Decode-and-forward polar coding scheme for receive diversity: a relay partially perfect retransmission for half-duplex wireless relay channels

2017 ◽  
Vol 11 (2) ◽  
pp. 185-191 ◽  
Author(s):  
Tamer Soliman ◽  
Fengfan Yang ◽  
Saqib Ejaz ◽  
Amir Almslmany
Keyword(s):  
Relay Channels ◽  
Decode And Forward ◽  
Coding Scheme ◽  
Receive Diversity ◽  
Polar Coding ◽  
Half Duplex ◽  
Wireless Relay

scholarly journals A New Coding Paradigm for the Primitive Relay Channel

Algorithms ◽  
2019 ◽  
Vol 12 (10) ◽  
pp. 218 ◽  
Author(s):  
Marco Mondelli ◽  
S. Hamed Hassani ◽  
Rüdiger Urbanke
Keyword(s):  
Upper And Lower Bounds ◽  
Achievable Rate ◽  
Polar Codes ◽  
Relay Channel ◽  
Decode And Forward ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Polar Coding ◽  
Separate Channel ◽  
Special Case

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.

Polar codes for soft decode-and-forward in half-duplex relay channels

2017 ◽  
Vol 14 (8) ◽  
pp. 22-32 ◽  
Author(s):  
Fangliao Yang ◽  
Kai Niu ◽  
Chao Dong ◽  
Baoyu Tian
Keyword(s):  
Polar Codes ◽  
Relay Channels ◽  
Decode And Forward ◽  
Half Duplex

LDPC codes for soft decode-and-forward in half-duplex relay channels

2013 ◽  
Vol 31 (8) ◽  
pp. 1402-1413 ◽  
Author(s):  
Marwan Azmi ◽  
Jun Li ◽  
Jinhong Yuan ◽  
Robert Malaney
Keyword(s):  
Ldpc Codes ◽  
Relay Channels ◽  
Decode And Forward ◽  
Half Duplex

scholarly journals Cooperative LDPC Codes Design for Decode-and-forward Half-duplex Relay Channels

2011 ◽  
Vol 33 (11) ◽  
pp. 2610-2615
Author(s):  
Zi-qiang Chen ◽  
Shan Ouyang ◽  
Hai-ling Xiao
Keyword(s):  
Ldpc Codes ◽  
Relay Channels ◽  
Decode And Forward ◽  
Half Duplex
Sign in / Sign up

Export Citation Format

Share Document