Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder

碩士 === 國立雲林科技大學 === 電子與資訊工程研究所碩士班 === 91 === The Viterbi algorithm, widely used in digital communications, is known to be an efficient method for the realization of maximum likelihood decoding of convolutional codes. Of the key techniques to successfully designing the Viterbi decoders, how to effici...

Full description

Bibliographic Details
Main Authors: Ming-Chung Lee, 李明宗
Other Authors: Ming-Der Shieh
Format: Others
Language:zh-TW
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/70097264783168916966
id ndltd-TW-091YUNT5393172
record_format oai_dc
spelling ndltd-TW-091YUNT53931722016-06-10T04:15:28Z http://ndltd.ncl.edu.tw/handle/70097264783168916966 Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder 腓特比解碼器之路徑計量值記憶體連結複雜度之降低研究 Ming-Chung Lee 李明宗 碩士 國立雲林科技大學 電子與資訊工程研究所碩士班 91 The Viterbi algorithm, widely used in digital communications, is known to be an efficient method for the realization of maximum likelihood decoding of convolutional codes. Of the key techniques to successfully designing the Viterbi decoders, how to efficiently manage the path metric memory unit (PMMU) and at the same time to minimize the interconnection networks between PMMU and add_compare_select unit (ACSU) is always a key concern of hardware implementation. In this thesis, we first derive a systematic method for conflict-free address arrangement of in-place path metric update according to the butterfly-based computation. In this manner, we can increase the equivalent memory bandwidth at the expense of more complicated interconnects. To further reduce the interconnect overhead, we present a novel and efficient in-place scheduling technique, denoted as the extended in-place scheduling, such that every ACSU will only access a dedicated, partitioned memory bank; therefore, the interconnection network is simplified and the bank becomes conceptually local to the specific ACSU. The resulting architecture has the following characteristics: (1) The whole memory can be systematically partitioned into several sets of banks and each set can be treated as a local memory of a specific ACSU. (2) The implementation can be derived in a simple way with regular controlling circuitry (3) The result can be easily applied to different applications of Viterbi decoder and the effectiveness of the developed techniques is very apparent for convolutional codes with a long memory order. Finally, to show the resulting performance, we apply the presented techniques to both DAB (4, 1, 6) and CDMA (3, 1, 8) systems and demonstrate the flexibility of our development. Ming-Der Shieh Ming-Hwa Sheu 謝明得 許明華 2003 學位論文 ; thesis 103 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立雲林科技大學 === 電子與資訊工程研究所碩士班 === 91 === The Viterbi algorithm, widely used in digital communications, is known to be an efficient method for the realization of maximum likelihood decoding of convolutional codes. Of the key techniques to successfully designing the Viterbi decoders, how to efficiently manage the path metric memory unit (PMMU) and at the same time to minimize the interconnection networks between PMMU and add_compare_select unit (ACSU) is always a key concern of hardware implementation. In this thesis, we first derive a systematic method for conflict-free address arrangement of in-place path metric update according to the butterfly-based computation. In this manner, we can increase the equivalent memory bandwidth at the expense of more complicated interconnects. To further reduce the interconnect overhead, we present a novel and efficient in-place scheduling technique, denoted as the extended in-place scheduling, such that every ACSU will only access a dedicated, partitioned memory bank; therefore, the interconnection network is simplified and the bank becomes conceptually local to the specific ACSU. The resulting architecture has the following characteristics: (1) The whole memory can be systematically partitioned into several sets of banks and each set can be treated as a local memory of a specific ACSU. (2) The implementation can be derived in a simple way with regular controlling circuitry (3) The result can be easily applied to different applications of Viterbi decoder and the effectiveness of the developed techniques is very apparent for convolutional codes with a long memory order. Finally, to show the resulting performance, we apply the presented techniques to both DAB (4, 1, 6) and CDMA (3, 1, 8) systems and demonstrate the flexibility of our development.
author2 Ming-Der Shieh
author_facet Ming-Der Shieh
Ming-Chung Lee
李明宗
author Ming-Chung Lee
李明宗
spellingShingle Ming-Chung Lee
李明宗
Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
author_sort Ming-Chung Lee
title Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
title_short Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
title_full Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
title_fullStr Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
title_full_unstemmed Reducing Interconnect Overhead for Efficient Path Metric Memory Management in Viterbi Decoder
title_sort reducing interconnect overhead for efficient path metric memory management in viterbi decoder
publishDate 2003
url http://ndltd.ncl.edu.tw/handle/70097264783168916966
work_keys_str_mv AT mingchunglee reducinginterconnectoverheadforefficientpathmetricmemorymanagementinviterbidecoder
AT lǐmíngzōng reducinginterconnectoverheadforefficientpathmetricmemorymanagementinviterbidecoder
AT mingchunglee féitèbǐjiěmǎqìzhīlùjìngjìliàngzhíjìyìtǐliánjiéfùzádùzhījiàngdīyánjiū
AT lǐmíngzōng féitèbǐjiěmǎqìzhīlùjìngjìliàngzhíjìyìtǐliánjiéfùzádùzhījiàngdīyánjiū
_version_ 1718299520939327488