Patent classifications
H04L1/0052
TECHNIQUES FOR MANAGING BLIND DECODING REDUCTION FOR CONTROL CHANNEL SEARCH SPACES
Aspects described herein relate to managing blind decoding of a control channel search space. A number of blind decodes configured for a control channel search space can be determined based at least in part on one or more parameters broadcasted by a access point that transmits a control channel in the control channel search space. One or more reduction values can be determined for the number of blind decodes at the UE. A pattern for performing a subset of the number of blind decodes can be determined based at least in part on the one or more reduction values. Blind decoding can be performed for the control channel based on the pattern for performing the subset of the number of blind decodes to obtain control data transmitted in the control channel.
Multi-slot blind detection limits
To facilitate more flexible blind detection, a UE may be configured receive PDCCH in a set of consecutive slots, the set of consecutive slots comprising at least two slots. The UE may be further configured to perform blind detection on each PDCCH received in the set of consecutive slots based on a first PDCCH blind detection limit and a second PDCCH blind detection limit, the first PDCCH blind detection limit being a single-slot limit, the second PDCCH blind detection limit being a multi-slot limit.
IMPROVED SIGNALING TECHNIQUES IN THE PRESENCE OF PHASE NOISE AND FREQUENCY OFFSET
Systems and methods are provided for enabling reliable signaling in the presence of strong phase noise and frequency offset. To this end, a method is provided comprising receiving, at a receiver, a communication signal, including data, from a transmitter via a communication channel, and jointly tracking and jointly correcting phase noise errors and frequency errors in the communication signal with a joint detector using an iterative feedback correction process between an output decoder of the receiver and the joint detector.
METHOD, SYSTEM, AND APPARATUS FOR A SEGMENTED POLARIZATION-ADJUSTED CONVOLUTIONAL (PAC) CODE
A codeword is generated based on a segmentation transform and a Polarization-Assisted Convolutional (PAC) code that includes an outer convolutional code and a polar code, and based on separate encoding of respective different segments of convolutionally encoded input bits according to the polar code. Each segment of the respective segments includes multiple bits of the convolutionally encoded input bits for which the separate encoding of the segment is independent of the separate encoding of other segments. Separate decoding may be applied to segments of such a codeword to decode convolutionally encoded input bits corresponding to the separately encoded segments of the convolutionally encoded input bits.
Systems and methods for performing efficient blind decoding at a wireless receiver
Systems and methods for performing efficient blind decoding. A first plurality of decision metrics corresponding to a first repetition of periodic decoding information is stored. The first plurality of decision metrics is grouped into sequential portions. A plurality of combined versions of the sequential portions is stored into combining buffers arranged in sequence. Each combined version is associated with a different sequence of timing information. A first of the plurality of combined versions stored in a first of the combining buffers is combined with a second version of a second plurality of decision metrics that corresponds to a second repetition of the periodic decoding information. The second version is associated with timing information adjacent in the timing information sequence to the timing information associated with the first combined version. The data is decoded based on information in the combining buffers.
Decoder, minimum value selection circuit, and minimum value selection method
A storage which, in operation, stores a first minimum value and a second minimum value each time a plurality of data are input. Round-robin comparison circuitry which, in operation, makes a magnitude comparison among the plurality of data. First selection comparison circuitry and second selection comparison circuitry which, in operation, make a magnitude comparison between the first minimum value and each of the plurality of data and a magnitude comparison between the second minimum value and each of the plurality of data, respectively. Judgment circuitry which, in operation, judges a new first minimum value and a new second minimum value on the basis of a comparison result from the round-robin comparison circuitry and comparison results from the first and second selection comparison circuitry.
Cyclic redundancy check, CRC, decoding using the inverse CRC generator polynomial
A cyclic redundancy check, CRC, decoder circuit having a K-bit input bit sequence, s, comprising information bits and CRC bits; and at least one processor (P) configured to perform a CRC decode computation and configured to: use an inverse of a predefined CRC generator polynomial that encoded the K-bit input bit sequence, s, to produce a data set; compute a CRC syndrome from the data set; and determine whether the CRC syndrome contains any one-valued bits indicative of a CRC error. An LUT stores one or more rows of a CRC generator matrix (G) generated from the inverse of the predefined CRC generator polynomial. A set of mod(−K,P) zero-valued filler bits are appended to an end of the K-bit input bit sequence, wherein an order of the rows in the CRC generator matrix (G) is reversed and aligned with the input bits of the input stream.
LIST DECODING OF POLARIZATION-ADJUSTED CONVOLUTIONAL CODES
Devices, systems and methods for list decoding of polarization-adjusted convolutional (PAC) codes are described. One example method for improving error correction in a decoder for data in a communication channel includes receiving a noisy codeword, the codeword having been generated using a polarization-adjusted convolutional (PAC) code and provided to the communication channel prior to reception by the decoder, and performing PAC list decoding on the noisy codeword, wherein an encoding operation of the PAC code comprises a convolutional precoding operation that generates one or more dynamically frozen bits, and wherein the PAC list decoding comprises extending, based on the one or more dynamically frozen bits, at least two paths of a plurality of paths in the PAC list decoding differently and independently.
Mechanism for inline packet response generation in software defined networks
A method and system provide for inline packet response generation implemented by a network device functioning as a switch in a software defined networking (SDN) network. The method configures the flow control pipeline to enable the inline response generation without use of the control channel and SDN controller after configuration. The method includes connecting with the SDN controller, receiving a packet out data packet from SDN controller with a template message and a buffer identifier (ID) for the template message, and identifying the received packet out data packet as containing the template message. The method further includes installing the template message into a buffer with corresponding buffer ID, receiving a first data packet from the SDN controller identifying matching criteria and the buffer ID, and updating a flow control pipeline to match on the matching criteria and to point to the buffer with the buffer ID.
Fast cyclic redundancy check: utilizing linearity of cyclic redundancy check for accelerating correction of corrupted network packets
Systems and methods for correcting corrupted network packets are provided. An example method includes receiving a network packet via a communication channel. The network packet includes a payload and a Cyclic Redundancy Check (CRC) associated with the payload. The method continues with calculating a reference CRC based on the received payload and determining, based on the reference CRC and the received CRC, whether the network packet is corrupted. Based on the determination that the network packet is corrupted, the method continues with selecting a predetermined number of positions of bits in the payload of the network packet, precalculating a set of additional CRCs, and determining, based on the reference CRC and the set of additional CRCs, a combination of bit flips at the predetermined number of positions. The method also includes modifying the payload according to the combination of bit flips at the predetermined number of positions.