Analysis of convolutional encoders and synthesis of rate-2/n Viterbi decoders
From MaRDI portal
Publication:4885737
DOI10.1109/18.508860zbMATH Open0855.94023OpenAlexW2046123234MaRDI QIDQ4885737FDOQ4885737
Authors: S. Summerfield
Publication date: 4 February 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.508860
Recommendations
Convolutional codes (94B10) Decoding (94B35) Modulation and demodulation in information and communication theory (94A14)
Cited In (8)
- Viterbi decoding of the \((63,57)\) Hamming code -- implementation and performance results
- Systolic array processing of the Viterbi algorithm
- An efficient in-place VLSI architecture for Viterbi algorithm
- State diagram connectivity and its effects on the decoding of shift-register-based codes
- Interleaved convolutional code and its Viterbi decoder architecture
- Realization of 2D convolutional codes of rate \(\frac{1}{n}\) by separable Roesser models
- Some VLSI decompositions of the de Bruijn graph
- On locally invertible rate-1/n convolutional encoders
This page was built for publication: Analysis of convolutional encoders and synthesis of rate-2/n Viterbi decoders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885737)