| Paper: | SPCOM-P1.2 | ||
| Session: | Coding and Compression | ||
| Time: | Tuesday, May 16, 10:30 - 12:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communication: MIMO precoder/decoder design, receiver algorithms | ||
| Title: | MONOTONIC OPTIMIZATION BASED DECODING FOR LINEAR CODES | ||
| Authors: | Phan Khoa, University of New South Wales, Australia; Tran Son, Toyota Technological Institute, Japan; Hoang D. Tuan, University of New South Wales, Australia; Hoang Tuy, Institute of Mathematics, Viet Nam | ||
| Abstract: | A new efficient method is developed for the optimal maximum-likelihood (ML) decoding of an arbitrary binary linear code based on data received from Gaussian channel. The decoding algorithm is based on monotonic optimization, that is minimizing a difference of two monotonic objective functions. An iterative Branch-Reduce-Bound is then developed to suit the 0-1 constraint of bit variables. The algorithm converges to the global optimal ML solution after a finite number of steps. The proposed algorithm computational complexity depends on input sequence length k which is much less than the codeword length n, especially for codes with small code rates. The viability of the developed method is verified through simulations on different coding schemes. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012