Abstract:
Coding sub-channel selection involves, in an embodiment, determining, from sub-channels that are defined by a code and that have associated reliabilities for input bits at input bit positions, a first number of the sub-channels to carry bits that are to be encoded. A second number of the sub-channels, greater than the first number, are selected. The second number of sub-channels are selected to provide exactly the first number sub-channels to be available to carry the bits that are to be encoded.
Abstract:
Disabled input bit positions of an input bit vector that is to be encoded are determined based on non-contiguous subsets of consecutive coded bit positions that are to be punctured from a codeword of a polar code. The input bit vector is encoded according to the polar code to generate a codeword, by applying information bits to input bit positions of the input bit vector other than the disabled input bit positions. The non-contiguous subsets of consecutive coded bit positions are punctured from the codeword to generate a punctured codeword, and the punctured codeword is transmitted. In some embodiments, the non-contiguous subsets include a first subset that includes a first coded bit position and a second subset that includes a last coded bit position. The polar code could be a chained polar code, for example.
Abstract:
One or more codewords are generated by encoding input bits at input bit positions onto sub-channels that are provided by a code. Each of the sub-channels has an associated reliability of correct decoding of an input bit at an input bit position. Each codeword is transmitted to a decoder, and a word based on each transmitted codeword is received at the decoder. Each received word is decoded, and the reliabilities of the sub-channels are determined based on decoded bits and known input bits from which each codeword was generated. An indication that is based on the determined reliabilities of the sub-channels, such as an indication of the determined reliabilities, is transmitted to the encoder, and may be used by the encoder in selecting the sub-channels for encoding subsequent input bits, for example.
Abstract:
An assistant sub-channel to carry a decoding assistant bit, in input bits that are to be encoded, is selected from each of a plurality of non-adjacent segments. Each segment includes a subset of sub-channels with associated reliabilities. Some embodiments also involve grouping the sub-channels into the segments. After a target number of assistant sub-channels have been selected, the input bits are encoded to generate a codeword, and the codeword is transmitted. Assistant sub-channel selection could involve iterations to select assistant sub-channels at each iteration, until at least the target number of assistant sub-channels have been selected.
Abstract:
The application provides manner for communicating channel state information (CSI) in a communication network. A preset length is used for equalizing lengths of CSI to be reported. The preset length is determined based on a quantity of CSI-reference signal (RS) ports. A communication device determines whether a total length of one or more indication information items to be included in the CSI is less than the preset length. If the total length of the one or more indication information items to be included in the CSI is less than the preset length, the communication device adds one or more padding bits, to obtain a CSI bit sequence including the one or more indication information items and the one or more padding bits. A total length of the CSI bit sequence is consistent with the preset length. The communication device then outputs the CSI bit sequence.
Abstract:
A self-timed parallelized multi-core processor has an instruction decoder unit for receiving a program code instruction, determining an operating code and latency for the instruction, and assigning a loop index to the instruction. An instruction decomposer creates a primitive by decomposing the instruction, replacing the loop index with a core index, and broadcasting the primitive. Self-timed processing cores each having a unique core index compare the core index to their unique processing core index. The processing cores act on the primitive when their processing core index is within a threshold of the core index.
Abstract:
Aspects of this disclosure provide a technique for implementing polar encoding with incremental redundancy HARQ re-transmission. In particular, a transmitter may encode a message using different polar codes to obtain a first codeword and a second codeword that is twice the length of the first codeword, and transmit the first codeword as an original transmission, and the second half of the second codeword as a re-transmission without transmitting the first half of the second codeword. Information bits that are common to both the first codeword and the second half of the second codeword may be mapped to more-reliable bit-locations in the second half of the second codeword. Decoded bit values for the common information in the original transmission and retransmission may be compared by the receiver to perform a parity check.
Abstract:
A clock-less asynchronous processing circuit or system having a plurality of pipelined processing stages utilizes self-clocked generators to tune the delay needed in each of the processing stages to complete the processing cycle. Because different processing stages may require different amounts of time to complete processing or may require different delays depending on the processing required in a particular stage, the self-clocked generators may be tuned to each stage's necessary delay(s) or may be programmably configured.
Abstract:
Embodiments are provided for adding a token jump logic to an asynchronous processor with token passing. The token jump logic allows token forward jumps and token backward jumps over a cascade of token processing logics in the processor. An embodiment method includes determining, using a token jump logic coupled to a cascade of token processing logics, whether to administer a token forward jump or a token backward jump of a token signal passing through the token processing logics. The token forward jump and token backward jump allow the token signal to skip one or more token processing logics in the cascade. The method further includes monitoring, for each of the token processing logics, a polarity status of a token sense logic, and inverting the polarity status according to the determination at the token jump logic.