early termination and path removal based on frozen bits for polar decoding

专利摘要:
methods, systems and devices for wireless communication are described. the examples described in this document can enable a successive cancellation decoder to determine path metrics for various decoding paths based on identified frozen bit locations of a polar code. the path metric for a decode path can be based on bit metrics determined for the frozen bit locations identified along the decode path. once trajectory metrics and bit metrics are determined, the decoder can compare those metrics with threshold criteria and determine whether to discard decoding trajectories based on the comparison. the techniques described in this document for discarding decoding paths may allow the decoder to discard, remove or disqualify certain decode paths that are not likely to provide an accurate representation of bits received from another device. consequently, the decoder may be able to save energy by terminating an early decoding process (ie, early termination) if all trajectories are discarded, removed or disqualified.
公开号:BR112019022853A2
申请号:R112019022853
申请日:2018-05-01
公开日:2020-05-19
发明作者:Sarkis Gabi；Menjay Lin Jamie；Yang Yang
申请人:Qualcomm Inc；
IPC主号:

专利说明:

EARLY TERMINATION AND REMOVAL OF FROZEN BIT PATH FOR POLAR DECODING
CROSS REFERENCES
[0001] The present patent application claims the benefit of U.S. Patent Application No. 15 / 967,592 by Lin et al. , entitled Frozen Bits Based Pruning And Early Termination For Polar Decoding, filed on April 30, 2018; and Provisional Patent Application No. U.S. 62 / 502,154 by LIN, et al., entitled Frozen Bits Based Pruning And Early Termination For Polar Decoding, filed on May 5, 2017; each of which is assigned to the present assignee.
BACKGROUND
[0002] What is mentioned below refers, in general, to wireless communication and, more specifically, the removal of frozen bits and early termination for polar decoding.
[0003] Wireless communication systems are widely deployed to provide various types of communication content such as voice, video, packet data, messages, broadcast and so on. These systems may be able to support communication with multiple users by sharing available system resources (for example, time, frequency and power). Examples of such multiple access systems include code division multiple access systems (CDMA), time division multiple access systems (TDMA), frequency division multiple access systems (FDMA) and multiple access systems by orthogonal frequency division (OFDMA) (for example, a system of
Petition 870190111033, of 10/31/2019, p. 6/121
2/88 long term evolution (LTE) or a new radio system (NR)). A wireless multiple access communications system can include multiple base stations or access network nodes, each of which simultaneously supports wireless communications for multiple communication devices, which may otherwise be known as user equipment. (HUH).
[0004] Wireless communications, however, often involve sending data over a noisy communication channel. To combat noise, a transmitter can encode data in the form of code words using error correction codes to introduce redundancy in the code words so that transmission errors can be detected and / or corrected. Some examples of coding algorithms with error correction codes include convolutional codes (CCs), low density parity verification codes (LDPC) and polar codes. A polar code is an example of a linear block error correction code and has been shown to approximate theoretical channel capacity as the code length approaches infinity. To decode a coded codeword using a polar code, a receiving device can create a candidate hypothesis of the code length and number of information bits, generate a representation of the information bits using a decoding process successive cancellation (SC) or successive cancellation list (SCL) in the codeword according to the candidate hypothesis and perform an error checking operation on the representation of the information bits to determine whether
Petition 870190111033, of 10/31/2019, p. 7/121
3/88 decoding is successful.
[0005] In some cases, the decoding operation may fail due to the fact that the code word has experienced successive corruption (for example, the code word was transmitted through a channel with very low signal to noise ratio (SNR)) , there is no code word transmitted for the candidate hypothesis (for example, the code word represents random noise), the transmitted code word is intended for a different device, or the candidate hypothesis may be incorrect (for example, incorrect code, incorrect information bit size, incorrect aggregation level). In any or all of these circumstances, termination of decoding for a candidate hypothesis early (for example, before all decoding processes are completed) may limit energy consumption in situations for which decoding will be successful. However, differentiating circumstances in which early termination is adequate (for example, without ending decoding early for some decoding processes that might have been successful) provides challenges for existing deployments. Other known techniques to facilitate early termination increase the complexity of decoding, diminishing the benefits provided by early termination.
SUMMARY
[0006] The techniques described refer to improved methods, systems or devices that support removal based on frozen bits and early termination for polar decoding. The examples described in the present
Petition 870190111033, of 10/31/2019, p. 8/121
4/88 documents include the determination and use of frozen bit metrics and frozen bit trajectory metrics for the removal and early termination of candidate decoding paths. Candidate decoding trajectories can be evaluated for trajectory selection at information bit locations according to decoding trajectory metrics, while frozen bit metrics or frozen bit trajectory metrics can be improved at frozen bit locations identified by a polar code for removal and early termination. The frozen bit path metric for a decode path can be based on frozen bit metrics determined for the frozen bit locations identified along the decode path.
[0007] Once the frozen bit path metrics and frozen bit metrics are determined, the decoder can compare these metrics with threshold criteria and determine whether to discard decode paths based on the comparison. The techniques described in this document for discarding decode paths may allow the decoder to discard, remove or disqualify certain decode paths that are not likely to provide an accurate representation of a possible candidate bit vector of information associated with a received codeword . Consequently, the decoder may be able to increase the probability of detection by removing improbable trajectories to provide a correctly decoded set of information bits or to save energy.
Petition 870190111033, of 10/31/2019, p. 9/121
5/88 by terminating an early decoding process (ie, early termination) if all trajectories are discarded, removed or disqualified.
[0008] A method for wireless communication is described. The method may include receiving a candidate code word through a communication channel, identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, and the decoding process comprises, for each frozen bit location of at least a subset of the plurality of frozen bit locations: determine metrics of frozen bit path for a set of decoding paths based, at least in part, on metric the bit values for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding trajectories based, at least in part, on comparisons between the metrics of
Petition 870190111033, of 10/31/2019, p. 12/101
6/88 frozen bit path for each of the set of decoding paths and a threshold frozen bit path metric, and determine whether to process the candidate bits of information code word based, at least in part, on a result of the decoding process.
[0009] A device for wireless communication is described. The apparatus may include a means for receiving a candidate code word via a communication channel, a means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded with the use of a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, means for carrying out a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the means for carrying out the decoding process comprising, for each frozen bit location of at least minus a subset of the plurality of frozen bit locations: means for determining frozen bit path metrics for a path set decoding ages based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent of bit metrics for The
Petition 870190111033, of 10/31/2019, p. 12/111
7/88 plurality of information bit locations, and means to discard a subset of the set of decoding paths based, at least in part, on comparisons between the frozen bit path metrics for each of the set of path paths. decoding and a threshold frozen bit trajectory metric, and means for determining whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process.
[00010] Another device for wireless communication is described. The device can include a processor, memory in electronic communication with the processor and instructions stored in memory. Instructions can be operational to make the processor receive a candidate code word through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code corresponding to a plurality of information bits and a plurality of frozen bit locations of the polar code corresponding to a plurality of frozen bits, perform a decoding process for the candidate codeword based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least a subset the plurality of frozen bit locations: determine frozen bit trajectory metrics for a
Petition 870190111033, of 10/31/2019, p. 12/121
8/88 set of decoding paths based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of independent and frozen bit locations of bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding paths based, at least in part, on comparisons between the frozen bit path metrics for each of the set of paths decoding and a threshold frozen bit trajectory metric, and determining whether to process the candidate bits of information code word based, at least in part, on a result of the decoding process.
[0011] A non-transitory computer-readable media for wireless communication is described. Non-transitory computer-readable media may include operational instructions to have a processor receive a candidate code word through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least in part, in the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the
Petition 870190111033, of 10/31/2019, p. 12/13
The decoding process comprises, for each frozen bit location of at least a subset of the plurality of frozen bit locations: determining frozen bit path metrics for a set of decoding paths based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding paths based, at least in part, on comparisons between the frozen bit path metrics for each of the set of decoding paths and a threshold frozen bit path metric, and determining whether to process the bits of information from the candidate code word based, at least in part, on a result of the decoding process.
[0012] In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process additionally comprises, for each frozen bit location, discarding a subset of the set of decoding paths based on at least in part, in comparisons between the bit metrics for the set of decoding paths for each frozen bit location and a threshold bit metric. In some examples of the non-transitory, computer-readable method, device and media described above, the bit metrics for the set of decoding paths for each bit location
Petition 870190111033, of 10/31/2019, p. 12/14
10/88 frozen can be based, at least in part, on reliability information for each frozen bit location or an aggregate of logarithmic likelihood ratio (LLR) magnitudes for the candidate codeword. In some examples of the non-transitory computer-readable method, apparatus and media described above, the determination of frozen bit trajectory metrics for the set of decoding trajectories further comprises determining the frozen bit trajectory metrics based, at least in part , at various bit locations that correspond to each frozen bit location and those prior to at least the subset of the plurality of the frozen bit locations, reliability information for bit locations that correspond to each frozen bit location and those prior to at minus the subset of the plurality of frozen bit locations, or an aggregate of LLR magnitudes for the candidate codeword.
[0013] In some examples of the non-transitory computer-readable method, device and media described above, for each frozen bit location, the frozen bit trajectory metrics can be determined based, at least in part, on a sum of the metrics bits for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations. In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process additionally comprises, for each frozen bit location, determining first candidate path metrics for
Petition 870190111033, of 10/31/2019, p. 12/15
11/88 each set of decoding paths that may not be discarded. In some examples of the non-transitory, computer-readable method, device and media described above, performing the decoding process further comprises, for an information bit location after each frozen bit location, determining second candidate path metrics for an extended set decoding paths based, at least in part, on the first candidate path metrics and bit metrics for the information bit location. Some examples of the non-transitory computer-readable method, apparatus and media described above may additionally include processes, resources, means or instructions for selecting a subset of the extended set of decoding trajectories based, at least in part, on the candidate's second trajectory metrics .
[0014] In some examples of the non-transitory computer-readable method, apparatus and media described above, the determination to process the information bits comprises determining that all decoding paths of the set of decoding paths can be discarded and terminating decoding candidate code word. In some examples of the non-transitory computer-readable method, device and media described above, the determination to process the bits of information comprises determining, subsequent to the decoding process for all of the plurality of frozen bit locations, that at least one path decoding set of decoding paths is not discarded, identifying the
Petition 870190111033, of 10/31/2019, p. 12/161
12/88 information based, at least in part, on at least one decoding path, and processing the information bits based, at least in part, on identification. In some examples of the non-transitory computer-readable method, device and media described above, the subset of the plurality of frozen bit locations is selected for evaluation based, at least in part, on the assumption of decoding or reliability information for the plurality of frozen bit locations.
[0015] A method for wireless communication is described. The method may include receiving a candidate code word that has a code word length through a communication channel, identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word which is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of locations frozen bit of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate codeword, the decoding process being carried out according to the codeword length and the decoding hypothesis, and determine whether to finish the decoding process as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality
Petition 870190111033, of 10/31/2019, p. 12/17
13/88 bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the decoding hypothesis.
[0016] A device for wireless communication is described. The apparatus may include a means for receiving a candidate code word that has a code word length through a communication channel, a means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, means to initiate a decoding process for the candidate codeword, the decoding process being carried out according to the codeword length and the decoding hypothesis, and means of determining whether to end the decoding process as it has failed to obtain the plurality of information bits information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least least in part, in the case of decoding.
[0017] Another device is described for
Petition 870190111033, of 10/31/2019, p. 12/181
14/88 wireless communication. The apparatus may include a processor, memory in electronic communication with the processor, and instructions stored in memory. Instructions can be operational to make the processor receive a candidate code word that has a code word length through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least on part, in the candidate codeword that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of bit locations of the polar code information that corresponds to a plurality of bits information and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate codeword, and the decoding process is carried out according to the length of the code and the decoding hypothesis, and determine whether to finish the decoding process as you no longer get the plurality of bits of i information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least least in part, in the case of decoding.
[0018] A non-transitory computer-readable medium for wireless communication is described. Non-transitory computer-readable media can include
Petition 870190111033, of 10/31/2019, p. 12/191
15/88 operational instructions to make a processor receive a candidate code word that has a code word length through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least on part, in the candidate codeword that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of bit locations of the polar code information that corresponds to a plurality of bits information and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate codeword, and the decoding process is carried out according to the length of the code and the decoding hypothesis, and determine whether to finish the decoding process as you no longer get the plurality of information bits based on, at least in part, the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least least in part, in the case of decoding.
[0019] In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process comprises successively decoding the plurality of bit locations. In some examples of the non-transitory, computer-readable method, device and media described above, the
Petition 870190111033, of 10/31/2019, p. 12/20
16/88 decoding comprises a successive cancellation (SC) decoding process. In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process comprises a successive cancellation list (SCL) decoding process.
[0020] A method for wireless communication is described. The method may include receiving a candidate code word through a communication channel, identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, and the decoding process comprises, for each frozen bit location of at least a subset of the plurality of frozen bit locations: determine metrics of frozen bit path for a set of decoding paths based, at least in part, on metric the bit values for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discard a subset of
Petition 870190111033, of 10/31/2019, p. 12/21
17/88 set of decoding trajectories based, at least in part, on comparisons between frozen bit trajectory metrics for each of the set of decoding trajectories and a threshold frozen bit trajectory metric, and determining whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process.
[0021] A device for wireless communication is described. The apparatus may include a means for receiving a candidate code word via a communication channel, a means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded with the use of a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, means for carrying out a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the means for carrying out the decoding process comprising, for each frozen bit location of at least minus a subset of the plurality of frozen bit locations: means for determining frozen bit path metrics for a path set decoding ages based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those at least
Petition 870190111033, of 10/31/2019, p. 12/22
18/88 minus the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and means to discard a subset of the set of decoding paths based, at least in part, on comparisons between frozen bit trajectory metrics for each of the set of decoding trajectories and a threshold frozen bit trajectory metric, and means for determining whether to process candidate information word code bits based, at least in part, in a result of the decoding process.
[0022] Another device for wireless communication is described. The device can include a processor, memory in electronic communication with the processor and instructions stored in memory. Instructions can be operational to make the processor receive a candidate code word through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code corresponding to a plurality of information bits and a plurality of frozen bit locations of the polar code corresponding to a plurality of frozen bits, perform a decoding process for the candidate codeword based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least
Petition 870190111033, of 10/31/2019, p. 12/23
19/88 a subset of the plurality of frozen bit locations: determining frozen bit path metrics for a set of decoding paths based, at least in part, on bit metrics for the set of decoding paths for each location of frozen bit and previous ones of at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding paths based, at least in part , in comparisons between the frozen bit trajectory metrics for each of the set of decoding trajectories and a threshold frozen bit trajectory metric, and determine whether to process the candidate bits of information code word based, at least on part, as a result of the decoding process.
[0023] Non-transitory computer-readable media for wireless communication is described. Non-transitory computer-readable media may include operational instructions to have a processor receive a candidate code word through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least in part, in the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, perform a decoding process for the
Petition 870190111033, of 10/31/2019, p. 12/24
20/88 candidate codeword based, at least in part, on the identified decoding hypothesis, and the decoding process comprises, for each frozen bit location of at least a subset of the plurality of frozen bit locations: determine metrics of bit-frozen path for a set of decoding paths based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those prior to at least the subset of the plurality of frozen bit and independent of bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding trajectories based, at least in part, on comparisons between the frozen bit trajectory metrics for each among the set of decoding paths and a threshold frozen bit path metric, and determining whether to process the information bits candidate code word based, at least in part, on a result of the decoding process.
[0024] In some examples of the non-transitory computer-readable method, apparatus and media described above, performing the decoding process further comprises, for each frozen bit location, discarding a subset of the set of decoding paths based on at least in part, in comparisons between the bit metrics for the set of decoding paths for each frozen bit location and a threshold bit metric. In some examples of the method, device and non-transitory computer-readable media
Petition 870190111033, of 10/31/2019, p. 12/25
21/88 described above, the bit metrics for the set of decoding paths for each frozen bit location can be based, at least in part, on reliability information for each frozen bit location or an aggregate of ratio magnitudes logarithmic likelihood (LLR) for the candidate code word. In some examples of the non-transitory computer-readable method, apparatus and media described above, the determination of frozen bit trajectory metrics for the set of decoding trajectories further comprises determining the frozen bit trajectory metrics based, at least in part , at various bit locations that correspond to each frozen bit location and those prior to at least the subset of the plurality of the frozen bit locations, reliability information for the bit locations that correspond to each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations, or an aggregate of LLR magnitudes for the candidate codeword.
[0025] In some examples of the non-transitory computer-readable method, device and media described above, for each frozen bit location, the frozen bit trajectory metrics can be determined based, at least in part, on a sum of the metrics bits for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations. In some examples of the non-transitory computer-readable method, device and media described above, performing the decoding process comprises
Petition 870190111033, of 10/31/2019, p. 12/26
22/88 additionally, for each frozen bit location, determine first candidate path metrics for each set of decoding paths that may not be discarded. In some examples of the non-transitory, computer-readable method, device and media described above, performing the decoding process further comprises, for an information bit location after each frozen bit location, determining second candidate path metrics for an extended set decoding paths based, at least in part, on the first candidate path metrics and bit metrics for the information bit location. Some examples of the non-transitory computer-readable method, apparatus and media described above may additionally include processes, resources, means or instructions for selecting a subset of the extended set of decoding trajectories based, at least in part, on the candidate's second trajectory metrics .
[0026] In some examples of the non-transitory computer-readable method, apparatus and media described above, the determination to process the bits of information comprises determining that all decoding paths of the set of decoding paths can be discarded and ending decoding candidate code word. In some examples of the non-transitory computer-readable method, apparatus and media described above, the determination to process the bits of information comprises determining, subsequent to the decoding process for all of the plurality of frozen bit locations, that at least
Petition 870190111033, of 10/31/2019, p. 12/27
23/88 a decoding path from the set of decoding paths is not discarded, identifying the information bits based, at least in part, on at least one decoding path, and processing the information bits based, at least on part, in identification. In some examples of the non-transitory computer-readable method, device and media described above, the subset of the plurality of frozen bit locations is selected for evaluation based, at least in part, on the assumption of decoding or reliability information for the plurality of frozen bit locations.
[0027] A method for wireless communication is described. The method may include receiving a candidate code word that has a code word length through a communication channel, identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word which is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of locations frozen bit of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate codeword, the decoding process being carried out according to the codeword length and the decoding hypothesis, and determine whether to finish the decoding process as it has failed to obtain the plurality of bits of information with
Petition 870190111033, of 10/31/2019, p. 12/28
24/88 base, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least in part, in the case of decoding.
[0028] A device for wireless communication is described. The apparatus may include a means for receiving a candidate code word that has a code word length through a communication channel, a means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, means to initiate a decoding process for the candidate codeword, the decoding process being carried out according to the codeword length and the decoding hypothesis, and means of determining whether to end the decoding process as it has failed to obtain the plurality of information bits information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least least in part, in the event that
Petition 870190111033, of 10/31/2019, p. 12/29
25/88 decoding.
[0029] Another device for wireless communication is described. The device can include a processor, memory in electronic communication with the processor and instructions stored in memory. Instructions can be operational to make the processor receive a candidate code word that has a code word length through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least on part, in the candidate codeword that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of bit locations of the polar code information that corresponds to a plurality of bits information and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate codeword, and the decoding process is carried out according to the length of the code and the decoding hypothesis, and determine whether to finish the decoding process as you no longer get the plurality of bits of i information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based on, at least least in part, in the case of decoding.
[0030] A medium readable by
Petition 870190111033, of 10/31/2019, p. 12/30
26/88 non-transitory computer for wireless communication. Non-transitory computer-readable media may include operational instructions to have a processor receive a candidate code word that has a code word length through a communication channel, identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate codeword that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of polar code information bit locations that corresponds to a plurality of bits of information and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, start a decoding process for the candidate code word, and the decoding process is carried out according to with the codeword length and decoding hypothesis, and determine whether to end the decoding process as you go. has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the decoding hypothesis.
[0031] In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process comprises successively decoding the plurality of bit locations. In some
Petition 870190111033, of 10/31/2019, p. 12/31
27/88 examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process comprises a successive cancellation (SC) decoding process. In some examples of the non-transitory computer-readable method, apparatus and media described above, the decoding process comprises a successive cancellation list (SCL) decoding process.
BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 illustrates an example of a wireless communications system that supports frozen bit removal and early termination for polar decoding in accordance with various aspects of the present disclosure;
[0033] Figure 2 illustrates an example of a wireless communications system that supports frozen bit removal and early termination for polar decoding in accordance with various aspects of the present disclosure;
[0034] Figure 3 illustrates an example diagram of subchannels of a polar code according to various aspects of the present disclosure;
[0035] Figure 4 illustrates an example of multiple decoding paths in a decoding process according to different aspects of the present disclosure;
[0036] Figure 5 illustrates an example of a flow chart that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure;
Petition 870190111033, of 10/31/2019, p. 12/31
28/88
[0037] Figures 6 to 8 show block diagrams of a device that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure;
[0038] Figure 9 illustrates a block diagram of a system that includes user equipment (UE) that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure;
[0039] Figure 10 illustrates a block diagram of a system that includes a base station that supports the removal of frozen bits and early termination for polar decoding in accordance with various aspects of the present disclosure; and
[0040] Figures 11 to 13 illustrate methods for removing frozen bits and early termination for polar decoding according to various aspects of the present disclosure.
DETAILED DESCRIPTION
[0041] The techniques described refer to improved methods, systems or devices that support the removal of frozen bits and early termination for polar decoding. A polar code is an example of a linear block error correction code and has been shown to approximate theoretical channel capacity as the code length approaches infinity. An encoder can receive an information vector that includes bits of information for encoding, encode the bits of information using a polar code to generate a codeword and transmit the codeword through a
Petition 870190111033, of 10/31/2019, p. 12/31
29/88 wireless communication channel.
[0042] A decoder can receive the code word and use a decoding process that tries to retrieve the information bits from the code word. In some cases, successive cancellation list (SCL) decoding can be used to decode the codeword. In SCL decoding, a decoder can determine candidate paths through a code tree of subchannels of a code and maintain an L number of trajectory list size through the code tree at each decoding level. A candidate path can also be referred to in this document as a decoding path.
[0043] In one example, during decoding, a candidate path can be extended in each subchannel of a code tree using difficult decision values of 0 or 1. The extension of L candidate paths by an additional bit in 2L possible paths . In SCL decoding, a decoder can calculate a trajectory metric for each candidate trajectory and select L trajectories from the 2L possible trajectories that have the best trajectory metrics. A trajectory metric can be a sum of costs for the transition from bit value to bit value along a candidate path. The addition of a bit that has a particular value to a candidate path can be associated with a cost that represents the probability that the bit value is correct.
[0044] In some cases, a device may receive a corrupted transmission, and may be suitable
Petition 870190111033, of 10/31/2019, p. 12/31
30/88 for the device to end a decoding process early (ie early termination). To facilitate early termination, an encoder can attach additional bits (for example, cyclic redundancy check bits (CRC) or parity check bits) in the form of an external code to a code word transmitted to a decoder. The decoder can then compare these bits with calculated values to determine whether it maintains a particular decoding path. Consequently, if the decoder decides to discard all decoding paths, the decoder can save energy by terminating the decoding early.
[0045] However, in some cases, the use of these additional bits can increase the decoding complexity in a decoder. For example, the decoder can perform operations on those bits in relation to the decoding bit hypothesis and operations in the list management and bit feedback for those bits, which can increase complexity. In addition, these additional bits can be distributed over an entire sequence of bits instead of being colocalized in one location of the code. As a result, a decoder can perform, for example, distributed CRC or parity derivation in order to obtain early termination, which can increase processing latencies during runtime decoding. Thus, techniques for using additional bits to facilitate early termination in a decoder can be ineffective.
[0046] As described in this document,
Petition 870190111033, of 10/31/2019, p. 12/35
31/88 a decoder can support effective techniques to support early termination to limit the complexity of decoding, latency and power consumption in a device. A polar code can be made up of multiple subchannels that have different levels of reliability. Subchannel reliability can represent a subchannel's ability to carry information as part of the coded codeword. Subchannels of a polar code that have greater reliability are used to encode bits of information and the remaining subchannels are used to encode frozen bits. For N subchannels, K bits of information can be loaded into the most reliable K subchannels and frozen N-K bits can be loaded into the less reliable N-K subchannels, where K <N.
[0047] A frozen bit is a bit that has a known value for a decoder and is generally set to 0. The value of a frozen bit, however, can be any value as long as the decoder knows or can calculate the value of the frozen bit from previously received information bits (for example, bits decoded earlier based on a codeword decoding order). The techniques described in this document allow a decoder to support early termination using the known value of frozen bits. Specifically, a decoder can determine frozen bit path metrics and frozen bit metrics, and the decoder can determine whether to discard a decode path based on comparing those metrics with threshold criteria. If one or more of these metrics meet the criteria for
Petition 870190111033, of 10/31/2019, p. 12/36
32/88 threshold for removing a decoding path, the decoder can determine to discard the decoding path. Consequently, the decoder may be able to support early termination without requiring additional CRC or parity bits in a polar code.
[0048] The disclosure aspects introduced above are described below in the context of a wireless communications system. Examples of signaling processes and exchanges that support frozen bit removal and early termination for polar decoding are then described. The aspects of the disclosure are further illustrated by and described with reference to device diagrams, system diagrams and flowcharts that refer to the removal of frozen bits and early termination for polar decoding.
[0049] Figure 1 illustrates an example of a wireless communications system 100 that supports frozen bit removal and early termination in accordance with various aspects of the present disclosure. The wireless communications system 100 includes base stations 105, UEs 115 and a primary network 130. In some instances, the wireless communications system 100 may be a long-term evolution network (LTE), an advanced LTE network (LTE-A), an advanced professional LTE network or a New Radio (NR) network. In some cases, the wireless communications system 100 can support improved broadband communications, ultra-reliable (i.e., critical) communications, low-latency communications and communications with low-cost and low-complexity devices.
[0050] Base stations 105 can communicate from
Petition 870190111033, of 10/31/2019, p. 37/121
33/88 wireless mode with the UEs 115 through one or more base station antennas. Each base station 105 can provide communication coverage for a respective geographic coverage area 110. The communication links 125 shown in wireless communication system 100 can include uplink transmissions from an UE 115 to a base station 105 or downlink transmissions from a base station 105 to a UE 115. Control information and data can be multiplexed on an uplink channel or a downlink channel according to various techniques. Control data and information can be multiplexed on a downlink channel, for example, using time division multiplexing (TDM) techniques, frequency division multiplexing (FDM) techniques or TDM-FDM techniques hybrids. In some examples, control information transmitted during a transmission time interval (TTI) downlink channel can be distributed between different control regions in a cascade manner (for example, between a common control region and one or more EU-specific control regions).
[0051] UEs 115 can be dispersed over wireless communication system 100, and each UE 115 can be stationary or mobile. A UE 115 can also be called a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a wireless communications device , a remote device, a remote subscriber station, a
Petition 870190111033, of 10/31/2019, p. 12/38
34/88 access, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a customer or some other suitable terminology. An UE 115 can be a cell phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a portable device, a tablet computer, a laptop computer, a cordless phone, a device personal electronic device, a handheld device, a personal computer, a local wireless circuit station (WLL), an Internet of things (loT) device, an Internet of all things (loE) device, a machine-type communication (MTC), an appliance, a vehicle or the like.
[0052] Base stations 105 can communicate with main network 130 and with each other. For example, base stations 105 can interface with main network 130 through backhaul links 132 (e.g., SI, etc.). Base stations 105 can communicate with each other on backhaul links 134 (for example, X2, etc.) directly or indirectly (for example, through main network 130). Base stations 105 can perform radio configuration and programming for communication with UEs 115, or they can operate under the control of a base station controller (not shown). In some examples, base stations 105 may be macrocells, small cells, access points or the like. Base stations 105 can also be referred to as evolved NodeBs (eNBs) 105.
[0053] In wireless communication system 100, base stations 105 and UEs 115 can communicate over noise communication channels. To combat noise, a
Petition 870190111033, of 10/31/2019, p. 12/31
35/88 The transmitter can encode code words using error correction codes to introduce redundancy in the code words so that transmission errors can be detected and corrected. Some examples of coding algorithms with error correction codes include convolutional codes (CCs), low density parity verification codes (LDPC) and polar codes. In some cases, a receiving device may be trying to decode a corrupted transmission (for example, a corrupted polar coding codeword), a candidate transmission that is not present, or a candidate transmission that is destined for a different device. In any or all of these circumstances, terminating decoding early (for example, before all decoding processes are completed) can limit energy consumption in situations for which decoding will be successful. However, existing deployments that facilitate early termination can increase the complexity of decoding which limits the benefits of removal and early termination.
[0054] The wireless communications system 100 can support effective decryption techniques to support early termination to limit the complexity of decoding, latency and power consumption on a device. The techniques described in this document allow a decoder to support early termination using the known value of frozen bits. Specifically, a decoder can determine frozen bit metrics or frozen bit trajectory metrics at frozen bit locations in a polar code, and the
Petition 870190111033, of 10/31/2019, p. 40/121
36/88 decoder can determine whether to discard a decoding trajectory based on the comparison of these metrics with threshold criteria. If one or more of these metrics meet the threshold criteria for removing a decoding path, the decoder can determine to discard the decoding path.
[0055] Figure 2 illustrates an example of a wireless communications system 200 that supports frozen bit removal and early termination for polar decoding in accordance with various aspects of the present disclosure. The wireless communications system 200 can deploy aspects of wireless communications system 100. The wireless communications system 200 includes a base station 105-a and an UE 115-a. Base station 105-a is an example of base station 105 of Figure 1 and UE 115-a is an example of UE 115 of Figure 1.
[0056] In the example in Figure 2, base station 105-a can use polar encoding to encode bits of information for transmission to UE 115-a via a communication channel 235. In other examples, UE 115-a it can encode data for transmission to base station 105-a or another UE 115 using these same techniques. In additional examples, base station 105-a can encode data for transmission to another base station 105 using these same techniques. In addition, devices in addition to base station 105-a and UE 115-a can use the techniques described in this document to decode a coded codeword using a polar code.
[0057] In the example shown, base station 105-a can include a data source 205, a data generator
Petition 870190111033, of 10/31/2019, p. 41/121
37/88 frozen bit 210 and a polar encoder 215. A data source 205 can provide a k bit information vector of information to be encoded and transmitted to UE 115-a. The data source 205 can be coupled to a network, a storage device or the like. The data source 205 can output the vector of information to the frozen bit generator 210. The frozen bit generator 210 can generate frozen bits for a polar code used to encode a codeword to be transmitted to UE 115-a ( for example, based on information bits or independent of information bits). The frozen bit generator 210 can pass the generated frozen bits to the polar encoder 215 which can encode the information bits and frozen bits to obtain a code word for transmission to UE 115-a. As mentioned above, polar encoder 215 can allocate the most reliable subchannels of a polar code for bits of information and the least reliable subchannels of the polar code for frozen bits.
[0058] Figure 3 illustrates an example diagram 300 of a polar code according to various aspects of the present disclosure. Diagram 300 represents a polar code for encoding or decoding a codeword 320 that includes N subchannels in a decoding order with subchannel 0 at the top, followed by subchannel 1 and proceeding sequentially to subchannel N-1. The decoding order can indicate which subchannels include bits of information and which subchannels include frozen bits and can correspond to the order in which decoder 225 decodes subchannels of a polar code. The encoder
Petition 870190111033, of 10/31/2019, p. 42/121
Polar 38/88 215 and decoder 225 may determine the decoding order or otherwise be aware of the decoding order (for example, accessing a table in memory that includes the decoding order).
[0059] The generator matrix 315 can be used by an encoder (for example, polar encoder 215) to encode frozen bits and bits of information inserted in subchannels u [0: Nl] to generate subchannels of xcode word [0: Nl] , and can be used by a decoder to decode information received in the subchannels of codeword x [0: Nl] to obtain a representation of the information bits and bits frozen in subchannels u [0: Nl]. Subchannels 305 that correspond to frozen bits are represented using dashed lines, and subchannels 310 that correspond to bits of information are represented using continuous lines. The represented location of the subchannels within the decoding order is an example and the location of any particular subchannel may depend on its reliability in relation to other subchannels of the polar code.
[0060] After encoding, polar encoder 215 may pass the encoded bits to a rate matching element (not shown) to rate the encoded bits to a set of resources for transmission to UE 115-a. When rate matching is employed, a subset of the N bits can be transmitted or a subset of the N bits can be repeated in the transmission. In some examples, subchannel reliability is computed for each M: N: K combination, where M is the number of the N bits of the code word that are transmitted,
Petition 870190111033, of 10/31/2019, p. 43/121
39/88 and M can be less than (perforation) or greater than (repetition) N. The rate matching element can then insert the rate matching bits into a modulator (not shown) for modulation before transmission to UE 115-a. Base station 105-a can then transmit the code word to UE 115-a over communication channel 235.
[0061] UE 115-a can identify a candidate code word based on a candidate hypothesis (for example, decoded resources, M: N: K hypothesis). For example, UE 115-a may employ a blind decoding process in which multiple candidate hypotheses (ie, decoding hypotheses) within a search space are tested to determine whether the decoding performed for any of the candidate hypotheses is successful . Demodulator 220 may demodulate the candidate code word, which may include demapping received symbols associated with a set of resources to obtain a representation of the code word. Demodulator 220 can then pass the code word representation to decoder 225 to identify the most likely candidate path or paths for the information bits obtained from the code word. The demodulated signal can be, for example, a sequence of logarithmic likelihood ratio (LLR) values that represent a probability value of a received bit that is either a 0 or a 1. The decoder can perform a list decoding algorithm in the LLR values (for example, SCL decoding) and can provide an output. If the decoder is capable of decoding the
Petition 870190111033, of 10/31/2019, p. 44/121
40/88 code word with polar coding successfully, the decoder can output a sequence of bits of the information vector (for example, the k bits of information) for use, storage, communication to another device or the like.
[0062] According to several aspects described in this document, the decoder 225 can support decoding techniques that facilitate early termination while limiting the complexity of the decoding process. Specifically, the decoder can determine decoding paths that correspond to a sequence of bits, and the decoder can discard decoding paths that are unlikely to accurately represent bits of information transmitted by base station 105-a in an encoded codeword. Figure 4 illustrates an example of multiple decoding paths 400 maintained by a decoder during a decoding process according to various aspects of the present disclosure. Decoder 225 can maintain decoding paths that are prone to accurately represent bits of information received from base station 105-a. The levels of the decoding process illustrated in Figures 3 and 4 are used to show the relationship between the information and frozen bit locations in Figure 3 and the decoding paths in Figure 4.
[0063] Upon receipt of the code word with polar coding, the UE 115-a can generate decoding paths 400 to identify the bits of information included in the code word. The trajectories of
Petition 870190111033, of 10/31/2019, p. 45/121
41/88 decoding 400 represents the list decoding for subchannels j to j + 6 as illustrated in Figure 3. In some examples, subchannel j is the location of the first bit of information in the order of decoding the polar code. However, it must be understood that the operations represented in Figure 4 can be performed in different sections of the subchannels of the polar code. Before subchannel j, decoder 225 may maintain only one decoding path due to the fact that all previous subchannels are frozen bits that the decoder is aware of having a value of 0.
[0064] In subchannel j, decoder 225 can divide the decoding path from a node 405 associated with an information bit location of Figure 3 into two decoding paths for the two possible values for the information bit. In some cases, decoder 225 may limit a number of decoding paths maintained during the decoding process (for example, it may maintain a maximum of L decoding paths after SCL operations for each subchannel). In the example in Figure 4, decoder 225 can maintain a maximum of four (4) paths (that is, L = 4). Consequently, since the number of paths after subchannel j processing in Figure 4 is below four (4) (i.e. two (2)), decoder 225 can continue the list decoding process without discarding any one of these decoding paths.
[0065] Although decoder 225 may not have to select a number of paths to continue processing, decoder 225 can determine metrics
Petition 870190111033, of 10/31/2019, p. 46/121
42/88 path for each decoding path based on the probability that the information bit is a 0 or 1 for each decoding path. The decoder can maintain these path metrics as it traverses the code tree, updating the path metrics for each of the L decoding paths for each subchannel (for example, frozen bits and information bits) based on bit metrics calculated for each subchannel for each decoding path. When the number of decoding paths exceeds the list size due to decoding branches in information bit locations, the decoder 225 can select the L best decoding paths based on the path metrics for further processing.
[0066] In subchannel j + 1, decoder 225 can identify a frozen bit location, and the value of the frozen bit can be known in advance as being 0. Decoder 225 can then generate a frozen bit metric associated with the bit frozen in subchannel j + 1 based on the probability that the frozen bit value is 0. In some examples, the probability that the frozen bit value is 0 may depend on an LLR associated with a subchannel allocated for the frozen bit. Using the frozen bit metric, the decoder 225 can then generate frozen bit path metrics for each of the decoding paths. For example, the frozen bit metrics generated in subchannel j + 1 may be different for decoding paths 410-a and 410-b, and the frozen bit path metrics for each of the decoding paths may depend on the respective decoding paths.
Petition 870190111033, of 10/31/2019, p. 47/121
43/88 frozen bit metrics. In some cases, frozen bit metrics and frozen bit path metrics may not depend on all frozen bit locations in a polar code. Instead, frozen bit metrics and frozen bit trajectory metrics may depend on a subset of the frozen bit locations of a polar code. That is, a subset of the frozen bit locations of a polar code can be evaluated for early termination.
[0067] In one example, the subset of frozen bit locations to be evaluated can be selected based on reliability information associated with each frozen bit location of the frozen bits. For example, frozen bit locations associated with higher reliability (for example, above a reliability threshold) can be selected for evaluation. In another example, the subset of frozen bit locations to be evaluated can be selected based on a decoding hypothesis identified for decoding. Due to the fact that the number of bits of information for different codewords (for example, different messages that have different forward link control (DO) information message formats) may be different, the frozen bit locations of a first codeword can correspond to bit locations of information from a second codeword. As such, for a decoding hypothesis that corresponds to the first codeword, the decoder can evaluate the frozen bit locations of the first codeword that correspond to information bit locations of the second codeword, so that the
Petition 870190111033, of 10/31/2019, p. 48/121
44/88 decoder may be able to differentiate between the first and second code words.
[0068] Once the frozen bit metric or frozen bit trajectory metrics are determined, decoder 225 can determine whether to discard certain decoding paths based on frozen bit criteria for path removal. Specifically, decoder 225 can compare frozen bit metrics with a threshold frozen bit metric and, if the comparison result meets the criteria for removal (for example, the frozen bit metric is greater than the frozen threshold metric , where smaller metrics are associated with greater decoding certainty), the decoding path removal manager 230 can discard (or remove) the decoding path associated with the frozen bit metric. Similarly, decoder 225 can compare frozen bit path metrics with a threshold frozen bit path metric and, if the frozen bit path metric for a given decode path meets the frozen bit path criteria for trajectory removal (for example, the frozen bit trajectory metric is greater than a threshold frozen bit trajectory metric in which smaller metrics are associated with greater decoding certainty), the decoding trajectory removal manager 230 can discard (or remove) the decoding path associated with the frozen bit path metric.
[0069] In the example in Figure 4, the decoder 225 can determine that the frozen bit metrics and the
Petition 870190111033, of 10/31/2019, p. 49/121
45/88 frozen bit path metrics for each of the decoding paths in subchannel j + 1 no longer meet the criteria for removal, and decoder 225 can thus determine to maintain both of these decoding paths. In subchannel j +2, decoder 225 can divide each decoding path into two (2) decoding paths to generate guatro (4) decoding paths. Since the number of paths after subchannel j + 2 processing in Figure 4 is less than or equal to the list size of four (4), decoder 225 can continue the list decoding process without discarding any of these path paths. decoding. Subsequently, in subchannel j + 3, decoder 225 can determine that metrics for decoding path 410-a indicate that the job is prone to accurately represent the information bits received from base station 105-a, and the decoder 225 may discard (or remove) the decoding path 410-a. For example, decoder 225 may determine that the frozen bit metric or the frozen bit path metric for decoding path 410-a in subchannel j + 3 of the decoding process meets the criteria for path removal (for example , greater than a threshold), and decoder 225 can therefore determine to discard (or remove) decoding path 410-a.
[0070] In subchannel j + 4, decoder 225 can extend the remaining decode paths and determine that the number of decode paths generated (that is, six (6) decode paths) is
Petition 870190111033, of 10/31/2019, p. 50/121
46/88 greater than L (that is, four (4)). Consequently, decoder 225 can select four (4) out of six (6) decoding paths to maintain. Decoding paths in subchannel j + 4 can be selected based on candidate path metrics associated with each of the decoding paths (for example, decoding path 410-b may not be selected). As discussed above, the candidate path metric for a decoding path can be generated based on information bit metrics and frozen bit metrics determined along the decoding path. In contrast, frozen bit path metrics can be generated based on frozen bit metrics determined along a decoding path and, although dependent on the difficult bits for each decoding path to previous bit locations through feedback operations bit, according to the polar code, frozen bit path metrics can be independent of bit metrics determined for information bit subchannels along the decoding path. In other words, frozen bit path metrics can be generated based on an accumulation of frozen bit metrics determined along the decoding path for at least a subset of frozen bit locations (that is, for a bit location current frozen and at least a subset of previous frozen bit locations in the decoding path), but exclusive of bit metrics for the information bit locations along the decoding path. Additionally, the
Petition 870190111033, of 10/31/2019, p. 51/121
47/88 candidate trajectory metrics, determined based on frozen bit metrics and information, are used for trajectory selection (for example, in information bit locations), while frozen bit metrics and bit trajectory metrics frozen, determined regardless of information bit bit metrics, are used to determine whether to discard (or remove) decoding paths (for example, at frozen bit locations). Although Figure 4 describes that paths that meet the criteria for removal are discarded in the list decoding process, decoder 225 can keep all paths in each frozen bit location, but mark paths that meet the removal criteria as erroneous . In this way, the decoder 225 can continue to maintain candidate paths with the largest candidate path metrics until all decoding paths meet the criteria for removal. Failure to rule out intermediate trajectories can reduce the false alarm rate.
[0071] In some decoding operations, all the remaining decoding paths can meet the criteria for removal at a particular level and can be discarded (or removed), and decoder 225 can end a decoding process early to limit consumption of energy in UE 115-a. In other decoding operations using a different input code word or different N: K values, at least one decoding path can do the same by evaluating frozen bit metric and / or frozen path metric for all bit locations
Petition 870190111033, of 10/31/2019, p. 52/121
48/88 frozen evaluated. The decoder 225 can then identify candidate sets of information bits for the codeword received from base station 105-a based on the remaining decoding paths (for example, up to four (4) decoding paths in the example. of Figure 4). Specifically, the number of bits in a decoding path can include CRC bits and information bits, and decoder 225 can check the CRC bits to identify whether one of the candidate sets of information bits passes the CRC check for be considered a set of information bits successfully decoded for information processing.
[0072] Figure 5 illustrates an example of a flow chart 500 that supports removal based on frozen bits and early termination for polar decoding in accordance with various aspects of the present disclosure. Flowchart 500 illustrates the processing of frozen bit locations from a polar code that can allow a decoder to determine whether to discard (or remove) certain decoding paths. In some respects, flow chart 500 can be used by a UE 115-a in blind decoding (for example, of control information). For example, decoder 225 can determine to test multiple N: K hypotheses as part of a blind decoding process, and flow chart 500 can be repeated for each N: K hypothesis.
[0073] In some cases, the N— K frozen bits can be indexed according to a pre-encoding bit classification with index i, where
Petition 870190111033, of 10/31/2019, p. 53/121
49/88 t E {O, 1, ..., N -K -1} (1)
As described with reference to Figure 4, decoder 225 can generate frozen bit metrics for each of the indexed frozen bits. The decoder 225 can also generate frozen bit trajectory metrics using the frozen bit metrics for each of the indexed frozen bits of a frozen bit vector (I), where / c {0, l ..... N - K - 1} (2)
In some cases, the decoding techniques described in this document can be applied to a subset of frozen bit locations instead of all frozen bit locations (for example, a frozen bit vector (I) whose length is less than N— K). Additionally, the L decoding candidates can be indexed with the index j, where ^Ê {0.1 ..... Ll} (3)
The above indices are used to identify a specific frozen bit metric or frozen bit path metric from a decode path that is used to determine whether to discard (or remove) a decode path.
[0074] Flowchart 500 starts at 505 and proceeds to block 510. In block 510, UE 115-a can identify a frozen bit location (for example, an i-th frozen bit location). In block 515, UE 115-a can generate frozen bit metrics (F ±, j) for one or more decoding paths based on the frozen bit location. As an example, decoder 225 can determine a conditional probability (Pf ±, j) that the bit
Petition 870190111033, of 10/31/2019, p. 54/121
50/88 frozen at the frozen bit location for a trajectory candidate j is equal to 0 (ie, f_i = 0) since the bit is frozen (for example, known to be equal to 0). The decoder 225 can then determine the frozen bit metric based on the conditional probability (Pfi, j) associated with the frozen bit. Specifically, decoder 225 can determine the frozen bit metric based on the following:
^.) = 0, ifP _ri j> 0.or ₍₄₎
A = M '^ ^ρ Μ ^<0
[0075] Subsequently, in block 520, decoder 225 can determine the frozen bit trajectory metric (Fi, j) over a sequence of frozen bits. For example, for a decoding path, the frozen bit trajectory metric can be determined based on the frozen bit metric for the i-th frozen bit and the frozen bit metrics for frozen bits that precede the i-th frozen bit . In some examples, the decoder 225 can evaluate frozen bit path metrics for a first subset of frozen bit locations (for example, frozen bit location vector I), while frozen bit path metrics are determined with based on a second subset of frozen bit locations (locations in the second subset that precedes the i-th frozen bit location). That is, the bit locations for the frozen bit path metric evaluation need not be the same as the bit locations used to calculate the frozen bit path metrics. Specifically, the
Petition 870190111033, of 10/31/2019, p. 55/121
51/88 decoder 225 can determine the frozen bit trajectory metric based on the following equation (for example, for all bits frozen up to and including the i-th frozen bit):
ίγ _; · => Where I c {0/1,, Λ '- K - (Ν - j) - 1} and jc {0/1, ..., 1-1] (5)
[0076] Once the frozen bit metric and the frozen path metric for a decoding path are determined for the i-th frozen bit, decoder 225 can compare one or more metrics with threshold criteria to determine whether to discard ( or remove) the decoding path. That is, if in block 525, decoder 225 determines that frozen bit metrics or frozen path metrics for all decoding paths meet the respective threshold criteria for removal, decoder 225 can discard (or remove) all paths decode and terminate decoding early (ie early termination in block 530). Otherwise, in block 535, decoder 225 can discard a subset of the decoding paths whose metrics meet the respective threshold criteria, and decoder 225 can continue processing the remaining decoding paths. Alternatively, the decoder 225 may not discard any decode paths, except when all decode paths meet the threshold criteria for removal, or it can mark the removed decode paths, but continue to extend the marked paths according to the metrics of candidate trajectory. Thus, in
Petition 870190111033, of 10/31/2019, p. 56/121
52/88
525, decoder 225 may terminate decoding early if all decoding paths meet the threshold criteria for removal or are marked as having previously failed to meet the criteria. As described above, although equation 1 describes a scenario for using all frozen bit locations to calculate frozen bit trajectory metrics, only a subset can be used in some cases. The subset can be determined according to, for example, the frozen bit locations that have the highest reliability (for example, highest polarization weight) or the largest generator weight (number of G operations for a given subchannel). In addition or alternatively, the frozen bit path metrics can only be evaluated against the threshold criteria for path removal in a subset (which can be the same or a subset of the subset used to determine the frozen bit path metrics) of frozen bit locations. The subset can be selected based, at least in part, on the assumption of decoding or reliability information for the plurality of frozen bit locations.
[0077] In some cases, the decoder 225 may normalize the values of frozen bit metric or frozen bit trajectory metric before comparing these values with the respective thresholds. In particular, the thresholds used for comparison between frozen bit metrics or frozen bit trajectory metrics can be the same for all evaluated frozen bit locations, while decoder 225 can normalize the metrics of
Petition 870190111033, of 10/31/2019, p. 57/121
53/88 frozen bit or frozen bit trajectory metrics based on one or more factors. In one example, decoder 225 can normalize frozen bit metrics based on a predefined scalar matrix of size NK, where each value in the matrix is used to normalize a frozen bit metric or frozen path metric calculated at a bit location corresponding frozen. In some cases, each value in the scalar matrix that corresponds to a frozen bit location may depend on reliability information for the frozen bit location. In this way, decoder 225 can normalize frozen bit metrics based on reliability information for each frozen bit location in the polar code, and normalization can be based on the values of N and K. The reliability information can be, for example, example, polarization weight, generator weight or the like.
[0078] In another example, decoder 225 can normalize frozen bit metrics or frozen bit trajectory metrics based on an aggregate of LLR magnitudes for the received polar coded code word. In yet another example, decoder 225 can normalize frozen bit path metrics based on various frozen bit locations used to generate frozen bit path metrics (for example, including an evaluated frozen bit location and bit locations frozen data used to generate frozen bit trajectory metrics). That is, normalization can represent the accumulation of frozen bit metrics as the frozen bit path metrics are updated for each frozen bit location
Petition 870190111033, of 10/31/2019, p. 58/121
54/88 in vector I. Additionally, frozen bit metrics or frozen bit trajectory metrics can be normalized based on a combination of the above factors.
[0079] In block 540, decoder 225 can determine if there are additional frozen bits remaining in a polar code and, if there are remaining frozen bits, decoder 225 can identify the bit location of the next frozen bit in block 545, and repeat the procedures described above starting at block 510. If there are no more frozen bits in the polar code, decoder 225 can terminate frozen bit processing at block 550. The techniques described in this document may allow decoder 225 to finish a decoding procedure early if a corrupted transmission is received or if a device receives pure noise.
[0080] Figure 6 shows a block diagram 600 of a wireless device 605 that supports removal based on frozen bits and early termination for polar decoding in accordance with various aspects of the present disclosure. The wireless device 605 can be an example of aspects of an UE 115 or base station 105 as described in this document. The wireless device 605 can include receiver 610, communications manager 615 and transmitter 620. The wireless device 605 can also include a processor. Each of these components can be in communication with each other (for example, through one or more buses).
[0081] The 610 receiver can receive information such as packages, user data or control information
Petition 870190111033, of 10/31/2019, p. 59/121
55/88 associated with several information channels (for example, control channels, data channels and information related to the removal of frozen bits and early termination for polar decoding, etc.). The information can be passed on to other components of the device. The receiver 610 can be an example of aspects of the transceiver 935 described with reference to Figure 9. The receiver 610 can use a single antenna or a set of antennas.
[0082] Communications manager 615 can be an example of aspects of communications manager 915 described with reference to Figure 9. Communications manager 615 and / or at least some of its various subcomponents can be deployed in hardware, software run by a processor, firmware or any combination thereof. If deployed in software run by a processor, the functions of the 615 communications manager and / or at least some of its various subcomponents can be performed by a general purpose processor, a digital signal processor (DSP), an application integrated circuit specifies (ASIC), a field programmable gate array (FPGA) or other programmable logic device, transistor logic or discrete gate, discrete hardware components or any combination thereof designed to perform the functions described in the present disclosure.
[0083] The communications manager 615 and / or at least some of its various subcomponents can be physically located in different positions, which include being distributed so that the portions of functions are
Petition 870190111033, of 10/31/2019, p. 60/121
56/88 implanted in different physical locations by one or more physical devices. In some instances, the communications manager 615 and / or at least some of its subcomponents may be a separate and separate component, according to various aspects of the present disclosure. In other examples, the communications manager 615 and / or at least some of its various subcomponents can be combined with one or more other hardware components, including, but not limited to, an I / O component, a transceiver, a server network, another computing device, one or more other components described in the present disclosure, or a combination thereof, according to various aspects of the present disclosure.
[0084] Communications manager 615 can, in combination with receiver 610, receive a candidate code word via a communication channel. Communications manager 615 can then identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the associated decoding hypothesis a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations in the polar code that corresponds to a plurality of frozen bits, perform a decoding process for the candidate code based, at least in part, on the identified decoding hypothesis, the decoding process including, for each frozen bit location of at least a subset of the set of bit locations
Petition 870190111033, of 10/31/2019, p. 61/121
57/88 frozen, determine frozen bit path metrics for a set of decoding paths based on bit metrics for the set of decoding paths for each frozen bit location and those prior to at least the subset of the location set frozen bit independent of bit metrics for the set of information bit locations, and discard a subset of the set of decoding paths based on comparisons between the frozen bit path metrics for each of the set of path paths. decoding and a threshold frozen bit trajectory metric, and determining whether to process the information bits of the candidate codeword based on a result of the decoding process.
[0085] Additionally, the communications manager 615 can, in combination with the receiver 610, receive a candidate code word that has a code word length through a communication channel. Communications manager 615 can then identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code that has a plurality of bit locations, a decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits, initiate a decoding process for the candidate code word, the decoding process being carried out in accordance with the
Petition 870190111033, of 10/31/2019, p. 62/121
58/88 code word length and decoding hypothesis, and determining whether the decoding process ends as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of metric information from bits associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the assumption of decoding.
[0086] The transmitter 620 can transmit signals generated by other components of the device. In some examples, transmitter 620 can be colocalized with a receiver 610 on a transceiver module. For example, transmitter 620 may be an example of aspects of transceiver 935 described with reference to Figure 9. Transmitter 620 may use a single antenna or set of antennas.
[0087] Figure 7 shows a block diagram 700 of a wireless device 705 that supports removal based on frozen bits and early termination for polar decoding in accordance with various aspects of the present disclosure. The wireless device 705 can be an example of aspects of a wireless device 605, an UE 115 or base station 105 as described with reference to Figure 6. The wireless device 705 can include receiver 710, communications manager 715 and transmitter 720. The 705 wireless device can also include a processor. Each of these components can be in communication with each other (for example, through one or more buses).
Petition 870190111033, of 10/31/2019, p. 63/121
59/88
[0088] Receiver 710 can receive information such as packets, user data or control information associated with various information channels (for example, control channels, data channels and information related to the removal of frozen bits and early termination for polar decoding, etc.). The information can be passed on to other components of the device. Receiver 710 can be an example of aspects of transceiver 935 described with reference to Figure 9. Receiver 710 can use a single antenna or set of antennas.
[0089] Communications manager 715 may be an example of aspects of communications manager 915 described with reference to Figure 9. Communications manager 715 may include decoder 725 and information bit processor 745. Decoder 725 may include the decoding hypothesis identifier 730, decoding metrics component 735 and decoding path manager 740. Communications manager 715 can, in combination with receiver 710, receive a candidate code word via a communication channel. The decoding hypothesis identifier 730 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that correspond to
Petition 870190111033, of 10/31/2019, p. 64/121
60/88 a plurality of frozen bits.
[0090] Decoder 725 can then perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis. In some cases, the decoding process may include functions performed by the decoding metrics component 735 and the decoding path manager 740 (for example, for each frozen bit location of at least a subset of the frozen bit location set) . In particular, the decoding metrics component 735 can determine frozen bit path metrics for a set of decoding paths based on bit metrics for the set of decoding paths for each frozen bit location and those of at least previous ones. the subset of the set of frozen bit locations and independent of bit metrics for the set of information bit locations.
[0091] The decoding path manager 740 can then discard a subset of the set of decoding paths based on comparisons between the frozen bit path metrics for each of the set of decoding paths and a path metric frozen bit threshold. In some cases, the 740 decode path manager may discard a subset of the decode path set based on comparisons between the bit metrics for the set of decode paths for each frozen bit location and a threshold bit metric. In some cases, for each location
Petition 870190111033, of 10/31/2019, p. 65/121
61/88 frozen bit, frozen bit trajectory metrics are determined based on a sum of the bit metrics for each frozen bit location and those prior to at least the subset of the frozen bit location set. The information bit processor 745 can then determine whether to process the information bits based on a result of the decoding process.
[0092] Communications manager 715 can also, in combination with receiver 710, receive a candidate code word that has a code word length through a communication channel. The decoding hypothesis identifier 730 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits. The decoder 725 can then initiate a decoding process for the candidate code word, the decoding process being carried out according to the code word length and the decoding hypothesis. The communications manager 715 can then determine whether the decoding process ends as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the
Petition 870190111033, of 10/31/2019, p. 66/121
62/88 plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the decoding hypothesis.
[0093] The transmitter 720 can transmit signals generated by other components of the device. In some examples, transmitter 720 can be colocalized with a receiver 710 on a transceiver module. For example, transmitter 720 can be an example of aspects of transceiver 935 described with reference to Figure 9. Transmitter 720 can use a single antenna or set of antennas.
[0094] Figure 8 shows a block diagram 800 of a communications manager 815 that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure. Communications manager 815 can be an example of aspects of a communications manager 615, communications manager 715 or communications manager 915 described with reference to Figures 6, 7 and 9. Communications manager 815 may include the decoder 820 , information bit processor 840, bit metric normalization component 845, path metric normalization component 850, path selector 855, and early termination manager 860. Decoder 820 may include decoding hypothesis identifier 825, decoding metrics component 830 and decoding path manager 835. Each of these modules can communicate, directly or indirectly, with each other (for example, through one or more buses).
Petition 870190111033, of 10/31/2019, p. 67/121
63/88
[0095] The communications manager 815 can, in combination with a receiver, receive a candidate code word through a communication channel. The decoding hypothesis identifier 825 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits.
[0096] Decoder 820 can then perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis. In some cases, the decoding process may include functions performed by the decoding metrics component 830 and the decoding path manager 835 (for example, for each frozen bit location of at least a subset of the frozen bit location set) . In particular, the decoding metrics component 830 can determine frozen bit path metrics for a set of decoding paths based on bit metrics for the set of decoding paths for each frozen bit location and those of at least previous ones. the subset of the set of frozen bit locations and independent of bit metrics for the set of information bit locations. THE
Petition 870190111033, of 10/31/2019, p. 68/121
64/88 decode path manager 835 can then discard a subset of the set of decode paths based on comparisons between the frozen bit path metrics for each of the set of decode paths and a path path metric. frozen bit threshold. In some cases, the decoding path manager 835 may discard a subset of the set of decoding paths based on comparisons between the bit metrics for the set of decoding paths for each frozen bit location and a threshold bit metric.
[0097] In some cases, for each frozen bit location, the frozen bit trajectory metrics can be determined based on a sum of the bit metrics for each frozen bit location and those from at least the subset of the set of frozen bit locations. In some cases, the 830 decoding metrics component can determine first candidate path metrics for each of the set of decoding paths that are not discarded. In some cases, the decoding metrics component 830 may, for an information bit location after each frozen bit location, determine second candidate path metrics for an extended set of decode paths based on the first candidate path metrics and in the bit metrics for the information bit location. In such cases, the path selector 855 can select a subset of the extended set of decoding paths based on the candidate second path metrics. In some
Petition 870190111033, of 10/31/2019, p. 69/121
In 65/88 cases, the subset of the plurality of frozen bit locations is selected for evaluation based, at least in part, on the assumption of decoding or reliability information for the plurality of frozen bit locations.
[0098] The information bit processor 840 can then determine whether to process the information bits based on a result of the decoding process. In some cases, the information bit processor 840 may determine, subsequent to the decoding process for all of the set of frozen bit locations, that at least one decoding path within the set of decoding paths is not discarded, identifying the information bits based on at least one decoding path, and processing the information bits based on identification. In other cases, the information bit processor 840 can determine that all decoding paths of the set of decoding paths are discarded and the early termination manager 860 can finish decoding the codeword.
[0099] The 845 bit metric normalization component can normalize bit metrics determined by the 830 decoding metrics component. For example, the 845 bit metric normalization component can normalize bit metrics determined by the decoding metrics component. 830 based on reliability information for each frozen bit location or an aggregate of LLR magnitudes for the codeword. The 850 trajectory metric normalization component
Petition 870190111033, of 10/31/2019, p. 70/121
66/88 can normalize trajectory metrics determined by the decoding metrics component 830. For example, the trajectory metrics normalization component 850 can normalize frozen bit trajectory metrics based on multiple bit locations that correspond to each location of frozen bit and those earlier among at least the subset of the set of frozen bit locations, with the reliability information for bit locations corresponding to each frozen bit location and to those earlier among at least the subset of the set of frozen locations. frozen bit, or an aggregate of LLR magnitudes for the code word.
[00100] The communications manager 815 can also, in combination with a receiver, receive a candidate code word that has a code word length through a communication channel. The decoding hypothesis identifier 825 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits. The decoder 820 can then initiate a decoding process for the candidate code word, the decoding process being carried out according to the code word length and the decoding hypothesis. The 860 early termination manager can
Petition 870190111033, of 10/31/2019, p. 71/121
67/88 determine whether the decoding process ends as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset of the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the decoding hypothesis. In some cases, the decoding process comprises successively decoding the plurality of bit locations. In such cases, the decoding process may comprise a successive cancellation (SC) decoding process or an SCL decoding process.
[00101] Figure 9 shows a diagram of a system 900 that includes a device 905 that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure. Device 905 can be an example of or include components of wireless device 605, wireless device 705 or an UE 115, as described above, for example, with reference to Figures 6 and 7. Device 905 can include components for communications bidirectional voice and data systems that include components for transmitting and receiving communications, including the EU communications manager 915, processor 920, memory 925, software 930, transceiver 935, antenna 940 and I / O controller 945. These components can be electronic communication through one or more buses (for example, the 910 bus). Device 905 can communicate wirelessly with one or more base stations 105.
Petition 870190111033, of 10/31/2019, p. 72/121
68/88
[00102] The 920 processor may include an intelligent hardware device (for example, a general purpose processor, a DSP, a central processing unit (CPU), a microcontroller, an ASIC, an FPGA, a programmable logic device, a discrete transistor or gate logic component, a discrete hardware component or any combination thereof). In some cases, the 920 processor can be configured to operate a memory array using a memory controller. In other cases, a memory controller can be integrated into a 920 processor. The 920 processor can be configured to execute computer-readable instructions stored in memory to perform various functions (for example, functions or tasks that support frozen bit removal) and early termination for polar decoding).
[00103] Memory 925 may include random access memory (RAM) and read-only memory (ROM). The 925 memory can store computer-executable, computer-readable 930 software that includes instructions that, when executed, cause the processor to perform various functions described in this document. In some cases, the 925 memory may contain, among other things, a basic input / output system (BIOS) that can control basic hardware or software operation such as interaction with peripheral devices or components.
[00104] The 930 software may include code to implement aspects of the present disclosure, including code to support removal of frozen bits and
Petition 870190111033, of 10/31/2019, p. 73/121
69/88 early termination for polar decoding. The 930 software can be stored on non-transitory, computer readable media such as system memory or other memory. In some cases, the 930 software may not be directly executable by the processor, but it can cause a computer (for example, when compiled and run) to perform functions described in this document.
[00105] Transceiver 935 can communicate in a bidirectional way through one or more antennas, wired or wireless links, as described above. For example, transceiver 935 can represent a wireless transceiver and can communicate bidirectionally with another wireless transceiver. The 935 transceiver may also include a modem to modulate the packets and provide the modulated packets to the antennas for transmission and to demodulate packets received from the antennas.
[00106] In some cases, the wireless device may include a single 940 antenna. However, in other cases, the device may have more than one 940 antenna, which may be able to simultaneously transmit or receive multiple wireless transmissions.
[00107] The I / O controller 945 can manage input and output signals for the 905 device. The I / O controller 945 can also manage peripherals not integrated in the 905 device. In some cases, the I / O controller 945 it can represent a physical port or connection to an external peripheral. In some cases, the 945 I / O controller may use an operating system such as iOS®, ANDROID®, MS-DOS®, MS-WINDOWS®, OS / 2®, UNIX®, LINUX® or another known operating system. In others
Petition 870190111033, of 10/31/2019, p. 74/121
In 70/88 cases, the 945 I / O controller can represent or interact with a modem, keyboard, mouse, touch screen or similar device. In some cases, the 945 I / O controller can be deployed as part of a processor. In some cases, a user can interact with the 905 device through the 945 I / O controller or through hardware components controlled by the 945 I / O controller.
[00108] Figure 10 shows a diagram of a system 1000 that includes a device 1005 that supports removal based on frozen bits and early termination for polar decoding according to various aspects of the present disclosure. Device 1005 can be an example of or include components of wireless device 605, wireless device 705 or a base station 105, as described above, for example, with reference to Figures 6 and 7. Device 1005 can include components for bidirectional data and voice communications that include components for transmitting and receiving communications, including base station communications manager 1015, processor 1020, memory 1025, software 1030, transceiver 1035, antenna 1040, network communications manager 1045, and network manager interstation 1050 communications. These components can be in electronic communication via one or more buses (for example, the 1010 bus). The device 1005 can communicate wirelessly with one or more UEs 115.
[00109] The 1020 processor can include an intelligent hardware device (for example, a general purpose processor, a DSP, a CPU, a
Petition 870190111033, of 10/31/2019, p. 75/121
71/88 microcontroller, an ASIC, an FPGA, a programmable logic device, a discrete transistor or gate logic component, a discrete hardware component or any combination thereof). In some cases, the 1020 processor can be configured to operate a memory array using a memory controller. In other cases, a memory controller can be integrated into a 1020 processor. The 1020 processor can be configured to execute computer-readable instructions stored in memory to perform various functions (for example, functions or tasks that support bit-based removal frozen and early termination for polar decoding).
[00110] Memory 1025 can include RAM and ROM. The 1025 memory can store 1030 computer-readable, computer-readable software that includes instructions that, when executed, cause the processor to perform various functions described in this document. In some cases, memory 1025 may contain, among other things, a BIOS that can control the operation of basic hardware or software such as interaction with peripheral devices or components.
[00111] Software 1030 may include code to implement aspects of the present disclosure, including code to support removal based on frozen bits and early termination for polar decoding. The 1030 software can be stored on non-transitory, computer-readable media such as system memory or other memory. In some cases, 1030 software may not be directly executable by the processor, but it can cause a computer (for example, when compiled and
Petition 870190111033, of 10/31/2019, p. 76/121
72/88 executed) perform functions described in this document.
[00112] Transceiver 1035 can communicate in a bidirectional way through one or more antennas, wired or wireless links, as described above. For example, transceiver 1035 can represent a wireless transceiver and can communicate bidirectionally with another wireless transceiver. Transceiver 1035 may also include a modem to modulate the packets and provide the modulated packets to the antennas for transmission and to demodulate packets received from the antennas. [00113] In some cases, the wireless device may include a single 1040 antenna. However, in other cases, the device may have more than one 1040 antenna, which may be able to simultaneously transmit or receive multiple wireless transmissions.
[00114] The network communications manager 1045 can manage communications with the main network (for example, through one or more wired backhaul links). For example, the network communications manager 1045 can manage the transfer of data communications to client devices, such as one or more UEs 115.
[00115] The interstation 1050 communications manager can manage communications with another base station 105, and may include a controller or programmer to control communications with UEs 115 in cooperation with other 105 base stations. For example, the interstation 1050 communications manager can coordinate scheduling for transmissions to UEs 115 for various interference mitigation techniques such as junction transmission or beam formation. In some
Petition 870190111033, of 10/31/2019, p. 77/121
73/88 examples, the interstitial communications manager 1050 can provide an X2 interface within an LTE / LTE-A wireless network technology to provide communication between base stations 105.
[00116] Figure 11 shows a flowchart that illustrates a method 1100 for removing frozen bits and early termination for polar decoding according to various aspects of the present disclosure. Method 1100 operations can be deployed by an UE 115 or base station 105 or its components as described in this document. For example, method 1100 operations can be performed by a communications manager as described with reference to Figures 6 to 8. In some examples, an UE 115 or base station 105 can execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the UE 115 or base station 105 can perform aspects of the functions described below using special purpose hardware.
[00117] In block 1105, UE 115 or base station 105 can receive a candidate code word through a communication channel. Block 1105 operations can be performed according to the methods described in this document. In certain examples, aspects of the operations of block 1105 can be performed by a receiver as described with reference to Figures 6 to 8.
[00118] In block 1110, UE 115 or base station 105 can identify a decoding hypothesis to decode the candidate code word based, at least
Petition 870190111033, of 10/31/2019, p. 78/121
74/88 in part, in the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations in the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code corresponding to a plurality of frozen bits. Block 1110 operations can be carried out according to the methods described in this document. In certain examples, aspects of the operations of block 1110 can be performed by a decoding hypothesis identifier as described with reference to Figures 6 to 8.
[0119] In block 1115, the UE 115 or the base station 105 can perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least a subset of the plurality of frozen bit locations, determine frozen bit path metrics for a set of decoding paths based, at least in part, on bit metrics for the path set of decoding for each frozen bit location and previous ones of at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discarding a subset of the set of decoding paths with based, at least in part, on comparisons between frozen bit trajectory metrics for each of the set of decoding trajectories and a metric of
Petition 870190111033, of 10/31/2019, p. 79/121
75/88 frozen bit path threshold. Block 1115 operations can be carried out according to the methods described in this document. In certain examples, the operations aspects of block 1115 can be performed by a decoder, decoding metrics component and a decoding path manager as described with reference to Figures 6 to 8.
[0120] In block 1120, the UE 115 or base station 105 can determine whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process. Block 1120 operations can be carried out according to the methods described in this document. In certain examples, aspects of the operations of block 1120 can be performed by a communications manager as described with reference to Figures 6 to 8.
[0121] Figure 12 shows a flow chart illustrating a method 1200 for removing frozen bits and early terminating for polar decoding according to various aspects of the present disclosure. Method 1200 operations can be deployed by an UE 115 or base station 105 or its components as described in this document. For example, method 1200 operations can be performed by a communications manager as described with reference to Figures 6 to 8. In some examples, an UE 115 or base station 105 can execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the UE 115
Petition 870190111033, of 10/31/2019, p. 80/121
76/88 or the base station 105 can perform aspects of the functions described below using special purpose hardware. [0122] In block 1205, the UE 115 or base station 105 can receive a candidate code word via a communication channel. Block 1205 operations can be performed according to the methods described in this document. In certain examples, aspects of the operations of block 1205 can be performed by a receiver as described with reference to Figures 6 to 8.
[0123] In block 1210, UE 115 or base station 105 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded using a polar code, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits. Block 1210 operations can be performed according to the methods described in this document. In certain examples, aspects of operations in block 1210 can be performed by a decoding hypothesis identifier as described with reference to Figures 6 to 8.
[0124] In block 1215, the UE 115 or base station 105 can perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least a subset of the plurality
Petition 870190111033, of 10/31/2019, p. 81/121
77/88 of frozen bit locations, determine frozen bit path metrics for a set of decoding paths based, at least in part, on bit metrics for the set of decoding paths for each frozen bit location and those previous of at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, discard a subset of the set of decoding paths based on comparisons between the bit metrics for the set decoding paths for each frozen bit location with a threshold bit metric, and discarding a subset of the set of decoding paths based, at least in part, on comparisons between the frozen bit path metrics for each of the set of decoding paths and a threshold frozen bit path metric. Block 1215 operations can be performed according to the methods described in this document. In certain examples, aspects of block 1215 operations can be performed by a decoder, decoding metrics component and decoding path manager as described with reference to Figures 6 to 8.
[0125] In block 1220, the UE 115 or base station 105 can determine whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process. Block 1220 operations can be performed according to the methods described in this document. In certain examples, aspects of the 1220 block operations can be performed
Petition 870190111033, of 10/31/2019, p. 82/121
78/88 by a communications manager as described with reference to Figures 6 to 8. [0126] Figure 13 shows a flowchart that illustrates a 1300 method for removing frozen bits and early terminating for polar decoding according to several aspects of the present revelation. Method 1300 operations can be deployed by an UE 115 or base station 105 or its components as described in this document. For example, method 1300 operations can be performed by a communications manager as described with reference to Figures 6 to 8. In some examples, an UE 115 or base station 105 can execute a set of codes to control the functional elements of the device to perform the functions described below. Additionally or alternatively, the UE 115 or base station 105 can perform aspects of the functions described below using special purpose hardware.
[0127] In block 1305, the UE 115 or base station 105 can receive a candidate code word that has a code word length through a communication channel. Block 1305 operations can be carried out according to the methods described in this document. In certain examples, aspects of the operations of block 1305 can be performed by a receiver as described with reference to Figures 6 to 8.
[0128] In block 1310, UE 115 or base station 105 can identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is coded using a polar code that has a set of locations
Petition 870190111033, of 10/31/2019, p. 83/121
79/88 bit, the decoding hypothesis associated with a set of information bit locations of the polar code that corresponds to a set of information bits and a set of frozen bit locations of the polar code that corresponds to a set of frozen bits . Block 1310 operations can be carried out according to the methods described in this document. In certain examples, aspects of the block 1310 operations can be performed by a decoding hypothesis identifier as described with reference to Figures 6 to 8.
[0129] In block 1315, the UE 115 or base station 105 can initiate a decoding process for the candidate code word, the decoding process being carried out according to the code word length and the hypothesis of decoding. Block 1315 operations can be carried out according to the methods described in this document. In certain examples, aspects of block 1315 operations can be performed by a decoder as described with reference to Figures 6 to 8.
[0130] In block 1320, the UE 115 or base station 105 can determine whether the decoding process ends as it has failed to obtain the set of information bits based, at least in part, on the evaluation of information from bit metrics associated with a subset of the bit location set, the subset of the bit location set selected from the frozen bit location set based, at least in part, on the decoding hypothesis. Block 1320 operations can be carried out according to the methods described in the present
Petition 870190111033, of 10/31/2019, p. 84/121
80/88 document. In certain examples, the operations aspects of block 1320 can be performed by an early termination manager as described with reference to Figures 6 to 8.
[0131] It should be noted that the methods described above describe possible deployments, and that operations and steps can be rearranged or otherwise modified and that other deployments are possible. In addition, aspects from two or more methods can be combined.
[0132] The techniques described in this document can be used for various wireless communication systems, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA) , orthogonal frequency division multiple access (OFDMA), single carrier frequency division multiple access (SC-FDMA) and other systems. The terms system and network are often used interchangeably. A code division multiple access system (CDMA) can implement radio technology such as CDMA2000, Universal Terrestrial Radio Access (UTRA), etc. CDMA2000 covers the IS-2000, IS-95 and IS-856 standards. IS2000 versions can be commonly referred to as CDMA2000 IX, IX, etc. IS-856 (TIA-856) is commonly referred to as CDMA2000 IxEV-DO, High Rate Packet Data (HRPD), etc. UTRA includes Broadband CDMA (WCDMA) and other CDMA variants. The TDMA system can deploy radio technology like the Global System for Mobile Communications (GSM).
[0133] An OFDMA system can implement a
Petition 870190111033, of 10/31/2019, p. 85/121
81/88 radio technology such as Ultra-Mobile Broadband (UMB), UTRA Evolved (E-UTRA), Institute of Electrical and Electronic Engineers (IEEE) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM , etc. UTRA and E-UTRA are part of the Universal Mobile Telecommunication System (UMTS). LTE and LTE-A are versions of UMTS that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A, R and GSM are described in documents from the organization called the Third Generation Partnership Project (3GPP). CDMA2000 and UMB are described in the documents of an organization called the Third Generation Partnership Project 2 (3GPP2). The techniques described in this document can be used for the radio systems and technologies mentioned above, as well as other radio systems and technologies. While aspects of an LTE or NR system can be described for the purpose of exemplification and LTE or NR terminology can be used in much of the description, the techniques described in this document are applicable in addition to LTE or NR applications. .
[0134] In LTE / LTE-A networks, including the networks described in this document, the term evolved B-node (eNB) can generally be used to describe base stations. The wireless communication system or systems described in this document may include a heterogeneous NR or LTE / LTE-A network in which different types of eNBs provide coverage for different geographic regions. For example, each next generation eNB, Node B (gNB) or base station can provide communication coverage for a macrocell, a small cell or other cell types. The term cell that can be used to describe
Petition 870190111033, of 10/31/2019, p. 86/121
82/88 a base station, a carrier or component carrier associated with a base station, or a coverage area (eg, sector, etc.) of a carrier or base station, depending on the context.
[0135] Base stations may include or may be mentioned by those skilled in the art as a transceiver base station, a radio base station, an access point, a radio transceiver, a NodeB, eNodeB (eNB) , gNB, domestic NodeB, a domestic eNodeB or some other suitable terminology. The geographic coverage area for a base station can be divided into sectors that make up only a portion of the coverage area. The wireless communications systems or systems described in this document may include base stations of different types (for example, macrocell or small cell base stations). The UEs described in this document may be able to communicate with various types of base stations and network equipment that include macroeNBs, small cell eNBs, gNBs, relay base stations and the like. There may be overlapping geographic coverage areas for different technologies.
[0136] A macrocell generally covers a relatively large geographical area (for example, several kilometers in a radius) and can allow unrestricted access by UEs with service subscriptions with the network provider. A small cell is a lower power base station, compared to a macrocell, which can operate in the same or different frequency bands (for example, licensed, unlicensed, etc.) as macrocells. Small cells can include picocells, femtocells and
Petition 870190111033, of 10/31/2019, p. 87/121
83/88 microcells according to several examples. A picocell, for example, can cover a small geographical area and can allow unrestricted access by UEs with service subscriptions with the network provider. A femtocell can also cover a small geographical area (for example, a residence) and can provide restricted access by UEs that have an association with the femtocell (for example, UEs in a closed subscriber group (CSG), UEs for users residence and the like). An eNB for a macrocell can be referred to as an eNB macro. A small cell eNB can be referred to as a small cell eNB, an eNB peak, an eNB femto, or a domestic eNB. An eNB can support one or multiple (for example, two, three, four and the like) cells (for example, component carriers).
[0137] The wireless communications systems or systems described in this document may support synchronous or asynchronous operation. For synchronous operation, base stations can have similar frame timing and transmissions from different base stations can be approximately time aligned. For asynchronous operation, base stations may have different frame timing and transmissions from different base stations may not be time-aligned. The techniques described in this document can be used for asynchronous or synchronous operations.
[0138] The downlink transmissions described in this document can also be called progressive link transmissions, while the uplink transmissions can also be called
Petition 870190111033, of 10/31/2019, p. 88/121
84/88 of backward link transmissions. Each communication link described in this document, which includes, for example, wireless communication system 100 and 200 of Figures 1 and 2, can include one or more carriers, where each carrier can be a signal consisting of multiple subcarriers (for example , waveform signals of different frequencies).
[0139] The description presented above in this document, together with the accompanying drawings, describes exemplary configurations and does not represent all examples that can be implemented or that are within the scope of the claims. The term exemplifier, used in this document, means that it serves as an example, occurrence or illustration, and not preferential or advantageous over other examples. The detailed description includes specific details for the purpose of providing an understanding of the techniques described. These techniques, however, can be practiced without these specific details. In some cases, well-known structures and devices are shown in the form of a block diagram to avoid hiding the concepts of the examples described.
[0140] In the attached Figures, components or similar characteristics can have the same reference identification. In addition, several components of the same type can be distinguished by following the reference mark with a dash and a second mark that distinguishes between similar components. If only the first reference identification is used in the specification, the description is applicable to any of the
Petition 870190111033, of 10/31/2019, p. 89/121
85/88 similar components that have the same first reference identification regardless of the second reference identification.
[0141] The information and signals described in this document can be represented using any one of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols and integrated circuits that can be mentioned throughout the above description can be represented by voltages, currents, electromagnetic waves, particles or magnetic fields, particles or optical fields or any combination thereof.
[0142] The various blocks and illustrative modules described in conjunction with the disclosure in this document can be deployed or performed with a general purpose processor, DSP, ASIC, FPGA or other programmable logic device, transistor or gate logic discrete, discrete hardware components or any combination thereof designed to perform the functions described in this document. A general purpose processor can be a microprocessor, however, alternatively the processor can be any conventional processor, controller, microcontroller or state machine. A processor can also be deployed as a combination of computing devices (for example, a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core or any other type of configuration).
Petition 870190111033, of 10/31/2019, p. 90/121
86/88
[0143] The functions described in this document can be implemented in hardware, software executed by a processor, firmware or any combination thereof. If implemented in software run by a processor, the functions can be stored in or transmitted as one or more instructions or code on a computer-readable medium. Other examples and deployments are covered by the scope of the disclosure and the attached claims. For example, due to the nature of software, the functions described above can be implemented using software executed by a processor, hardware, firmware, wired connection or combinations of any of them. Role deployment features can also be physically located in various positions, including being distributed so that portions of roles are deployed in different physical locations. In addition, as used in this document, including in the claims, or as used in a list of items (for example, a list of items preceded by a sentence such as at least one among or one or more among) indicates an inclusive list of so that, for example, a list of at least one of A, B or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). In addition, as used in this document, the phrase based on should not be interpreted as a reference to a closed set of conditions. For example, an exemplary step that is described as based on condition A can be based on either condition A or condition B without departing from the scope of the present disclosure. In other words, as used in this document, the phrase
Petition 870190111033, of 10/31/2019, p. 91/121
87/88 based on should be interpreted in the same way as the phrase based, at least in part, on.
[0144] Computer-readable media includes both non-transitory computer storage media and communication media that include any media that facilitates the transfer of a computer program from one location to another. A non-transitory storage media can be any available media that can be accessed by a general-purpose or specific-purpose computer. As an example, and not a limitation, non-transitory computer-readable media may comprise RAM, ROM, electrically erasable, programmable read-only memory (EEPROM), compact disc (CD-ROM) or other optical disc storage, storage magnetic disk or other magnetic storage devices or any other non-transitory medium that can be used to load or store medium of desired program code in the form of instructions or data structures and that can be accessed by a special purpose computer or general purpose, or a special purpose or general purpose processor. In addition, any connection is properly called a computer-readable medium. For example, if the software is transmitted from a website, server or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wireless technologies such as infrared , radio and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL or wireless technologies like infrared, radio and microwave
Petition 870190111033, of 10/31/2019, p. 92/121
88/88 are included in the media definition. The magnetic disk and optical disk, as used in this document, include CD, laser disk, optical disk, digital versatile disk (DVD), floppy disk and Blu-ray disk, in which magnetic disks normally reproduce data in a magnetic way, while optical discs reproduce data optically with lasers. The combinations of the above are also included in the scope of computer-readable media.
[0145] The description in this document is provided to enable an element skilled in the art to produce or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art and the generic principles defined in this document can be applied to other variations without departing from the scope of the disclosure. Accordingly, the disclosure is not intended to be limited to the examples and designs described in this document, but must be compatible with the broadest scope consistent with the principles and innovative features disclosed in this document.

权利要求:
Claims (28)
[1]
1. Method for wireless communications comprising:
receiving a candidate code word through a communication channel;
identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of information bit locations the polar code that corresponds to a plurality of bits of information and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits;
perform a decoding process for the candidate codeword based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least a subset of the plurality of bit locations frozen:
determine frozen bit trajectory metrics for a set of decoding trajectories based, at least in part, on bit metrics for the set of decoding trajectories for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent of bit metrics for the plurality of information bit locations, and discard a subset of the trajectory set
Petition 870190111033, of 10/31/2019, p. 94/121
[2]
2/11 decoding based, at least in part, on comparisons between frozen bit path metrics for each of the set of decoding paths and a threshold frozen bit path metric; and determining whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process.
A method according to claim 1, in which the decoding process additionally comprises, for each frozen bit location:
discard a subset of the set of decode paths based, at least in part, on comparisons between the bit metrics for the set of decode paths for each frozen bit location and a threshold bit metric.
[3]
3. Method according to claim 2, in which the bit metrics for the set of decoding paths for each frozen bit location are based, at least in part, on reliability information for each frozen bit location or an aggregate of logarithmic likelihood ratio (LLR) magnitudes for the candidate code word.
[4]
4. Method according to claim 1, in which the determination of the frozen bit trajectory metrics for the set of decoding trajectories further comprises:
determine bit trajectory metrics
Petition 870190111033, of 10/31/2019, p. 95/121
3/11 frozen based, at least in part, on several bit locations that correspond to each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations, reliability information for corresponding bit locations to each frozen bit location and to those previous to at least the subset of the plurality of frozen bit locations, or an aggregate of logarithmic likelihood ratio (LLR) magnitudes for the candidate code word.
[5]
5. Method according to claim 1, in which, for each frozen bit location, the frozen bit path metrics are determined based, at least in part, on a sum of the bit metrics for each bit location frozen and previous ones among at least the subset of the plurality of frozen bit locations.
[6]
A method according to claim 1, wherein carrying out the decoding process further comprises, for each frozen bit location:
determine first candidate path metrics for each of the set of decoding paths that are not discarded.
[7]
A method according to claim 6, wherein carrying out the decoding process further comprises, for an information bit location after each frozen bit location:
determine second candidate path metrics for an extended set of decoding trajectories based, at least in part, on the first
Petition 870190111033, of 10/31/2019, p. 96/121
One thousand candidate path metrics and bit metrics for the information bit location; and selecting a subset of the extended set of decoding paths based, at least in part, on the candidate second path metrics.
[8]
A method according to claim 1, wherein determining the processing of information bits comprises:
determine that all decoding paths of the set of decoding paths are discarded; and
Finish decoding the candidate code word.
[9]
A method according to claim 1, wherein determining the processing of information bits comprises:
determine, subsequent to the decoding process for all of the plurality of frozen bit locations, that at least one decoding path within the set of decoding paths is not discarded;
identify the bits of information based, at least in part, on at least one decoding path; and processing the information bits based, at least in part, on identification.
[10]
10. The method of claim 1, wherein the subset of the plurality of frozen bit locations is
Petition 870190111033, of 10/31/2019, p. 97/121
5/11 selected for evaluation based, at least in part, on the decoding hypothesis or on the reliability information for the plurality of frozen bit locations.
[11]
11. Method for wireless communications comprising:
receiving a candidate code word that has a code word length through a communication channel;
identify a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of information bit locations of the polar code that corresponds to a plurality of information bits and a plurality of frozen bit locations of the polar code that corresponds to a plurality of frozen bits;
initiate a decoding process for the candidate code word, the decoding process being carried out according to the code word length and the decoding hypothesis; and determining whether to finish the decoding process as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations, the subset the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the assumption
Petition 870190111033, of 10/31/2019, p. 98/121
6/11 decoding.
[12]
A method according to claim 11, wherein the decoding process comprises successively decoding the plurality of bit locations.
[13]
13. The method of claim 12, wherein the decoding process comprises a successive cancellation (SC) decoding process.
[14]
14. The method of claim 12, wherein the decoding process comprises a successive cancellation list (SCL) decoding process.
[15]
15. Wireless communication device comprising:
means for receiving a candidate code word through a communication channel;
means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code, the decoding hypothesis associated with a plurality of bit locations polar code information corresponding to a plurality of information bits and a plurality of frozen bit locations of the polar code corresponding to a plurality of frozen bits;
means to perform a decoding process for the candidate code word based, at least in part, on the identified decoding hypothesis, the decoding process comprising, for each frozen bit location of at least a subset of the plurality of
Petition 870190111033, of 10/31/2019, p. 99/121
7/11 frozen bit locations:
determine frozen bit trajectory metrics for a set of decoding trajectories based, at least in part, on bit metrics for the set of decoding trajectories for each frozen bit location and those prior to at least the subset of the plurality of frozen bit locations and independent bit metrics for the plurality of information bit locations, and discard a subset of the set of decoding paths based, at least in part, on comparisons between the frozen bit path metrics for each one among the set of decoding paths and a threshold frozen bit path metric; and means for determining whether to process the information bits of the candidate code word based, at least in part, on a result of the decoding process.
[16]
16. Apparatus according to claim 15, wherein the means for carrying out the decoding process discards the subset of the set of decoding paths based, at least in part, on comparisons between the bit metrics for the set of paths decoding for each frozen bit location and a threshold bit metric.
[17]
17. Apparatus according to claim 16, in which the bit metrics for the set of decoding paths for each frozen bit location are based, at least in part, on reliability information for
Petition 870190111033, of 10/31/2019, p. 100/121
8/11 each frozen bit location or an aggregate of logarithmic likelihood ratio (LLR) magnitudes for the candidate code word.
[18]
An apparatus according to claim 15, which further comprises: means for determining frozen bit trajectory metrics based, at least in part, on several bit locations that correspond to each frozen bit location and those earlier among at least the subset of the plurality of frozen bit locations, reliability information for bit locations that correspond to each frozen bit location and those earlier among at least the subset of the plurality of frozen bit locations, or an aggregate of ratio magnitudes of logarithmic likelihood (LLR) for the candidate code word.
[19]
19. Apparatus according to claim 15, wherein, for each frozen bit location, the frozen bit path metrics are determined based, at least in part, on a sum of the bit metrics for each bit location frozen and previous ones among at least the subset of the plurality of frozen bit locations.
[20]
20. Apparatus according to claim 15, in which the means for carrying out the decoding process determines first candidate path metrics for each of the set of decoding paths that are not discarded.
[21]
21. Apparatus according to claim 20, wherein, for an information bit location after each location of
Petition 870190111033, of 10/31/2019, p. 101/121
9/11 bit frozen, the means to perform the decoding process determines second candidate path metrics for an extended set of decoding paths based, at least in part, on the first candidate path metrics and bit metrics for the location information bit and selects a subset of the extended set of decoding paths based, at least in part, on the candidate second path metrics.
[22]
22. Apparatus according to claim 15, the means of carrying out the decoding process determines that all decoding paths of the set of decoding paths are discarded and the decoding of the candidate code word ends.
[23]
23. Apparatus according to claim 15, wherein the means for carrying out the decoding process:
determines, subsequent to the decoding process for all of the plurality of frozen bit locations, that at least one decoding path of the set of decoding paths is not discarded;
identifies the bits of information based, at least in part, on at least one decoding path; and processes information bits based, at least in part, on identification.
[24]
24. Apparatus according to claim 15, wherein the subset of the plurality of frozen bit locations is selected for evaluation based, at least in part, on the
Petition 870190111033, of 10/31/2019, p. 102/121
10/11 decoding hypothesis or reliability information for the plurality of frozen bit locations.
[25]
25. A wireless communication apparatus comprising: means for receiving a candidate code word that has a code word length through a communication channel;
means for identifying a decoding hypothesis to decode the candidate code word based, at least in part, on the candidate code word that is encoded using a polar code that has a plurality of bit locations, the decoding hypothesis associated with a plurality of polar code information bit locations that corresponds to a plurality of information bits and a plurality of polar code frozen bit locations that correspond to a plurality of frozen bits;
means to start a decoding process for the candidate code word, the decoding process being carried out according to the length of the code word and the decoding hypothesis; and means to determine whether to finish the decoding process as it has failed to obtain the plurality of bits of information based, at least in part, on the evaluation of bit metric information associated with a subset of the plurality of bit locations , the subset of the plurality of bit locations selected from the plurality of frozen bit locations based, at least in part, on the decoding hypothesis.
[26]
26. Apparatus according to claim 25, in
Petition 870190111033, of 10/31/2019, p. 103/121
11/11 that the decoding process comprises successively decoding the plurality of bit locations.
[27]
27. Apparatus according to claim 26, wherein the decoding process comprises a successive cancellation (SC) decoding process.
[28]
Apparatus according to claim 26, wherein the decoding process comprises a successive cancellation list (SCL) decoding process.

类似技术:

---

公开号 | 公开日 | 专利标题

---

BR112019022853A2|2020-05-19|early termination and path removal based on frozen bits for polar decoding

---

BR112019019282A2|2020-04-14|assignment of parity bit channel for polar coding

---

JP2020520196A|2020-07-02|Reduced payload size ambiguity and false alarm rate for polar code

---

BR112019022779A2|2020-05-19|decoding the polar list with early termination

---

BR112019015016A2|2020-03-10|BROADCASTING CHANNEL CODING AND DECODING

---

JP2020511058A|2020-04-09|Mutual information based recursive polar code construction.

---

BR112019023659A2|2020-08-18|prioritization and early decoding of control fields for polar codes

---

KR20190138682A|2019-12-13|Dynamic Fixed Bits and Error Detection for Polar Codes

---

BR112019013035A2|2019-12-17|nested structure for building polar code using density evolution

---

JP2020524429A|2020-08-13|Construction of polar code for low latency decoding and false alarm rate reduction using multiple formats

---

BR112019022655A2|2020-05-19|polar codes for uplink control information

---

JPWO2018185896A1|2020-02-20|User terminal and wireless communication method

---

BR112019015616A2|2020-03-10|TERMINAL AND BASE STATION

---

BR112019021756A2|2020-05-05|downlink control channel structure in low latency systems

---

BR112019015661A2|2020-03-31|A LOW COMPLEXITY PUNISHMENT METHOD FOR LOW RATE POLAR CODES

---

BR112019027054A2|2020-06-30|providing protection for information released on demodulation reference signals |

---

WO2018232562A1|2018-12-27|Parity bits of polar code for early termination

---

BR112019023669A2|2020-06-02|EARLY TERMINATION OF SUCCESSIVE CANCELLATION LIST DECODING

---

BR112019018749A2|2020-04-07|building polar code based on mutual information

---

TWI756421B|2022-03-01|Frozen bits based pruning and early termination for polar decoding

---

TWI756434B|2022-03-01|Polar code construction for low-latency decoding and reduced false alarm rate with multiple formats

---

JP7026698B2|2022-02-28|Early termination of sequential removal list decryption

---

EP3796707A1|2021-03-24|User terminal and wireless base station

---

BR112019023004A2|2020-05-19|rate matching scheme for polar codes

---

BR112020009643A2|2020-11-10|uplink control information segmentation to polar codes

同族专利:

---

公开号 | 公开日

---

US20180323809A1|2018-11-08|

---

CA3059233A1|2018-11-08|

---

KR20200003157A|2020-01-08|

---

TW201907670A|2019-02-16|

---

US10742238B2|2020-08-11|

---

CN110574292A|2019-12-13|

---

JP2020520142A|2020-07-02|

---

WO2018204418A1|2018-11-08|

---

EP3619814A1|2020-03-11|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US20190260391A1|2016-11-11|2019-08-22|Telefonaktiebolaget Lm Ericsson |Error detection in communication systems using polar coded data transmission|

---

KR101856416B1|2017-02-28|2018-05-09|성균관대학교산학협력단|A method of low complexity scl decoding for polar codes and an apparatus thereof|US10523369B2|2017-01-09|2019-12-31|Qualcomm Incorporated|Mutual-information based recursive polar code construction|

---

WO2018126496A1|2017-01-09|2018-07-12|Qualcomm Incorporated|Bit allocation for encoding and decoding|

---

US10601450B2|2017-03-29|2020-03-24|Qualcomm Incorporated|List management for parallel operations of polar codes|

---

CN108809500B|2017-05-05|2020-12-22|华为技术有限公司|Coding method, device and equipment|

---

WO2018207155A2|2017-05-12|2018-11-15|Telefonaktiebolaget Lm Ericsson |Adaptive crc length for beam sweeping|

---

US10713113B2|2018-09-06|2020-07-14|Sabrina Barbato|Solid state drive implementing polar encoding and successive cancellation list decoding|

---

US10963342B2|2019-02-01|2021-03-30|Micron Technology, Inc.|Metadata-assisted encoding and decoding for a memory sub-system|

---

TWI731441B|2019-10-18|2021-06-21|國立清華大學|Successive cancellation list-based decoder and decoding method thereof|

---

WO2021107746A1|2019-11-29|2021-06-03|삼성전자 주식회사|Method and apparatus for decoding polar code in communication and broadcasting system|

---

US20210351860A1|2020-05-05|2021-11-11|Viavi Solutions Inc.|Method for reducing false detection of successful decoding of cyclic redundancy check codes|

---

US11139839B1|2020-07-07|2021-10-05|Huawei Technologies Co., Ltd.|Polar code decoder and a method for polar code decoding|

法律状态:
2021-10-19| B350| Update of information on the portal [chapter 15.35 patent gazette]|

优先权:

---

申请号 | 申请日 | 专利标题

---

US201762502154P| true| 2017-05-05|2017-05-05|

---

US15/967,592|US10742238B2|2017-05-05|2018-04-30|Frozen bits based pruning and early termination for polar decoding|

---

PCT/US2018/030534|WO2018204418A1|2017-05-05|2018-05-01|Frozen bits based path pruning and early termination for polar decoding|

---