Low-complexity iterative detection based on bi-directional trellis search

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 396-

  Bokolamulla, Dhammika ^a   Hansson, Anders ^b   Aulin, Tor ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; FINITE AUTOMATA; PROBABILITY DENSITY FUNCTION; SIGNAL DETECTION;

A POSTERIORI PROBABILITY; ADD COMPARE SELECT OPERATIONS; BIDIRECTIONAL TRELLIS SEARCH; FINITE STATE MACHINE; ITERATIVE DECODING; ITERATIVE DETECTION;

TRELLIS CODES;

EID: 0141904275     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228413     Document Type: Conference Paper

References (3)

1. X. Chen and K. M. Chugg, "Reduced-state soft-input/soft-output algorithms for complexity reduction in iterative and non-iterative data detection," in Proc. IEEE ICC 2000, vol. 1, pp. 6-10, June 2000.
2. T. M. Aulin, "Breadth-first maximum likelihood sequence detection: Basics," IEEE Trans. Communication, vol. 47, pp. 208-216, Feb. 1999.
3. D. Bokolamulla, "Reduced complexity techniques for iterative decoding," Licenciate Thesis, Chalmers University of Technology, Gothenburg, Sweden, 2003. Under preparation.