Three Measures of Decoder Complexity
John E. Savage · IBM Journal of Research and Development · 1970
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 Peat code rate R are given and the complexity of a number of ad hoc decoding procedures is examined.
Cited by 9 works. doi:10.1147/rd.144.0417
Authors
References
- Error-Correcting Codes.
- A simple derivation of the coding theorem and some applications
- Lower bounds to error probability for coding on discrete memoryless channels. II
- A coding scheme for additive noise channels with feedback--II: Band-limited signals
- The complexity of decoders--II: Computational work and decoding time
- On the Schalkwijk-Kailath coding scheme with a peak energy constraint
- Complexity of decoders--I: Classes of decoding rules
- A note on the performance of concatenated codes (Corresp.)