System and methods for low complexity list decoding of turbo codes and convolutional codes

    公开(公告)号:US11043976B2

    公开(公告)日:2021-06-22

    申请号:US16272653

    申请日:2019-02-11

    Abstract: A method, system, and non-transitory computer-readable recording medium of decoding a signal are provided. The method includes receiving signal to be decoded, where signal includes at least one symbol; decoding signal in stages, where each at least one symbol of signal is decoded into at least one bit per stage, wherein Log-Likelihood Ratio (LLR) and a path metric are determined for each possible path for each at least one bit at each stage; determining magnitudes of the LLRs; identifying K bits of the signal with smallest corresponding LLR magnitudes; identifying, for each of the K bits, L possible paths with largest path metrics at each decoder stage for a user-definable number of decoder stages; performing forward and backward traces, for each of the L possible paths, to determine candidate codewords; performing a Cyclic Redundancy Check (CRC) on the candidate codewords; and stopping after a first candidate codeword passes the CRC.

    System and methods for low complexity list decoding of turbo codes and convolutional codes

    公开(公告)号:US10938420B2

    公开(公告)日:2021-03-02

    申请号:US16272722

    申请日:2019-02-11

    Abstract: Method for decoding signal includes receiving signal, where signal includes at least one symbol; decoding signal in stages, where each at least one symbol of signal is decoded into at least one bit per stage, wherein Log-Likelihood Ratio (LLR) for each at least one bit at each stage is determined, and identified in vector LAPP; performing Cyclic Redundancy Check (CRC) on LAPP, and stopping if LAPP passes CRC; otherwise, determining magnitudes of LLRs in LAPP; identifying K LLRs in LAPP with smallest magnitudes and indexing K LLRs as r={r(1), r(2), . . . , r(K)}; setting Lmax to maximum magnitude of LLRs in LAPP or maximum possible LLR quantization value; setting v=1; generating {tilde over (L)}A(r(k))=LA(r(k))−Lmaxvksign[LAPP(r(k))], for k=1, 2, . . . , K; decoding with {tilde over (L)}A to identify {tilde over (L)}APP, wherein {tilde over (L)}APP is LLR vector; and performing CRC on {tilde over (L)}APP, and stopping if {tilde over (L)}APP passes CRC or v=2K-1; otherwise, incrementing v and returning to generating {tilde over (L)}A(r(k)).

    System and method for higher order long short-term memory (LSTM) network

    公开(公告)号:US10241684B2

    公开(公告)日:2019-03-26

    申请号:US15480086

    申请日:2017-04-05

    Abstract: A method and apparatus are provided. The method includes configuring a plurality of long short term memory (LSTM) networks, wherein each of the plurality of LSTM networks is at a different network layer, configuring a plurality of memory cells in a spatial domain of the plurality of LSTM networks, configuring the plurality of memory cells in a temporal domain of the plurality of LSTM networks, controlling an output of each of the plurality of LSTM networks based on highway connections to outputs from at least one previous layer and at least one previous time of the plurality of LSTM networks, and controlling the plurality of memory cells based on highway connections to memory cells from the at least one previous time.

    System and methods for low complexity list decoding of turbo codes and convolutional codes

    公开(公告)号:US10205470B2

    公开(公告)日:2019-02-12

    申请号:US14565082

    申请日:2014-12-09

    Abstract: A method and system for decoding a signal are provided. The method includes receiving a signal, where the signal includes at least one symbol; decoding the signal in stages, where each at least one symbol is decoded into at least one bit per stage, wherein a Log-Likelihood Ratio (LLR) and a path metric are determined for each possible path for each at least one bit at each stage; determining the magnitudes of the LLRs; identifying K bits of the signal with the smallest corresponding LLR magnitudes; identifying, for each of the K bits, L possible paths with the largest path metrics at each decoder stage for a user-definable number of decoder stages; performing forward and backward traces, for each of the L possible paths, to determine candidate codewords; performing a Cyclic Redundancy Check (CRC) on the candidate codewords, and stopping after a first candidate codeword passes the CRC.

    Computing system with error handling mechanism and method of operation thereof

    公开(公告)号:US10108483B2

    公开(公告)日:2018-10-23

    申请号:US14465694

    申请日:2014-08-21

    Abstract: A computing system includes: an inter-device interface configured to access a destination signal including an information portion for representing a content and an error-handling portion for describing the information portion relative to the content; a communication unit, coupled to the inter-device interface, configured to: generate a parity-check parameter based on a sparse configuration from the destination signal, and estimate the content based on decoding the information portion using the error-handling portion and the parity-check parameter.

    Apparatus and method of constructing polar code
    59.
    发明授权
    Apparatus and method of constructing polar code 有权
    装置和方法构造极性码

    公开(公告)号:US09479291B2

    公开(公告)日:2016-10-25

    申请号:US14837763

    申请日:2015-08-27

    Abstract: An apparatus and method of constructing a universal polar code is provided. The apparatus includes a first function block configured to polarize and degrade a class of channels Wj to determine a probability of error Pe,j of each bit-channel of Wj, wherein jε{1, 2, . . . , s}, in accordance with a bit-channel index i; a second function block configured to determine a probability of error Pe(i) for the universal polar code for each bit-channel index i; a third function block configured to sort the Pe(i); and a fourth function block configured to determine a largest number k of bit-channels such that a sum of corresponding k bit-channel error probabilities Pe(i) is less than or equal to a target frame error rate Pt for the universal polar code, wherein the indices corresponding to the k smallest Pe(i) are good bit-channels for the universal polar code.

    Abstract translation: 提供了构成通用极性码的装置和方法。 该装置包括:第一功能块,被配置为使一类信道Wj偏振和降级,以确定Wj的每个位信道的误差概率Pe,j,其中j∈{1,2,..., 。 。 ,s},根据位信道索引i; 第二功能块,被配置为确定每个位通道索引i的通用极性代码的误差Pe(i)的概率; 配置为对Pe(i)进行排序的第三功能块; 以及第四功能块,被配置为确定比特信道的最大数量k,使得相应的k个比特信道误差概率Pe(i)的和小于或等于所述通用极性码的目标帧错误率Pt, 其中对应于k个最小Pe(i)的索引是用于通用极性码的良好比特信道。

    Method and system for encoding and decoding data using concatenated polar codes
    60.
    发明授权
    Method and system for encoding and decoding data using concatenated polar codes 有权
    使用连接极性码对数据进行编码和解码的方法和系统

    公开(公告)号:US09362956B2

    公开(公告)日:2016-06-07

    申请号:US14158571

    申请日:2014-01-17

    Abstract: A concatenated encoder is provided that includes an outer encoder, a symbol interleaver and a polar inner encoder. The outer encoder is configured to encode a data stream using an outer code to generate outer codewords. The symbol interleaver is configured to interleave symbols of the outer codewords and generate a binary stream. The polar inner encoder is configured to encode the binary stream using a polar inner code to generate an encoded stream. A concatenated decoder is provided that includes a polar inner decoder, a symbol de-interleaver and an outer decoder. The polar inner decoder is configured to decode an encoded stream using a polar inner code to generate a binary stream. The symbol de-interleaver is configured to de-interleave symbols in the binary stream to generate outer codewords. The outer decoder is configured to decode the outer codewords using an outer code to generate a decoded stream.

    Abstract translation: 提供了包括外部编码器,符号交织器和极内部编码器的级联编码器。 外编码器被配置为使用外码对数据流进行编码以产生外码字。 符号交织器被配置为交织外部码字的符号并生成二进制流。 极性内部编码器被配置为使用极性内部码来对二进制流进行编码以生成编码的流。 提供了包括极性内部解码器,符号解交织器和外部解码器的级联解码器。 极性内部解码器被配置为使用极性内部码来解码编码的流以生成二进制流。 符号解交织器被配置为对二进制流中的符号进行解交织以产生外部码字。 外部解码器被配置为使用外部码来解码外部码字以产生解码的流。

Patent Agency Ranking