Invention Grant
US07882416B2 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(几乎规则排列)

  • Patent Title: General and algebraic-constructed contention-free memory mapping for parallel turbo decoding with algebraic interleave ARP (almost regular permutation) of all possible sizes
  • Patent Title (中): 通用和代数构造的无争用内存映射,用于并行turbo解码,具有所有可能尺寸的代数交错ARP(几乎规则排列)
  • Application No.: US11704068
    Application Date: 2007-02-08
  • Publication No.: US07882416B2
    Publication Date: 2011-02-01
  • Inventor: Ba-Zhong ShenTak K. Lee
  • Applicant: Ba-Zhong ShenTak K. Lee
  • Applicant Address: US CA Irvine
  • Assignee: Broadcom Corporation
  • Current Assignee: Broadcom Corporation
  • Current Assignee Address: US CA Irvine
  • Agency: Garlick Harrison & Markison
  • Agent Shayne X. Short
  • Main IPC: 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
Abstract:
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.
Information query
Patent Agency Ranking
0/0