首页 | 本学科首页   官方微博 | 高级检索  
     


A parallel Viterbi decoding algorithm
Authors:J. S. Reeve
Affiliation:Department of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, U.K.
Abstract:In this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array. We describe the algorithm for Bose–Chaudhuri–Hocquenghem (BCH) codes which have a task graph with its valence restricted to four inputs and four outputs. The method is also applicable to convolution codes, but the complexity of the task graph increases with the number of input bits for these codes. Results for BCH codes are given for two general purpose parallel machines, an IBM SP2 and a Meiko CS2. Copyright © 2001 John Wiley & Sons, Ltd.
Keywords:trellis decoding  Viterbi decoding  BCH codes
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号