{"title":"A 1 Gb/s, 4-state, sliding block Viterbi decoder","authors":"P. Black, T. Meng","doi":"10.1109/VLSIC.1993.920543","DOIUrl":null,"url":null,"abstract":"In recent years there has been great interest in the implementation of high-speed Viterbi decoders. A potential application which has pushed decode rates into the Gb/s range is convolutional coding for optical channels. In this paper, an alternative sliding block Viterbi decoder is proposed that approaches ideal linear scaling (complexity proportional to speedup) without constraining the encoding process. Sliding block Viterbi decoder implementation of the Viterbi algorithm as a sliding block decoder (SBD) is based on the observation that the state at time n can be decoded using only the information from the interval n-L to n +L, where L is the survivor path length.","PeriodicalId":127467,"journal":{"name":"Symposium 1993 on VLSI Circuits","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium 1993 on VLSI Circuits","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLSIC.1993.920543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
In recent years there has been great interest in the implementation of high-speed Viterbi decoders. A potential application which has pushed decode rates into the Gb/s range is convolutional coding for optical channels. In this paper, an alternative sliding block Viterbi decoder is proposed that approaches ideal linear scaling (complexity proportional to speedup) without constraining the encoding process. Sliding block Viterbi decoder implementation of the Viterbi algorithm as a sliding block decoder (SBD) is based on the observation that the state at time n can be decoded using only the information from the interval n-L to n +L, where L is the survivor path length.