Reduced-complexity turbo equalization for coded intersymbol interference channels based on local search algorithms

IEEE Transactions on Vehicular Technology

Volumn 57, Issue 1, 2008, Pages 630-635

  Qin, Zhiliang ^a   Teh, Kah Chan ^b  

^a DATA STORAGE INSTITUTE   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Combinatorial optimization; Local search (LS); Turbo equalization

Indexed keywords

BLIND EQUALIZATION; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; ITERATIVE METHODS; TURBO CODES;

CHANNEL DETECTION; LOCAL SEARCH ALGORITHM;

INTERSYMBOL INTERFERENCE;

EID: 39649104551     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2007.901933     Document Type: Article

References (13)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: Turbo-codes," in Proc. IEEE ICC, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. D. Raphaeli, "Combined turbo equalization and turbo decoding," IEEE Commun. Lett., vol. 2, no. 4, pp. 107-109, Apr. 1998.
3. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
4. M. Tüchler, R. Koetter, and A. Singer, "Turbo equalization: Principles and new results," IEEE Trans. Commun., vol. 50, no. 5, pp. 754-767, May 2002.
5. Z. Wu and J. M. Cioffi, "Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels," IEEE J. Sel. Areas Commun., vol. 19, no. 4, pp. 699-708, Apr. 2001.
6. C. M. Vithanage, C. Andrieu, R. J. Piechocki, and M. S. Yee, "Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm," in Proc. IEEE Int. Workshop Signal Process. Adv. Wireless Commun., New York, Jun. 2005, pp. 136-140.
7. E. Tungsrisanguan and R. M. A. P. Rajatheva, "Turbo equalization with sequential sequence estimation over multipath fading channels," IEEE Commun. Lett., vol. 6, no. 3, pp. 93-95, Mar. 2002.
8. P. Merz, "Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies," Ph.D. dissertation, Univ. Siegen, Siegen, Germany, Dec. 2000.
9. S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Oper Res., vol. 21, no. 2, pp. 498-516, Mar./Apr. 1973.
10. P. H. Tan and L. K. Rasmussen, "Multiuser detection in CDMA - A comparison of relaxations, exact, and heuristic search methods," IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1802-1809, Sep. 2004.
11. J. G. Proakis, Digital Communications, 3rd ed. New York: McGraw-Hill, 1995.
12. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes," TDA Progress Rep. 42-127, Nov. 15, 1996. pp. 1-20.
13. V. Franz and J. B. Anderson, "Concatenated decoding with a reduced-search BCJR algorithm," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 186-195, Feb. 1998.