Successive interference cancelation amenable multiple access (SAMA) for future wireless communications

In this work, we introduce a novel multiple access scheme which is based on the joint design of the system signature matrix at the transmitter and the successive interference cancelation (SIC) based detector at the receiver. The symbols of the different users are judiciously spread in the frequency (space) domain, which can be effectively exploited by the SIC based technique, such as the iterative message-passing algorithm (MPA), to cancel the multi-user interference as well as to obtain diversity gain. Numerical results show that the non-orthogonal system based on the proposed successive interference cancelation amenable multiple access (SAMA) paradigm employing the iterative MPA achieves significant performances gain over the orthogonal one for the same spectral efficiency with affordable complexity.

[1]  Andrea J. Goldsmith,et al.  Dirty paper coding vs. TDMA for MIMO broadcast channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

[3]  Reza Hoshyar,et al.  Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel , 2008, IEEE Transactions on Signal Processing.

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

[5]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..

[6]  Sergio Verdú,et al.  Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.

[7]  Jinho Choi.  Low density spreading for multicarrier systems , 2004, Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738).

[8]  Andrea Montanari,et al.  Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula) , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[9]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[10]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[11]  R. Michael Buehrer,et al.  Equal BER performance in linear successive interference cancellation for CDMA systems , 2001, IEEE Trans. Commun..

[12]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[13]  Krishna R. Pattipati,et al.  Near-optimal multiuser detection in synchronous CDMA using probabilistic data association , 2001, IEEE Communications Letters.

[14]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[15]  Andrew J. Viterbi,et al.  Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels , 1990, IEEE J. Sel. Areas Commun..

[16]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[17]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[18]  Upamanyu Madhow,et al.  MMSE interference suppression for direct-sequence spread-spectrum CDMA , 1994, IEEE Trans. Commun..

[19]  Andrea J. Goldsmith,et al.  Dirty-paper coding versus TDMA for MIMO Broadcast channels , 2005, IEEE Transactions on Information Theory.

[20]  François Gagnon,et al.  Performance analysis of the V-BLAST algorithm: an analytical approach , 2004, IEEE Transactions on Wireless Communications.