New Capacity-Achieving Encoding Schemes for Degraded Binary Broadcast Channels

Bhat, U. Narayan; Fertonani, D.; Duman, Tolga M.

doi:10.1109/glocom.2010.5683749

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cover [12] introduced an independent-encoding scheme for two-user broadcast channels. This scheme is known to achieve the boundary of the capacity region for the broadcast binarysymmetric channel (BBSC) and is investigated in [13] [14] [15] [16].…”

Section: Bbsc: Introductionmentioning

confidence: 99%

Designing Nonlinear Turbo Codes with a Target Ones Density

Wang¹,

Courtade²,

Chen³

et al. 2011

Preprint

View full text Add to dashboard Cite

Certain binary asymmetric channels, such as Zchannels in which one of the two crossover probabilities is zero, demand optimal ones densities different from 50%. Some broadcast channels, such as broadcast binary symmetric channels (BBSC) where each component channel is a binary symmetric channel, also require a non-uniform input distribution due to the superposition coding scheme, which is known to achieve the boundary of capacity region. This paper presents a systematic technique for designing nonlinear turbo codes that are able to support ones densities different from 50%. To demonstrate the effectiveness of our design technique, we design and simulate nonlinear turbo codes for the Z-channel and the BBSC. The best nonlinear turbo code is less than 0.02 bits from capacity.

show abstract

Section: Bbsc: Introductionmentioning

confidence: 99%

Designing Nonlinear Turbo Codes with a Target Ones Density

Wang¹,

Courtade²,

Chen³

et al. 2011

Preprint

View full text Add to dashboard Cite

show abstract

“…They employ nonlinear turbo codes with a desired distribution of ones and zeros in their codebook to operate close to the optimal rate region boundary. A capacity-achieving encoding scheme is designed for a general degraded binary broadcast channel (DBBC) in [19]. The designed scheme uses simple logical operators (i.e., XOR, OR and AND) at the output of independent binary encoders to achieve the capacity boundary.…”

mentioning

confidence: 99%

Code Design for Discrete Memoryless Interference Channels

Dabirnia

Tanc

Sharifi

et al. 2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

We study the design of explicit and implementable codes for the two-user discrete memoryless interference channels (DMICs). We consider Han-Kobayashi (HK) type encoding where both public and private messages are used and propose coding techniques utilizing a serial concatenation of a nonlinear trellis code (NLTC) with an outer low-density paritycheck (LDPC) code. Since exact analytical treatment of the BCJR decoder for the inner trellis-based code appears infeasible, we analytically investigate the iterative decoding process in the asymptotic regime where the probability of decoding error tends to zero. Based on this approximate analysis, we derive a stability condition for this type of a concatenated coding scheme for the first time in the literature. Furthermore, we use an extrinsic information transfer analysis to design the outer LDPC code while fixing the inner NLTC, and utilize the derived stability condition to accelerate the design process and to avoid code ensembles that potentially produce high error floors. Via numerical examples, we demonstrate that our designed codes achieve rate pairs close the optimal boundary of the HK subregion, which cannot be obtained without the use of nonlinear codes. Also, we verify that the estimated thresholds of the designed codes via finite block length simulations and show that our designs significantly outperform the point-to-point optimal codes, hence demonstrating the need for designs specifically tailored for DMICs. Index Terms-Discrete memoryless interference channels, nonlinear trellis codes, low-density parity-check codes, concatenated codes, stability condition. I. INTRODUCTION A N interference channel (IC) is a communication medium shared by several sender-receiver pairs. Transmission of Manuscript

show abstract

“…Cover [10] introduced an independent-encoding scheme for two-user broadcast channels. This scheme is known to achieve the boundary of the capacity region for the broadcast binarysymmetric channel (BBSC) and is investigated in [2] [3] [4] [5]. The class of channels for which independent encoding is optimal was recently extended in [6], [7].…”

Section: B Introduction To the Dbcmentioning

confidence: 99%

Superposition coding to support multiple streams, priorities, and channel capacities in the context of GMSK

Courtade

Wang

Wesel

2011

2011 - MILCOM 2011 Military Communications Conference

View full text Add to dashboard Cite

Abstract-It is well known in information theory that superposition coding is an optimal technique for providing a single transmission that both provides a high data rate when channel conditions are good and still provides some information when the channel conditions are poor (perhaps due to jamming). Typical superposition coding schemes for the additive white Gaussian noise channel combine signals after the modulator. For modulation schemes such as GMSK, this standard form of (additive) superposition is not acceptable because it does not maintain a constant envelope. This paper introduces a new approach in which newly designed nonlinear codes allow superposition to take place before the GMSK modulation. These codes are demonstrated to operate very close to the boundary of the achievable rate region for the broadcast binary symmetric channel which would result from GMSK transmission with hard decoding. The results also suggest that similarly optimal performance might be obtainable in the soft decoding regime.

show abstract

New Capacity-Achieving Encoding Schemes for Degraded Binary Broadcast Channels

Cited by 4 publications

References 9 publications

Designing Nonlinear Turbo Codes with a Target Ones Density

Designing Nonlinear Turbo Codes with a Target Ones Density

Code Design for Discrete Memoryless Interference Channels

Superposition coding to support multiple streams, priorities, and channel capacities in the context of GMSK

Contact Info

Product

Resources

About