会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 15. 发明申请
    • Parallel concatenated code with soft-in-soft-out interactive turbo decoder
    • 软和软交互式turbo解码器的并行级联代码
    • US20060251184A1
    • 2006-11-09
    • US11481365
    • 2006-07-05
    • Kelly CameronBa-Zhong ShenHau TranChristopher JonesThomas Hughes
    • Kelly CameronBa-Zhong ShenHau TranChristopher JonesThomas Hughes
    • H04L27/00H04L23/02
    • H03M13/3972H03M13/151H03M13/1515H03M13/25H03M13/258H03M13/27H03M13/2757H03M13/29H03M13/2966H03M13/2978H03M13/3905H03M13/3922H03M13/3927H03M13/3988H03M13/4107H03M13/6505H03M13/6561H04L1/0041H04L1/005H04L1/006H04L1/0065H04L1/0066H04L1/0068H04L1/0071
    • A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo-N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel.
    • 一种并行级联(Turbo)编码和解码的方法。 Turbo编码器接收一系列输入数据元组并进行编码。 输入序列可以对应于原始数据源的序列,或者对应于已由Reed-Solomon编码器提供的已经编码的数据序列。 turbo编码器通常包括由一个或多个交织器分离的两个或更多个编码器。 输入数据元组可以使用其中交织根据某些方法(例如块或随机交织)的加法规则进行交织,其中输入元组可以只交织到具有相同模N的交织位置 其中N是整数),因为它们在输入数据序列中具有。 如果所有的输入元组都是由所有的编码器编码的,那么输出元组可以从编码器顺序选择,也不会丢失元组。 如果输入元组包含多个比特,那么这些比特可以与具有相同模N和相同比特位置的交织位置独立交织。 这可以提高代码的鲁棒性。 第一编码器可以不具有交织器,或者所有编码器可以具有交织器,无论输入元组位是否独立交错。 模式类型交织也允许并行解码。
    • 16. 发明申请
    • Efficient design to implement LDPC (Low Density Parity Check) decoder
    • 高效设计实现LDPC(低密度奇偶校验)解码器
    • US20050262424A1
    • 2005-11-24
    • US11171998
    • 2005-06-30
    • Hau TranKelly CameronBa-Zhong Shen
    • Hau TranKelly CameronBa-Zhong Shen
    • G06F11/00H03M13/00H03M13/11
    • H03M13/255H03M13/1102H03M13/1111H03M13/1117H03M13/112H03M13/1134H03M13/1137H03M13/116H03M13/1165H03M13/6505H03M13/658
    • Efficient design to implement LDPC decoder. The efficient design presented herein provides for a solution that is much easier, smaller, and has less complexity than other possible solutions. The use of a ping-pong memory structure (or pseudo-dual port memory structure) in conjunction with a metric generator near the decoder's front end allows parallel bit/check node processing. An intelligently operating barrel shifter operates with a message passing memory that is operable to store updated edges messages with respect to check nodes as well as updated edges messages with respect to bit nodes. Using an efficient addressing scheme allows the same memory structure to store the two types of edges messages with respect to bit nodes: (1) corresponding to information bits and (2) corresponding to parity bits. In addition, an intelligently designed hardware macro block may be instantiated a number of times into the decoder design to support ever greater design efficiency.
    • 高效设计实现LDPC解码器。 本文提供的高效设计提供了一种比其他可能的解决方案更简单,更小,复杂度更低的解决方案。 与解码器前端附近的度量发生器结合使用乒乓存储器结构(或伪双端口存储器结构)允许并行位/校验节点处理。 智能操作的桶形移位器利用消息传递存储器操作,该存储器可操作以存储相对于校验节点的更新的边缘消息以及相对于位节点的更新的边缘消息。 使用有效的寻址方案允许相同的存储器结构相对于比特节点存储两种类型的边缘消息:(1)对应于信息比特和(2)对应于奇偶校验位。 此外,智能设计的硬件宏块可以被多次实例化到解码器设计中以支持更大的设计效率。
    • 20. 发明申请
    • Low density parity check (LDPC) code decoder using min*, min**, max* or max** and their respective inverses
    • 使用min *,min **,max *或max **的低密度奇偶校验(LDPC)码解码器及其各自的反转
    • US20050010856A1
    • 2005-01-13
    • US10901528
    • 2004-07-29
    • Ba-Zhong ShenKelly CameronHau Tran
    • Ba-Zhong ShenKelly CameronHau Tran
    • H04L1/00G06F11/00H03M13/00
    • H04L1/005H04L1/0057
    • Low Density Parity Check (LDPC) code decoder using min*, min**, max* or max** and their respective inverses. For the first time, min* processing is demonstrated for use in decoding LDPC-coded signals. In addition, max*, min**, or max** (and their respective inverses) may also be employed when performing calculations that are required to perform decoding of signals coded using LDPC code. These new parameters may be employed to provide for much improved decoding processing for LDPC codes when that decoding involves the determination of a minimal and/or maximal value, or a minimal and/or maximal log corrected value, from among a number of possible values. The total number of processing steps employed within the decoding of an LDPC-coded signal is significantly reduced be employing the min*, max*, min**, or max** (and their respective inverses) decoding processing described herein.
    • 使用min *,min **,max *或max **的低密度奇偶校验(LDPC)码解码器及其各自的反转。 首次演示了用于解码LDPC编码信号的min *处理。 另外,当执行执行使用LDPC码编码的信号的解码所需的计算时,也可以采用max *,min **或max **(及其各自的反转)。 当解码涉及从多个可能值中确定最小和/或最大值或最小和/或最大对数校正值时,可以采用这些新参数来为LDPC码提供大大改进的解码处理。 采用本文所述的最小*,最大*,最小**或最大**(及其相应的反转)解码处理,在LDPC编码信号的解码中采用的处理步骤的总数显着减少。