Polar coded hybrid automatic repeat request (HARQ) with incremental channel polarization

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a wireless communication device may perform a first polar code encoding process on a first transmission of a hybrid automatic repeat request (HARQ) process; generate a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and transmit the second transmission of the HARQ process. Numerous other aspects are provided.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a 371 national stage of PCT Application No. PCT/CN2019/072084 filed on Jan. 17, 2019, entitled POLAR CODED HYBRID AUTOMATIC REPEAT REQUEST (HARQ) WITH INCREMENTAL CHANNEL POLARIZATION,” which claims priority to Patent Cooperation Treaty (PCT) Patent Application No. PCT/CN2018/076612, filed on Feb. 13, 2018, entitled “TECHNIQUES AND APPARATUSES FOR A POLAR CODED HYBRID AUTOMATIC REPEAT REQUEST (HARQ) WITH INCREMENTAL CHANNEL POLARIZATION,” both of which are hereby expressly incorporated by reference herein.

FIELD OF THE DISCLOSURE

Aspects of the present disclosure generally relate to wireless communication, and more particularly to techniques and apparatuses for a polar coded hybrid automatic repeat request (HARQ) with incremental channel polarization.

BACKGROUND

SUMMARY

In some aspects, a method of wireless communication may include performing a first polar code encoding process on a first transmission of a HARQ process; generating a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and transmitting the second transmission of the HARQ process.

In some aspects, a wireless communication device for wireless communication may include memory and one or more processors operatively coupled to the memory. The memory and the one or more processors may be configured to perform a first polar code encoding process on a first transmission of a HARQ process; generate a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and transmit the second transmission of the HARQ process.

In some aspects, a non-transitory computer-readable medium may store one or more instructions for wireless communication. The one or more instructions, when executed by one or more processors of a user equipment, may cause the one or more processors to perform a first polar code encoding process on a first transmission of a HARQ process; generate a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and transmit the second transmission of the HARQ process.

In some aspects, an apparatus for wireless communication may include means for performing a first polar code encoding process on a first transmission of a HARQ process; means for generating a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and means for transmitting the second transmission of the HARQ process.

DETAILED DESCRIPTION

In some aspects, one or more components of UE120may be included in a housing. Controller/processor240of base station110, controller/processor280of UE120, and/or any other component(s) ofFIG. 2may perform one or more techniques associated with a polar coded hybrid automatic repeat request (HARD) with incremental channel polarization, as described in more detail elsewhere herein. For example, controller/processor240of base station110, controller/processor280of UE120, and/or any other component(s) ofFIG. 2may perform or direct operations of, for example, process1400ofFIG. 14, and/or other processes as described herein. Memories242and282may store data and program codes for base station110and UE120, respectively. A scheduler246may schedule UEs for data transmission on the downlink and/or uplink.

In some aspects, UE120may include means for performing a first polar code encoding process on a first transmission of a HARQ process; means for generating a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and means for transmitting the second transmission of the HARQ process, and/or the like. In some aspects, such means may include one or more components of UE120described in connection withFIG. 2.

In some aspects, base station110may include means for performing a first polar code encoding process on a first transmission of a HARQ process; means for generating a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission; and means for transmitting the second transmission of the HARQ process, and/or the like. In some aspects, such means may include one or more components of base station110described in connection withFIG. 2.

In many instances, wireless communication systems may use polar coding to identify reliable bits after a channel polarization transform and relocate data onto those active bits. Polar coding may be implemented in a hybrid automatic repeat request (HARQ) process of the wireless communication. For example, in HARQ Chase combining (HARQ-CC) systems, a same codeword can be transmitted within each transmission of the HARQ system. In HARQ incremental redundancy (HARQ-IR) systems, additional coding gain can be attained, as a relatively long codeword can be incrementally transmitted within each transmission and a receiver can buffer the transmissions for decoding. However, in HARQ-IR, because information indices are fixed to optimize the first transmission, there is no opportunity to adjust positions of bits of the codeword in following retransmissions.

According to some aspects described herein, a polar coded HARQ scheme with incremental channel polarization (which may be referred to herein as IP-HARQ) is provided to enable multiple transmissions of a HARQ process (e.g., each transmission of the HARQ process and/or all transmissions of the HARQ process) to adjust and/or relocate bits from less reliable bit positions to more reliable bit positions. Accordingly, in some aspects, each transmission of an IP-HARQ process can be flexible and include a different code length and/or a different rate-matching scheme according to a channel polarization transform of previous transmissions. Furthermore, the example IP-HARQ process can achieve a desired capacity using an incremental channel transform. In some implementations, various incremental transforms can be adjusted (e.g., depending on a desired configuration of the wireless communication system).

Accordingly, as described in some aspects herein, an IP-HARQ process ensures that multiple transmissions or all transmission of a HARQ process can take advantage of polar coding by adjusting bits of a previous transmission from less reliable bit positions to more reliable bit positions of a subsequent transmission of the HARQ.

FIG. 3is a diagram illustrating an example300of a polar coded HARQ with incremental channel polarization, in accordance with various aspects of the present disclosure. As mentioned above, when using polar coding in some HARQ schemes (e.g., HARQ-IR), each transmission of the HARQ process may use a same polarization channel transform. In the example300ofFIG. 3, an IP-HARQ process is shown that enables bits to be adjusted between T transmissions (shown as Tx) of the HARQ process. Furthermore, in the example300ofFIG. 3, bits in less reliable bit positions of a previous transmission are adjusted to more reliable bit positions in subsequent transmissions using a channel transform matrix RT, which is incremented (in size) according to the round of the IP-HARQ process. For example, for round number two of the IP-HARQ process, the channel transform matrix R2is a 2×2 matrix; for round number three of the IP-HARQ process, the channel transform matrix R3is a 3×3 matrix; for round number four of the IP-HARQ process, the channel transform matrix R4is a 4×4 matrix, and so on.

As shown inFIG. 3, and by reference number302, data is received and is to be transmitted via an IP-HARQ process. A first HARQ transmission (or round one of the IP-HARQ process) is shown by reference numbers310-1through310-4. As shown by reference number310-1, in a first transmission (shown as 1st Tx) of a portion of the data, a wireless communication device (e.g., BS110and/or UE120), can encode N1bits of data (which can be any number of bits of the data) for a transmission of length K. For example, the wireless communication device can perform a polar encoding process on the N1bits of the data. As shown by reference number310-2, the wireless communication device can insert K−N1zero bits into the transmission to create codeword Z1of the first transmission (e.g., to ensure the first transmission is the appropriate bit length).

As shown by reference number310-3ofFIG. 3, the N1bits of the first transmission can be selected to create codeword X1of the first transmission. In some implementations, because the same N1bits are to be selected from the first transmission, the wireless communication device may not insert the zero bits into codeword X1of the first transmission as described in connection with reference number310-2. As shown by reference number310-4, the wireless communication device can perform rate-matching of X1of the first transmission to M1bits corresponding to the rate-matching technique used (e.g., repetition rate-matching, puncture rate-matching, or shorten rate-matching). After the rate-matching technique is applied to the M1bits, the wireless communication device may transmit the first transmission of the IP-HARQ process.

As shown further shown inFIG. 3and by reference number320, the IP-HARQ process is used to perform a second HARQ transmission (or round two of the IP-HARQ process). As shown by reference number320-1, in a second transmission (shown as 2nd Tx) of a portion of the data, a wireless communication device (e.g., BS110and/or UE120), can encode N2bits of data (which can be any number of bits of the data) for a transmission of length K. For example, the wireless communication device can perform a polar encoding process on the N2bits of the data. As shown by reference number320-2, the wireless communication device can insert K−N2zero bits into the transmission to create codeword Z2of the second transmission. As shown by reference number320-3, the codeword Z1of the first transmission is multiplied with a channel transform matrix R2(e.g., a 2×2 upper triangle matrix and combined with the codeword Z2of the second transmission) to create codeword V2for the second transmission. In such cases, use of the matrix R2causes bits in less reliable bit positions of the first transmission to be relocated to more reliable bit positions of the second transmission. The codeword Z2of the second transmission is then combined with the codeword V2. Accordingly, those bits of the codeword Z2of the second transmission are added to the codeword V2to ensure (or at least increase a likelihood) that the bits in the less reliable bit positions of the first transmission are transmitted in the second transmission.

As shown by reference number320-4ofFIG. 3, the N2bits of the second transmission are selected from the codeword V2of the second transmission to create codeword X2of the second transmission. As shown by reference number320-5, the wireless communication device can perform rate-matching of the codeword X2of the second transmission to M2bits corresponding to rate-matching technique used (e.g., repetition rate-matching, puncture rate-matching, or shorten rate-matching) for the second transmission (which can be configurable). After the rate-matching technique is applied for M2bits, the wireless communication device may transmit the second transmission of the IP-HARQ process.

In a similar manner as the second transmission, as shown by reference number330ofFIG. 3, the IP-HARQ process is used to perform a third HARQ transmission (or round three of the IP-HARQ process). However, during the third transmission, a 3×3 channel transform matrix R3is used to relocate bits in less reliable bit positions of the first transmission and second transmission to more reliable bit positions in the third transmission (shown as 3rd Tx). Furthermore, as shown by reference number340, for the T-th transmission (or round T of the IP-HARQ process), a T×T channel transform matrix RTis used to relocate bits in less reliable bit positions of all previous transmissions (1st Tx to T-lth Tx) to more reliable bit positions of the T-th transmission.

Accordingly, as shown, the IP-HARQ process ofFIG. 3provides an incremental channel transform RTthat is based at least in part on a round of the IP-HARQ process that relocates bits in less reliable bit positions of one or more transmissions to a more reliable bit positions of subsequent transmissions. Therefore, a wireless communication device and/or a wireless communication system, using the IP-HARQ process, can ensure (or at least increase a likelihood) that all bits of data reach an intended destination when transmitted.

As indicated above,FIG. 3is provided as an example. Other examples may differ from what is described with respect toFIG. 3.

FIG. 4is a diagram illustrating an example400of a polar coded HARQ with incremental channel polarization, in accordance with various aspects of the present disclosure. In the example400ofFIG. 4, bits in less reliable bit positions in previous T−1 transmission are shown being relocated to more reliable bit positions in a subsequent transmission T of the IP-HARQ process. As shown inFIG. 4, the channel transform matrix RTof reference number410may correspond to R1-RTof example300ofFIG. 3and the GNblocks of reference number420may correspond to the polar encoding (shown as encode blocks) of example300ofFIG. 3.

The example400ofFIG. 4shows a two-step polarization that relocates and/or copies a number of bits from less reliable bit positions of previous transmissions to more reliable bit positions in subsequent transmissions. For example, because the channel transform matrix RTis designed to ensure (or at least increase the likelihood) that the decoding order from the T-th transmission is performed before the previous T−1 blocks, corresponding duplicated bits in transmission 1 to T−1 can be regarded as known bits in that the duplicated bits are relocated to the T-th block.

Referring to reference number410, a first step of the two-step polarization involves combining an underlying channel of up to T transmissions. In some implementations, a wireless communication device may perform the first step of the channel polarization as follows:

As further shown byFIG. 4, and by reference number420, a second step the two-step channel polarization combines N use of channel WT(t). In some implementations, a wireless communication device may perform the second step of the channel polarization as follows:

GN=[1011]⊗n(3)
where n=log2N, xtis a variable at the t-th transmission, xtis a variable at the t-th transmission, xt,iis the i-th element of vector xt, xt, i:j is the subvector of xtwhich includes elements indexed from i to j, and XNis an N×N sized matrix.

Accordingly, incremental channel polarization can be achieved in example400of an IP-HARQ process, as shown, using an incremental channel transform. Thus, as shown inFIG. 4, using the two-step channel polarization of example implementation400, bits in less reliable positions of previous transmissions (T−1) can be relocated and/or copied into more reliable positions of a subsequent transmission (T).

As indicated above,FIG. 4is provided as an example. Other examples may differ from what is described with respect toFIG. 4.

FIG. 5is a diagram illustrating an example500of a polar coded HARQ with incremental channel polarization, in accordance with various aspects of the present disclosure.

In the example implementation500ofFIG. 5, there are four transmissions of an IP-HARQ process. In example500, as shown by reference number510, a wireless communication device may use a transposed Arikan kernel matrix during incremental channel polarization. Accordingly, as shown, during the channel polarization of the second transmission, the codeword Z1is combined with the codeword Z2of the second transmission (corresponding to column 2 of the Arikan kernel matrix). Furthermore, as shown, during the channel polarization of the third transmission, the codeword Z1of the first transmission is combined with the codeword Z3of the third transmission (corresponding to column 3 of the Arikan kernel matrix). Finally, as shown in example500ofFIG. 5, during the channel polarization of the fourth transmission, the codeword Z1of the first transmission, the codeword Z2of the second transmission, and the codeword Z3of the third transmission are combined with the codeword Z4of the fourth transmission (corresponding to column 4 of the Arikan kernel matrix). Accordingly, a transpose of the Arikan kernel matrix can be used during incremental channel polarization in an IP-HARQ process, as described herein.

As indicated above,FIG. 5is provided as an example. Other examples may differ from what is described with respect toFIG. 5.

FIG. 6is a diagram illustrating an example600of polar coded HARQ with incremental channel polarization, in accordance with various aspects of the present disclosure.

In the example implementation600ofFIG. 6, there are four transmissions of an IP-HARQ process. In example600, as shown by reference number610, a wireless communication device may use a diagonal kernel matrix during incremental channel polarization. Accordingly, as shown, during the channel polarization of each of the four transmissions, the codewords Z1-Z4are passed through as the diagonal kernel matrix does not facilitate combining previous transmissions with subsequent transmissions because there is only a single reliable bit position. Accordingly, selected bits are relocated to the reliable bit position. As such, a diagonal kernel matrix can be used during incremental channel polarization in an IP-HARQ process, as described herein.

As indicated above,FIG. 6is provided as an example. Other examples may differ from what is described with respect toFIG. 6.

FIG. 7is a diagram illustrating an example700of a polar coded HARQ with incremental channel polarization, in accordance with various aspects of the present disclosure.

In the example implementation700ofFIG. 7, there are four transmissions of an IP-HARQ process. In example700, as shown by reference number710, a wireless communication device may use a First—exclusive OR—Latest (FL) kernel matrix during incremental channel polarization. Accordingly, as shown, during the channel polarization of the second transmission, the codeword Z1is combined with the codeword Z2of the second transmission (corresponding to column 2 of the FL kernel matrix). Furthermore, as shown, during the channel polarization of the third transmission, the codeword Z1is combined with the codeword Z3of the third transmission (corresponding to column 3 of the FL kernel matrix). Finally, as shown in example500ofFIG. 5, during the channel polarization of the fourth transmission, the codeword Z1of the first transmission, the codeword Z2of the second transmission, and the codeword Z3of the third transmission are combined with the codeword Z4of the fourth transmission (corresponding to column 4 of the FL kernel matrix). As such, in all subsequent transmissions of example500, the codeword Z1of the first transmission is combined with the codeword of the latest (or T-th) transmission. Accordingly, an FL kernel matrix can be used during incremental channel polarization in an IP-HARQ process, as described herein.

As indicated above,FIG. 7is provided as an example. Other examples may differ from what is described with respect toFIG. 7.

FIGS. 8-13are diagrams illustrating examples of performance improvements associated with a polar coded hybrid automatic repeat request (IP-HARQ) with incremental channel polarization, in accordance with various aspects of the present disclosure.

FIG. 8shows examples810,820of IP-HARQ performance relative to a baseline and bound of a Gaussian Approximation (GA) with a first transmission length (M1) of 512 bits, a second transmission length (M2) of 512 bits, and a codeword length (K) of 200 bits. Example810shows performance using a successive cancellation decoder (SC), while example820shows performance using a successive cancellation list (SCL) decoder to decode the transmissions. As shown by example810, performance is within a bound of the GA. In such a case, joint decoding two received transmissions of data under IP-HARQ can achieve the same or similar performance as data constructed as a single code.

FIG. 9shows examples910,920of IP-HARQ performance relative to a baseline and bound of a GA with a first transmission length (M1) of 512 bits, a second transmission length (M2) of 384 bits, and a codeword length (K) of 200 bits. In example910, a first 1024 bit transmission is sent using a puncture rate-matching scheme, and in example920, a second 512 bit transmission is sent using a shorten rate-matching scheme. As shown, the IP-HARQ performance is within a bound of the GA. Furthermore, joint decoding of received transmissions under the IP-HARQ achieve an acceptable performance. Accordingly, IP-HARQ can achieve acceptable performance using different code lengths and/or different rate-matching schemes.

FIG. 10shows an example1010of IP-HARQ performance of four transmissions. Notably, a third transmission, shown by reference number1020, shows improved performance over baseline HARQ transmissions by using IP-HARQ.

FIG. 11shows examples1110,1120of IP-HARQ performance relative to a baseline performance for two transmission with varying rate-matching schemes. Example1110has a first transmission length (M1) of 512 bits and a second transmission length (M2) of 256 bits, and a codeword length (K) of 200 bits. Example1120has a first transmission length (M1) of 256 bits and a second transmission length (M2) of 512 bits, and a codeword length (K) of 200 bits. As shown, when comparing example1110and example1120, there is better decoding performance in IP-HARQ when M1>M2(i.e., the case shown by reference number1110shows better performance than the case shown by reference number1120), though both may achieve acceptable performance.

FIG. 12shows examples1210,1220of IP-HARQ performance relative to a baseline performance for two transmission with varying data bit length and rate-matching schemes. Example1210has a first transmission length (M1) of 320 bits and a second transmission length (M2) of 256 bits, and a codeword length (K) of 200 bits, using an N1of 512 (using shorten rate-matching) and an N2of 256. Example1220has a first transmission length (M1) of 256 bits and a second transmission length (M2) of 320 bits, and a codeword length (K) of 200 bits, using an N1of 256 and an N2of 512 (using shorten rate-matching). As shown, when comparing example1210and example1220, there is better decoding performance in IP-HARQ when M1>M2, though both may achieve acceptable performance.

FIG. 13shows examples1310,1320of IP-HARQ performance relative to a baseline performance for two transmission with varying codeword length (K). Example1310has first transmission length (M1) and second transmission length (M2) of 432 bits and a codeword length (K) of 200 bits, using puncture rate-matching. Example1320has first transmission length (M1) and second transmission length (M2) of 432 bits and a codeword length (K) of 128 bits, also using puncture rate-matching. As shown, both examples1310,1320may achieve acceptable performance.

As indicated above,FIGS. 8-13are provided as examples. Other examples may differ from what is described in connection withFIGS. 8-13.

FIG. 14is a diagram illustrating an example process1400performed, for example, by a wireless communication device, in accordance with various aspects of the present disclosure. Example process1400is an example where a wireless communication device (e.g., BS110and/or UE120) performs a HARQ process using an incremental channel transform for each round of the HARQ process to move bits in less reliable positions of one or more previous transmissions to more reliable positions of one or more subsequent transmissions.

As shown inFIG. 14, in some aspects, process1400may include performing a first polar code encoding process on a first transmission of a HARQ process (block1410). For example, a wireless communication device, such as BS110(e.g., using transmit processor220, TX MIMO processor230, controller/processor240, and/or the like) and/or UE120(e.g., using transmit processor264, TX MIMO processor266, controller/processor280, and/or the like), may performing a first polar code encoding process on a first transmission of a HARQ process.

As further shown inFIG. 14, in some aspects, process1400may include generating a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable positions of the second transmission of the HARQ process, wherein the less reliable positions and the more reliable positions are evaluated based at least in part on a channel transform, wherein the channel transform is based at least in part on the first transmission, the second transmission, the first polar encoding process and a second polar encoding process associated with the second transmission (block1420). For example, a wireless communication device, such as BS110(e.g., using transmit processor220, TX MIMO processor230, controller/processor240, and/or the like) and/or UE120(e.g., using transmit processor264, TX MIMO processor266, controller/processor280, and/or the like), may generate a second transmission a second transmission of the HARQ process by relocating a portion of bits in less reliable positions of the first transmission to more reliable position of the second transmission of the HARQ process.

As further shown inFIG. 14, in some aspects, process1400may include transmitting the second transmission of the HARQ process (block1430). For example, a wireless communication device, such as BS110(e.g., using controller/processor240, transmit processor220, TX MIMO processor230, MOD232, antenna234, and/or the like) and/or UE120(e.g., using controller/processor240, transmit processor220, TX MIMO processor230, MOD232, antenna234, and/or the like), may transmit the second transmission of the HARQ process.

Process1400may include additional aspects, such as any single aspect and/or any combination of aspects described below and/or in connection with one or more other processes described elsewhere herein.

In some aspects, in some aspects, the channel transform is based at least in part on a round, of the HARQ process, associated with the second transmission.

In some aspects, the second transmission is generated from a codeword of the first transmission and the first polar encoding process associated with the first transmission, wherein the codeword is generated from data, of the first transmission, transformed by the first polar encoding process.

In some aspects, the codeword is generated to include a number of bits corresponding to a transmission length of the HARQ process by inserting one or more zero bits after the data transformed by the first polar encoding process when a length of the data is less than the transmission length.

In some aspects, the second transmission is generated by rate-matching a codeword of the second transmission, wherein the codeword of the second transmission is generated using the channel transform and a codeword of the first transmission.

In some aspects, the codeword of the second transmission comprises a number of bits corresponding to a number of bits of data used to generate the codeword of the first transmission.

In some aspects, the channel transform uses an Arikan kernel matrix.

In some aspects, the channel transform uses an upper-triangular matrix.

In some aspects, the upper-triangular matrix comprises a transpose of an Arikan kernel matrix.

In some aspects, the upper-triangular matrix comprises a diagonal kernel matrix.

In some aspects, the upper-triangular matrix comprises a First-exclusive OR-Latest (FL) kernel matrix.

In some aspects, the first transmission has a different code length than the second transmission.

In some aspects, the second transmission is transmitted using a different rate-matching scheme than the first transmission.

In some aspects, the channel transform is a first channel transform, and a third transmission of the HARQ process is generated by relocating bits in a set of less reliable positions of the first transmission and second transmission to a set of more reliable positions of the third transmission of the HARQ process, wherein the less reliable positions of the first transmission and second transmission and the more reliable positions of the third transmission are evaluated based at least in part on a second channel transform, wherein the second channel transform is based at least in part on the first transmission, the second transmission, third transmission and a polar encoding process associated with the third transmission.

AlthoughFIG. 1400shows example blocks of process1400, in some aspects, process1400may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted inFIG. 14. Additionally, or alternatively, two or more of the blocks of process1400may be performed in parallel.

The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the aspects to the precise form disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of the aspects.

As used herein, the term component is intended to be broadly construed as hardware, firmware, or a combination of hardware and software. As used herein, a processor is implemented in hardware, firmware, or a combination of hardware and software.