Interleaving for outer convolutional codes in DS-CDMA systems

IEEE Transactions on Communications

Volumn 48, Issue 7, 2000, Pages 1100-1107

  Brück, Stefan ^a   Sorger, Ulrich ^b   Gligorevic, Snjezana ^b   Stolte, Norbert ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CONVOLUTIONAL CODES; DIFFERENCE EQUATIONS; FIR FILTERS; POLYNOMIALS; SIGNAL INTERFERENCE; SIGNAL TO NOISE RATIO;

DIRECT SEQUENCE CODE DIVISION MULTIPLE ACCESS SYSTEM; FINITE CODELENGTH; GAUSSIAN MULTIPLE ACCESS CHANNEL; INTERUSER INTERFERENCE; OUTER CONVOLUTIONAL CODES;

CODE DIVISION MULTIPLE ACCESS;

EID: 0034226614     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.855517     Document Type: Article

References (15)

1. S. Verdú, "Minimum probability of error for asynchronous Gaussian multiple-access channels," IEEE Trans. Inform. Theory, vol. COM-32, pp. 85-96, Jan. 1986.
2. T. Giallorenzi and S. Wilson, "Multiuser ML sequence estimator for convolutionally coded asynchrohnous DS-CDMA systems," IEEE Trans. Commun., vol. 44, pp. 997-1008, Aug. 1996.
3. A. Grant and P. Alexander, "Random sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 44, pp. 2832-2836, Nov. 1998.
4. S. Verdú and S. Shamai (Shitz), "Spectral efficiency of CDMA with random spreading," IEEE Trans. Inform. Theory, vol. 45, pp. 622-643, Mar. 1999.
5. S. Verdú, "Optimum multiuser asymptotic efficiency," IEEE Trans. Commun., vol. COM-34, pp. 890-897, Sept. 1986.
6. R. Jana and L. Wei, "Bounds for minimum euclidean distance for coded multiuser CDMA systems," in IEEE Int. Symp. on Spread Spectrum Techniques and Applications, Mainz, Germany, 1996, pp. 847-852.
7. S. Brück and U. Sorger, "Binary codes with inner spreading for Gaussian multiple-access channels," in IEEE Int. Symp. on Information Theory, Cambridge, MA, Aug. 1998.
8. L. Wei, "A simple way to compute minimum euclidean distance for synchronous coded multiuser systems," IEEE Commun. Lett., vol. 2, pp. 120-121, May 1998.
9. M. Moher, "Turbo-based multiuser detection," in IEEE Int. Symp. on Information Theory, Ulm, Germany, June/July 1997.
10. _, "An iterative multiuser decoder for near-capacity communications," IEEE Trans. Commun., pp. 870-880, July 1998.
11. M. C. Reed, P. Alexander, J. Asenstorfer, and C. B. Schlegel, "Iterative multi-user detection for DS-CDMA with FEC," in Int. Symp. on Turbo Codes, Brest, France, Sept. 1997.
12. C. Thommesen and J. Justesen, "Bounds on distances and error exponents of unit memory codes," IEEE Trans. Inform. Theory, vol. IT-29, pp. 637-649, Sept. 1983.
13. U. Dettmar and U. Sorger, "Bounded minimum distance decoding for unit memory codes," IEEE Trans. Inform. Theory, vol. 41, pp. 591-596, Mar. 1995.
14. U. Dettmar, "Partial unit memory codes," Ph.D. dissertation, Inst. for Network and Signal Theory, Univ. of Technol., Darmstadt, Germany, 1994.
15. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.