摘要:
Joint erasure marking Viterbi algorithm (JEVA), decoder schemes, methods, and systems are provided which perform robust trellis decoder techniques. The provided JEVA decoding schemes are shown to be maximum likelihood decoding schemes that find the most likely transmitted code sequence with a set of symbol erasures, without knowledge of the impulsive noise probability distribution function, and can be implemented sequentially such that they are well suited for dynamically changing impulsive noise channels. In addition, the disclosed details enable various refinements and modifications according to decoder and system design considerations. For example, truncated JEVA is provided for continuous transmission and long frame applications.
摘要:
The iterative decoding of blocks may be continued or terminated based on CRC checks. In an example embodiment, one iteration of an iterative decoding process is performed on a block whose information bits are covered by a CRC. The iterative decoding process is stopped if the CRC checks for a predetermined number of consecutive iterations. In another example embodiment, a decoding iteration is performed on a particular sub-block of multiple sub-blocks of a transport block, which includes a single CRC over an entirety of the transport block. The CRC is checked using decoded bits obtained from the decoding iteration on the particular sub-block and decoded bits obtained from previous decoding iterations on other sub-blocks of the multiple sub-blocks. The decoding iteration is then performed on a different sub-block if the CRC does not check. Also, the decoding iterations for the sub-blocks may be terminated if the CRC checks.
摘要:
A method for decoding a codeword in a data stream encoded according to a low density parity check (LDPC) code having an m×j parity check matrix H by initializing variable nodes with soft values based on symbols in the codeword, wherein a graph representation of H includes m check nodes and j variable nodes, and wherein a check node m provides a row value estimate to a variable node j and a variable node j provides a column value estimate to a check node m if H(m,j) contains a 1, computing row value estimates for each check node, wherein amplitudes of only a subset of column value estimates provided to the check node are computed, computing soft values for each variable node based on the computed row value estimates, determining whether the codeword is decoded based on the soft values, and terminating decoding when the codeword is decoded.
摘要:
A method for selecting a population of schedules of an n-layer decoder for offline schedule testing. The method identifies one or more triads, where a triad is a sequence of three layers where no layer is repeated. The method selects a set of schedules where each of the identified triads is contained in at least one schedule. The method associates each selected schedule with one or more key-layer values, where a key layer is the middle layer of a triad contained within the schedule.
摘要:
An apparatus and a method for raising a data throughput by dynamically changing the maximum number of iterative decoding times of an iteratively decodable code in a mobile communication system are provided. The apparatus includes an early stop controller for determining whether an early stop condition is satisfied during a decoding process according to a maximum number of the iterative decoding times, a Connection IDentifier (CID) controller for detecting a CID of a Media Access Control (MAC) header after the early stop, and an iteration controller for, when determining that a Protocol Data Unit (PDU) is allocated to the receiver apparatus by detecting the CID of the MAC header, resetting the maximum number of iterative decoding times after identifying a decoding block of a next PDU, and for, when the CID is not detected, resetting the maximum number of the iterative decoding times after identifying a next decoding block of the current PDU.
摘要:
Method and apparatus for determining the stopping point of an iterative decoding process. In one embodiment the estimated values of an iteration of an iterative decoder are provided to a signature circuit. If the signature does not differ from the previous signature developed from a prior iteration, or the signature developed from an iteration prior to the previous iteration, the decoding stops. The variance may also be tested and compared to a threshold as a criteria to stop the iterative decoding.
摘要:
Methods, systems, and devices for wireless communication are described. In a new radio (NR) system, a wireless device may identify a candidate codeword for a channel employing polar coding. The wireless device may perform a decoding operation on the candidate codeword to determine candidate decoding paths corresponding to encoded information bits. The decoding operation may include multiple decoding path candidates, each of which is associated with a path metric. The wireless device may evaluate a spread metric to determine if a decoding hypothesis is incorrect or if the received codeword is too corrupted for decoding. The spread metric may be based on the path metrics of the decoding paths or soft metrics of the decoding paths determined based on a subset of bit channels of the polar code. The wireless device may normalize the spread metric to compensate for signal-to-noise ratio (SNR) variation.
摘要:
Systems and methods described herein provides a method for dynamically allocating an iteration number for a decoder. The method includes receiving, at an input buffer, an input signal including at least one data packet. The method further includes calculating a first iteration number for decoding the at least one data packet. The method further includes monitoring at least one of available space of the input buffer and available decoding time for the at least one data packet. The method further includes dynamically adjusting the first iteration number to a second iteration number based on the available space or the available decoding time to continue decoding the at least one data packet.
摘要:
Certain aspects of the present disclosure relate to techniques and apparatus for increasing decoding performance and/or reducing decoding complexity. A transmitter may divide data of a codeword into two or more sections and then calculate redundancy check information (e.g., a cyclic redundancy check or a parity check) for each section and attach the redundancy check information to the codeword. A decoder of a receiver may decode each section of the codeword and check the decoding against the corresponding redundancy check information. If decoding of a section fails, the decoder may use information regarding section(s) that the decoder successfully decoded in re-attempting to decode the section(s) that failed decoding. In addition, the decoder may use a different technique to decode the section(s) that failed decoding. If the decoder is still unsuccessful in decoding the section(s), then the receiver may request retransmission of the failed section(s) or of the entire codeword.
摘要:
An apparatus includes a memory and a controller. The memory may be configured to store data. The controller may be configured to process a plurality of read/write operations to/from the memory, receive a codeword from the memory, generate a plurality of syndromes of the codeword at a plurality of possible code rates, generate a plurality of count values by counting a number of unsatisfied parity checks in each of the plurality of syndromes, generate a plurality of normalized values by dividing the plurality of count values by a plurality of lengths of the plurality of possible code rates respectively, and determine a bit error rate value of the memory based on a lowest value among the plurality of normalized values.