Loading...

Uniquely decodable codes with fast decoder for overloaded synchronous CDMA systems

Mashayekhi, O ; Sharif University of Technology | 2012

713 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TCOMM.2012.081012.110178
  3. Publisher: 2012
  4. Abstract:
  5. In this paper, we introduce a new class of sigature matrices for overloaded synchronous CDMA systems that have a very low complexity decoder. While overloaded systems are more efficient from the bandwidth point of view, the Maximum Likelihood (ML) implementation for decoding is impractical even for moderate dimensions. Simulation results show that the performance of the proposed decoder is very close to that of the ML decoder. Indeed, the proposed decoding scheme needs neither multiplication nor addition and requires only a few comparisons. Furthermore, the computational complexity and the probability of error vs. Signal to Noise Ratios (SNR) are derived analytically
  6. Keywords:
  7. bit-error rate (BER) ; code division multiple access (CDMA) ; Coding ; Decoding scheme ; Fast decoding ; ML decoder ; overloaded codes ; Overloaded systems ; Probability of errors ; Synchronous CDMA systems ; Uniquely decodable codes ; Very low complexity ; Computational complexity ; Decoding ; Fading channels ; Code division multiple access
  8. Source: IEEE Transactions on Communications ; Volume 60, Issue 11 , 2012 , Pages 3145-3149 ; 00906778 (ISSN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6266766