TY - GEN
T1 - A self-orthogonal code and its maximum-likelihood decoder for combined channel estimation and error protection
AU - Wu, Chia Lung
AU - Chen, Po-Ning
AU - Han, Yunghsiang S.
AU - Wang, Shih Wei
PY - 2008/12/1
Y1 - 2008/12/1
N2 - Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers1 can now be further extended, and therefore facilitates their applications.
AB - Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers1 can now be further extended, and therefore facilitates their applications.
UR - http://www.scopus.com/inward/record.url?scp=77951120222&partnerID=8YFLogxK
U2 - 10.1109/ISITA.2008.4895568
DO - 10.1109/ISITA.2008.4895568
M3 - Conference contribution
AN - SCOPUS:77951120222
SN - 9781424420698
T3 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008
PB - IEEE
T2 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
Y2 - 7 December 2008 through 10 December 2008
ER -