Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Protection
Authors:
- Chia-Lung WuCWChia-Lung Wu
- Po-Ning ChenPCPo-Ning Chen
- Yunghsiang S. HanYHYunghsiang S. Han
- Ming-Hsin KuoMKMing-Hsin Kuo
Preprint
Abstract
The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect. It has been shown by simulations that such code design can considerably improve the system performance over the conventional design with separate channel estimation and error protection modules under the same code rate. Nevertheless, the major obstacle that prevents from the practice of the codes is that the existing codes are mostly searched by computers, and hence exhibit no good structure for efficient decoding. Hence, the time-consuming exhaustive search becomes the only decoding choice, and the decoding complexity increases dramatically with the codeword length. In this paper, by optimizing the signal-tonoise ratio, we found a systematic construction for the codes for combined channel estimation and error protection, and confirmed its equivalence in performance to the computer-searched codes by simulations. Moreover, the structural codes that we construct by rules 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 significantly when compared with that of the exhaustive decoder. The extension code design for fast-fading channels is also presented. Simulations conclude that our constructed extension code is robust in performance even if the coherent period is shorter than the codeword length.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Combined Coding and Training for Unknown ISI ChannelsIEEE Transactions on Communications, 2005
- Combined equalization and decoding for IEEE 802.11b devicesIEEE Journal on Selected Areas in Communications, 2003
- Space-time block codes: a maximum SNR approachIEEE Transactions on Information Theory, 2001
- Channel estimation using aperiodic binary sequencesIEEE Communications Letters, 1998
- Complex optimal sequences with constant magnitude for fast channel estimation initializationIEEE Transactions on Communications, 1998
- MLSE for an unknown channel .I. Optimality considerationsIEEE Transactions on Communications, 1996
- Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codesIEEE Transactions on Information Theory, 1993
- Least sum of squared errors (lsse) channel estimationIEE Proceedings F Radar and Signal Processing, 1991
- Sequential Coding Algorithms: A Survey and Cost AnalysisIEEE Transactions on Communications, 1984
- Trace inequalities involving Hermitian matricesLinear Algebra and its Applications, 1979