会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • 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和相同比特位置的交织位置独立交织。 这可以提高代码的鲁棒性。 第一编码器可以不具有交织器,或者所有编码器可以具有交织器,无论输入元组位是否独立交错。 模式类型交织也允许并行解码。
    • 6. 发明申请
    • LDPC (low density parity check) coded modulation hybrid decoding
    • LDPC(低密度奇偶校验)编码调制混合解码
    • US20080005650A1
    • 2008-01-03
    • US11701156
    • 2007-02-01
    • Ba-Zhong ShenHau TranKelly Cameron
    • Ba-Zhong ShenHau TranKelly Cameron
    • G06F11/00
    • H04L1/005H03M13/1105H03M13/255H04L1/0058
    • LDPC (Low Density Parity Check) coded modulation hybrid decoding. A novel approach is presented wherein a combination of bit decoding and symbol level decoding (e.g., hybrid decoding) is performed for LDPC coded signals. Check node updating and symbol node updating are successively and alternatively performed on bit edge messages for a predetermined number of decoding iterations or until a sufficient degree of precision is achieved. The symbol node updating of the bit edge messages involves using symbol metrics corresponding to the symbol being decoded as well as the bit edge messages most recently updated by check node updating. The check node updating of the bit edge messages involves using the bit edge messages most recently updated by symbol node updating. The symbol node updating also involves computing possible soft symbol estimates for the symbol during each decoding iteration.
    • LDPC(低密度奇偶校验)编码调制混合解码。 提出了一种新颖的方法,其中对LDPC编码信号执行比特解码和符号级解码(例如混合解码)的组合。 对于预定数量的解码迭代,或直到达到足够的精确度,连续替代地对位边消息执行检查节点更新和符号节点更新。 位边消息的符号节点更新涉及使用与被解码的符号相对应的符号度量以及最近由校验节点更新更新的位边消息。 位边消息的校验节点更新涉及使用最近通过符号节点更新更新的位边消息。 符号节点更新还涉及在每次解码迭代期间计算符号的可能的软符号估计。
    • 7. 发明申请
    • Short length LDPC (Low Density Parity Check) code and modulation adapted for high speed Ethernet applications
    • 适用于高速以太网应用的短长度LDPC(低密度奇偶校验)码和调制
    • US20060041821A1
    • 2006-02-23
    • US11190657
    • 2005-07-27
    • Ba-Zhong ShenKelly CameronHau TranScott Powell
    • Ba-Zhong ShenKelly CameronHau TranScott Powell
    • H03M13/00
    • H04L27/04H03M13/118H03M13/255H04L25/4917H04L27/3416
    • A short length LDPC (Low Density Parity Check) code and modulation adapted for high speed Ethernet applications. In some instances, the short length-LDPC code and modulation may be employed within the recommended practices currently being developed by the IEEE 802.3an (10GBASE-T) Task Force. The IEEE 802.3an (10GBASE-T) Task Force has been commissioned to develop and standardize communications protocol adapted particularly for Ethernet operation over 4 wire twisted pair cables. A new LDPC code, some possible embodiments of constellations and the corresponding mappings, as well as possible embodiments of various parity check matrices, H, of the LDPC code are presented herein to provide for better overall performance than other proposed LDPC codes existent in the art of high speed Ethernet applications. Moreover, this proposed LDPC code may be decoded using a communication device having much less complexity than required to decode other proposed LDPC codes existent in this technology space.
    • 适用于高速以太网应用的短长度LDPC(低密度奇偶校验)码和调制。 在一些情况下,可以在IEEE 802.3an(10GBASE-T)工作组当前正在开发的推荐做法中采用短长度LDPC码和调制。 IEEE 802.3an(10GBASE-T)工作组已委托开发和标准化通信协议,特别适用于通过4线双绞线电缆进行以太网操作。 本文中呈现了新的LDPC码,星座的一些可能的实施例和对应的映射以及LDPC码的各种奇偶校验矩阵H的可能实施例,以提供比本领域中存在的其它提出的LDPC码更好的总体性能 的高速以太网应用。 此外,该提出的LDPC码可以使用比在该技术空间中存在的其它提出的LDPC码要求更低的复杂度的通信设备进行解码。
    • 8. 发明申请
    • Efficient front end memory arrangement to support parallel bit node and check node processing in LDPC (Low Density Parity Check) decoders
    • 有效的前端存储器布置支持LDPC(低密度奇偶校验)解码器中的并行比特节点和校验节点处理
    • US20050262421A1
    • 2005-11-24
    • US11171727
    • 2005-06-30
    • Hau TranKelly CameronBa-Zhong Shen
    • Hau TranKelly CameronBa-Zhong Shen
    • H03M13/00H03M13/11
    • H03M13/6563H03M13/1137H03M13/1165
    • Efficient front end memory arrangement to support parallel bit node and check node processing in LDPC (Low Density Parity Check) decoders. A novel approach is presented by which the front end design of device capable to decode LDPC coded signals facilitates parallel decoding processing of the LDPC coded signal. The implementation of the front end memory management in conjunction with the implementation of a metric generator operate cooperatively lend themselves for very efficient parallel decoding processing of LDPC coded signals. There are several embodiments by which the front end memory management and the metric generator may be implemented to facilitate this parallel decoding processing of LDPC coded signals. This also allows for the decoding of variable code rate and/or variable modulation signals whose code rate and/or modulation varies as frequently as on a block by block basis (e.g., a block may include a group of symbols within a frame).
    • 有效的前端存储器布置支持LDPC(低密度奇偶校验)解码器中的并行比特节点和校验节点处理。 提出了一种能够对LDPC编码信号进行解码的装置的前端设计有助于LDPC编码信号的并行解码处理的新颖方法。 结合执行度量发生器的前端存储器管理的实现协同地借助于LDPC编码信号的非常有效的并行解码处理。 存在可以实现前端存储器管理和度量生成器以促进LDPC编码信号的这种并行解码处理的几个实施例。 这也允许解码可变码率和/或可变调制信号,其码率和/或调制随着逐个块的频率而变化(例如,一个块可以包括帧内的符号组)。