A novel physical layer scheme based on superposition codes

The recently proposed superposition codes (SCs) have been mathematically proved to be decoded at any rate below the capacity, for additive white Gaussian noise (AWGN) channels. The main objective of this paper is to study the feasibility of a novel SC approach as an alternative to the traditional way of designing modern physical (PHY) layer schemes. Indeed, currently, PHY solutions are based on the decomposition into two separate problems of modulation shaping and coding over finite alphabets. Since superposition codes are defined over real numbers, modulation and coding can be jointly realized. Moreover, a fast decoding method is developed and tested by comparing the obtained results with both the uncoded system performance and two approximate message passing (AMP) algorithms. Finally, possible perspective to fifth generation (5G) applications exploiting SC solutions are outlined in the paper, and some interesting relations with sparse signal recovery are analyzed for further future research lines.

[1]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[2]  Pietro Savazzi,et al.  Efficient Receivers for q-ary LDPC Coded Signals over Partial Response Channels , 2010, 2010 IEEE International Conference on Communications.

[3]  Ian F. Akyildiz,et al.  5G roadmap: 10 key enabling technologies , 2016, Comput. Networks.

[4]  Frank Schaich,et al.  5GNOW: non-orthogonal, asynchronous waveforms for future mobile applications , 2014, IEEE Communications Magazine.

[5]  Carsten Bockelmann,et al.  Coping with CDMA Asynchronicity in Compressive Sensing Multi-User Detection , 2013, 2013 IEEE 77th Vehicular Technology Conference (VTC Spring).

[6]  Li Ping,et al.  Comparison of orthogonal and non-orthogonal approaches to future wireless cellular systems , 2006, IEEE Vehicular Technology Magazine.

[7]  Florent Krzakala,et al.  Replica analysis and approximate message passing decoder for superposition codes , 2014, 2014 IEEE International Symposium on Information Theory.

[8]  Ramji Venkataramanan,et al.  Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding , 2015, IEEE Transactions on Information Theory.

[9]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[10]  T. Marshall,et al.  Coding of Real-Number Sequences for Error Correction: A Digital Signal Processing Problem , 1984, IEEE J. Sel. Areas Commun..

[11]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[12]  J. Kovalcík.  A LIVING COURSE IN COMMUNICATION AT A DYING COLLEGE , 1953 .

[13]  Georgios B. Giannakis,et al.  Exploiting Sparse User Activity in Multiuser Detection , 2011 .

[14]  Warren J. Gross,et al.  Sparse superposition codes: A practical approach , 2015, 2015 IEEE Workshop on Signal Processing Systems (SiPS).

[15]  Warren J. Gross,et al.  Implementation of Sparse Superposition Codes , 2017, IEEE Transactions on Signal Processing.

[16]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.

[17]  Zizhong Chen,et al.  Optimal real number codes for fault tolerant matrix operations , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[18]  G. David Forney,et al.  Modulation and Coding for Linear Gaussian Channels , 1998, IEEE Trans. Inf. Theory.

[19]  Andrew R. Barron,et al.  Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{\cal C}$ , 2014, IEEE Transactions on Information Theory.

[20]  Lie-Liang Yang,et al.  Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels , 2006, IEEE Transactions on Communications.

[21]  Richard H. Sherman,et al.  Chaotic communications in the presence of noise , 1993, Optics & Photonics.

[22]  Andrew R. Barron,et al.  High-rate sparse superposition codes with iteratively optimal estimates , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[23]  Paolo Gamba,et al.  An Iterative Algorithm for Joint Symbol Timing Recovery and Equalization of Short Bursts , 2008, J. Commun..

[24]  Ioannis N. Athanasiadis,et al.  A Miniature Data Repository on a Raspberry Pi , 2016 .

[25]  Paolo Gamba,et al.  Efficient detection and decoding of q-ary LDPC coded signals over partial response channels , 2013, EURASIP Journal on Wireless Communications and Networking.

[26]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[27]  Georgios B. Giannakis,et al.  Complex-field coding for OFDM over fading wireless channels , 2003, IEEE Trans. Inf. Theory.

[28]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[29]  Emanuele Goldoni,et al.  A Novel Channel Coding Scheme for RFID Generation-2 Systems , 2016 .

[30]  Paolo Gamba,et al.  Iterative symbol timing recovery for short burst transmission schemes , 2008, IEEE Transactions on Communications.

[31]  Lie Wang,et al.  Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise , 2011, IEEE Transactions on Information Theory.

[32]  Joel A. Tropp,et al.  Applications of sparse approximation in communications , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[33]  Daniel J. Costello,et al.  Error Control Coding, Second Edition , 2004 .