Pipeline architecture for maximum a posteriori (MAP) decoders
    2.
    发明申请
    Pipeline architecture for maximum a posteriori (MAP) decoders 失效
    最大后验(MAP)解码器的管道架构

    公开(公告)号:US20030066019A1

    公开(公告)日:2003-04-03

    申请号:US10037609

    申请日:2002-01-02

    CPC classification number: H03M13/3905 H03M13/3972 H03M13/6505

    Abstract: The sliding window approach to pipeline maximum a posteriori (MAP) decoder architecture is modified to decrease processing time. Once the forward metrics have been calculated for the first sliding window of the decoder, the reverse metrics for each window are calculated while the forward metrics for the next window are calculated. As each new forward metric is calculated and stored into memory, the forward metric from the previous window is read from memory for use with reverse metric being calculated in calculating extrinsic value. Each forward metric for use in calculating an extrinsic value is read from memory on the same clock edge that the new forward metric is written to the same memory location. Although this architecture was developed for a turbo decoder, all convolution codes can use the MAP algorithm of the present invention.

    Abstract translation: 流水线最大后验(MAP)解码器架构的滑动窗口方法被修改以减少处理时间。 一旦为解码器的第一滑动窗口计算了前向量度,则在计算下一个窗口的前向量度时,计算每个窗口的反向度量。 当每个新的前向度量被计算并存储到存储器中时,从存储器中读取来自前一窗口的前向度量用于在计算外在值时计算的反向度量。 用于计算外在值的每个前向量度在相同的时钟边沿从存储器读取,该时钟边沿将新的前向量度写入相同的存储器位置。 虽然该架构是为turbo解码器开发的,但是所有的卷积码都可以使用本发明的MAP算法。

Patent Agency Ranking