Punctured Convolutional Codes for The 1-D Partial-Response Channel

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 808-817

  Hole, Kjell Jϕrgen ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

partial; Punctured convolutional codes; response channels

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY - COMMUNICATION CHANNELS; MATHEMATICAL TECHNIQUES - TRANSFER FUNCTIONS; NOISE, SPURIOUS SIGNAL; SIGNAL FILTERING AND PREDICTION;

CODE SEARCH; PARTIAL-RESPONSE CHANNELS; PUNCTURED CONVOLUTIONAL CODES; SELECTABLE-RATE ENCODING; VITERBI DECODING;

CODES, SYMBOLIC;

EID: 0026152287     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79950     Document Type: Article

References (14)

1. J. K. Wolf and G. Ungerboeck, “Trellis coding for partial-response channels,” IEEE Trans. Commun., vol. COM-34, pp. 765–773, Aug. 1986.
2. E. Zehavi and J. K. Wolf, “On saving decoder states for some trellis codes and partial response channels,” IEEE Trans. Commun., vol. COM-36, pp. 222–224, Feb. 1988.
3. T.-A. Lee and C. Heegard, “An inversion technique for the design of binary convolutional codes for the l-DN channel,” in Proc. IEEE Regional Meeting, Johns Hopkins Univ., Baltimore, MD, Feb. 1985.
4. A. R. Calderbank, C. Heegard, and T.-A. Lee, “Binary convolutional codes with application to magnetic recording,” IEEE Trans. Inform. Theory, vol. IT-32, no. 6, pp. 797–815, Nov. 1986.
5. G. D. Forney, Jr., “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, no. 6, pp. 720–738, Nov. 1970.
6. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
7. D. G. Daut, J. W. Modestino, and L. D. Wismer, “New short constraint length convolutional code constructions for selected rational rates,” IEEE Trans. Inform. Theory, vol. IT-28, no. 5, pp. 794–800, Sept. 1982.
8. J. L. Massey and M. K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Comput., vol. C-17, pp. 330–337, Apr. 1968.
9. J. B. Cain, G. C. Clark, Jr., and J. M. Geist, “Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-25, no. 1, pp. 97–100, Jan. 1979.
10. G. D. Forney, Jr., “Minimal bases of rational vector spaces with applications to multivariable linear systems,” Siam J. Contr., vol. 13, no. 3, pp. 493–520, May 1975.
11. Y. Yasuda, Y. Hirata, and A. Ogawa, “Optimum soft decision for Viterbi decoding,” in Proc. 5th Int. Conf. Digital Satellite Commun., Genova, Italy, Mar. 1981, pp. 251–258.
12. Y. Yasuda, Y. Hirata, K. Nakamura, and S. Otani, “Development of variable-rate Viterbi decoder and its performance characteristics,” in Proc. 6th Int. Conf. Digital Satellite Commun., Phoenix, AZ, Sept. 1983, pp. XII-24–XII-31.
13. K. J. Hole, “New short constraint length rate (n -1)/n punctured convolutional codes for soft-decision Viterbi decoding,” IEEE Trans. Inform. Theory, vol. IT-34, no. 5, pp. 1079–1081, Sept. 1988.
14. P. J. Lee, “Constructions of rate (n-1)/n punctured convolutional codes with minimum required SNR criterion,” IEEE Trans. Commun., vol. COM-36, pp. 1171–1174, Oct. 1988.