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.