会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Pipeline architecture for maximum a posteriori (MAP) decoders
    • 最大后验(MAP)解码器的管道架构
    • US20060005111A1
    • 2006-01-05
    • US11219986
    • 2005-09-06
    • Edward HeplerMichael Starsinic
    • Edward HeplerMichael Starsinic
    • H03M13/03
    • H03M13/3905H03M13/3972H03M13/6505
    • 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 he 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 written to the same memory location. The calculations can be reversed, reverse metrics being calculated first, followed by reverse metric calculations. Although this architecture as developed for a turbo decoder, all convolution codes can use the MAP algorithm of the present invention.
    • 流水线最大后验(MAP)解码器架构的滑动窗口方法被修改以减少处理时间。 一旦为其解码器的第一滑动窗口计算了前向度量,则在计算下一个窗口的前向量度时,计算每个窗口的反向度量。 当每个新的前向度量被计算并存储到存储器中时,从存储器中读取来自前一窗口的前向度量用于在计算外在值时计算的反向度量。 用于计算外在值的每个前向量度被写入同一个存储单元。 计算可以反转,首先计算反向度量,然后是反向度量计算。 虽然为turbo解码器开发的这种架构,但是所有的卷积码都可以使用本发明的MAP算法。
    • 2. 发明申请
    • Pipeline architecture for maximum a posteriori (MAP) decoders
    • 最大后验(MAP)解码器的管道架构
    • US20070118791A1
    • 2007-05-24
    • US11653014
    • 2007-01-12
    • Edward HeplerMichael Starsinic
    • Edward HeplerMichael Starsinic
    • H03M13/03
    • H03M13/3905H03M13/3972H03M13/6505
    • 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 he 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 written to the same memory location. The calculations can be reversed, reverse metrics being calculated first, followed by reverse metric calculations. Although this architecture as developed for a turbo decoder, all convolution codes can use the MAP algorithm of the present invention.
    • 流水线最大后验(MAP)解码器架构的滑动窗口方法被修改以减少处理时间。 一旦为其解码器的第一滑动窗口计算了前向度量,则在计算下一个窗口的前向量度时,计算每个窗口的反向度量。 当每个新的前向度量被计算并存储到存储器中时,从存储器中读取来自前一窗口的前向度量用于在计算外在值时计算的反向度量。 用于计算外在值的每个前向量度被写入同一个存储单元。 计算可以反转,首先计算反向度量,然后是反向度量计算。 虽然为turbo解码器开发的这种架构,但是所有的卷积码都可以使用本发明的MAP算法。