会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • METHOD AND APPARATUS FOR TURBO DECODER MEMORY COLLISION RESOLUTION
    • TURBO解码器存储器碰撞分辨率的方法和装置
    • US20140068117A1
    • 2014-03-06
    • US13599926
    • 2012-08-30
    • Axel HuebnerJens BerkmannMichael Janning
    • Axel HuebnerJens BerkmannMichael Janning
    • G06F3/00
    • G06F13/16G06F13/1673G06F13/376G06F13/38H03M13/2775H03M13/2957
    • A device such as a turbo decoding device is proposed in which an intermediate buffering device including an address buffering device and an element buffering device is communicatively coupled to a plurality of processing devices and a memory device. During a cycle of a parallel decoding process, the intermediate buffering device receives, from two different processing devices, first and second address information respectively corresponding to first and second elements of a code sequence stored in the memory device. During the cycle, the intermediate buffering device transmits a request for the first element to the memory device based on the first address information and stores the second address information in the address buffering device. Subsequently, during the cycle, the intermediate buffering device receives first element information corresponding to the first element from the memory device and stores the received first element information in the element buffering device.
    • 提出了诸如turbo解码装置的装置,其中包括地址缓冲装置和元素缓冲装置的中间缓冲装置通信地耦合到多个处理装置和存储装置。 在并行解码处理的周期期间,中间缓冲装置从两个不同的处理装置接收分别对应于存储在存储装置中的代码序列的第一和第二元素的第一和第二地址信息。 在该循环期间,中间缓冲装置基于第一地址信息向存储装置发送对第一元素的请求,并将第二地址信息存储在地址缓冲装置中。 随后,在该周期期间,中间缓冲装置从存储装置接收对应于第一元素的第一元素信息,并将接收到的第一元素信息存储在元素缓存装置中。
    • 4. 发明申请
    • TURBO CODE PARALLEL INTERLEAVER AND PARALLEL INTERLEAVING METHOD THEREOF
    • 涡轮代码并行交互和并行交互方法
    • US20130198592A1
    • 2013-08-01
    • US13825886
    • 2011-03-25
    • Yi Wang
    • Yi Wang
    • H03M13/29
    • H03M13/2903H03M13/271H03M13/2739H03M13/2764H03M13/2775H03M13/2782H03M13/2957H03M13/3972
    • A Turbo code parallel interleaver and a parallel interleaving method are disclosed by the disclosure. The Turbo code parallel interleaver comprises: an interleaving unit, configured to generate a column address for parallel-reading data and a row address of each row of data being row-interleaved, input the column address and the column address after delay to a CB matrix unit, input the row address of each row to a switching output unit, and input the row address of each row after delay to a switching input unit; a switching output unit, configured to receive the data of each row output by the CB matrix unit, perform the inter-row interleaving for the data of each row according to the row address of each row, and input the interleaved data to a parallel MAP unit for the MAP computing; and a switching input unit.
    • 本公开公开了Turbo码并行交织器和并行交错方法。 Turbo码并行交织器包括:交织单元,被配置为产生用于并行读取数据的列地址和被行交错的每行数据的行地址,将延迟后的列地址和列地址输入到CB矩阵 将每行的行地址输入到切换输出单元,并将延迟后的每行的行地址输入到切换输入单元; 开关输出单元,被配置为接收由CB矩阵单元输出的每一行的数据,根据每行的行地址对每行的数据执行行间交织,并将交织的数据输入到并行MAP MAP计算单位; 和切换输入单元。
    • 9. 发明授权
    • Quadratic polynomial permutation (QPP) interleaver providing hardware savings and flexible granularity adaptable to any possible turbo code block size
    • 二次多项式置换(QPP)交织器,提供硬件节省和灵活的粒度,适用于任何可能的turbo码块大小
    • US07975203B2
    • 2011-07-05
    • US11810890
    • 2007-06-07
    • Ba-Zhong ShenTak K. Lee
    • Ba-Zhong ShenTak K. Lee
    • H03M13/00
    • H03M13/2957H03M13/2757H03M13/2775H03M13/3972H03M13/6356H03M13/6362H03M13/6508H03M13/6525H03M13/6566
    • Quadratic polynomial permutation (QPP) interleaver providing hardware saving and flexible granularity adaptable to any possible turbo code block size. A means is presented by which only a very small number of coefficients need be stored to effectuate a wide variety of QPP interleaves as can be employed in the context of turbo coding. In one instance, to accommodate the approximate 6000 different turbo code block sizes in 3GPP LTE channel coding, only 5 different coefficient values need to be stored to effectuate a very broad range of QPP interleaves to be applied each of those various turbo code block sizes. Moreover, a few small number of dummy bits, if any, need to be employed to accommodate a very broad range of turbo code block sizes. It is noted that the QPP interleaving as described herein can be applied to turbo encoding and turbo decoding (e.g., including both interleaving and de-interleaving).
    • 二次多项式置换(QPP)交织器,提供适用于任何可能的turbo码块大小的硬件保存和灵活的粒度。 提出了一种手段,其中仅需要非常少量的系数来存储多个QPP交织以便在turbo编码的上下文中使用。 在一种情况下,为了适应3GPP LTE信道编码中的大约6000个不同的Turbo码块大小,仅需要存储5个不同的系数值,以实现要应用那些各种turbo码块大小中的每一个的非常宽范围的QPP交织。 此外,需要采用少量的虚拟位(如果有的话)以适应非常宽范围的turbo码块大小。 注意,如本文所述的QPP交织可以应用于turbo编码和turbo解码(例如,包括交织和解交织两者)。
    • 10. 发明授权
    • Turbo decoder employing ARP (almost regular permutation) interleave and arbitrary number of decoding processors
    • Turbo解码器采用ARP(几乎规则排列)交错和任意数量的解码处理器
    • US07827473B2
    • 2010-11-02
    • US11811014
    • 2007-06-07
    • Tak K. LeeBa-Zhong Shen
    • Tak K. LeeBa-Zhong Shen
    • H03M13/03
    • G06F11/1008H03M13/2753H03M13/2775H03M13/2957H03M13/3905H03M13/3972
    • Turbo decoder employing ARP (almost regular permutation) interleave and arbitrary number of decoding processors. A novel approach is presented herein by which an arbitrarily selected number (M) of decoding processors (e.g., a plurality of parallel implemented turbo decoders) be employed to perform decoding of a turbo coded signal while still using a selected embodiment of an ARP (almost regular permutation) interleave. The desired number of decoding processors is selected, and very slight modification of an information block (thereby generating a virtual information block) is made to accommodate that virtual information block across all of the decoding processors during all decoding cycles except some dummy decoding cycles. In addition, contention-free memory mapping is provided between the decoding processors (e.g., a plurality of turbo decoders) and memory banks (e.g., a plurality of memories).
    • Turbo解码器采用ARP(几乎规则排列)交错和任意数量的解码处理器。 本文提出了一种新颖的方法,通过该方法,使用任意选择的数量(M)的解码处理器(例如,多个并行实现的turbo解码器)来执行turbo编码信号的解码,同时仍然使用所选择的ARP实施例(几乎 正则排列)交错。 选择所需数量的解码处理器,并且进行信息块(从而生成虚拟信息块)的非常轻微的修改以在除了一些虚拟解码周期之外的所有解码周期期间在所有解码处理器之间容纳该虚拟信息块。 此外,在解码处理器(例如,多个turbo解码器)和存储体(例如,多个存储器)之间提供无竞争的存储器映射。