首页> 外国专利> DECODING CIRCUIT FOR CONVOLUTIONAL CODES FOR THE EXECUTION OF THE REVERSE STORAGE AND EXPLORATION STAGE OF SURFACE ROADS OF A VITERBI ALGORITHM.

DECODING CIRCUIT FOR CONVOLUTIONAL CODES FOR THE EXECUTION OF THE REVERSE STORAGE AND EXPLORATION STAGE OF SURFACE ROADS OF A VITERBI ALGORITHM.

机译:卷积码的解码电路,用于执行维特比算法的表面道路的反向存储和探测阶段。

摘要

This decoding consists of exploring in the opposite direction a plurality of paths of a trellis representative of a diagram of possible transitions resulting from coding by a v-flip-coder, each node of the trellis being represented by a word of N = 2v bits. . BR/ The circuit operates in such a way as to select, from a plurality of possible surviving paths, that presenting the weakest metric, so as to reconstruct the trellis path actually described during coding and to find the sequence of bits of information having caused the path of this path. BR/ According to the invention, the circuit comprises a memory (20) storing a plurality of said words (D ') of N = 2v bits and, at the output of this memory, cascading of v groups of multiplexers 2- in-1 (21, 22, 23, 24, 25, 26), progressively reducing the 2v outputs of the memory to a single output, a D flip-flop (31, 32, 33, 34, 35, 36) being output of each multiplexer. BR/ The last, unique, the most downstream flip-flop (36) sequentially outputs the information bits (S (t-6)) corresponding to the searched path, and the selection signal of each multiplexer is directly given by the exit of this last rocker.
机译:该解码包括在相反的方向上探索网格的多个路径,该路径表示由v-flip编码器进行编码而导致的可能转换的图,网格的每个节点由N = 2v位的字表示。 。
该电路的工作方式是从多个可能的幸存路径中选择呈现最弱度量的路径,以便重建编码期间实际描述的网格路径,并找到具有以下特征的信息比特序列:造成了这条路的路径。
根据本发明,该电路包括存储器(20),该存储器(20)存储N = 2v个比特的多个所述字(D′),并且在该存储器的输出处,级联v个多路复用器2-in。 -1(21、22、23、24、25、26),将存储器的2v输出逐渐减小为单个输出,D触发器(31、32、33、34、35、36)输出为每个多路复用器。
最后一个唯一的,最下游的触发器(36)顺序输出与搜索路径相对应的信息位(S(t-6)),并且每个多路复用器的选择信号直接由出口给出最后一个摇杆。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号