Heuristic Tree Search for Detection and Decoding of Uncoded and Linear Block Coded Communication Systems
- Creators
- Cui, Tao
- Ho, Tracey
- Tellambura, Chinthananda
Abstract
A heuristic tree search algorithm is developed for the maximum likelihood detection and decoding problem in a general communication system. We propose several "cheap" heuristic functions using constrained linear detectors and the minimum mean square errors (MMSE) detector. Even though the MMSE heuristic function does not guarantee the optimal solution, it has a negligible performance loss and provides a good complexity-performance tradeoff. For linear block coded systems, heuristic tree search is modified for soft decision decoding. High rate codes are decoded via the minimum state trellis, and low rate codes via the minimum complexity tree. Preprocessing is also discussed to further speed up the algorithms.
Additional Information
© 2006 IEEE. Issue Date: June 2006. Date of Current Version: 11 December 2006.Attached Files
Published - Cui2006p137812008_Ieee_International_Conference_On_Communications_Proceedings_Vols_1-13.pdf
Files
Name | Size | Download all |
---|---|---|
md5:99a9c492f39aae4ee2cd87c9df11af11
|
164.9 kB | Preview Download |
Additional details
- Eprint ID
- 23573
- Resolver ID
- CaltechAUTHORS:20110506-105351004
- Created
-
2011-06-03Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- IEEE International Conference on Communications