Pipelined VLSI architecture of the Viterbi decoder for IMT-2000

Byonghyo Shim, Jung Chul Suh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

An improved VLSI architecture for the high-speed Viterbi decoder is proposed. We partitioned the datapath of the Viterbi decoder into largely 3 pipeline stages and to reduce the operation overhead of the ACSU, removed the minimum metric selection logic and exploited constant subtraction scheme for the metric rescaling. This can be done by using unsigned arithmetic and the overflow detection unit. We also discuss unnecessity of minimum metric selection logic in the point of truncation effects. Simulation results demonstrate that if the traceback depth is set long enough, the arbitrary state decoding can be used without much disadvantage over the best state decoding. The SMU pipelining architecture based on the modified traceback algorithm is also presented. By exploiting the 2 registers and multiplexor, we made one-stage pipeline cell and by cascading them, the traceback operation without LIFO or some complex memory controller can be achieved with a latency of only 2T.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Volume1
Publication statusPublished - 1999 Dec 1
Externally publishedYes
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: 1999 Dec 51999 Dec 9

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period99/12/599/12/9

Fingerprint

Decoding
Pipelines
Data storage equipment
Controllers
simulation
speed
detection
effect

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Shim, B., & Suh, J. C. (1999). Pipelined VLSI architecture of the Viterbi decoder for IMT-2000. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1). Piscataway, NJ, United States: IEEE.

Pipelined VLSI architecture of the Viterbi decoder for IMT-2000. / Shim, Byonghyo; Suh, Jung Chul.

Conference Record / IEEE Global Telecommunications Conference. Vol. 1 Piscataway, NJ, United States : IEEE, 1999.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shim, B & Suh, JC 1999, Pipelined VLSI architecture of the Viterbi decoder for IMT-2000. in Conference Record / IEEE Global Telecommunications Conference. vol. 1, IEEE, Piscataway, NJ, United States, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 99/12/5.
Shim B, Suh JC. Pipelined VLSI architecture of the Viterbi decoder for IMT-2000. In Conference Record / IEEE Global Telecommunications Conference. Vol. 1. Piscataway, NJ, United States: IEEE. 1999
Shim, Byonghyo ; Suh, Jung Chul. / Pipelined VLSI architecture of the Viterbi decoder for IMT-2000. Conference Record / IEEE Global Telecommunications Conference. Vol. 1 Piscataway, NJ, United States : IEEE, 1999.
@inproceedings{799994168b5144a7bbfac63912e57617,
title = "Pipelined VLSI architecture of the Viterbi decoder for IMT-2000",
abstract = "An improved VLSI architecture for the high-speed Viterbi decoder is proposed. We partitioned the datapath of the Viterbi decoder into largely 3 pipeline stages and to reduce the operation overhead of the ACSU, removed the minimum metric selection logic and exploited constant subtraction scheme for the metric rescaling. This can be done by using unsigned arithmetic and the overflow detection unit. We also discuss unnecessity of minimum metric selection logic in the point of truncation effects. Simulation results demonstrate that if the traceback depth is set long enough, the arbitrary state decoding can be used without much disadvantage over the best state decoding. The SMU pipelining architecture based on the modified traceback algorithm is also presented. By exploiting the 2 registers and multiplexor, we made one-stage pipeline cell and by cascading them, the traceback operation without LIFO or some complex memory controller can be achieved with a latency of only 2T.",
author = "Byonghyo Shim and Suh, {Jung Chul}",
year = "1999",
month = "12",
day = "1",
language = "English",
volume = "1",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Pipelined VLSI architecture of the Viterbi decoder for IMT-2000

AU - Shim, Byonghyo

AU - Suh, Jung Chul

PY - 1999/12/1

Y1 - 1999/12/1

N2 - An improved VLSI architecture for the high-speed Viterbi decoder is proposed. We partitioned the datapath of the Viterbi decoder into largely 3 pipeline stages and to reduce the operation overhead of the ACSU, removed the minimum metric selection logic and exploited constant subtraction scheme for the metric rescaling. This can be done by using unsigned arithmetic and the overflow detection unit. We also discuss unnecessity of minimum metric selection logic in the point of truncation effects. Simulation results demonstrate that if the traceback depth is set long enough, the arbitrary state decoding can be used without much disadvantage over the best state decoding. The SMU pipelining architecture based on the modified traceback algorithm is also presented. By exploiting the 2 registers and multiplexor, we made one-stage pipeline cell and by cascading them, the traceback operation without LIFO or some complex memory controller can be achieved with a latency of only 2T.

AB - An improved VLSI architecture for the high-speed Viterbi decoder is proposed. We partitioned the datapath of the Viterbi decoder into largely 3 pipeline stages and to reduce the operation overhead of the ACSU, removed the minimum metric selection logic and exploited constant subtraction scheme for the metric rescaling. This can be done by using unsigned arithmetic and the overflow detection unit. We also discuss unnecessity of minimum metric selection logic in the point of truncation effects. Simulation results demonstrate that if the traceback depth is set long enough, the arbitrary state decoding can be used without much disadvantage over the best state decoding. The SMU pipelining architecture based on the modified traceback algorithm is also presented. By exploiting the 2 registers and multiplexor, we made one-stage pipeline cell and by cascading them, the traceback operation without LIFO or some complex memory controller can be achieved with a latency of only 2T.

UR - http://www.scopus.com/inward/record.url?scp=0033293305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033293305&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033293305

VL - 1

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

CY - Piscataway, NJ, United States

ER -