Soft-input soft-output lattice sphere decoder for linear channels

Conference Record / IEEE Global Telecommunications Conference

Volumn 3, Issue , 2003, Pages 1583-1587

  Boutros, Joseph ^a   Gresset, Nicolas ^a,b   Brunel, Loïc ^b   Fossorier, Marc ^a,c  

^a TELECOM PARISTECH   (France)

^b Mitsubishi Electric ITE   (France)

^c University of Hawaii at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; CHANNEL CAPACITY; COMPUTER SIMULATION; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; QUADRATURE AMPLITUDE MODULATION; RAYLEIGH FADING; SIGNAL DETECTION; SIGNAL TO NOISE RATIO; TURBO CODES; WHITE NOISE;

LINEAR CHANNELS; MULTIPLE ANTENNA CHANNELS;

DECODING;

EID: 0842267613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. E. Agrell, T. Eriksson, A. Vardy and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inf. Theory, pp. 2201-2214, August 2002.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo-codes," Proceedings of ICC'93, Geneva, pp. 1064-1070, May 1993.
3. J. Boutros, F. Boixadera and C. Lamy, "Bit-interleaved coded modulations for multiple-input multiple-output channels," IEEE 6th Int. Symp. on Spread Spectrum Techniques & App., NJ, September 2000.
4. J. Boutros and G. Caire, "Iterative multiuser joint decoding: unified framework and asymptotic analysis," IEEE Trans. on Inf. Theory, vol. 8, pp. 1772-1793, July 2002.
5. G. Caire, G. Taricco, E. Biglieri, "Bit-interleaved coded modulation," IEEE Trans. on Inf. Theory, vol. 44, no. 3, May 1998.
6. Henri Cohen: Computational algebraic number theory, Springer Verlag, 1993.
7. J. H. Conway, N. J. Sloane, "Sphere packings, lattices and groups," 3rd edition, 1998, Springer-Verlag, New York.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics of Computation, vol. 44, pp. 463-471, April 1985.
9. G.J. Foschini, Jr. and M.J. Gans, "On limits of wireless communication in a fading environment when using multiple antennas," Wireless Personal Communications, vol. 6, no. 3, pp. 311-335, March 1998.
10. B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," submitted to the IEEE Trans. Comm., July 2001.
11. F. Kschischang, B. Frey, H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, Feb 2001.
12. J. Luo, K. Pattipati, P. Willett, L. Brunel, "Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA," IEEE International Conference on Communications, Anchorage, May 2003.
13. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," ACM SIGSAM Bull., vol. 66, pp.181-191, 1994.
14. C.P. Schnorr and M. Euchnerr, "Lattice basis reduction: improved practical algorithms and solving subset sum problems," Mathematical Programming, vol.66, pp.181-191, 1994.
15. V. Tarokh, N. Seshadri and A. R. Calderbank, "Space-time codes for high data rate wireless communication: Performance criterion and code construction," IEEE Trans. on Inf. Theory, vol. 44, no. 2, pp.744-765, March 1998.
16. E. Viterbo and E. Biglieri, "A universal lattice decoder," 14eme Colloque GRETSI, Juan-Les-Pins, pp. 611-614, September 1993.
17. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. on Inf. Theory, pp. 1639-1642, July 1999.