52results about "Error correction/detection using block single space coding" patented technology

A method includes receiving a bit string at a processor, performing an error correction, and causing transmission of a modulated signal. The error correction includes identifying a set of binary strings based on the bit string, mapping each binary string from the set of binary strings to a first abelian group element from a set of first abelian group elements, and applying a generalization of polar codes to the set of first abelian group elements to produce a set of second abelian group elements. The error correction also includes mapping each of the second abelian group elements to an in-phase / quadrature (I / Q) point from a set of I / Q points and identifying real-valued points based on the set of I / Q points, each of the real-valued points representing an I / Q point from the set of I / Q points. The modulated signal has a modulation that is based on the real-valued points.

In an alignment marker search method, a first module receives a first data stream, where the first data stream is obtained by multiplexing a plurality of second data streams at a reference granularity, any second data stream includes an AM and data from at least one FEC codeword, and the reference granularity is a quantity of bits corresponding to n symbols included in the FEC codeword; obtains a first data segment from a first location in the first data stream at the reference granularity; and performs AM search on the first data segment. The reference granularity is the quantity of bits corresponding to the n symbols. Therefore, when a burst bit error occurs in the first data stream, a quantity of symbols affected by the burst bit error is small.

The invention discloses a polar code coding method and device, relates to the technical field of communication, and aims at enabling different numbers of information bit sequences to construct polar codes based on the same reliability sequence and a first matrix, reducing the hardware complexity and improving the decoding performance. The method comprises the steps of mapping an information bit sequence with the length of k to k bits of a first sequence with the length of N according to a reliability sequence with the length of N to obtain a second sequence comprising k information bits, x PC bits and N-k-x frozen bits, multiplying the second sequence by a first matrix to obtain a third sequence, and performing polarization coding to obtain a fourth sequence. K < = K < = N, 1 < = x, K is the maximum value of the length of the information bit sequence, k, K, N and x are positive integers, all the parts below the diagonal lines of the first matrix are 0, all the diagonal lines are 1, the column weight of the column corresponding to the PC bit in the first matrix is greater than 1, the column weight of the column corresponding to the frozen bit or the information bit is equal to 1, and the number of the columns with the column weight greater than 1 is smaller than or equal to N-K.

This application relates to the field of communication technologies, and discloses an alignment marker search method and apparatus, a system, and a computer-readable storage medium. The method includes: A first module receives a first data stream, where the first data stream is obtained by multiplexing a plurality of second data streams at a reference granularity, any second data stream includes an AM and data from at least one FEC codeword, and the reference granularity is a quantity of bits corresponding to n symbols included in the FEC codeword; obtains a first data segment from a first location in the first data stream at the reference granularity, and performs AM search on the first data segment. In the method, the reference granularity is the quantity of bits corresponding to the n symbols. Therefore, when a burst bit error occurs in the first data stream, a quantity of symbols affected by the burst bit error is small. In comparison with a data stream obtained through bit multiplexing, the first data stream in this method has higher tolerance to the burst bit error.

This application provides a rate matching method, a de-rate matching method, and a communication apparatus. The method includes: The communication apparatus determines a second position set based on a first position set. The first position set is an initial position set corresponding to a bit to be deleted during rate matching, and the second position set is a bit position set corresponding to an information bit in a to-be-encoded sequence. The communication apparatus performs rate matching on a first bit sequence to obtain a second bit sequence. The first bit sequence is obtained by performing channel encoding on the to-be-encoded sequence based on the second position set, the second bit sequence corresponds to a bit position other than a third position set in the first bit sequence, and a bit position in the third position set is a bit position obtained when a bit position in the first position set in the first bit sequence is converted in one or more of cyclic shift, mirror reversal, or segmented cyclic shift. The communication apparatus sends the second bit sequence. In this way, rate matching complexity can be reduced.

The present disclosure relates to a technology for decoding encoded data based on PME-HARQ. In accordance with an aspect of the present disclosure, there is provided a PME-HARQ-based data decoding device, comprising: at least one first decoding unit that performs successive cancellation-based decoding on PME-HARQ-based data; at least one second decoding unit that performs polar code permutation-based decoding on the PME-HARQ-based data; and a decoding result selection unit that selects one of decoding results of the first decoding unit and decoding results of the second decoding unit based on a reliability of the decoding results of the first decoding unit and a reliability of the decoding results of the second decoding unit.

This invention relates to a codeword bit interleaving scheme for multi-layer transmission in a wireless communication system. The codeword bit interleaving scheme involves dividing the columns of an interleaving matrix into at least two separate column groups based on the transmission quality (e.g., SNR) of the data transmission layer (e.g., MIMO layer). Then, starting with writing information bits into the column group corresponding to the high-quality data transmission layer, the column group is filled with codeword bits. Afterwards, all column groups are merged to restore the initial column arrangement of the interleaving matrix, and codeword bits are read row by row from the interleaving matrix and mapped to modulation symbols. The modulation symbols are then mapped to the data transmission layer itself. By doing so, the information bits of the codewords can be allocated to the high-quality data transmission layer, thereby improving decoding performance.

A data processing method is provided. The method may be applied to the field of communication technologies, and the method includes: generating a check block, where the check block is determined based on first bit sequences respectively corresponding to a plurality of code blocks, the first bit sequence is a part of a second bit sequence, and the second bit sequence is an encoded bit sequence of the code block corresponding to the first bit sequence; and sending the check block and the code blocks. In this way, error correction performance is improved when assisting in code block recovery.

A signal transmitter encodes data bits into an index value that is included within the index values in Λ / rΛ, where Λ is a lattice. The signal transmitter modulates the index values into lattice points of a lattice group and converts each lattice point to a baseband in-phase / quadrature (I / Q) point. The signal transmitter transmits a signal that a a modulation based on the I / Q points and has a demodulated component to be decoded at a signal receiver to recover the data bits.

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a wireless communication device may encode one or more information bits into a plurality of polar code sub-block outputs, identify one or more shaping bits for a first polar code sub-block output of the plurality of polar code sub-block outputs, and transmit a polar-coded codeword derived from at least the first polar code sub-block output and the second polar code sub-block output. In some aspects, a wireless communication device may identify one or more shaping bit subchannels, identify one or more information bit subchannels, and transmit one or more shaping bits in the one or more shaping bit subchannels and one or more information bits in the one or more information bit subchannels. Numerous other aspects are described.

A polar code encoding method and an apparatus are provided and relate to the field of communication technologies, to enable polar codes to be constructed based on a same reliability sequence and a same first matrix for sequences of different quantities of information bits, thereby reducing hardware complexity and improving decoding performance. The method includes: mapping, based on a reliability sequence whose length is N, an information bit sequence whose length is k to k bits of a first sequence whose length is N, to obtain a second sequence including k information bit positions, x PC bit positions, and N-k-x frozen bit positions; multiplying the second sequence by a first matrix to obtain a third sequence; and performing polar encoding to obtain a fourth sequence, where k≤K≤N, 1≤x, K is a maximum value of the length of the information bit sequence, k, K, N, and x are all positive integers, there are all 0s below a diagonal of the first matrix, and all 1s on the diagonal, a column weight of a column corresponding to the PC bit position in the first matrix is greater than 1, a column weight of a column corresponding to the frozen bit position or the information bit position is equal to 1, and a quantity of columns whose column weights are greater than 1 is less than or equal to N-K.

An encoding / decoding method and apparatus, and a data transmission method are provided, and relate to the field of communication technologies, to reduce a bit error rate during encoding / decoding using PAM3. The method includes: encoding to-be-encoded 3-bit data [A, B, C], to obtain a 4-bit encoded parity signal [S1, S2, S3, S4] that satisfies S1 = A • (B + C); generating a PAM3 signal in two UIs based on the 4-bit encoded parity signal, and sending the PAM3 signal; obtaining the PAM3 signal in the two UIs, and determining a 4-bit decoding parity signal based on the PAM3 signal in the two UIs; and decoding the 4-bit decoding parity signal based on preset decoding logic, to obtain the 3-bit data. The preset decoding logic can ensure that when a bit error in one UI occurs, a bit error occurs in a maximum of 2-bit data in 3-bit data obtained through decoding. In this case, in comparison with a bit error in a maximum of 3-bit data in a related technology, a bit error rate is low.

A correction value calculation method calculates correction values to correct the 2-phase sinusoidal signals (X, Y) output by the encoder, and includes: a polar coordinate calculation step for calculating, for N phase angles and the Lissajous radius corresponding to each phase angle in the Lissajous waveform drawn by the 2-phase sinusoidal signals, a squared radius, which is the square of the Lissajous radius corresponding to each phase angle; and a correction value calculation step for calculating, based on each phase angle and corresponding squared radius, at least a correction residual of an offset error of the signal X, a correction residual of an offset error of the signal Y, a correction residual of an amplitude ratio error of the signals X and Y, and a correction residual of a phase difference error between the signal X and the signal Y, and then calculating correction values based on the correction residuals.

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a wireless communication device may obtain a phase vector. The wireless communication device may quantize the phase vector to obtain a bit vector comprising a set of sub-vectors. The wireless communication device may compress the bit vector, using one or more polar codes, to obtain a compressed vector, wherein the one or more polar codes are derived from a compression ratio of the compressed vector. The wireless communication device may transmit the compressed vector. Numerous other aspects are described.

Streams of data encoded by a plurality of OFEC encoders are merged and allocated among a plurality of optical subcarriers of an optical communication system having two polarization channels. Methods and apparatus are provided for performing the merging and allocating such that for each OFEC encoder of said OFEC encoder plurality, a same number of bits of encoded data is allocated to each subcarrier of the subcarrier plurality, and a same number of bits of encoded data is allocated to each of the two polarization channels.

In an example method, probabilistic constellation shaping (PCS) processing is performed on a first bit set in k bits, to obtain a second bit set. Forward error correction (FEC) encoding is performed on the second bit set and a third bit set in the k bits excluding the first bit set, to obtain a fourth bit set. The fourth bit set includes m0 first bit subsets, and each of the first bit subsets includes F0 bits. First interleaving processing is performed on the fourth bit set to obtain a fifth bit set. The fifth bit set includes m0 second bit subsets, each of the second bit subsets includes F0 bits, F0 / 2 bits in each of the second bit subsets are from the second bit set, and the other F0 / 2 bits in each of the second bit subsets are from the third bit set and / or parity bits of the FEC encoding.

Apparatus, methods, and computer program products for wireless communication are provided. An example method may include receiving, from a network node, a transmission. The example method may further include decoding the transmission, where the transmission includes two or more repetitions of a polar codeword output portion in the transmission. The example method may further include detecting downlink control information (DCI) based on the two or more repetitions of the polar codeword output portion. The example method may further include communicating with the network node based on the DCI.

This application relates to the field of communication technologies, and discloses an alignment marker search method and apparatus, a system, and a computer-readable storage medium. The method includes: A first module receives a first data stream, where the first data stream is obtained by multiplexing a plurality of second data streams at a reference granularity, any second data stream includes an AM and data from at least one FEC codeword, and the reference granularity is a quantity of bits corresponding to n symbols included in the FEC codeword; obtains a first data segment from a first location in the first data stream at the reference granularity, and performs AM search on the first data segment. In the method, the reference granularity is the quantity of bits corresponding to the n symbols. Therefore, when a burst bit error occurs in the first data stream, a quantity of symbols affected by the burst bit error is small. In comparison with a data stream obtained through bit multiplexing, the first data stream in this method has higher tolerance to the burst bit error.

To provide a method and an apparatus for encoding and decoding of data using concatenated polarization adjusted convolutional codes.SOLUTION: An encoder receives a concatenated encoder input block d, splits d into an outer code input array a, and encodes a using outer codes to generate an output array b. The encoder generates, from b, a concatenated code output array x using a layered polarization adjusted convolutional code. A decoder 106 counts the number of layers and carries out an inner decoding operation for a layered polarization adjusted convolutional code to generate an inner decoder decision b∼i from a concatenated decoder input array y and a cumulative decision feedback (b^1, b^2 to b^i-1). The decoder carries out an outer decoding operation to generate from b∼i an outer decoder decision a^i, and carries out a reencoding operation to generate a decision feedback b^i from a^i, where the number of layers is an integer greater than two, with a concatenated decoder output block d^ being generated from outer decoder decisions.SELECTED DRAWING: Figure 1

Aspects of the present disclosure relate to techniques for wireless communication, and in particular to methods for interleaving and deinterleaving wireless data. In some examples, a wireless node may encode a plurality of bits to produce encoded bits. In some examples, a wireless node may interleave (i) a first subset of one or more coded bits via a first interleaving scheme, and (ii) a second subset of one or more coded bits via a second interleaving scheme, where one or more coded bits in the second subset are different from one or more coded bits in the first subset. In some examples, a wireless node may map (i) the interleaved first subset to a first bit level, and (ii) the interleaved second subset to a second bit level.

A data stream de-interleaving method is provided. The method includes: obtaining a first interleaved data stream on which forward error correction FEC encoding is performed; obtaining, based on an interleaving granularity of the first interleaved data stream, N sub-data streams corresponding to the first interleaved data stream, where N is an interleaving depth of the first interleaved data stream, and N is a positive integer greater than 1; determining a de-interleaving position based on FEC codeword boundaries of at least two of the N sub-data streams; and obtaining a first de-interleaved data stream based on the de-interleaving position and the first interleaved data stream. According to the method, de-interleaving can be completed and data can be correctly restored without inserting additional fixed data segments dedicated to searching for the de-interleaving position. In this way, adding of additional data is avoided, hardware resources are saved, de-interleaving efficiency is improved, transmission costs are reduced, and network efficiency is improved.

Aspects of the disclosure are directed to techniques for wireless communication, and specifically, to methods for interleaving and deinterleaving wireless data. In some examples, a wireless node may encode a plurality of bits to yield encoded bits. In some examples, the wireless node may interleave: (i) a first subset of one or more encoded bits via a first interleaving scheme, and (ii) a second subset of one or more encoded bits via a second interleaving scheme, wherein the one or more encoded bits of the second subset are different from the one or more encoded bits of the first subset. In some examples, the wireless node may map: (i) the interleaved first subset to a first bit level, and (ii) the interleaved second subset to a second bit level.

This application discloses a data transmission method, apparatus, and system, to reduce an error correction processing delay in a chiplet interconnect system, thereby improving data transmission efficiency. Before sending data, a transmit end performs processing such as single-bit error correction ECC encoding, interleaving, and PAM-N encoding on the raw data. After receiving data, a receive end performs processing such as PAM-N decoding, de-interleaving, and single-bit error correction ECC decoding on the data to restore the raw data. According to this application, error correction is performed by using a single-bit error correction technique in a chiplet interconnect system. Compared with a multi-bit error correction technique or a retransmission technique, this application can provide a lower delay and smaller area power consumption.

A data processing method is provided. The method may be applied to the field of communication technologies, and the method includes: generating a check block, where the check block is determined based on first bit sequences respectively corresponding to a plurality of code blocks, the first bit sequence is a part of a second bit sequence, and the second bit sequence is an encoded bit sequence of the code block corresponding to the first bit sequence; and sending the check block and the code blocks. In this way, error correction performance is improved when assisting in code block recovery.

A signal receiver receives a signal that encodes symbols. Each symbol represents a binary string encoded using a generalization of polar codes. The signal receiver identifies, based on the symbols, a data structure representing at least one probability of transmission. The signal receiver includes a decoder that decodes the signal based on the data structure to identify the binary strings encoded by the generalization of polar codes.

This application provides a rate matching method, a de-rate matching method, and a communication apparatus. The method includes: The communication apparatus determines a second position set based on a first position set. The first position set is an initial position set corresponding to a bit to be deleted during rate matching, and the second position set is a bit position set corresponding to an information bit in a to-be-encoded sequence. The communication apparatus performs rate matching on a first bit sequence to obtain a second bit sequence. The first bit sequence is obtained by performing channel encoding on the to-be-encoded sequence based on the second position set, the second bit sequence corresponds to a bit position other than a third position set in the first bit sequence, and a bit position in the third position set is a bit position obtained when a bit position in the first position set in the first bit sequence is converted in one or more of cyclic shift, mirror reversal, or segmented cyclic shift. The communication apparatus sends the second bit sequence. In this way, rate matching complexity can be reduced.

This application provides a signal transmission method and apparatus, applied to automatic driving, assisted driving, and the like. The method includes: A first device generates a first signal, where the first signal includes a first part and a second part, the second part is modulated in a phase shift keying PSK modulation scheme, the second part is encoded by using polar code, the first part is used to transmit a preconfigured sequence, a predefined sequence, or a sequence generated according to a predefined rule, and the second part is used to transmit control information. The first device sends the first signal to a second device. The second device obtains the control information. The PSK modulation scheme can improve sensitivity of a signal receive end, and improve anti-noise and anti-interference capabilities. In addition, the second part is encoded by using the polar code, which can improve anti-noise and anti-interference performance.

A method for deinterleaving data streams is provided. This method includes acquiring a first interleaved data stream encoded with Forward Error Correction (FEC); obtaining N sub-data streams corresponding to the first interleaved data stream based on the interleaving granularity of the first interleaved data stream, where N is the interleaving depth of the first interleaved data stream and is a positive integer greater than 1; determining the deinterleaving position based on the FEC codeword boundaries of at least two of the N sub-data streams; and obtaining a first deinterleaved data stream based on the first interleaved data stream at the deinterleaving position. This method eliminates the need to insert additional fixed data segments specifically for finding the deinterleaving position, thus completing deinterleaving and correctly recovering the data. This avoids adding extra data, saves hardware resources, improves deinterleaving efficiency, reduces transmission costs, and enhances network efficiency.

The invention relates to a flexible decoding method for a received digital signal, comprising, for a signal () in the complex plane received and to be interpreted into a vector of Q bits, a calculation of log-likelihood ratios for each bit of the vector.The digital signal is encoded into symbols in the complex plane according to a Gray-type or quasi-Gray labeling law, and a table associates each symbol in the constellation with other symbols in the complex plane. The process comprises, after receiving said signal, an identification step (100) of the symbol in the constellation closest to the signal in the complex plane, followed by an extraction step (101, 102) from memory of at least some of said other symbols associated by the lookup table with said closest identified symbol, and finally, by a linear combination (105) of products of the integer and imaginary values ​​of said extracted symbols and the received signal, the provision to the receiver controller of values ​​for the log-likelihood ratios of the Q bits. Abbreviated figure: Figure 5.

Systems and techniques for wireless communication are provided. An input bit sequence of a plurality of polarization coded bits each associated with a respective bit index of a plurality of bit indices and a respective subcarrier of a modulated plurality of subcarriers for polarization coding may be obtained. A first interleaving pattern may be applied to a first subset of polarization coded bits each associated with a first bit index of the plurality of bit indices. A second interleaving pattern may be applied to a second subset of the polarization coded bits each associated with a second bit index of the plurality of bit indices, the second interleaving pattern being different from the first interleaving pattern. The interleaved bit sequence may be output to include a first portion corresponding to the first interleaving pattern and the first subset and a second portion corresponding to the second interleaving pattern and the second subset.