会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明申请
    • Implementation of LDPC (Low Density Parity Check) decoder by sweeping through sub-matrices
    • 通过扫描子矩阵实现LDPC(低密度奇偶校验)解码器
    • US20070157062A1
    • 2007-07-05
    • US11360268
    • 2006-02-23
    • Tak LeeHau TranBa-Zhong ShenKelly Cameron
    • Tak LeeHau TranBa-Zhong ShenKelly Cameron
    • H03M13/00
    • H03M13/116H03M13/1137H03M13/255H03M13/27H03M13/6362H03M13/6566
    • Implementation of LDPC (Low Density Parity Check) decoder by sweeping through sub-matrices. A novel approach is presented by which an LDPC coded signal is decoded processing the columns and rows of the individual sub-matrices of the low density parity check matrix corresponding to the LDPC code. The low density parity check matrix can partitioned into rows and columns according to each of the sub-matrices of it, and each of those sub-matrices also includes corresponding rows and columns. For example, when performing bit node processing, the same columns of at 1 or more sub-matrices can be processed together (e.g., all 1st columns in 1 or more sub-matrices, all 2nd columns in 1 or more sub-matrices, etc.). Analogously, when performing check node processing, the same rows of 1 or more sub-matrices can be processed together (e.g., all 1st rows in 1 or more sub-matrices, all 2nd rows in 1 or more sub-matrices, etc.).
    • 通过扫描子矩阵实现LDPC(低密度奇偶校验)解码器。 提出了一种解码处理与LDPC码对应的低密度奇偶校验矩阵的各个子矩阵的列和行的LDPC编码信号的新方法。 低密度奇偶校验矩阵可以根据它的每个子矩阵划分成行和列,并且这些子矩阵中的每一个也包括相应的行和列。 例如,当执行位节点处理时,可以一起处理1个或更多个子矩阵的相同列(例如,1个或更多个子矩阵中的所有1个SUP列,全部2个SUP 1个或更多个子矩阵中的 / nd>列等)。 类似地,当执行校验节点处理时,可以一起处理1个或更多个子矩阵的相同行(例如,1个或更多个子矩阵中的所有1 行,全部2个 1个或多个子矩阵中的行等)。
    • 24. 发明申请
    • Sub-matrix-based implementation of LDPC (Low Density Parity Check ) decoder
    • LDPC(低密度奇偶校验)解码器的基于子矩阵的实现
    • US20070157061A1
    • 2007-07-05
    • US11360267
    • 2006-02-23
    • Tak LeeHau TranBa-Zhong ShenKelly Cameron
    • Tak LeeHau TranBa-Zhong ShenKelly Cameron
    • H03M13/00
    • H03M13/116H03M13/1137H03M13/255H03M13/27H03M13/6362H03M13/6566
    • Sub-matrix-based implementation of LDPC (Low Density Parity Check) decoder. A novel approach is presented by which an LDPC coded signal is decoded by processing 1 sub-matrix at a time. A low density parity check matrix corresponding to the LDPC code includes rows and columns of sub-matrices. For example, when performing bit node processing, 1 or more sub-matrices in a column are processed; when performing check node processing, 1 or more sub-matrices in a row are processed. If desired, when performing bit node processing, the sub-matrices in each column are successively processed together (e.g., all column 1 sub-matrices, all column 2 sub-matrices, etc.). Analogously, when performing check node processing, the sub-matrices in each row can be successively processed together (e.g., all row 1 sub-matrices, all row 2 sub-matrices in row 2, etc.).
    • LDPC(低密度奇偶校验)解码器的基于子矩阵的实现。 提出了一种新颖的方法,通过该方法通过一次处理1个子矩阵对LDPC编码信号进行解码。 对应于LDPC码的低密度奇偶校验矩阵包括子矩阵的行和列。 例如,当执行位节点处理时,处理列中的一个或多个子矩阵; 当执行校验节点处理时,处理一行中的一个或多个子矩阵。 如果需要,当执行位节点处理时,每列中的子矩阵被连续处理(例如,所有列1个子矩阵,全部2个子矩阵等)。 类似地,当执行校验节点处理时,可以一起连续地处理每行中的子矩阵(例如,所有行1子矩阵,行2中的所有行2子矩阵等)。
    • 26. 发明申请
    • Efficient design to implement min**/min**- or max**/max**- functions in LDPC (low density parity check) decoders
    • 高效设计实现LDPC(低密度奇偶校验)解码器中的min ** / min ** - 或max ** / max ** - 函数
    • US20050246618A1
    • 2005-11-03
    • US11172165
    • 2005-06-30
    • Hau TranKelly CameronBa-Zhong Shen
    • Hau TranKelly CameronBa-Zhong Shen
    • G06F11/00H03M13/00H03M13/03H03M13/11H03M13/45
    • H03M13/3911H03M13/1111H03M13/1117H03M13/112H03M13/45H04L1/005H04L1/0057
    • Efficient design to implement min**/min**− or max**/max**− functions in LDPC (Low Density Parity Check) decoders. When compared to prior art approaches, the novel and efficient implementation presented herein allows for the use of substantially less hardware and surface area within an actual communication device implemented to perform these calculations. In certain embodiments, the min** processing (and/or max** processing) is implemented to assist in the computationally intensive calculations required to decoded LDPC coded signals. In one instance, this is operable to assist in check node processing when decoding LDPC coded signals. However, the efficient principles and architectures presented herein may be implemented within other communication device types to decode other types of coded signals as well. For example, the processing presented herein may perform calculations within a variety of decoders including LDPC decoders, turbo decoders, TTCM decoders, and/or other decoder types without departing from the scope and spirit of the invention.
    • 高效设计实现LDPC(低密度奇偶校验)解码器中的min ** / min ** - 或max ** / max ** - 函数。 当与现有技术方法相比时,本文提出的新颖且有效的实现允许在实现为执行这些计算的实际通信设备中使用实质上更少的硬件和表面积。 在某些实施例中,实现最小**处理(和/或最大**处理)以帮助解码LDPC编码信号所需的计算密集计算。 在一种情况下,这可用于在解码LDPC编码信号时辅助校验节点处理。 然而,本文呈现的有效原理和架构可以在其他通信设备类型内实现,以解码其他类型的编码信​​号。 例如,在不脱离本发明的范围和精神的情况下,这里呈现的处理可以在包括LDPC解码器,turbo解码器,TTCM解码器和/或其他解码器类型的各种解码器中执行计算。
    • 27. 发明申请
    • Efficient LDPC code decoding with new minus operator in a finite precision radix system
    • 在有限精度基数系统中使用新的减运算符进行高效LDPC码解码
    • US20050172209A1
    • 2005-08-04
    • US10782142
    • 2004-02-19
    • Kelly CameronHau TranBa-Zhong Shen
    • Kelly CameronHau TranBa-Zhong Shen
    • H03M13/03H03M13/11H03M13/25H04L1/00
    • H04L1/0058H03M13/1117H03M13/112H03M13/1131H03M13/1134H03M13/255H03M13/6583H04L1/005
    • Efficient LDPC code decoding with new minus operator in a finite precision radix system. A new mathematical operator is introduced and applied to the decoding of LDPC coded signals. This new operator is referred to as the min†− (min-dagger minus) operator herein. This min†− processing is appropriately applied during the updating of the edge messages with respect to the variable nodes. In a bit level decoding approach to decoding LDPC coded signals, the updating of the edge messages with respect to the bit nodes is performed using the new min†− operator. This approach provides very comparable performance to min** processing as also applied to updating of the edge messages with respect to the bit nodes and may also provide for a significant savings in hardware. Also, within finite precision radix systems, the new min†− operator provides a means by which always meaningful results may be achieved during the decoding processing.
    • 在有限精度基数系统中使用新的减运算符进行高效LDPC码解码。 引入新的数学运算符并将其应用于LDPC编码信号的解码。 这个新操作符在这里被称为最小† - (最小匕首减号)运算符。 在边缘消息相对于可变节点的更新期间,该最小†处理被适当地应用。 在解码LDPC编码信号的位电平解码方法中,使用新的最小†运算符执行相对于比特节点的边缘消息的更新。 这种方法提供与min **处理非常可比的性能,也适用于相对于位节点的边缘消息的更新,并且还可以显着地节省硬件。 此外,在有限精度基数系统中,新的最小运算符提供了一种在解码处理期间可以实现有意义的结果的手段。
    • 28. 发明申请
    • LDPC (Low Density Parity Check) coded modulation hybrid decoding
    • LDPC(低密度奇偶校验)编码调制混合解码
    • US20050028071A1
    • 2005-02-03
    • US10723574
    • 2003-11-26
    • Ba-Zhong ShenHau TranKelly Cameron
    • Ba-Zhong ShenHau TranKelly Cameron
    • H03M13/11H03M13/25H04L1/00G06F11/00H03M13/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编码信号执行比特解码和符号级解码(例如混合解码)的组合。 对于预定数量的解码迭代,或直到达到足够的精确度,连续替代地对位边消息执行检查节点更新和符号节点更新。 位边消息的符号节点更新涉及使用与被解码的符号相对应的符号度量以及最近由校验节点更新更新的位边消息。 位边消息的校验节点更新涉及使用最近通过符号节点更新更新的位边消息。 符号节点更新还涉及在每次解码迭代期间计算符号的可能的软符号估计。