Change search
Refine search result
123 1 - 50 of 128
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Andersson, Mattias
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Schaefer, Rafael F.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Polar Coding for Bidirectional Broadcast Channels with Common and Confidential Messages2013In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 31, no 9, p. 1901-1908Article in journal (Refereed)
    Abstract [en]

    The integration of multiple services such as the transmission of private, common, and confidential messages at the physical layer is becoming important for future wireless networks in order to increase spectral efficiency. In this paper, bidirectional relay networks are considered, in which a relay node establishes bidirectional communication between two other nodes using a decode-and-forward protocol. In the broadcast phase, the relay transmits additional common and confidential messages, which then requires the study of the bidirectional broadcast channel (BBC) with common and confidential messages. This channel generalizes the broadcast channel with receiver side information considered by Kramer and Shamai. Low complexity polar codes are constructed that achieve the capacity region of both the degraded symmetric BBC, and the BBC with common and confidential messages. The use of polar codes allows an intuitive interpretation of how to incorporate receiver side information and secrecy constraints as different sets of frozen bits at the different receivers for an optimal code design. In order to show that the constructed codes achieve capacity, a tighter bound on the cardinality of an auxiliary random variable used in the converse is found using a method by Salehi.

  • 2.
    Andersson, Mattias
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Wyrembelski, R. F.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Polar codes for bidirectional broadcast channels with common and confidential messages2012In: International Symposium on Wireless Communication Systems (ISWCS), 2012, IEEE conference proceedings, 2012, p. 1014-1018Conference paper (Refereed)
    Abstract [en]

    We consider the bidirectional broadcast channel with common and confidential messages. We show that polar codes achieve the capacity of binary input symmetrical bidirectional broadcast channels with confidential messages, if one node's channel is a degraded version of the other node's channel. We also find a new bound on the cardinality of the auxiliary random variable in this setup.

  • 3.
    Bilal, Ibrahim
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Zaidi, Ali A.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    An Optimized Linear Scheme for Stabilization Over Multi-User Gaussian Networks2013In: 2013 Information Theory And Applications Workshop (ITA), New York: IEEE , 2013, p. 290-297Conference paper (Refereed)
    Abstract [en]

    Remote stabilization of linear dynamical systems over Gaussian networks is studied. Two linear time invariant systems (plants) with arbitrary distributed initial states are monitored by two separate sensors. The sensors communicate their measurements to two remotely situated controllers over a Gaussian interference, possibly with the assistance from a relay node. The common goal of the sensors, relay, and controllers is to stabilize the plants in mean-square sense. An optimized linear delay-free sensing and control scheme is proposed and sufficient conditions for mean-square stability are derived. These conditions reveal the relationship between plants' stability and communication channel parameters. It is shown that the proposed linear scheme can significantly outperform the existing estimation based control scheme in multi-user Gaussian networks.

  • 4.
    Bilal, Ibrahim
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Zaidi, Ali Abbas
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Feedback stabilization over a Gaussian interference relay channel2013In: 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications, SPAWC, IEEE , 2013, p. 560-564Conference paper (Refereed)
    Abstract [en]

    A transmission scheme for mean square stabilization of two linear systems over a Gaussian interference relay channel is studied. A delay-free linear sensing and control strategy is proposed and an achievable stability region is derived. It shows that the stability region can be significantly enlarged by deploying a relay node in such a multi-user Gaussian channels. Furthermore we observe that the separation structure between estimation and control is inadequate in high interference regime.

  • 5.
    Bilal, Ibrahim
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Zaidi, Ali Abbas
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Managing interference for stabilization over wireless channels2012In: Intelligent Control (ISIC), 2012 IEEE International Symposium on, IEEE , 2012, p. 933-938Conference paper (Refereed)
    Abstract [en]

    The remote stabilization of a first order linear plant over a wireless channel is studied. The plant is assumed to have an arbitrary distributed initial state and the wireless channel between the plant's sensor and the controller is modeled as a white Gaussian channel subject to an external interference signal. In order to combat the interference a dedicated sensor (relay) node is deployed adjacent to the interferer, which relays the interference information to both the plant's sensor and the controller. The sensor and the controller utilize this information to mitigate interference. We use delay-free linear sensing and control scheme in order to derive sufficient conditions for mean square stability. The achievable stability region significantly enlarges with the relay assisted interference cancelation scheme. Moreover the effect of interference can be completely eliminated if the encoder knows all the future values of the interference.

  • 6. Bjelakovic, Igor
    et al.
    Oechtering, Tobias J.
    Technical University of Berlin.
    Schnurr, Clemens
    Boche, Holger
    On the strong converse for the broadcast capacity region of two-phase bidirectional relaying2007In: Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW, 2007, p. 111-115Conference paper (Refereed)
    Abstract [en]

    In our previous work we determined the weak capacity region for the broadcast phase of two-phase bidirectional relay channel. It turned out that the set of achievable rates obtained by optimizing over the two communication phases exceeds that obtained by using the network coding principle, i.e. by applying XOR to the decoded messages. In this paper we supplement our result by a proof of the strong converse with respect to the maximum error probability to the coding theorem for the broadcast phase. This result implies that the capacity region of that phase remains constant for a certain range of values of average error parameters [epsilon(1), epsilon(2)].

  • 7.
    Cao, Phuong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Schaefer, Rafael
    Princeton University.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimal Transmission Rate for MISO Channels with Joint Sum and Per-antenna Power Constraints2015In: IEEE International Conference on Communications (ICC), London, June 08-12, 2015, 2015, p. 4727-4732Conference paper (Refereed)
    Abstract [en]

    We consider multiple-input single-output (MISO) Gaussian channels with joint sum and per-antenna power constraints. A closed-form solution of the optimal beamforming vector is derived which achieves the maximal transmission rate. The result shows that if the sum power constraint only optimal power allocation violates a per-antenna power constraint then the joint power constraint optimal power allocation is at the intersection of the sum power constraint and the per-antenna power constraints.

  • 8. Cao, Phuong
    et al.
    Oechtering, Tobias J.
    Skoglund, Mikael
    Precoding Design for Massive MIMO Systems with Sub-connected Architecture and Per-antenna Power Constraints2018Conference paper (Refereed)
    Abstract [en]

    This paper provides the necessary conditions to design precoding matrices for massive MIMO systems with a sub-connected architecture, RF power constraints and per-antenna power constraints. The system is configured such that each RFchain serves a group of antennas. The necessary condition to design the digital precoder is established based on a generalized water-filling and joint sum and per-antenna optimal power allocation solution, while the analog precoder is based on a per-antenna power allocation solution only. We study the analytically most interesting case where the power constraint on the RF chain is smaller than the sum of the corresponding per-antenna power constraints. For this, the optimal power is allocated based on two properties: Each RF chain uses full power and if the optimal power allocation of the unconstraint problem violates a per-antenna power constraint then it is optimal to allocate the maximal power for that antenna.

  • 9.
    Cao, Phuong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Mikael, Skoglund
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Optimal Transmission with Per-antenna Power Constraints for Multiantenna Bidirectional Broadcast Channels2016In: The Ninth IEEE Sensor Array and Multichannel Signal Processing Workshop, 2016Conference paper (Refereed)
    Abstract [en]

    This paper considers the optimal transmit strategy for multi-antenna bidirectional broadcast channels with per-antenna power constraints. First, an equivalent formulation of the weighted rate sum maximization problem is provided. This allows us to come up with an effective solution to characterize the boundary of the capacity region which relies on the weighted rate sum optimal rate pair. To that end, an iterative algorithm to find the optimal transmit strategy is derived, the convergence to the optimum is proved, and a closed-form solution of the corresponding off-diagonal elements of the optimal transmit strategy is provided. Further, we provide a parametrization of the curved section of the capacity region. Finally, the theoretical results and algorithm performance are illustrated by numerical examples.

  • 10.
    Cao, Phuong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Schaefer, Rafael
    The Information Theory and Applications Chair, Technische Universitat Berlin.
    Mikael, Skoglund
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Optimal Transmit Strategy for MISO Channels with Joint Sum and Per-antenna Power Constraints2016In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476Article in journal (Refereed)
    Abstract [en]

    In this paper, we study an optimal transmit strategy for multiple-input single-output (MISO) Gaussian channels with joint sum and per-antenna power constraints. We study in detail the interesting case where the sum of the per-antenna power constraints is larger than sum power constraint. A closed-form characterization of an optimal beamforming strategy is derived.It is shown that we can always find an optimal beamforming transmit strategy that allocates the maximal sum power with phases matched to the complex channel coefficients. The main result is a simple recursive algorithm to compute the optimal power allocation. Whenever the optimal power allocation of the corresponding problem with sum power constraint only exceeds per-antenna power constraints, it is optimal to allocate maximal per-antenna power to those antennas to satisfy the per-antenna power constraints. The remaining power is divided amongst the other antennas whose optimal allocation follows from a reduced joint sum and per-antenna power constraints problem of smaller channel coefficient dimension and reduced sum power constraint. Finally, the theoretical results are illustrated by numerical examples.

  • 11.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    A new inner bound for the interference relay channel2012In: 2012 46th Annual Conference on Information Sciences and Systems, CISS 2012, IEEE , 2012, p. 6310756-Conference paper (Refereed)
    Abstract [en]

    This paper proposes a new coding scheme for the discrete memoryless interference channel with a dedicated relay. The scheme is built upon rate-splitting encoding, layered noisy network coding, and joint decoding. The result is extended to two Gaussian channels. For the Gaussian channel whose relay is connected to the destinations via orthogonal links we indirectly show that the proposed scheme achieves a bounded gap to the capacity region under certain channel conditions. For the Gaussian channel wherein the relay receives and transmits in the same spectral resource with the transmitters the numerical results show that the proposed scheme achieves higher sum rate than other compress-forward-based schemes. This work, together with our previous work [1], shows that noisy network coding can be extended by the well-known rate-splitting technique of the interference channel to achieve a bounded gap to the capacity region of some multi-unicast networks.

  • 12.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    An Achievable Rate Region for the Gaussian Z-interference Channel with Conferencing2009In: 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, NEW YORK: IEEE , 2009, p. 75-81Conference paper (Refereed)
    Abstract [en]

    This paper presents an achievable rate region for a 2-user Gaussian Z-interference channel with a noiseless and bidirectional digital communication link between the receivers. The region is achieved by utilizing the rate-splitting encoding technique, and the decode-and-forward and compress-and-forward strategies. In the very strong interference regime, the capacity region is achieved. In the weak interference regime, the asymptotic sum rate is characterized and shown to be possibly unbounded, which is in contrast to a recent result by Yu and Zhou for a similar scenario, however, with a unidirectional communication link between the receivers.

  • 13.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Capacity bounds for the Z channel2011In: IEEE Information Theory Workshop (ITW), 2011, 2011Conference paper (Refereed)
    Abstract [en]

    We present a new achievable rate region for the discrete memoryless Z channel (DM-ZC) using Marton coding with rate splitting. The region is shown to include previously known achievable rate regions. Secondly we study a class of degraded Z channels, the bijective degraded Z channel (BDZC). An outer bound for the BDZC is proved, which is shown to meet the inner bound for the deterministic settings. For the Gaussian Z channel with weak crossover link, we show that if Gaussian inputs are optimal then a coding scheme based on Marton coding without rate splitting achieves to within half a bit per real dimension from the boundary of the capacity region.

  • 14.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Coding for the Z Channel With a Digital Relay Link2010In: 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings, 2010Conference paper (Refereed)
    Abstract [en]

    This paper considers a discrete memoryless four-node network where two nodes want to send three independent messages to the other two nodes. The two receiving nodes are allowed to cooperate by means of a unidirectional noiseless link with finite capacity. A coding scheme is proposed which combines rate splitting, block Markov multi-level superposition coding with binning and joint decoding. The general achievable rates are then specialized to degraded channel and Gaussian channel, where it is shown that the sum capacity for the Gaussian channel is achieved under certain conditions. Results in this paper recover and unify previously known results for the discrete memoryless Z channel without cooperation, and results for the Gaussian Z-interference channel with a digital relay link.

  • 15.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Layered quantize-forward for the two-way relay channel2012In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, IEEE , 2012, p. 423-427Conference paper (Refereed)
    Abstract [en]

    This paper proposes two new coding schemes for the discretememoryless two-way relay channel. The main target is to show thebenefits of compress-forward without Wyner-Ziv binning and oflayered relaying in networks wherein a relay is to help multipledestinations, that may have unequal channel quality and/or haveaccess to different side information. Numerical results for aGaussian channel show that the new coding schemes outperformvariants of compress-forward relaying and offer a good trade-offbetween achievable rates and complexity and decoding delay. The ideacan also be applied to other relay networks.

  • 16.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Noisy network coding approach to the interference channel with receiver cooperation2011In: 49th Annual Allerton Conference on Communication, Control, and Computing, 2011., 2011, p. 839-846Conference paper (Refereed)
    Abstract [en]

    This work proposes a new coding scheme for thediscrete memoryless two-user interference channel whose receivers can cooperate to decode their desired messages. Thecoding scheme is built upon Han-Kobayashi rate splitting andsuperposition coding at the transmitters, noisy network coding,and non-unique joint decoding at the receivers. As a case studythe general achievable region leads to an inner bound for theGaussian interference channel whose receivers cooperate throughrate-limited orthogonal channels. It is shown that this innerbound is equivalent to the one-round quantize-bin-and-forwardinner bound established by Wang and Tse, thereby showing thatnoisy network coding achieves within 1 bit/s/Hz to the capacityregion when the interference is strong, and achieves within 1 bit/s/Hz to the capacity region of the Gaussian compound multipleaccess channel with conferencing decoders regardless of channelparameters.

  • 17.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On Asymmetric Interference Channels with Cooperating Receivers2013In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 61, no 2, p. 554-563Article in journal (Refereed)
    Abstract [en]

    This paper studies a model for communications in wireless networks supported by designated cooperation links. In particular, a 2-user Gaussian one-sided interference channel with two rate-limited and orthogonal communication links between the receivers is considered. A communication protocol for the channel is proposed, which combines rate-splitting and superposition encoding techniques with the conventional decode-forward and compress-forward strategies. It is shown that a careful design of codebooks and coding scheme, which is obtained from intuition based on superposition coding, can greatly reduce the complexity of the strategy. Analytical and numerical results show that the proposed scheme, although not universally optimal, can achieve the capacity region or sum capacity exactly or asymptotically in certain scenarios. Various limits of sum capacity gain due to cooperation are also discussed.

  • 18.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    The Gaussian Z-interference channel with rate-constrained conferencing decoders2010In: 2010 IEEE International Conference on Communications, 2010, p. 5502610-Conference paper (Refereed)
    Abstract [en]

    We derive achievable rate regions for a 2-user Gaussian Z-interference channel with conferencing decoders. We identify different cases where the rate-limitedness of the conference link from the interference-free receiver to the interfered receiver affects the conferencing strategy as well as the achievable rate region. Furthermore, an outer bound to the capacity region based on cut-set and genie-aided bounds is presented.

  • 19.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Vu, Mai
    Tufts University.
    Capacity Region of a Class of Interfering Relay Channels2013In: 2013 IEEE Information Theory Workshop (ITW), IEEE , 2013, p. 6691350-Conference paper (Refereed)
    Abstract [en]

    This paper studies a new model for cooperative communication, the interfering relay channels. We show that thehash-forward scheme introduced by Kim for the primitive relay channel is capacity achieving for a class of semideterministic interfering relay channels. The obtained capacity result generalizes and unifies earlier capacity results for a class of primitive relay channels and a class of deterministic interference channels.

  • 20.
    Do, Hieu
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Vu, Mai
    Dept. of Electrical and Computer Engineering, Tufts University.
    Gaussian Interfering Relay Channels2013In: 2013 Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society, 2013, p. 1968-1972Conference paper (Refereed)
    Abstract [en]

    We extend the primitive relay channel (PRC) in-troduced by Cover and Kim to a more general scenario wheretwo Gaussian PRC’s cause interference to each other. We show that extended hash-and-forward relaying with proper power allocation can achieve bounded gaps to the capacity region of the Gaussian channel in different regimes of channel parameters.

  • 21.
    Do, Hieu T.
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Ericsson Research, Sweden.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Layered Coding for the Interference Channel With a Relay2014In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 60, no 10, p. 6154-6180Article in journal (Refereed)
    Abstract [en]

    This paper studies and derives new results for the interference channel with a relay (ICR). Three inner bounds for the discrete memoryless ICR are proposed, based on three coding strategies that employ layered code at the relay. The first scheme is inspired by layered noisy network coding, proposed by Lim et al. for the two-way relay channel, the second and the third schemes rely on simpler encoding and decoding processes, dubbed layered quantize-forward. Performance of the proposed schemes is investigated for two classes of channels with Gaussian noise: the interference channel with in-band relay reception/out-of-band relay transmission and the interference with in-band relay reception/in-band relay transmission. For the former class of channels, it is shown that the first proposed scheme achieves the same inner bound as the generalized hash-forward scheme with incremental binning. In addition, the inner bound is within 0.5 bit of the capacity region under certain conditions on the channel parameters. For the latter class of channels, new upper bounds on sum-rate are established by extending known upper bounds for symmetric channels. The first inner bound is shown to be within 0.5 bit of the capacity region if the relay's power exceeds a certain threshold, which depends on channel parameters. Numerical examples show that the proposed schemes can achieve significantly higher sum-rates when compared with other compress-forward schemes. Analysis also reveals a tradeoff between achievable rates, coding delay, and complexity of the proposed schemes. Results in this paper provide a better understanding of coding for the ICR, in particular, they show that layered coding is a beneficial element in multiuser networks with relays.

  • 22.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES).
    Kim, Su Min
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Peters, Gunnar
    Waveform domain framework for capacity analysis of uplink WCDMA systems2015In: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, article id 253Article in journal (Refereed)
    Abstract [en]

    This paper investigates the capacity limit of an uplink WCDMA system considering a continuous-time waveform signal. Various realistic assumptions are incorporated into the problem, which make the study valuable for performance assessment of real cellular networks to identify potentials for performance improvements in practical receiver designs. An equivalent discrete-time channel model is derived based on sufficient statistics for optimal decoding of the transmitted messages. The capacity regions are then characterized using the equivalent channel considering both finite constellation and Gaussian distributed input signals. The capacity with sampling at the receiver is also provided to exemplify the performance loss due to a typical post-processing at the receiver. Moreover, we analyze the asymptotic capacity when the signal-to-noise ratio goes to infinity. The conditions to simultaneously achieve the individual capacities are derived, which reveal the impacts of signature waveform space, channel frequency selectivity and signal constellation on the system performance.

  • 23.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Kim, Sumin
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Peters, G.
    Capacity analysis of uplink WCDMA systems with imperfect channel state information2015In: IEEE Vehicular Technology Conference, IEEE , 2015Conference paper (Refereed)
    Abstract [en]

    This paper considers the capacity limit of an uplink wideband CDMA (WCDMA) system assuming imperfect channel state information at the receiver (CSIR). In order to make the studied results useful for the performance assessment of real cellular networks, various realistic assumptions are included in the problem. A discrete-time channel model is derived based on the mismatched filtering at the receiver. Capacity inner bounds are then characterized based on the discrete-time channel model considering different assumptions on decoding strategy. Numerical results are also provided to show the effect of imperfect CSIR on the capacity.

  • 24. Do, Tan Tai
    et al.
    Ngo, Hien Quoc
    Duong, Trung Q.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Massive MIMO Pilot Retransmission Strategies for Robustification Against Jamming2017In: IEEE Wireless Communications Letters, ISSN 2162-2337, E-ISSN 2162-2345, Vol. 6, no 1, p. 58-61Article in journal (Refereed)
    Abstract [en]

    This letter proposes anti-jamming strategies based on pilot retransmission for a single user uplink massive MIMO under jamming attack. A jammer is assumed to attack the system both in the training and data transmission phases. We first derive an achievable rate which enables us to analyze the effect of jamming attacks on the system performance. Counter-attack strategies are then proposed to mitigate this effect under two different scenarios: random and deterministic jamming attacks. Numerical results illustrate our analysis and benefit of the proposed schemes.

  • 25.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES).
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Kim, Su Min
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Peters, Gunnar
    Uplink Waveform Channel With Imperfect Channel State Information and Finite Constellation Input2017In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 16, no 2, p. 1107-1119Article in journal (Refereed)
    Abstract [en]

    This paper investigates the capacity limit of an uplink waveform channel assuming imperfect channel state information at the receiver (CSIR). Various realistic assumptions are incorporated into the problem, which make the study valuable for performance assessment of real cellular networks to identify potentials for performance improvements in practical receiver designs. We assume that the continuous-time received signal is first discretized by mismatched filtering based on the imperfect CSIR. The resulting discrete-time signals are then decoded considering two different decoding strategies, i.e., an optimal decoding strategy based on specific statistics of channel estimation errors and a sub-optimal decoding strategy treating the estimation error signal as additive Gaussian noise. Motivated by the proposed decoding strategies, we study the performance of the decision feedback equalizer for finite constellation inputs, in which inter-stream interferences are treated either using their true statistics or as Gaussian noise. Numerical results are provided to exemplify the benefit of exploiting the knowledge on the statistics of the channel estimation errors and inter-stream interferences. Simulations also assess the effect of the CSI imperfectness on the achievable rate, which reveal that finite constellation inputs are less sensitive to the estimation accuracy than Gaussian input, especially in the high SNR regime.

  • 26.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES).
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Kim, Sumin
    KTH, School of Electrical Engineering (EES), Signal Processing.
    Peters, G.
    Capacity analysis of continuous-time time-variant asynchronous uplink wideband CDMA system2014In: IEEE Vehicular Technology Conference, 2014Conference paper (Refereed)
    Abstract [en]

    This paper considers the capacity limit of an uplink wideband CDMA system. In order to make the studied results useful for the performance assessment of real cellular networks, various realistic assumptions are included in the problem. An equivalent discrete-time channel model is derived based on sufcient statistic for optimal decoding of transmit messages. The capacity regions are then characterized considering nite constellation and Gaussian input assumptions. For further insight, an analysis on the asymptotic capacity is considered, in which the conditions to simultaneously achieve the individual capacities are derived.

  • 27.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Optimal Transmission for the MIMO Bidirectional Broadcast Channel in the Wideband Regime2013In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 61, no 20, p. 5103-5116Article in journal (Refereed)
    Abstract [en]

    This paper considers a transmit strategy for an AWGN MIMO bidirectional broadcast channel in the wideband regime. In order to characterize the boundaries of the wideband capacity and energy per bit regions, the transmit strategy at the relay is designed to maximize the weighted wideband rate sum. A closed form of the optimal transmit covariance matrix is derived, which shows that a single beam transmit strategy is optimal. The transmit strategies for some special cases are also analyzed. The fairness versus energy efficiency tradeoff is then discussed. In addition, an extension to multipair MIMO bidirectional broadcast channel is studied in which we show that serving a certain pair with full power is optimal in the sense of maximizing the achievable weighted wideband rate sum. Finally, a discussion on the conjecture of the minimum energy per bit for multi-pair systems is provided.

  • 28.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Achievable energy per bit for the multi-pair MIMO bidirectional broadcast channel2012In: European Wireless, 2012. EW. 18th European Wireless Conference, 2012Conference paper (Refereed)
    Abstract [en]

    This paper presents a transmit strategy for the AWGN multi-pair MIMO bidirectional broadcast channels in the wideband regime. An achievable wideband rate region and an achievable energy per bit region are provided. The transmit covariance matrix at the relay has been designed in order to maximize the wideband weighted rate sum. A closed form of the optimal matrix is derived, which shows that a single beam transmit strategy is optimal. In addition, an energy efficiency versus fairness analysis is considered. Lastly, some discussions on the minimum energy per bit are given.

  • 29.
    Do, Tan Tai
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimal transmission for the MIMO bidirectional broadcast channel in the wideband regime2011In: IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC, 2011, p. 356-360Conference paper (Refereed)
    Abstract [en]

    This paper presents an optimal transmit strategy for multiple antennas bidirectional broadcast channels in the wideband regime. The transmit covariance matrix at the relay has been designed in order to maximize the wideband weighted sum rate. A closed form of the optimal matrix is derived, which shows that a single beam transmit strategy is optimal. The transmit strategies for some special cases, the wideband capacity region, and the minimum energy per bit versus fairness issues are also discussed.

  • 30.
    Goubet, Olivier
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. THALES Communications and Security, Paris, France.
    Baudic, Gwilherm
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Institut Supérieur de l'Aéronautique et de l'Espace, Toulouse, France.
    Gabry, Frédéric
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Low-Complexity Scalable Iterative Algorithms for IEEE 802.11p Receivers2015In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 64, no 9, p. 3944-3956Article in journal (Refereed)
    Abstract [en]

    In this paper, we investigate receivers for vehicle-to- vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. Vehicular channels are characterized by multiple paths and time variations, which introduce challenges in the design of receivers. We propose an algorithm for IEEE 802.11p-compliant receivers, based on orthogonal frequency-division multiplexing (OFDM). We employ iterative structures in the receiver as a way to estimate the channel despite variations within a frame. The channel estimator is based on factor graphs (FGs), which allow the design of soft iterative receivers while keeping acceptable computational complexity. Throughout this paper, we focus on designing a receiver that offers a good complexity-performance tradeoff. Moreover, we propose a scalable algorithm to be able to tune the tradeoff, depending on the channel conditions. Our algorithm allows reliable communications while offering a considerable decrease in computational complexity. In particular, numerical results show the tradeoff between complexity and performance measured in computational time and bit error rate (BER), as well as frame error rate (FER) achieved by various interpolation lengths used by the estimator, which both outperform by decades the standard least squares (LS) solution. Furthermore, our adaptive algorithm shows a considerable improvement in terms of computational time and complexity against state-of-the-art and classical receptors while showing acceptable BER and FER performance.

  • 31.
    Jaldén, Joakim
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Distributed Bayesian detection for the butterfly network2013In: 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), IEEE , 2013, p. 61-65Conference paper (Refereed)
    Abstract [en]

    We consider a distributed detection problem where two nodes, or decision makers, observe a common source and aim to decide on one of several hypotheses. Before making their individual decisions, the nodes are allowed to communicate over rate-constrained links, through a bidirectional relay. We show that if the rate of the common relay-to-node link is greater than or equal to the rate of the individual node-to-relay links, and the individual decisions are not coupled by the cost metric, then network coding at the relay allows the overall problem to decouple into two separate two-node distributed detection problems over serial networks; and the two serial networks can be designed independently. However, if the rate of the relay-to-node link is strictly less than the node-to-relay links, no such decoupling can be assumed in general, and the overall detection network needs to be jointly designed.

  • 32. Jorswieck, E. A.
    et al.
    Oechtering, Tobias J.
    Technical University Berlin.
    Boche, H.
    Performance analysis of combining techniques with correlated diversity2005In: 2005 IEEE Wireless Communications and Networking Conference: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., New York: IEEE , 2005, p. 849-854Conference paper (Refereed)
    Abstract [en]

    Diversity combining schemes are successfully applied in communication systems. In many recent publications the performance of different diversity combining schemes in different fading scenarios and with different modulation schemes was analyzed and analytical expressions for the performance derived. It turned out that the performance depends on the statistics of the fading, especially on the correlation of the diversity branches. In this work, we study the impact of correlation on the performance of the maximum ratio, equal gain, and selection combining schemes without computing directly the error rate. The performance depends only on the eigenvalues, i.e. powers, of the correlation matrix and not on the eigenvectors. Therefore, majorization theory can be used as a measure of the correlation. We show that the performance of maximum ratio combining and equal gain combining are Schur-convex functions with respect to the correlation eigenvalues, i.e. correlation increases the error rate. Surprisingly, the behavior of selection combining depends on the SNR: For small SNR, correlation decreases the error rate, whereas for high SNR, correlation increases the error rate. Finally, we illustrate the theoretical results by numerical simulations.

  • 33.
    Karlsson, Johannes
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gattami, Ather
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Iterative Source-Channel Coding Approach to Witsenhausen's Counterexample2011In: Proceedings of the American Control Conference, NEW YORK: IEEE , 2011, p. 5348-5353Conference paper (Refereed)
    Abstract [en]

    In 1968, Witsenhausen introduced his famous counterexample where he showed that even in the simple linear quadratic static team decision problem, complex nonlinear decisions could outperform any given linear decision. This problem has served as a benchmark problem for decades where researchers try to achieve the optimal solution. This paper introduces a systematic iterative source-channel coding approach to solve problems of the Witsenhausen Counterexample-character. The advantage of the presented approach is its simplicity. Also, no assumptions are made about the shape of the space of policies. The minimal cost obtatined using the introduced method is 0.16692462, which is the lowest known thus far.

  • 34. Khormuji, Majid N.
    et al.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Capacity Region of the Bidirectional Broadcast Channel with Causal Channel State Information2013In: Proceedings of the Tenth International Symposium on Wireless Communication Systems (ISWCS 2013), IEEE Computer Society, 2013, p. 274-278Conference paper (Refereed)
    Abstract [en]

    We consider the broadcast channel with one transmitter and two receivers such that the transmitter wishes to convey two independentmessages to each receiver, respectively. When each receiver knows the intended message for the other one, as a side information the channel is referred to as the bidirectional broadcast channel. In this work, we establish the capacity region of the discrete memoryless bidirectional broadcast channel with state whose knowledge is causally known at the encoder. Further, we present an Ariomoto-Blahut-like algorithm to compute the capacity region numerically.

  • 35.
    Kim, Su Min
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing.
    Do, Tan Tai
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Peters, Gunnar
    On the Entropy Computation of Large Complex Gaussian Mixture Distributions2015In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 63, no 17, p. 4710-4723Article in journal (Refereed)
    Abstract [en]

    The entropy computation of Gaussian mixture distributions with a large number of components has a prohibitive computational complexity. In this paper, we propose a novel approach exploiting the sphere decoding concept to bound and approximate such entropy terms with reduced complexity and good accuracy. Moreover, we propose an SNR region-based enhancement of the approximation method to reduce the complexity even further. Using Monte-Carlo simulations, the proposed methods are numerically demonstrated for the computation of the mutual information including the entropy term of various channels with finite constellation modulations such as binary and quadratic amplitude modulation (QAM) inputs for communication applications.

  • 36.
    Kim, Su Min
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing.
    Do, Tan Tai
    KTH, School of Electrical Engineering (EES).
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Peters, Gunnar
    Huawei Technologies Sweden AB.
    Sphere decoding inspired approximation method to compute the entropy of large Gaussian mixture distributions2014In: IEEE Workshop on Statistical Signal Processing Proceedings, 2014, p. 264-267Conference paper (Refereed)
    Abstract [en]

    The computation of mutual informations of large scale systems with finite input alphabet and Gaussian noise has often prohibitive complexities. In this paper, we propose a novel approach exploiting the sphere decoding concept to bound and approximate such mutual information term with reduced complexity and good accuracy. Using Monte-Carlo simulations, the method is numerically demonstrated for the computation of the mutual information of a frequency- and time-selective channel with QAM modulation.

  • 37.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Chia, Yeow-Khiang
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Weissman, Tsachy
    Secure Source Coding With a Public Helper2016In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 62, no 7, p. 3930-3949Article in journal (Refereed)
    Abstract [en]

    We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper and 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff among transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of the rate-distortion-leakage region for various classes of problems.

  • 38.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Chia, Yeow-Khiang
    Institute for Infocomm Research, Singapore.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Weissman, Tsachy
    Stanford University, USA.
    Secure Source Coding with a Public Helper2013In: IEEE International Symposium on Information Theory, IEEE conference proceedings, 2013, p. 2209-2213Conference paper (Refereed)
    Abstract [en]

    We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

  • 39.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Capacity of the Channel With Action-dependent State and Reversible Input2011In: 2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011, 2011, p. 24-28Conference paper (Refereed)
    Abstract [en]

    We consider a problem of coding for channels with action-dependent states available noncausally to the encoder where the decoder is additionally required to be able to decode the channel input reliably. The complete characterization of the channel capacity is given in this work to complete our previous result presented in ISIT 2011. The key contribution essentially lies in the converse proof of the capacity result where the restriction on the set of input distribution is shown to coincide with the two-stage coding condition. Some interesting discussion on the two-stage coding condition and the connection to the multiple-access setting is also provided.

  • 40.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Coding With Action-Dependent Side Information and Additional Reconstruction Requirements2015In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 61, no 11, p. 6355-6367Article in journal (Refereed)
    Abstract [en]

    Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, while an encoder is required to estimate the decoder's reconstruction reliably. Side information is action-dependent in the sense that its quality and/or availability at the encoder or decoder can be influenced by a cost-constrained action sequence. In the channel coding dual, the decoder wishes to decode both the message and the channel input sequence reliably, and the channel state information available at the encoder or decoder is assumed to depend on the action sequence. We consider discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.

  • 41.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lossy Source Coding with Reconstruction Privacy2014In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, p. 386-390Conference paper (Refereed)
    Abstract [en]

    We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender, or a helper. We are interested in how the reconstruction privacy constraint at a particular terminal affects the rate-distortion tradeoff. In this work, we allow the decoder to use a random mapping, and give inner and outer bounds to the rate-distortion-equivocation region for different cases. In the case where each reconstruction symbol depends only on the source description and current side information symbol, the complete rate-distortion-equivocation region is provided. A binary example illustrating a new tradeoff due to the new privacy constraint, and a gain from the use of randomized decoder is given.

  • 42.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Multi-stage coding for channels with a rewrite option and reversible input2012In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, IEEE , 2012, p. 3063-3067Conference paper (Refereed)
    Abstract [en]

    We consider a problem of constrained multi-stage coding for channels with a rewrite option. It is a natural extension of Weissman's channels with action-dependent states to the multistage coding case where an encoder in each stage observes its own message as well as all previous-stage messages, inputs, and outputs. In addition to decoding all messages at the final stage, the new reconstruction constraint introduced in Sumszyk and Steinberg's information embedding with reversible stegotext is imposed on the problem such that the decoder is required to be able to reconstruct all channel input sequences reliably. The complete characterization of the channel capacity region is given for the two-stage case, while the inner and outer bounds to the capacity regions for the cases of three or more stages are provided. For the two-stage case, a discussion regarding the rate constraint of the message in the second stage is also given in which we can draw a connection to the two-stage coding condition which appears in our previous study on channel with action-dependent state and reversible input.

  • 43.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On the capacity of a channel with action-dependent state and reversible input2011In: IEEE International Symposium on Information Theory - Proceedings, 2011, p. 331-335Conference paper (Refereed)
    Abstract [en]

    We consider a problem of coding for channels with action-dependent states available noncausally to the encoder where the decoder is additionally required to be able to decode the channel input reliably. Lower and upper bounds on the channel capacity are derived. It is shown that the capacity is determined if there exists a maximizing joint probability distribution in the upper bound which satisfies the two-stage coding condition, and it, in turn, reveals the formula duality between this problem and that of source coding with common reconstruction and action-dependent side information. We also state two simple coding schemes and the corresponding achievable rates for the cases where the two-stage coding condition is not fulfilled.

  • 44.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Secure source coding with action-dependent side information2011In: IEEE International Symposium on Information Theory - Proceedings, 2011, p. 1678-1682Conference paper (Refereed)
    Abstract [en]

    We consider a secure lossy source coding problem with the presence of an eavesdropper who has access to the source description. An encoder wants to compress the source in such a way that the intended decoder can reconstruct the source sequence and satisfy a distortion criterion, while revealing only limited knowledge about the source to the eavesdropper. In our system an action sequence is generated based on the source description with some costs to influence the side information available to the legitimate decoder and the eavesdropper. We provide a complete characterization of the rate-distortion- cost-equivocation region for a discrete source with correlated action-dependent side information at the decoders. The result serves as a fundamental limit for example in secure sensor networking.

  • 45.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Source Coding With Common Reconstruction and Action-dependent Side Information2010In: 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings, IEEE , 2010, p. 5592707-Conference paper (Refereed)
    Abstract [en]

    We determine the rate region of a source coding problem with common reconstruction and action-dependent side information where an action sequence is taken by an encoder over a rate-limited link. We show that the rate region depends only on the sum-rate and the sum-rate distortion and cost function is characterized. The result serves as a fundamental limit in transmission scenarios where the encoder wants to control and monitor the quality of the decoder's reconstruction via the respective uses of action sequences and a common reconstruction constraint.

  • 46.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Chia, Yeow-Khiang
    Secure Source Coding With Action-Dependent Side Information2015In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 61, no 12, p. 6444-6464Article in journal (Refereed)
    Abstract [en]

    We consider the problems of secure lossy source coding with side information in the presence of a passive eavesdropper who has access to the source description. The encoder wishes to compress the source sequence in order to satisfy a distortion criterion at the decoder, while revealing only limited knowledge about the source to the eavesdropper. The side information available to the encoder, the legitimate decoder, or the eavesdropper can be influenced by a cost-constrained action sequence. Three different settings are studied. In the first two settings, we are interested in understanding the influence of the action sequence on the rate-distortion-leakage tradeoff where the action is taken either by the decoder or by the encoder to influence side information at the decoder and eavesdropper. Next, we consider a setting where common action-dependent side information is available securely to both encoder and decoder, and thus can be used for secret key generation. We characterize the optimal rate-distortion-cost-leakage region or the corresponding inner bounds for a discrete memoryless source for above settings. The results are useful in characterizing fundamental limits for example in secure sensor networking and future cyber physical systems.

  • 47.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Source and channel coding with action-dependent partially known two-sided state information2010In: IEEE International Symposium on Information Theory - Proceedings, 2010, p. 629-633Conference paper (Refereed)
    Abstract [en]

    We consider a source coding problem where the encoder can take actions that influence the availability and/or quality of the side information which is available partially and noncausally at the encoder and the decoder. We then characterize the associated achievable tradeoffs between rate, distortion, and cost. In addition, we state and discuss a capacity result for the channel coding dual problem where the formula duality of special cases is recognized.

  • 48.
    Kron, Johannes
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gattami, Ather
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Iterative source-channel coding approach to Witsenhausen's counterexampleIn: Automatica, ISSN 0005-1098, E-ISSN 1873-2836Article in journal (Other academic)
  • 49.
    Li, Zuxing
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Differential Privacy in Parallel Distributed Bayesian Detections2014In: Proceedings of the 17th International Conference on Information Fusion (FUSION), IEEE conference proceedings, 2014, p. 1-7Conference paper (Refereed)
    Abstract [en]

    In this paper, the differential privacy problem in parallel distributed detections is studied in the Bayesian formulation. The privacy risk is evaluated by the minimum detection cost for the fusion node to infer the private random phenomenon. Different from the privacy-unconstrained distributed Bayesian detection problem, the optimal operation point of a remote decision maker can be on the boundary of the privacy-unconstrained operation region or in the intersection of privacy constraint hyperplanes. Therefore, for a remote decision maker in the optimal privacy-constrained distributed detection design, it is sufficient to consider a deterministic linear likelihood combination test or a randomized decision strategy of two linear likelihood combination tests which achieves the optimal operation point in each case. Such an insight indicates that the existing algorithm can be reused by incorporating the privacy constraint. The trade-off between detection and privacy metrics will be illustrated in a numerical example.

  • 50.
    Li, Zuxing
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Privacy on Hypothesis Testing in Smart Grids2015In: Proceedings of the IEEE Information Theory Workshop (ITW) 2015 Jeju, IEEE , 2015, p. 337-341Conference paper (Refereed)
    Abstract [en]

    In this paper, we study the problem of privacy information leakage in a smart grid. The privacy risk is assumed to be caused by an unauthorized binary hypothesis testing of the consumer's behaviour based on the smart meter readings of energy supplies from the energy provider. Another energy supplies are produced by an alternative energy source. A controller equipped with an energy storage device manages the energy inflows to satisfy the energy demand of the consumer. We study the optimal energy control strategy which minimizes the asymptotic exponential decay rate of the minimum Type II error probability in the unauthorized hypothesis testing to suppress the privacy risk. Our study shows that the cardinality of the energy supplies from the energy provider for the optimal control strategy is no more than two. This result implies a simple objective of the optimal energy control strategy. When additional side information is available for the adversary, the optimal control strategy and privacy risk are compared with the case of leaking smart meter readings to the adversary only.

123 1 - 50 of 128
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf