发明申请
US20080086673A1 General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes 有权
通用和代数构造的无争用内存映射,用于并行turbo解码,具有所有可能尺寸的代数交错ARP(几乎规则排列)

  • 专利标题: General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes
  • 专利标题(中): 通用和代数构造的无争用内存映射,用于并行turbo解码,具有所有可能尺寸的代数交错ARP(几乎规则排列)
  • 申请号: US11704068
    申请日: 2007-02-08
  • 公开(公告)号: US20080086673A1
    公开(公告)日: 2008-04-10
  • 发明人: Ba-Zhong ShenTak K. Lee
  • 申请人: Ba-Zhong ShenTak K. Lee
  • 申请人地址: US CA Irvine
  • 专利权人: Broadcom Corporation a California Corporation
  • 当前专利权人: Broadcom Corporation a California Corporation
  • 当前专利权人地址: US CA Irvine
  • 主分类号: H03M13/00
  • IPC分类号: H03M13/00
General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes
摘要:
General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes. A novel means is presented in which contention-free memory mapping is truly achieved in the context of performing parallel decoding of a turbo coded signal. A novel means of performing the contention-free memory mapping is provided to ensure that any one turbo decoder (of a group of parallel arranged turbo decoders) accesses only memory (of a group of parallel arranged memories) at any given time. In doing so, access conflicts between the turbo decoders and the memories are avoided.
信息查询
0/0