Reducing interconnect complexity for efficient path metric memory management in viterbi decoders

Ming-Der Shieh, Tai Ping Wang, Chien Ming Wu

Research output: Contribution to journalArticle

Abstract

We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add-compare-select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.

Original languageEnglish
Pages (from-to)2300-2311
Number of pages12
JournalIEICE Transactions on Information and Systems
VolumeE91-D
Issue number9
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Data storage equipment
Convolutional codes
Processing
Scheduling
Bandwidth

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

@article{fc31a1feb14944f5979614c0d1db23d3,
title = "Reducing interconnect complexity for efficient path metric memory management in viterbi decoders",
abstract = "We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add-compare-select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.",
author = "Ming-Der Shieh and Wang, {Tai Ping} and Wu, {Chien Ming}",
year = "2008",
month = "1",
day = "1",
doi = "10.1093/ietisy/e91-d.9.2300",
language = "English",
volume = "E91-D",
pages = "2300--2311",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

Reducing interconnect complexity for efficient path metric memory management in viterbi decoders. / Shieh, Ming-Der; Wang, Tai Ping; Wu, Chien Ming.

In: IEICE Transactions on Information and Systems, Vol. E91-D, No. 9, 01.01.2008, p. 2300-2311.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Reducing interconnect complexity for efficient path metric memory management in viterbi decoders

AU - Shieh, Ming-Der

AU - Wang, Tai Ping

AU - Wu, Chien Ming

PY - 2008/1/1

Y1 - 2008/1/1

N2 - We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add-compare-select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.

AB - We present a systematic and efficient way of managing the path metric memory and simplifying its connection network to the add-compare-select unit (ACSU) for Viterbi decoder (VD) design. Using the derived equations for memory partition and add-compare-select (ACS) arrangement together with the extended in-place scheduling scheme proposed in this work, we can increase the memory bandwidth for conflict-free path metric accesses with hardwired interconnection between the path metric memory and ACSU. Compared with the existing work, the developed architecture possesses the following advantages: (1) Each partitioned memory bank can be treated as a local memory of a specific processing element, inside the ACSU, with hardwired interconnection, so that the interconnect complexity is reduced significantly. (2) The partitioned memory banks can be merged into only two pseudo-banks regardless of the number of adopted ACS processing elements. This not only greatly simplifies the design of address generation unit, but also makes smaller the physical size of required memory. (3) The implementation can be accomplished in a systematic way with regular and simple controlling circuitry. Experimental results demonstrate the effectiveness of the developed architecture and the benefit will be more apparent for convolutional codes with large memory order.

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

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

U2 - 10.1093/ietisy/e91-d.9.2300

DO - 10.1093/ietisy/e91-d.9.2300

M3 - Article

VL - E91-D

SP - 2300

EP - 2311

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 9

ER -