论文信息 - Three measures of decoder complexity

Three measures of decoder complexity

Three measures of the complexity of error correcting decoders are considered, namely, logic complexity, computation time and computational work (the number of logical operations). Bounds on the complexity required with each measure to decode with probability of error Pe, at code rate R are given and the complexity of a number of ad hoc decoding procedures is examined.

John E. Savage

[1] Thomas Kailath,et al. A coding scheme for additive noise channels with feedback-I: No bandwidth constraint , 1966, IEEE Trans. Inf. Theory.

[2] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[3] JOHN E. SAVAGE. The complexity of decoders-II: Computational work and decoding time , 1971, IEEE Trans. Inf. Theory.

[4] Aaron D. Wyner,et al. On the Schalkwijk-Kailath coding scheme with a peak energy constraint , 1968, IEEE Trans. Inf. Theory.

[5] Robert G. Gallager,et al. A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[6] John E. Savage. A note on the performance of concatenated codes (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[7] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .

[8] J. Pieter M. Schalkwijk,et al. A coding scheme for additive noise channels with feedback-II: Band-limited signals , 1966, IEEE Trans. Inf. Theory.

[9] John E. Savage,et al. Complexity of decoders-I: Classes of decoding rules , 1969, IEEE Trans. Inf. Theory.