Multiple Description Coding Based Compress-and-Forward for the Broadcast Relay Channel

Yildirim, Seckin Anil
Yüksel Turgut, Ayşe Melda
In this work, the broadcast relay channel (BRC) with one source, two destinations and a dedicated relay node is studied for both discrete memoryless and Gaussian channels. Unlike all the existing achievability schemes, which use decode-and-forward (DF) relaying for the BRC, the new achievability schemes are based on compress-and-forward (CF). Three different compression methods are proposed: naive, joint and multiple description coding based. In naive CF (nCF) and joint CF (jCF), the relay forms a single representation, conveying its observation to both destinations at a single quality level. On the other hand, in multiple description coding based CF (mdCF), the relay utilizes multiple description coding and forms two representations, which allows for the two destinations to receive the relay observation at different quality levels. Through Gaussian examples, it is observed that mdCF enlarges nCF and jCF rate regions. Moreover, mdCF is the only scheme, which can achieve both of the single user CF rates achievable in the constituent single user relay channels.
IEEE International Symposium on Information Theory


The relay channel with a wire-tapper
Yüksel Turgut, Ayşe Melda; Erkip, Elza (2007-01-01)
In this work a relay channel with a wire-tapper is studied for both discrete memoryless and Gaussian channels. The wire-tapper receives a physically degraded version of the destination's signal. We find inner and outer bounds for the capacity-equivocation rate region. We also argue that when the destination receives a physically degraded version of the relay's signal, inner and outer bounds meet for some special cases.
Transmission strategies and resource allocation for fading broadcast relay channels
Isikman, Arif Onder; Yüksel Turgut, Ayşe Melda (2015-01-01)
In this paper the broadcast relay channel, where the source communicates with multiple destinations with the help of a single relay is studied. Five different transmission protocols, direct transmission, multihop (MH), multihop with link combination (MHLC), path selection (PS) and path selection with link combination (PSLC) are investigated. In MH and MHLC, the relay decodes the source message and assists both destinations. In PS and PSLC, the relay can perform partial decoding and has the option to help on...
Diversity-multiplexing tradeoff in multiple-antenna relay systems
Yüksel Turgut, Ayşe Melda; Erkip, Elza (2006-01-01)
We study the diversity-multiplexing tradeoff (DMT) for the full-duplex relay channel when the source and the destination have multiple antennas, and the relay has I or more. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), partial decode-and-forward (PDF), and compress-and-forward (CF) protocols. We study the effect of increased degrees of freedom in the direct link and the source-relay channel when multiple antennas are introduced. Our results suggest that whi...
Dual band quasi-yagi antenna array structure for the side loop reduction by using binomial weighting
Karaçuha, Kamil; Çelik, Feza Turgay (2019-12-01)
In this study, a double-loop resonant type dual-band quasi-Yagi microstrip antenna array is designed. The numerical and experimental analyses are done and the prototype is produced. The antenna array is fed by Binomial weighting to reduce the sidelobes. Operating frequencies are chosen as the free unlicensed Wi-Fi band (2.4-2.48 GHz) and one of the planned 5G band for Europe Zone (3.4-3.8 GHz). The main aim is to have a directive radiation pattern for the higher frequency band and an Omni-like radiation pat...
Age-Optimal Channel Coding Blocklength for an M/G/1 Queue with HARQ
Sac, Hakan; Bacinoglu, Tan; Uysal, Elif; Durisi, Giuseppe (2018-08-24)
We consider a communication system in which a source transmits information updates to a destination node through a binary erasure channel (BEC). When a packet containing an information update, which consists of a fixed number of information bits, arrives at the transmitter, it gets queued in a buffer, to be encoded and sent over the channel. Before transmitting a packet, the transmitter selects a channel coding blocklength n and then uses an automatic repeat request (ARQ) protocol, whereby packets that are ...
Citation Formats
S. A. Yildirim and A. M. Yüksel Turgut, “Multiple Description Coding Based Compress-and-Forward for the Broadcast Relay Channel,” presented at the IEEE International Symposium on Information Theory, Cambridge, Kanada, 2012, Accessed: 00, 2022. [Online]. Available: