Abstract
In this paper, we consider a soft-input and soft-output iterative bounded-distance decoding (SISO-IBDD) algorithm in which the bounded-distance decodings are performed sequentially. And we study a computation method of a soft-output value to approximate Max-Log-MAP. In the decoding algorithm, search centers are generated by the sums of the hard-decision sequence obtained from a received sequence and test patterns which are selected beforehand, and the bounded-distance decodings with respect to the search centers are performed. We have proposed a selection method of test patterns for an iterative bounded-distance decoding (IBDD) algorithm in [5]. Simulation results have shown that the IBDD algorithm whose test patterns are selected by the proposed method with considerably small number of iterations provides better error performance than the Chase II decoding algorithm for several BCH codes over an AWGN channel using BPSK signaling. We adopt the selection method of test patterns for the SISO-IBDD algorithm and a computation method of a soft-output value which is modified based on the proposed method in [2] with respect to reliability factors. Over the AWGN channel using the BPSK signaling, we show bit error rates and average soft-output values given by the SISO-IBDD algorithm for the extended BCH (64, 36, 12) and (64, 45, 8) codes by computer simulation. For the extended BCH codes, the simulation results show that bit error rates of the SISO-IBDD algorithm are relatively smaller than those of a Chase-like decoding algorithm with the same number of iterations of the bounded-distance decodings and for each component bit, average soft-output values provided by the SISO-IBDD algorithm are close to those by the Max-Log-MAP decoding algorithm by computer simulation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Hagenauer, E. Offer and L. Papke, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. Inform. Theory vol. 42, No. 2, pp. 429–445, 1996.
R.M. Pyndiah, “Near Optimum Decoding of Product Codes: Block Turbo Codes,” IEEE Trans. on Commun. vol. 46, no. 8, pp. 1003–1010, Aug. 1998.
P.A. Martin and D.P. Taylor, “On Multilevel Codes and Iterative Multistage Decoding,” IEEE Trans. Commun. vol. 49, no. 11, pp. 1916–1925, Nov. 2001.
P.A. Martin, D.P. Taylor and M.P.C. Fossorier, “Soft-input Soft-output List-based Decoding Algorithm,” Proc. of 2002 IEEE International Symposium on Information Theory Lausanne, Switzerland,2 pp. 339, Jun. 2002.
H. Tokushige, T. Koumoto, M. Fossorier and T. Kasami, “Selection Method of Test Patterns in Soft-decision Iterative Bounded Distance Decoding Algorithms” IEICE Trans. Fundamentals vol. E86-A, no. 10, pp. 2445–2451, Oct. 2003.
D. Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information,” IEEE Trans. Inform. Theory, IT-18, pp. 170–182, Jan. 1972.
M. Fossorier and S. Lin, “Error Performance Analysis for Reliability-Based Decoding Algorithms,” IEEE Trans. on Inform. Theory, vol. IT-48, pp. 287–293, Jan. 2002.
R.L. Graham and N.J.A. Sloane. “On the Covering Radius of Codes,” IEEE Trans. Inform. Theory, IT-31, pp. 385–401, May 1985.
G. Cohen, I. Honkala, S. Litsyn and A. Lobstein Covering Codes Amsterdam, The Netherlands: North-Holland, 1997.
M. Fossorier and S. Lin, “Soft-Decision Decoding of Binary Linear Block Codes Based on Ordered Statistics,” IEEE Trans. on Inform. Theory vol. 44, No. 5, pp. 1217–1234, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Tokushige, H., Asatani, J., Fossorier, M.P.C., Kasami, T. (2004). Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_23
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive