Abstract: A method of operating a network node in a communications network that includes a communication device is provided. The method can include receiving uplink control information, UCI, from the communication device. The method can further include determining whether the UCI is reliable based on a maximum distance and a threshold value.

Abstract: A method in a sending node of a communications network includes: encoding a transport block, TB, including data of at least one protocol data unit, PDU, to generate a code block group, CBG, comprising one or more code blocks; defining a CBG header indicative of a starting location of a first PDU within the CBG; and transmitting the CBG including the CBG header. A method in a receiving node includes: receiving one or more code block groups, CBGs, each CBG comprising a CBG header indicative of a start location of a first protocol data unit, PDU, within the CBG; attempting to decode each received CBG; responsive to failing to decode a first CBG, attempting to decode a second CBG, and responsive to successfully decoding the second CBG: identifying the start location of the first PDU in the second CBG; buffering data of the second CBG prior to the identified start location; and forwarding data of PDUs following the identified start location.

Abstract: A multi-intelligence federated reinforcement learning (FRL)-based vehicle-road cooperative control system and method at the complex intersection use a vehicle-road cooperative control framework based on the Road Side Unit (RSU) static processing module and the vehicle-based dynamic processing module. The historical road information is supplied by the proposed RSU module. The Federated Twin Delayed Deep Deterministic policy gradient (FTD3) algorithm is proposed to connect the federated learning (FL) module and the reinforcement learning (RL) module. The FTD3 algorithm transmits only neural network parameters instead of vehicle samples to protect privacy. Firstly, FTD3 selects only specific networks for aggregation to reduce the communication cost. Secondly, FTD3 realizes the deep combination of FL and RL by aggregating target critic networks with smaller Q-values. Thirdly, RSU neural network participates in aggregation rather than training, and only shared global model parameters are used.

Abstract: A multi-intelligence federated reinforcement learning (FRL)-based vehicle-road cooperative control system and method at the complex intersection use a vehicle-road cooperative control framework based on the Road Side Unit (RSU) static processing module and the vehicle-based dynamic processing module. The historical road information is supplied by the proposed RSU module. The Federated Twin Delayed Deep Deterministic policy gradient (FTD3) algorithm is proposed to connect the federated learning (FL) module and the reinforcement learning (RL) module. The FTD3 algorithm transmits only neural network parameters instead of vehicle samples to protect privacy. Firstly, FTD3 selects only specific networks for aggregation to reduce the communication cost. Secondly, FTD3 realizes the deep combination of FL and RL by aggregating target critic networks with smaller Q-values. Thirdly, RSU neural network participates in aggregation rather than training, and only shared global model parameters are used.

Abstract: According to some embodiments, a method performed by a network node for decoding a channel state information (CSI) report comprises generating a physical uplink shared channel (PUSCH) scrambling sequence, descrambling a PUSCH using the PUSCH scrambling sequence, decoding a CSI report part one to determine a rank indicator, and determining a location of a CSI report part two. The method further comprises extracting a scrambling sequence from the PUSCH scrambling sequence corresponding to the location of the CSI report part two, generating a CSI part two scrambling sequence based on the PUSCH scrambling sequence and the location of the CSI report part two, and applying the extracted scrambling sequence to the location of the CSI report part two. The method further comprises descrambling the location of the CSI report part two in the PUSCH using the CSI part two scrambling sequence and decoding the CSI part two.

Abstract: Apparatuses and methods are disclosed for a communication device associated with a wireless transmission. In one embodiment, a method includes performing one of a low-density parity check, LDPC, decoding process and an LDPC encoding process by loading a set of bits, in parallel, into a plurality of registers, the set of bits being distributed among the plurality of registers; one of de-interleaving and interleaving the loaded set of bits within the plurality of registers by rearranging the loaded set of bits into one of a de-interleaved and an interleaved set of bits; and after the set of bits is rearranged into the one of the de-interleaved and the interleaved set of bits within the plurality of registers, writing the one of the de-interleaved and the interleaved set of bits, in parallel, from the plurality of registers to memory.

Abstract: According to some embodiments, a method for polar encoding includes obtaining an input bits index array Q, wherein each element Q[i] is an index of a polar coded transmission channel and corresponds to an input U[i] of a polar encoder. The elements of Q are ordered according to their associated channel quality. The method further includes obtaining an integer number X of bits for polar encoding and wireless transmission, wherein X is not greater than N. Upon determining the polar code block length N is not greater than the number of rate matched bits M available for transmission, the method includes assigning each of the bits as inputs to the polar encoder ordered according to the input bits index array Q.

Abstract: According to some embodiments, a method for use in a wireless transmitter of a wireless communication network comprises (1) calculating information carrying bits per resource block group (RBG) or physical resource block (PRB) based on a channel condition (e.g., signal to interference plus noise ratio (SINR)); (2) estimating the required information bits and number of RBGs based on the desired number of bits to be transmitted and the number of available RBGs; (3) determining the MCS and TBS based on the estimated information bits, the required number of RBGs, number of layers, and RBG size; (4) adjusting the MCS and TBS based on the MCS index and TBS calculated at step 3, the number of required RBGs, and the accumulated information bits calculated from step 2; and (5) determining an MCS state based on the TBS and the accumulated information bits.

Abstract: Apparatuses and methods are disclosed for a communication device associated with a wireless transmission. In one embodiment, a method includes performing one of a low-density parity check, LDPC, decoding process and an LDPC encoding process by loading a set of bits, in parallel, into a plurality of registers, the set of bits being distributed among the plurality of registers; one of de-interleaving and interleaving the loaded set of bits within the plurality of registers by rearranging the loaded set of bits into one of a de-interleaved and an interleaved set of bits; and after the set of bits is rearranged into the one of the de-interleaved and the interleaved set of bits within the plurality of registers, writing the one of the de-interleaved and the interleaved set of bits, in parallel, from the plurality of registers to memory.

Abstract: Methods and systems for Long Term Evolution (LTE) and Fifth Generation (5G) beam index filtering are presented. According to one aspect, a method for beam index filtering comprises receiving a beam index that was estimated based on information received from a User Equipment (UE); storing the received beam index into a queue of length N for storing received beam indexes, N being greater than one; selecting a beam index from the queue according to a filtering algorithm; and using the selected beam index for transmissions to the UE. In one embodiment, a majority vote algorithm is employed to select the beam index that appears most often in the queue. Where there is a tie between two or more beam indexes, the beam index that was most recently added to the queue is selected. The same concepts may be applied to filter input data or parameters other than beam indexes.

Abstract: A method for use in a wireless transmitter of interleaving coded bits includes: determining an integer number (M) of polar coded bits {e(0), . . . , e(M?1)} for wireless transmission; determining a smallest integer number (T) such that T(T+1)/2>=M; and determining a one-dimensional interleaving index array, interleavingId( ), that represents the column by column non-zero elements of a two-dimensional matrix. The two-dimensional matrix includes a hypothetical T by T matrix containing the polar coded bits {e(0), . . . , e(M?1)} input row by row without using the lower right corner elements of the T×T matrix. The method further includes: interleaving the polar coded bits {e(0), . . . , e(M?1)} using the one-dimensional interleaving index array resulting in the output sequence {f(0), . . . , f(M?1)} wherein f(i)=e(interleavingId(i)); and transmitting the interleaved polar coded bits to a wireless receiver.

Abstract: Apparatuses and methods are disclosed for a communication device associated with a wireless transmission. In one embodiment, a method includes performing one of a low-density parity check, LDPC, decoding process and an LDPC encoding process by loading a set of bits, in parallel, into a plurality of registers, the set of bits being distributed among the plurality of registers; one of de-interleaving and interleaving the loaded set of bits within the plurality of registers by rearranging the loaded set of bits into one of a de-interleaved and an interleaved set of bits; and after the set of bits is rearranged into the one of the de-interleaved and the interleaved set of bits within the plurality of registers, writing the one of the de-interleaved and the interleaved set of bits, in parallel, from the plurality of registers to memory.

Abstract: A method in a sending node of a communications network includes: encoding a transport block, TB, including data of at least one protocol data unit, PDU, to generate a code block group, CBG, comprising one or more code blocks; defining a CBG header indicative of a starting location of a first PDU within the CBG; and transmitting the CBG including the CBG header. A method in a receiving node includes: receiving one or more code block groups, CBGs, each CBG comprising a CBG header indicative of a start location of a first protocol data unit, PDU, within the CBG; attempting to decode each received CBG; responsive to failing to decode a first CBG, attempting to decode a second CBG, and responsive to successfully decoding the second CBG: identifying the start location of the first PDU in the second CBG; buffering data of the second CBG prior to the identified start location; and forwarding data of PDUs following the identified start location.

Abstract: Methods and systems for Long Term Evolution (LTE) and Fifth Generation (5G) beam index filtering are presented. According to one aspect, a method for beam index filtering comprises receiving a beam index that was estimated based on information received from a User Equipment (UE); storing the received beam index into a queue of length N for storing received beam indexes, N being greater than one; selecting a beam index from the queue according to a filtering algorithm; and using the selected beam index for transmissions to the UE. In one embodiment, a majority vote algorithm is employed to select the beam index that appears most often in the queue. Where there is a tie between two or more beam indexes, the beam index that was most recently added to the queue is selected. The same concepts may be applied to filter input data or parameters other than beam indexes.

Abstract: According to some embodiments, a method for use in a wireless transmitter of a wireless communication network comprises (1) calculating information carrying bits per resource block group (RBG) or physical resource block (PRB) based on a channel condition (e.g., signal to interference plus noise ratio (SINR)); (2) estimating the required information bits and number of RBGs based on the desired number of bits to be transmitted and the number of available RBGs; (3) determining the MCS and TBS based on the estimated information bits, the required number of RBGs, number of layers, and RBG size; (4) adjusting the MCS and TBS based on the MCS index and TBS calculated at step 3, the number of required RBGs, and the accumulated information bits calculated from step 2; and (5) determining an MCS state based on the TBS and the accumulated information bits.

Abstract: According to some embodiments, a method for polar encoding includes obtaining an input bits index array Q, wherein each element Q[i] is an index of a polar coded transmission channel and corresponds to an input U[i] of a polar encoder. The elements of Q are ordered according to their associated channel quality. The method further includes obtaining an integer number X of bits for polar encoding and wireless transmission, wherein X is not greater than N. Upon determining the polar code block length N is not greater than the number of rate matched bits M available for transmission, the method includes assigning each of the bits as inputs to the polar encoder ordered according to the input bits index array Q.

Abstract: Apparatuses and methods are disclosed for a communication device associated with a wireless transmission. In one embodiment, a method includes performing one of a low-density parity check, LDPC, decoding process and an LDPC encoding process by loading a set of bits, in parallel, into a plurality of registers, the set of bits being distributed among the plurality of registers; one of de-interleaving and interleaving the loaded set of bits within the plurality of registers by rearranging the loaded set of bits into one of a de-interleaved and an interleaved set of bits; and after the set of bits is rearranged into the one of the de-interleaved and the interleaved set of bits within the plurality of registers, writing the one of the de-interleaved and the interleaved set of bits, in parallel, from the plurality of registers to memory.

Abstract: A robust header compression (ROHC) controller provides for service flow processing of a ROHC channel in a WiMAX wireless communication system. The ROHC controller controls the negotiations of the MS ROHC capabilities during its registration and the negotiations of the ROHC channel parameters during ROHC enabled service flow setup; the MS ROHC capabilities including ROHC compression and decompression capabilities and ROHC channel and feedback strategies; the channel parameter negotiation covers the ROHC profile set and feedback channel information in addition to the 16e/12D standard. The ROHC controller receives a service flow request for a ROHC enabled service flow, wherein the request includes a QoS profile.

Abstract: A method for use in a wireless transmitter of interleaving coded bits includes: determining an integer number (M) of polar coded bits {e(0), . . . , e(M?1)} for wireless transmission; determining a smallest integer number (T) such that T(T+1)/2>=M; and determining a one-dimensional interleaving index array, interleavingId( ), that represents the column by column non-zero elements of a two-dimensional matrix. The two-dimensional matrix includes a hypothetical T by T matrix containing the polar coded bits {e(0), . . . , e(M?1)} input row by row without using the lower right corner elements of the T×T matrix. The method further includes: interleaving the polar coded bits {e(0), . . . , e(M?1)} using the one-dimensional interleaving index array resulting in the output sequence {f(0), . . . , f(M?1)} wherein f(i)=e(interleavingId(i)); and transmitting the interleaved polar coded bits to a wireless receiver.

Abstract: A robust header compression (ROHC) controller provides for service flow processing of a ROHC channel in a WiMAX wireless communication system. The ROHC controller controls the negotiations of the MS ROHC capabilities during its registration and the negotiations of the ROHC channel parameters during ROHC enabled service flow setup; the MS ROHC capabilities including ROHC compression and decompression capabilities and ROHC channel and feedback strategies; the channel parameter negotiation covers the ROHC profile set and feedback channel information in addition to the 16e/12D standard. The ROHC controller receives a service flow request for a ROHC enabled service flow, wherein the request includes a QoS profile.