Cost-effective VLSI architecture for high-throughput sequential decoder

Chen-Yi Lee*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

This paper presents a new VLSI solution for high-speed digital communications based on long-constraint convolutional codes. The proposed VLSI architecture implements a modified sorter-based sequential decoding algorithm with an achievable maximum decoding rate of 25 Mbits/s. Unlike its previous version based on shiftable content addressable memory (SCAM) only, path recording is now implemented on an embedded SRAM module whose size is determined by path depth (d) and survived nodes (S). That is, both SCAM and SRAM are exploited to implement the sorter kernel. Results show that, for a (2,1,7) code, both power consumption and silicon area can be improved by 50% on the average, making the new proposal very suitable for high-speed convolutional code applications.

Original languageEnglish
Pages (from-to)328-331
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume4
DOIs
StatePublished - 1 Jan 1996
EventProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA
Duration: 12 May 199615 May 1996

Fingerprint Dive into the research topics of 'Cost-effective VLSI architecture for high-throughput sequential decoder'. Together they form a unique fingerprint.

Cite this