Analysis of the computational and storage requirements for the minimum-distance decoding of convolutional codes
- Creators
- Ng, W.-H.
- Goodman, R. M. F.
Abstract
In this paper we present the analytical results of the computational requirement for the minimum-distance decoding of convolutional codes. By deriving upper bounds for the number of decoding operations required to advance one code segment, we show that many less operations are required than in the case of sequential decoding This implies a significant reduction in the severity of the buffer-overflow problem. Then, we propose several modifications which could further reduce the computational effort required at long back-up distance. Finally we investigate the trade-off between coding-parameters selection and storage requirement as an aid to quantitative decoder design. Examples and future aspects are also presented and discussed.
Additional Information
© 1979 Institution of Electrical Engineers. Paper 8244 E, first received 12th June and in revised form 29th September 1978. This work was completed while Dr. Ng was with the University of Hull and before he joined the Aerospace Corporation.Attached Files
Published - 05253362.pdf
Files
Name | Size | Download all |
---|---|---|
md5:c087e72248691c42972b0fca9dd939f5
|
827.1 kB | Preview Download |
Additional details
- Eprint ID
- 93815
- Resolver ID
- CaltechAUTHORS:20190314-130608986
- Created
-
2019-03-14Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field