DocumentCode
2008712
Title
A flexible constraint length, foldable Viterbi decoder
Author
Kelly, Patrick H. ; Chau, Paul M.
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
fYear
1993
fDate
29 Nov-2 Dec 1993
Firstpage
631
Abstract
The design and implementation of a novel reconfigurable Viterbi decoder which provides programmed flexibility between constraint length and decoder throughput is described. This flexibility is achieved through an architecture which employs a foldable state scheduling scheme allowing a wide range of constraint lengths to be processed by a fixed set of physical hardware at full utilization and with no change in system configuration. In addition, the design affords scalability allowing hardware growth for higher throughput. A rapid prototype implementation using FPGA technology is discussed. Results showing excellent performance of the decoder for a variety of constraint lengths, including K=14 which finds application in deep space communications, are presented
Keywords
decoding; logic arrays; maximum likelihood estimation; space communication links; FPGA technology; decoder throughput; deep space communications; flexible constraint length decoder; foldable Viterbi decoder; foldable state scheduling; hardware growth; performance; prototype implementation; Computer architecture; Hardware; Maximum likelihood decoding; Processor scheduling; Prototypes; Scalability; Space technology; Throughput; Very large scale integration; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE
Conference_Location
Houston, TX
Print_ISBN
0-7803-0917-0
Type
conf
DOI
10.1109/GLOCOM.1993.318157
Filename
318157
Link To Document