发明公开
- 专利标题: Soft output Viterbi algorithm method and decoder
- 专利标题(中): 软输出维特比算法和解码器
-
申请号: EP11190056.9申请日: 2010-04-15
-
公开(公告)号: EP2442451A1公开(公告)日: 2012-04-18
- 发明人: ANG, Lay Hong , KAMUF, Matthias , LIM, Wee Guan
- 申请人: Telefonaktiebolaget LM Ericsson (publ)
- 申请人地址: 164 83 Stockholm SE
- 专利权人: Telefonaktiebolaget LM Ericsson (publ)
- 当前专利权人: Telefonaktiebolaget LM Ericsson (publ)
- 当前专利权人地址: 164 83 Stockholm SE
- 代理机构: Ström & Gulliksson AB
- 优先权: US234701P 20090818
- 主分类号: H03M13/41
- IPC分类号: H03M13/41 ; H03M13/39 ; H03M13/37
摘要:
A method of decoding a block with a Soft Output Viterbi Algorithm (SOVA) using a trellis representation and a sliding window wherein each position of the sliding window has a path determination stage at one end of the sliding window and a symbol decision stage at another end of the sliding window is disclosed. The method comprises determining, for each path determination stage and for each node of the path determination stage, a surviving path (including a surviving path input symbol and a surviving decision stage node) and a concurrent path (including a concurrent path input symbol and a concurrent decision stage node) based on path metrics. A path metric disparity value is calculated and stored for each node. Based on decision criteria, a soft output value of the surviving decision stage node is determined as either of the path metric disparity value of the node of the path determination stage, a function of the path metric disparity value of the node of the path determination stage and the stored path metric disparity value of the concurrent decision stage node, and the stored path metric disparity value of the surviving decision stage node. Corresponding computer program product, decoder and communication apparatus are also disclosed the at least two incoming path transitions of each node consists of two incoming path transitions and the method further comprising maintaining a state register exchange unit wherein each register cell, corresponding to a node of the sliding window, and each register exchange connection, corresponding to a path transition between nodes, has a word length equal to one..
信息查询
IPC分类: