Optimal Soft Decision Block Decoders Based on Fast Hadamard Transform

IEEE Transactions on Information Theory

Volumn 32, Issue 3, 1986, Pages 355-364

  Be'ery, Yair ^a   Snyders, Jakov ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; MATHEMATICAL TRANSFORMATIONS;

BLOCK CODING; CONCURRING CODEWORDS; HADAMARD TRANSFORMS; MEMORY REDUCTION;

CODES, SYMBOLIC;

EID: 0022719911     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057189     Document Type: Article

References (24)

1. R. R. Green, “A serial orthogonal decoder,” JPL Space Program Summary, vol. IV, no. 37-39, pp. 247–253, 1966.
2. R. R. Green, “Analysis of a serial orthogonal decoder,” JPL Space Program Summary, vol. III, no. 37–53, pp. 185–187, 1968.
3. J. O. Duffy, “Detailed design of a Reed-Muller (32, 6) block encoder,” JPL Space Program Summary, vol. III, no. 37–47, pp. 263–267, 1967.
4. E. C. Posner, “Combinatorial structure in planetary reconaissance,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1969, pp. 15–46.
5. C. K. Rushforth, “Fast Fourier-Hadamard decoding of orthogonal codes,” Inform. Contr., vol. 15, pp. 33–37, 1969.
6. H. J. Manley, H. F. Mattson Jr., and J. R. Schatz, “Some applications of Good's theorem,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 475–476, 1980.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
8. M. Cohn and A. Lempel, “ On fast M-sequence transforms,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 135–137, 1977.
9. V. V. Losev and V. D. Dvornikov, “Fast Walsh decoding of maximum length codes,” Radio Tek. El., vol. 24, pp. 630–632, 1979.
10. G. C. Clark, Jr., and R. C. Davis, “A decoding algorithm for group codes and convolution codes based on the fast Fourier-Hadamard transform,” presented at the IEEE 1969 Int. Symp. Information Theory, Ellenville, NY.
11. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.
12. C. R. P. Hartmann and L. D. Rudolph, “An optimum symbol-by-symbol decoding rule for linear codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 514–517, 1976.
13. L. D. Rudolph, C. R. P. Hartmann, T. Y. Hwang, and N. Q. Duc, “Algebraic analog decoding of linear binary codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 430–440, 1979.
14. G. R. Redinbo, “Optimum soft decision decoding with graceful degradation,” Inform. Contr., vol. 41, pp. 165–185, 1979.
15. G. R. Redinbo, “ Optimal symbol-by-symbol mean-square error channel coding,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 387–405, 1979.
16. K. R. Matis and J. W. Modestino, “Reduced-search soft-decision trellis decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 349–355, 1982.
17. E. R. Berlekamp, “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 372–377, 1983.
18. H. Tanaka and K. Kakigahara, “Simplified correlation decoding by selecting possible codewords using erasure information,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 743–748, 1983.
19. G. Seroussi and A. Lempel, “Maximum likelihood decoding of certain Reed-Muller codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 448–450, 1983.
20. Y. Be'ery and J. Snyders, “A recursive Hadamard transform optimal soft decision decoding algorithm,” to be published.
21. D. F. Elliot and K. R. Rao, Fast Transforms, Algorithms, Analyses, Applications. New York: Academic, 1982, pp. 313–317.
22. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983, p. 392.
23. J. L. Massey, D. J. Costello, Jr., and J. Justesen, “Polynomial weights and code construction,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 101–110, 1973.
24. L. B. Levitin and C. R. P. Hartmann, “A new approach to the general minimum distance decoding problem: the zero-neighbors algorithm,” IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 378–384, May 1985.