Trellis Codes with Low Ones Density for the OR Multiple Access Channel

This paper presents trellis codes for the Z channel designed to maintain a relatively low ones density. These codes have applications in pulse-position modulation systems and as a solution for uncoordinated communication on the binary OR multiple-access channel (MAC). In this paper we consider the latter application to demonstrate the performance of the codes. The OR channel provides an unusual opportunity where single-user decoding permits operation at about 70% of the full multiple-access channel sum capacity. The interleaver-division multiple access technique applied in this paper should approach that performance with turbo solutions. However, the current paper focuses on very low latency codes with simple decoding, intended for very high speed (gigabits per second) applications. Namely, it focuses on nonlinear trellis codes that provide about 30% of the full multiple-access sum capacity at high speeds and with very low latency. These trellis codes are designed specifically for the Z-channel that arises in a multiple-user OR channel, when the other users are treated as noise. In order to optimize the sum-capacity of the OR-MAC, the trellis code transmits codewords with a ones density much less than 50%. Also, a union bound technique that predicts the performance of these codes is presented. Results from simulations and a working FPGA implementation are shown

[1]  Li Ping,et al.  A simple approach to near-optimal multiuser detection: interleave-division multiple-access , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[2]  Chaoping Xing,et al.  New lower bounds and constructions for binary codes correcting asymmetric errors , 2003, IEEE Trans. Inf. Theory.

[3]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[4]  Richard D. Wesel,et al.  CTH02-5: Non-linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel , 2006, IEEE Globecom 2006.

[5]  Philip A. Whiting,et al.  Rate-splitting multiple access for discrete memoryless channels , 2001, IEEE Trans. Inf. Theory.

[6]  Ezio Biglien High-Level Modulation and Coding for Nonlinear Satellite Channels , 1984 .

[7]  K. X. M. Tzeng,et al.  Convolutional Codes and 'Their Performance in Communication Systems , 1971 .

[8]  David Burshtein,et al.  On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.

[9]  Li Ping,et al.  A simple, unified approach to nearly optimal multiuser detection and space-time coding , 2002, Proceedings of the IEEE Information Theory Workshop.

[10]  Susanna Spinsante,et al.  Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel , 2005 .

[11]  Ikuo Oka,et al.  Error probability for digital transmission over nonlinear channels with application to TCM , 1990, IEEE Trans. Inf. Theory.

[12]  David J. C. MacKay,et al.  Sparse low-density parity-check codes for channels with cross-talk , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).