WO2019015743A1 - Apparatus and method for encoding a message having a target probability distribution of code symbols - Google Patents
Apparatus and method for encoding a message having a target probability distribution of code symbols Download PDFInfo
- Publication number
- WO2019015743A1 WO2019015743A1 PCT/EP2017/068035 EP2017068035W WO2019015743A1 WO 2019015743 A1 WO2019015743 A1 WO 2019015743A1 EP 2017068035 W EP2017068035 W EP 2017068035W WO 2019015743 A1 WO2019015743 A1 WO 2019015743A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- vector
- communication apparatus
- bits
- precoder
- message
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
- H03M13/251—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with block coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
- H04L1/0042—Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape
Definitions
- the present invention relates to encoding and decoding in communication systems. More specifically, the present invention relates to apparatuses and methods for encoding and decoding messages based on a polar transform.
- the channel input symbols should have a certain probability distribution.
- AWGN additive white Gaussian noise
- a Gaussian distribution is required in order to achieve the capacity of the channel.
- uniformly distributed channel input symbols are used, thereby causing a gap to the capacity.
- This loss is also called the shaping loss and can be up to 1 .53 dB on AWGN channels, in case uniformly distributed quadrature amplitude modulation (QAM) symbols are used.
- QAM quadrature amplitude modulation
- a common approach for transmission with high order modulation is the so-called bit-interleaved coded modulation (BICM), wherein the message is first encoded by a channel encoder to a code word which is interleaved, and then mapped to channel input symbols via a symbol mapper.
- BICM bit-interleaved coded modulation
- the code words are binary vectors.
- NUC non-uniform constellations
- the output of the channel encoder is mapped to symbols that do not have a regular structure like QAM symbols, but have an optimized structure which can help reducing the shaping loss.
- This approach does not have any constraints on the used channel code and is also called geometric shaping.
- the standard QAM symbol mapper and QAM demapper has to be replaced by a more complex mapper/demapper, due to the non-regular constellation structure.
- the so-called probabilistic amplitude shaping (PAS) approach proposes the use of a shaping encoder prior to using the channel encoder, which converts the uniformly distributed input message to a non-uniformly distributed sequence.
- this sequence is encoded by a systematic channel encoder (i.e., the output of the channel encoder contains the input of the encoder as a sub-vector), which is then fed to a QAM symbol mapper.
- a QAM demapper can be used.
- the shaping decoder processes the output of the channel code in order to retrieve the message.
- this approach can remove almost all the shaping loss, it still requires a shaping encoder and a shaping decoder, thus, increasing the complexity and latency at the transmitter and the receiver.
- the information is retrieved after being processed by two decoders in serial, which can be suboptimal compared to a joint decoder.
- this approach poses a constraint on the used channel code, since the channel encoder has to be a systematic encoder, which may not be favorable.
- Polar codes (see, E. Arikan, "Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051 -3073, Jul. 2009) are recently developed forward error correction schemes that can achieve the capacity of binary input discrete memoryless channels and which can be used for the channel coding scheme.
- their performance with high order modulation (such as with BICM) is often poor compared to other modern coding schemes.
- the channel input symbols are considered as a combination of different bit levels. For each bit level, a different channel code is used.
- the demapping and decoding are done successively, i.e., it is started by demapping and decoding the first bit-level. After the first bit-level is processed, the output is used to demap and decode the second bit-level, and continues until all the bit levels are processed.
- polar codes combined with MLC can be better than conventional BICM.
- BICM bit-level code
- a separate channel code for each bit-level needs to be designed, and several channel demapping and decoding processes should be run, which can increase the complexity and the processing latency.
- there is a need for improved communication apparatuses and methods for encoding and decoding messages based on polar codes allowing to reduce the gap to the capacity of the transmission channel.
- the invention relates to a communication apparatus for encoding a message to be transmitted over a communication channel
- the communication apparatus comprises: a precoder configured to generate on the basis of the message and a polar transform a pre-coded message, and a channel encoder configured to encode the pre- coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the precoder is configured to generate the pre-coded message such that the channel encoder generates the plurality of bits of the code word with the probability distribution matching a target probability distribution.
- Matching the probability distribution to a target probability distribution can comprise that the precoder generates the bits and/or symbols based on the target probability distribution. Further, this can comprise that the bits and/or symbols generated by the precoder (or the channel encoder that processes the output of the precoder) have a probability distribution that is substantially equal to the target distribution, in particular that the probability distribution has substantially the same mean and/or variance as the target distribution. For example, the distance between the probability distribution of the plurality of bits of the code word and the target probability distribution can be given by the Kullback-Leibler distance.
- the communication apparatus can generate code words having a non-uniform probability distribution of the plurality of bits. For example, the probability for 1 to occur in a code word can be different from 0.5.
- an improved communication apparatus is provided, since its performance is significantly improved compared to conventional BICM with polar codes and compared to multi-level coding with polar codes.
- the precoder is a systematic precoder, i.e., the pre-coded message contains the message.
- the communication apparatus further comprises an interleaver configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper configured to map the code word to one or more symbols for transmission over the communication channel.
- an interleaver configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper configured to map the code word to one or more symbols for transmission over the communication channel.
- the polar transform is configured to take as an input a vector of frozen bits /, wherein the precoder is configured to generate the pre-coded message on the basis of the message and the vector of frozen bits /.
- the precoder is configured to generate the pre-coded message using one or more polar decoders, in particular successive cancellation (SC) or successive cancellation list (SCL) decoders.
- SC successive cancellation
- SCL successive cancellation list
- an improved communication apparatus is provided, since, for example, using a SC decoder provides the advantage of having a less complex communication apparatus, while using a SCL decoder provides the advantage of having a communication apparatus with a good performance.
- the precoder is configured to take as an input a vector v comprising a vector of information bits e representing the message and the vector of frozen bits /, wherein the precoder is configured to decompose the vector v into m subvectors v t .
- the precoder comprises m sub-precoders, wherein each sub-precoder is configured to generate a respective subvector d t of a vector d representing the pre-coded message.
- the precoder is configured to generate the vector d representing the pre-coded message on the basis of the respective subvectors d t generated by the respective sub- precoders.
- each sub-precoder comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder.
- each subvector v t of the vector v comprises a vector e t , which is a subvector of the vector of information bits e, and a vector /; , which is a subvector of the vector of frozen bits /, and wherein each sub-precoder is configured to generate a respective subvector d t of the vector d representing the pre-coded message on the basis of the respective subvector of information bits e t and the respective subvector of frozen bits /; .
- the target probability distribution comprises a plurality of target probabilities ; and wherein each sub-precoder is configured to generate a respective auxiliary channel decoder input vector y'i on the basis of the respective target probability ;.
- This provides the advantage of generating code words that contain different sub-vectors with different probabilities, so that after the symbol mapper channel input symbols with desired distribution can be obtained. Moreover, this allows to reduce the gap to the capacity of the transmission channel.
- each sub-precoder is further configured to generate a subvector of auxiliary frozen bits /'; on the basis of the respective subvector of information bits e t and the respective subvector of frozen bits /; .
- each sub-precoder comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder, configured to generate a respective shaping bit vector s; on the basis of the respective auxiliary channel decoder input vector y'i and the respective subvector of auxiliary frozen bits /';, wherein each sub- precoder is configured to generate the respective subvector d t of the vector d representing the pre-coded message on the basis of the respective information bits subvector e t and the respective shaping bit vector s; .
- each sub-precoder is configured to generate the respective subvector d t of the vector d representing the pre-coded message on the basis of the respective information bits subvector e t and the respective shaping bit vector s; by concatenating the respective shaping bit vector s; with the respective information bits subvector e t .
- the invention relates to a method for encoding a message to be transmitted over a communication channel, wherein the method comprises: generating on the basis of the message and a polar transform a pre-coded message, and
- the code word comprises a plurality of bits which have a probability distribution
- the pre-coded message is generated in such a way that the plurality of bits of the code word are generated with the probability distribution matching a target probability distribution.
- the invention relates to a computer program comprising program code for performing the method of the second aspect, when executed on a computer or a processor.
- the invention relates to a communication apparatus for decoding a message received over a communication channel, wherein the communication apparatus comprises: a channel decoder configured to generate an estimate of a vector d containing a vector of information bits e and a vector of shaping bits s by decoding the message on the basis of a polar transform on the basis of a vector of frozen bits /.
- the channel decoder is configured to discard the vector of shaping bits s.
- the channel decoder is configured to generate a sequence s' on the basis of the estimate of the vector d and to output an error message, in case the sequence s' is not equal to the vector of shaping bits s.
- the channel decoder comprises a list decoder configured to select a respective code word from a list of code words by selecting the code word, for which the sequence s' is equal to the vector of shaping bits s.
- the invention can be implemented in hardware and/or software.
- FIG. 1 shows a schematic diagram illustrating a communication system comprising a communication apparatus for encoding a message according to an embodiment, and a communication apparatus for decoding the message according to an embodiment;
- Fig. 2 shows a schematic diagram illustrating the channel encoder of a communication apparatus for encoding a message according to an embodiment
- Fig. 3 shows a schematic diagram illustrating a communication apparatus for decoding a message according to an embodiment
- Fig. 4 shows a schematic diagram illustrating a polar transform used by a communication apparatus for encoding a message according to an embodiment
- Fig. 5 shows a schematic diagram illustrating a communication apparatus for encoding a message according to an embodiment
- Fig. 6 shows a schematic diagram illustrating a polar transform used by a communication apparatus for encoding a message according to an embodiment
- Fig. 7 shows a schematic diagram illustrating a precoder of a communication apparatus for encoding a message according to an embodiment
- Fig. 8 shows a schematic diagram illustrating a sub-precoder of a precoder of a
- Fig. 9 shows a schematic diagram of a method for encoding a message according to an embodiment.
- identical reference signs will be used for identical or at least functionally equivalent features.
- a corresponding device may include a unit to perform the described method step, even if such unit is not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary aspects described herein may be combined with each other, unless specifically noted otherwise.
- Figure 1 shows a schematic diagram illustrating a communication system 100 comprising a communication apparatus 1 10 for encoding a message to be transmitted over a
- the communication apparatus 1 10 comprises a precoder 102 configured to generate on the basis of the message and a polar transform a pre-coded message, and a channel encoder 104 configured to encode the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the precoder 102 is configured to generate the pre-coded message such that the channel encoder 104 generates the plurality of bits of the code word with the probability distribution matching a target probability distribution, as will be described in more detail further below.
- rresponding to the Matching the probability distribution to a target probability distribution can comprise that the precoder 102 generates the bits and/or symbols based on the target probability distribution.
- this can comprise that the bits and/or symbols generated by the precoder 102 (or the channel encoder 104 that processes the output of the precoder) have a probability distribution that is substantially equal to the target distribution, in particular that the probability distribution has substantially the same mean and/or variance as the target distribution.
- the distance between the probability distribution of the plurality of bits of the code word and the target probability distribution can be given by the Kullback-Leibler distance.
- the communication apparatus 1 10 can easily be configured to adapt the generation of the code word with other modifications of polar codes, such as rate adaptation (puncturing, shortening and incremental redundancy methods) and other modifications for polar codes (like parity check (PC)-polar codes, cyclic redundancy check (CRC) assisted/CA-polar codes, sub-polar codes).
- polar codes like parity check (PC)-polar codes, cyclic redundancy check (CRC) assisted/CA-polar codes, sub-polar codes.
- PC parity check
- CRC cyclic redundancy check
- sub-polar codes sub-polar codes.
- the frozen bits of the polar transform can be chosen randomly or pseudo-randomly, wherein the randomness is shared between the encoder and the decoder.
- the communication apparatus 120 for decoding a message comprises a channel decoder 120a configured to generate an estimate of a vector d
- Figure 2 shows a schematic diagram illustrating the channel encoder 104 comprising a unit 104b for implementing the polar transform according to an embodiment.
- the channel encoder 104 is a polar encoder comprising a demultiplexer 104a and the polar transform unit 104b according to an embodiment.
- the demultiplexer 104a can be configured to combine the vector d representing the pre- coded message with a vector of frozen bits / in order to form a vector u of length N.
- the obtained vector u has the following structure:
- Uj,j 6 F contains the elements of f
- the vector u comprises, at the indices /, the bits of d (that contains a vector of information bits e representing the message and a vector of shaping bits s), and at the indices F, the frozen bits, that are also known at the receiver side (i.e., the communication apparatus 120).
- the vector u can then be converted into the code word c by using the polar transform implemented in the unit 104b, which can be seen as a multiplication of the vector u with a N x N polarization matrix.
- Figure 3 shows a schematic diagram of a communication apparatus 120 for decoding a message comprising a polar decoder 120a, in particular successive cancellation (SC) or a successive cancellation list (SCL) decoder 120a according to an embodiment.
- SC successive cancellation
- SCL successive cancellation list
- the SC or SCL polar decoder 120a has four inputs: the channel output vector or received symbols y (also called 'channel decoder input vector'), e.g., the log-likelihood values (Inp1 ), the vector of frozen bits / (Inp2), the set of indices of the information bits / (Inp3), and the set of indices of the frozen bits F (Inp4).
- the SC or SCL polar decoder 120a can have one output, namely the decoded information bits (Out1 ), i.e., the vector d representing the pre-coded message.
- the channel encoder 104 shown in figure 2 and/or the SC or SCL decoder 120b shown in figure 3 can have additional parameters depending on the implementation, and some of the input parameters can be related, such that one can obtain some input parameters depending on the other input parameters. For example, if the set of the information bits / is known, then the set of frozen bits indices F can be obtained as well.
- Figure 4 shows a schematic diagram illustrating a polar transform of length N implemented in the unit 104b according to an embodiment.
- the polar transform of length N implemented in the unit 104b can be used to generate the code word or polar code word c of length N by means of ⁇ og 2 (N) polarization steps, which can be performed successively. Therefore, a polar code word c of length N can also be seen as a code word obtained by using two polar codes of length N/2, which can further be polarized in one more step, as shown in figure 4.
- the communication apparatus 1 10 can further comprise an interleaver 500 configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper 502 configured to map the code word to one or more symbols for transmission over the communication channel.
- Figure 5 shows a schematic diagram illustrating the communication apparatus 1 10 for encoding a message comprising the precoder 102, the channel encoder 104, the interleaver 500, and the symbol mapper 502 according to an embodiment.
- the vector of information bits e representing the message is first processed by the precoder 102, which generates a vector d representing the pre-coded message.
- the vector d (d 0 , ... , d n ) representing the pre- coded message can be encoded by the channel encoder 104 in order to generate the code word, in particular a binary code word c.
- P c (l) ⁇ 0.5 i.e., the binary code word c can contain ones and zeros with an unequal probability distribution (note that P z (a) denotes the probability of occurrence of the element a in the vector z.).
- the precoder 102 is configured to generate the vector d in such a way that, after channel encoding by the channel encoder 104, the resulting code word c has certain characteristics in terms of probability distributions.
- the characteristics in terms of probability distributions can be described as follows: the code word c comprises m subvectors (for example subvectors of the same length) c , ... , c m , and each of these m subvectors has a respective target probability, i.e.,
- the vector d comprises the vector of information bits e, i.e, the vector of information bits e is a subvector of the vector d, i.e., the precoder 102 is a systematic precoder.
- the binary code word c can be shuffled or interleaved via the interleaver 500 in order to obtain a vector b. Then, the vector b can be fed to a symbol mapper 502.
- the symbol mapper 502 can be configured to map the binary code word c to one or more symbols for transmission over the communication channel.
- the symbol mapper 502 can output these symbols from the alphabet X. Therefore, in this embodiment, the output vector x of the symbol mapper 502 has a nonuniform probability distribution.
- Figure 6 shows a schematic diagram illustrating an embodiment where the precoder 102 comprises a first and a second sub-precoder.
- m different parts of the vector u of length N are generated in such a way that each of these m parts have some dependencies within their bits or different probability distributions.
- m can correspond to the number of bit-levels for higher-order modulation.
- the subvectors u x and u 2 can be generated using the first and the second sub-precoder. This can imply that the bits comprised in Uj have some dependencies. If [ ⁇ 1 ⁇ 2 u 2 ] is encoded via a single polar transform implemented in the unit 104b of length N, then the resulting code word c can have the desired properties mentioned above.
- the subvectors u x and u 2 can comprise information bits and frozen bits. Moreover, in embodiments of the invention, the subvectors u x and u 2 can comprise shaping bits as well, which are based on the information bits and frozen bits, and which help the output distribution to converge to the target probability distribution.
- Figure 7 shows a schematic diagram illustrating the precoder 102 of the communication apparatus 1 10 according to an embodiment.
- the precoder 102 comprises two multiplexing units 102a-1 , 102a-2, m sub-precoders 102b-1 ,...,102b-m, and a demultiplexing unit 104a.
- the precoder 102 can be configured to decompose a vector v comprising the vector of information bits e and the vector of frozen bits / into m subvectors v wherein each of the subvectors v t comprises a vector e i which is a subvector of the vector of information bits e and a vector /;, which is a subvector of the vector of frozen bits /.
- the multiplexing unit 102a-1 is configured to decompose the vector of information bits e into m vectors e t
- the multiplexing unit 102a-1 is configured to decompose the vector of frozen bits / into m vectors
- each of the m sub-precoders 102b-1 ,...,102b-m is configured to generate each of the respective subvectors d t of the vector d representing the pre-coded message on the basis of the respective vector e t , the vector /; and a respective target probability p t .
- the demultiplexing unit 104a is configured to generate the vector d representing the pre-coded message by combining the m subvectors d t .
- the precoder 102 contains a SC or SCL polar decoder 120a as already described in the context of figure 3.
- Figure 8 shows a schematic diagram illustrating a more detailed view of one of the m sub- precoders 102b-1 ,...,102b-m shown in figure 7.
- the sub-precoder 102b-1 comprises a unit 800 configured to generate a respective auxiliary channel decoder input vector y'i on the basis of the respective target probability p t .
- the channel decoder input vector is a vector of length N (same length as the code word length), with the elements having the same value log(pi/(l - i)).
- the respective subvector of information bits e t and the respective subvector of frozen bits f t are combined in the demultiplexer 802 in order to generate a vector /
- the bits composing the vector /'; can be used as auxiliary frozen bits for a SC/SCL decoder 804 in the sub-precoder 102b (Inp2).
- the SC/SCL decoder 804 in the sub-precoder 102b-1 can use the respective auxiliary channel decoder input vector y'i as the channel output vector (Inp1 ).
- the output of the SC/SCL polar decoder 804 can contain a respective shaping bit vector s; (Out1 ).
- a demultiplexing unit 806 can be configured to concatenate the respective shaping bit vector s t to the respective information bits subvector e t in order to generate the respective vector d;.
- the sub-precoder 102b-1 provides the advantage that the vector d contains e as a subvector, which provides the advantage of an easy decoding at the side of the receiving communication apparatus 120.
- the sub-precoder 102b-1 provides the advantage of using a SC or SCL decoder 804 for generating the code word c, which is already a part of the polar transmission chain, namely the decoder 120a of the receiving communication apparatus 120 shown in figure 3.
- the precoder 102 can be realized by using existing hardware on a chip comprising the communication apparatus 1 10 and the communication apparatus 120.
- Figure 9 shows a schematic diagram of a method 900 for encoding a message to be transmitted over a communication channel according to an embodiment.
- the method 900 comprises the steps of: generating 902 on the basis of the message and a polar transform a pre-coded message, and encoding 904 the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the pre-coded message is generated in such a way that the plurality of bits of the code word are generated with the probability distribution matching a target probability distribution.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention relates to a communication apparatus (110) for encoding a message to be transmitted over a communication channel. The communication apparatus (110) comprises a precoder (102) configured to generate on the basis of the message and a polar transform a pre-coded message, and a channel encoder (104) configured to encode the pre- coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the precoder (102) is configured to generate the pre-coded message such that the channel encoder (104) generates the plurality of bits of the code word with the probability distribution matching a target probability distribution.
Description
DESCRIPTION
APPARATUS AND METHOD FOR ENCODING A MESSAGE HAVING A TARGET PROBABILITY DISTRIBUTION OF CODE SYMBOLS TECHNICAL FIELD
In general, the present invention relates to encoding and decoding in communication systems. More specifically, the present invention relates to apparatuses and methods for encoding and decoding messages based on a polar transform.
BACKGROUND
In order to achieve the capacity of a transmission channel in communication systems, the channel input symbols should have a certain probability distribution. For example, in the case of an additive white Gaussian noise (AWGN) channel, a Gaussian distribution is required in order to achieve the capacity of the channel. However, in many practical communication systems, uniformly distributed channel input symbols are used, thereby causing a gap to the capacity. This loss is also called the shaping loss and can be up to 1 .53 dB on AWGN channels, in case uniformly distributed quadrature amplitude modulation (QAM) symbols are used.
The shaping loss can become significant especially with high order modulation. A common approach for transmission with high order modulation is the so-called bit-interleaved coded modulation (BICM), wherein the message is first encoded by a channel encoder to a code word which is interleaved, and then mapped to channel input symbols via a symbol mapper. In many communication systems, binary channel codes are used, such that the code words are binary vectors. In general, the distribution of ones and zeros in a code word is uniform. This causes the channel input symbols to have a uniform distribution too. In the so-called non-uniform constellations (NUC) approach, the possibility of using a symbol mapper with non-uniform constellations is suggested. In this approach, the output of the channel encoder is mapped to symbols that do not have a regular structure like QAM symbols, but have an optimized structure which can help reducing the shaping loss. This approach does not have any constraints on the used channel code and is also called geometric shaping. However, in this approach the standard QAM symbol mapper and QAM demapper has to be replaced by a more complex mapper/demapper, due to the non-regular constellation structure.
The so-called probabilistic amplitude shaping (PAS) approach proposes the use of a shaping encoder prior to using the channel encoder, which converts the uniformly distributed input message to a non-uniformly distributed sequence. Then, this sequence is encoded by a systematic channel encoder (i.e., the output of the channel encoder contains the input of the encoder as a sub-vector), which is then fed to a QAM symbol mapper. At the receiver, a QAM demapper can be used. After decoding the channel code, the shaping decoder processes the output of the channel code in order to retrieve the message. Although this approach can remove almost all the shaping loss, it still requires a shaping encoder and a shaping decoder, thus, increasing the complexity and latency at the transmitter and the receiver. The information is retrieved after being processed by two decoders in serial, which can be suboptimal compared to a joint decoder. Moreover, this approach poses a constraint on the used channel code, since the channel encoder has to be a systematic encoder, which may not be favorable.
Polar codes (see, E. Arikan, "Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051 -3073, Jul. 2009) are recently developed forward error correction schemes that can achieve the capacity of binary input discrete memoryless channels and which can be used for the channel coding scheme. However, their performance with high order modulation (such as with BICM) is often poor compared to other modern coding schemes. Moreover, in general, polar code words have Pc(l) = 0.5, i.e., the probabilities of having ones and zeros in the code words are equal.
In the prior art, there are proposals (see the work by Mondelli et al., "How to achieve the capacity of asymmetric channels", Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on. IEEE, 2014) to shape the output distribution of a polar code word, such that Pc(l) is not equal to 0.5. This is achieved by allowing some
dependencies between the transmitted information bits. Basically, instead of transmitting k information bits, one transmits k— s information bits, and generates s bits depending on the rest. Those s bits are selected in a way, such that the resulting code word has a certain Pc(l). These bits can also be called the shaping bits. In the BICM case, it is possible to combine BICM with polar codes (using a single polar code combined with a high order modulation). This is compatible with many existing standards,
and easy to implement. However, the performance of BICM with polar codes is poor compared to other alternatives.
In the multi-level coding (MLC) approach, the channel input symbols are considered as a combination of different bit levels. For each bit level, a different channel code is used. At the receiver, the demapping and decoding are done successively, i.e., it is started by demapping and decoding the first bit-level. After the first bit-level is processed, the output is used to demap and decode the second bit-level, and continues until all the bit levels are processed. It has been shown that the performance of polar codes combined with MLC can be better than conventional BICM. However, although a good performance can be achieved, a separate channel code for each bit-level needs to be designed, and several channel demapping and decoding processes should be run, which can increase the complexity and the processing latency. Thus, there is a need for improved communication apparatuses and methods for encoding and decoding messages based on polar codes allowing to reduce the gap to the capacity of the transmission channel.
SUMMARY
It is an object of the invention to provide for improved communication apparatuses and method for encoding and decoding messages based on polar codes allowing to reduce the gap to the capacity of the transmission channel. The foregoing and other objects are achieved by the subject matter of the independent claims. Further implementation forms are apparent from the dependent claims, the description and the figures.
According to a first aspect, the invention relates to a communication apparatus for encoding a message to be transmitted over a communication channel, wherein the communication apparatus comprises: a precoder configured to generate on the basis of the message and a polar transform a pre-coded message, and a channel encoder configured to encode the pre- coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the precoder is configured to generate the pre-coded message such that the channel encoder generates the plurality of bits of the code word with the probability distribution matching a target probability distribution.
rresponding to the
Matching the probability distribution to a target probability distribution can comprise that the precoder generates the bits and/or symbols based on the target probability distribution. Further, this can comprise that the bits and/or symbols generated by the precoder (or the channel encoder that processes the output of the precoder) have a probability distribution that is substantially equal to the target distribution, in particular that the probability distribution has substantially the same mean and/or variance as the target distribution. For example, the distance between the probability distribution of the plurality of bits of the code word and the target probability distribution can be given by the Kullback-Leibler distance.
Thus, the communication apparatus according to the first aspect can generate code words having a non-uniform probability distribution of the plurality of bits. For example, the probability for 1 to occur in a code word can be different from 0.5. Thus, an improved communication apparatus is provided, since its performance is significantly improved compared to conventional BICM with polar codes and compared to multi-level coding with polar codes.
In a possible implementation form of the communication apparatus according to the first aspect, the precoder is a systematic precoder, i.e., the pre-coded message contains the message.
This provides the advantage that, at the receiver side, which is configured to decode the message to be transmitted, the inversion of the precoding operation is not required, allowing for a less complex receiver.
In a further possible implementation form of the communication apparatus according to the first aspect, the communication apparatus further comprises an interleaver configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper configured to map the code word to one or more symbols for transmission over the communication channel. Thus, an improved communication apparatus is provided, since, for example, the use of an interleaver makes forward error correction more robust with respect to burst errors.
In a further possible implementation form of the communication apparatus according to the first aspect, the polar transform is configured to take as an input a vector of frozen bits /, wherein the precoder is configured to generate the pre-coded message on the basis of the message and the vector of frozen bits /.
In a further possible implementation form of the communication apparatus according to the first aspect, the precoder is configured to generate the pre-coded message using one or more polar decoders, in particular successive cancellation (SC) or successive cancellation list (SCL) decoders.
Thus, an improved communication apparatus is provided, since, for example, using a SC decoder provides the advantage of having a less complex communication apparatus, while using a SCL decoder provides the advantage of having a communication apparatus with a good performance.
In a further possible implementation form of the communication apparatus according to the first aspect, the precoder is configured to take as an input a vector v comprising a vector of information bits e representing the message and the vector of frozen bits /, wherein the precoder is configured to decompose the vector v into m subvectors vt.
In a further possible implementation form of the communication apparatus according to the first aspect, the precoder comprises m sub-precoders, wherein each sub-precoder is configured to generate a respective subvector dt of a vector d representing the pre-coded message.
In a further possible implementation form of the communication apparatus according to the first aspect, the precoder is configured to generate the vector d representing the pre-coded message on the basis of the respective subvectors dt generated by the respective sub- precoders.
In a further possible implementation form of the communication apparatus according to the first aspect, each sub-precoder comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder.
In a further possible implementation form of the communication apparatus according to the first aspect, each subvector vt of the vector v comprises a vector et, which is a subvector of
the vector of information bits e, and a vector /; , which is a subvector of the vector of frozen bits /, and wherein each sub-precoder is configured to generate a respective subvector dt of the vector d representing the pre-coded message on the basis of the respective subvector of information bits et and the respective subvector of frozen bits /; .
In a further possible implementation form of the communication apparatus according to the first aspect, the target probability distribution comprises a plurality of target probabilities ; and wherein each sub-precoder is configured to generate a respective auxiliary channel decoder input vector y'i on the basis of the respective target probability ;.
This provides the advantage of generating code words that contain different sub-vectors with different probabilities, so that after the symbol mapper channel input symbols with desired distribution can be obtained. Moreover, this allows to reduce the gap to the capacity of the transmission channel.
In a further possible implementation form of the communication apparatus according to the first aspect, each sub-precoder is further configured to generate a subvector of auxiliary frozen bits /'; on the basis of the respective subvector of information bits et and the respective subvector of frozen bits /; .
In a further possible implementation form of the communication apparatus according to the first aspect, each sub-precoder comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder, configured to generate a respective shaping bit vector s; on the basis of the respective auxiliary channel decoder input vector y'i and the respective subvector of auxiliary frozen bits /';, wherein each sub- precoder is configured to generate the respective subvector dt of the vector d representing the pre-coded message on the basis of the respective information bits subvector et and the respective shaping bit vector s; . In a further possible implementation form of the communication apparatus according to the first aspect, each sub-precoder is configured to generate the respective subvector dt of the vector d representing the pre-coded message on the basis of the respective information bits subvector et and the respective shaping bit vector s; by concatenating the respective shaping bit vector s; with the respective information bits subvector et .
According to a second aspect, the invention relates to a method for encoding a message to be transmitted over a communication channel, wherein the method comprises: generating on the basis of the message and a polar transform a pre-coded message, and
encoding the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the pre-coded message is generated in such a way that the plurality of bits of the code word are generated with the probability distribution matching a target probability distribution.
According to a third aspect, the invention relates to a computer program comprising program code for performing the method of the second aspect, when executed on a computer or a processor.
According to a fourth aspect, the invention relates to a communication apparatus for decoding a message received over a communication channel, wherein the communication apparatus comprises: a channel decoder configured to generate an estimate of a vector d containing a vector of information bits e and a vector of shaping bits s by decoding the message on the basis of a polar transform on the basis of a vector of frozen bits /.
In a possible implementation form of the communication apparatus according to the fourth aspect, the channel decoder is configured to discard the vector of shaping bits s.
In a further implementation form of the communication apparatus according to the fourth aspect, the channel decoder is configured to generate a sequence s' on the basis of the estimate of the vector d and to output an error message, in case the sequence s' is not equal to the vector of shaping bits s.
In a further implementation form of the communication apparatus according to the fourth aspect, the channel decoder comprises a list decoder configured to select a respective code word from a list of code words by selecting the code word, for which the sequence s' is equal to the vector of shaping bits s.
The invention can be implemented in hardware and/or software.
BRIEF DESCRIPTION OF THE DRAWINGS
Further embodiments of the invention will be described with respect to the following figures, wherein:
Fig. 1 shows a schematic diagram illustrating a communication system comprising a communication apparatus for encoding a message according to an embodiment, and a communication apparatus for decoding the message according to an embodiment;
Fig. 2 shows a schematic diagram illustrating the channel encoder of a communication apparatus for encoding a message according to an embodiment;
Fig. 3 shows a schematic diagram illustrating a communication apparatus for decoding a message according to an embodiment;
Fig. 4 shows a schematic diagram illustrating a polar transform used by a communication apparatus for encoding a message according to an embodiment; Fig. 5 shows a schematic diagram illustrating a communication apparatus for encoding a message according to an embodiment;
Fig. 6 shows a schematic diagram illustrating a polar transform used by a communication apparatus for encoding a message according to an embodiment;
Fig. 7 shows a schematic diagram illustrating a precoder of a communication apparatus for encoding a message according to an embodiment;
Fig. 8 shows a schematic diagram illustrating a sub-precoder of a precoder of a
communication apparatus for encoding a message according to an embodiment; and
Fig. 9 shows a schematic diagram of a method for encoding a message according to an embodiment. In the various figures, identical reference signs will be used for identical or at least functionally equivalent features.
DETAILED DESCRIPTION OF EMBODIMENTS In the following description, reference is made to the accompanying drawings, which form part of the disclosure, and in which are shown, by way of illustration, specific aspects in which the present invention may be placed. It is understood that other aspects may be
utilized and structural or logical changes may be made without departing from the scope of the present invention. The following detailed description, therefore, is not to be taken in a limiting sense, as the scope of the present invention is defined by the appended claims. For instance, it is understood that a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa. For example, if a specific method step is described, a corresponding device may include a unit to perform the described method step, even if such unit is not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary aspects described herein may be combined with each other, unless specifically noted otherwise.
Figure 1 shows a schematic diagram illustrating a communication system 100 comprising a communication apparatus 1 10 for encoding a message to be transmitted over a
communication channel, and a communication apparatus 120 for decoding the message according to an embodiment.
The communication apparatus 1 10 comprises a precoder 102 configured to generate on the basis of the message and a polar transform a pre-coded message, and a channel encoder 104 configured to encode the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the precoder 102 is configured to generate the pre-coded message such that the channel encoder 104 generates the plurality of bits of the code word with the probability distribution matching a target probability distribution, as will be described in more detail further below. rresponding to the
Matching the probability distribution to a target probability distribution can comprise that the precoder 102 generates the bits and/or symbols based on the target probability distribution. Further, this can comprise that the bits and/or symbols generated by the precoder 102 (or the channel encoder 104 that processes the output of the precoder) have a probability distribution that is substantially equal to the target distribution, in particular that the probability distribution has substantially the same mean and/or variance as the target distribution. For
example, the distance between the probability distribution of the plurality of bits of the code word and the target probability distribution can be given by the Kullback-Leibler distance.
The communication apparatus 1 10 can easily be configured to adapt the generation of the code word with other modifications of polar codes, such as rate adaptation (puncturing, shortening and incremental redundancy methods) and other modifications for polar codes (like parity check (PC)-polar codes, cyclic redundancy check (CRC) assisted/CA-polar codes, sub-polar codes). Furthermore, the frozen bits of the polar transform can be chosen randomly or pseudo-randomly, wherein the randomness is shared between the encoder and the decoder.
The communication apparatus 120 for decoding a message according to an embodiment comprises a channel decoder 120a configured to generate an estimate of a vector d
containing a vector of information bits e and a vector of shaping bits s by decoding the message sent by the communication apparatus 1 10 on the basis of the polar transform on the basis of a vector of frozen bits /, as will be described in more detail further below.
Figure 2 shows a schematic diagram illustrating the channel encoder 104 comprising a unit 104b for implementing the polar transform according to an embodiment.
In this embodiment, the channel encoder 104 is a polar encoder comprising a demultiplexer 104a and the polar transform unit 104b according to an embodiment.
The demultiplexer 104a can be configured to combine the vector d representing the pre- coded message with a vector of frozen bits / in order to form a vector u of length N. In an embodiment, the obtained vector u has the following structure:
Ui, i E I contains the elements of d
Uj,j 6 F contains the elements of f
/ U F = {0,1, ... , ]V - 1}
I n F = 0, namely, the vector u comprises, at the indices /, the bits of d (that contains a vector of information bits e representing the message and a vector of shaping bits s), and at the indices F, the frozen bits, that are also known at the receiver side (i.e., the communication apparatus 120). The vector u can then be converted into the code word c by using the polar
transform implemented in the unit 104b, which can be seen as a multiplication of the vector u with a N x N polarization matrix.
Figure 3 shows a schematic diagram of a communication apparatus 120 for decoding a message comprising a polar decoder 120a, in particular successive cancellation (SC) or a successive cancellation list (SCL) decoder 120a according to an embodiment.
In the embodiment shown in figure 3, the SC or SCL polar decoder 120a has four inputs: the channel output vector or received symbols y (also called 'channel decoder input vector'), e.g., the log-likelihood values (Inp1 ), the vector of frozen bits / (Inp2), the set of indices of the information bits / (Inp3), and the set of indices of the frozen bits F (Inp4). Moreover, the SC or SCL polar decoder 120a can have one output, namely the decoded information bits (Out1 ), i.e., the vector d representing the pre-coded message. In embodiments of the invention, the channel encoder 104 shown in figure 2 and/or the SC or SCL decoder 120b shown in figure 3 can have additional parameters depending on the implementation, and some of the input parameters can be related, such that one can obtain some input parameters depending on the other input parameters. For example, if the set of the information bits / is known, then the set of frozen bits indices F can be obtained as well.
Figure 4 shows a schematic diagram illustrating a polar transform of length N implemented in the unit 104b according to an embodiment.
The polar transform of length N implemented in the unit 104b can be used to generate the code word or polar code word c of length N by means of \og2(N) polarization steps, which can be performed successively. Therefore, a polar code word c of length N can also be seen as a code word obtained by using two polar codes of length N/2, which can further be polarized in one more step, as shown in figure 4. The communication apparatus 1 10 can further comprise an interleaver 500 configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper 502 configured to map the code word to one or more symbols for transmission over the communication channel.
Figure 5 shows a schematic diagram illustrating the communication apparatus 1 10 for encoding a message comprising the precoder 102, the channel encoder 104, the interleaver 500, and the symbol mapper 502 according to an embodiment. In the embodiment shown in figure 5, the vector of information bits e representing the message is first processed by the precoder 102, which generates a vector d representing the pre-coded message. In this embodiment, the vector d = (d0, ... , dn) representing the pre- coded message can be encoded by the channel encoder 104 in order to generate the code word, in particular a binary code word c. In an embodiment, Pc(l)≠ 0.5, i.e., the binary code word c can contain ones and zeros with an unequal probability distribution (note that Pz(a) denotes the probability of occurrence of the element a in the vector z.).
As already described above, in an embodiment, the precoder 102 is configured to generate the vector d in such a way that, after channel encoding by the channel encoder 104, the resulting code word c has certain characteristics in terms of probability distributions.
In embodiments of the invention, the characteristics in terms of probability distributions can be described as follows: the code word c comprises m subvectors (for example subvectors of the same length) c , ... , cm, and each of these m subvectors has a respective target probability, i.e.,
In embodiments of the invention, the vector d comprises the vector of information bits e, i.e, the vector of information bits e is a subvector of the vector d, i.e., the precoder 102 is a systematic precoder. This provides the advantage that, at the receiver or communication apparatus 120, the inversion of the precoding operation is not required, allowing for a less complex receiver. Moreover, the binary code word c can be shuffled or interleaved via the interleaver 500 in order to obtain a vector b. Then, the vector b can be fed to a symbol mapper 502.
The symbol mapper 502 can be configured to map the binary code word c to one or more symbols for transmission over the communication channel. In particular, the symbol mapper 502 can output these symbols from the alphabet X.
Therefore, in this embodiment, the output vector x of the symbol mapper 502 has a nonuniform probability distribution.
Figure 6 shows a schematic diagram illustrating an embodiment where the precoder 102 comprises a first and a second sub-precoder.
In embodiments of the invention, m different parts of the vector u of length N are generated in such a way that each of these m parts have some dependencies within their bits or different probability distributions. In particular, m can correspond to the number of bit-levels for higher-order modulation.
In particular, in figure 6, an example for m = 2 is shown, wherein the vector u of length N consists of two subvectors ux and u2 of length N/2. The subvectors ux and u2 can be generated using the first and the second sub-precoder. This can imply that the bits comprised in Uj have some dependencies. If [ι½ u2] is encoded via a single polar transform implemented in the unit 104b of length N, then the resulting code word c can have the desired properties mentioned above.
The subvectors ux and u2 can comprise information bits and frozen bits. Moreover, in embodiments of the invention, the subvectors ux and u2 can comprise shaping bits as well, which are based on the information bits and frozen bits, and which help the output distribution to converge to the target probability distribution.
The exemplary procedure explained in the context of figure 6 can be extended to larger m values as well. For example, by diving the vector u into m = 4 and using two extra polarization steps, one can obtain a single polar code word c with four different bit distributions.
Figure 7 shows a schematic diagram illustrating the precoder 102 of the communication apparatus 1 10 according to an embodiment.
In the embodiment shown in figure 7, the precoder 102 comprises two multiplexing units 102a-1 , 102a-2, m sub-precoders 102b-1 ,...,102b-m, and a demultiplexing unit 104a. The precoder 102 can be configured to decompose a vector v comprising the vector of information bits e and the vector of frozen bits / into m subvectors v wherein each of the
subvectors vt comprises a vector ei which is a subvector of the vector of information bits e and a vector /;, which is a subvector of the vector of frozen bits /.
In an embodiment, the multiplexing unit 102a-1 is configured to decompose the vector of information bits e into m vectors et, and the multiplexing unit 102a-1 is configured to decompose the vector of frozen bits / into m vectors
In an embodiment, each of the m sub-precoders 102b-1 ,...,102b-m is configured to generate each of the respective subvectors dt of the vector d representing the pre-coded message on the basis of the respective vector et, the vector /; and a respective target probability pt.
In an embodiment, the demultiplexing unit 104a is configured to generate the vector d representing the pre-coded message by combining the m subvectors dt. In an embodiment the precoder 102 contains a SC or SCL polar decoder 120a as already described in the context of figure 3.
Figure 8 shows a schematic diagram illustrating a more detailed view of one of the m sub- precoders 102b-1 ,...,102b-m shown in figure 7.
In the embodiment shown in figure 8, the sub-precoder 102b-1 comprises a unit 800 configured to generate a respective auxiliary channel decoder input vector y'i on the basis of the respective target probability pt. In an embodiment, the channel decoder input vector is a vector of length N (same length as the code word length), with the elements having the same value log(pi/(l - i)).
Moreover, in this embodiment, the respective subvector of information bits et and the respective subvector of frozen bits ft are combined in the demultiplexer 802 in order to generate a vector / The bits composing the vector /'; can be used as auxiliary frozen bits for a SC/SCL decoder 804 in the sub-precoder 102b (Inp2). Moreover, the SC/SCL decoder 804 in the sub-precoder 102b-1 can use the respective auxiliary channel decoder input vector y'i as the channel output vector (Inp1 ). The output of the SC/SCL polar decoder 804 can contain a respective shaping bit vector s; (Out1 ).
Furthermore, a demultiplexing unit 806 can be configured to concatenate the respective shaping bit vector st to the respective information bits subvector et in order to generate the respective vector d;. The sub-precoder 102b-1 provides the advantage that the vector d contains e as a subvector, which provides the advantage of an easy decoding at the side of the receiving communication apparatus 120.
Moreover, the sub-precoder 102b-1 provides the advantage of using a SC or SCL decoder 804 for generating the code word c, which is already a part of the polar transmission chain, namely the decoder 120a of the receiving communication apparatus 120 shown in figure 3. In other words, the precoder 102 can be realized by using existing hardware on a chip comprising the communication apparatus 1 10 and the communication apparatus 120. Figure 9 shows a schematic diagram of a method 900 for encoding a message to be transmitted over a communication channel according to an embodiment.
The method 900 comprises the steps of: generating 902 on the basis of the message and a polar transform a pre-coded message, and encoding 904 the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution, wherein the pre-coded message is generated in such a way that the plurality of bits of the code word are generated with the probability distribution matching a target probability distribution. While a particular feature or aspect of the disclosure may have been disclosed with respect to only one of several implementations or embodiments, such feature or aspect may be combined with one or more other features or aspects of the other implementations or embodiments as may be desired and advantageous for any given or particular application. Furthermore, to the extent that the terms "include", "have", "with", or other variants thereof are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term "comprise". Also, the terms "exemplary", "for example" and "e.g." are merely meant as an example, rather than the best or optimal. The terms "coupled" and "connected", along with derivatives may have been used. It should be understood that these terms may have been used to indicate that two elements cooperate or interact with each other regardless whether they are in direct physical or electrical contact, or they are not in direct contact with each other.
Although specific aspects have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that a variety of alternate and/or equivalent
implementations may be substituted for the specific aspects shown and described without departing from the scope of the present disclosure. This application is intended to cover any adaptations or variations of the specific aspects discussed herein.
Although the elements in the following claims are recited in a particular sequence with corresponding labeling, unless the claim recitations otherwise imply a particular sequence for implementing some or all of those elements, those elements are not necessarily intended to be limited to being implemented in that particular sequence.
Many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the above teachings. Of course, those skilled in the art readily recognize that there are numerous applications of the invention beyond those described herein. While the present invention has been described with reference to one or more particular embodiments, those skilled in the art recognize that many changes may be made thereto without departing from the scope of the present invention. It is therefore to be understood that within the scope of the appended claims and their equivalents, the invention may be practiced otherwise than as specifically described herein.
Claims
1 . A communication apparatus (1 10) for encoding a message to be transmitted over a communication channel, wherein the communication apparatus (1 10) comprises: a precoder (102) configured to generate on the basis of the message and a polar transform a pre-coded message; and a channel encoder (104) configured to encode the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution; wherein the precoder (102) is configured to generate the pre-coded message such that the channel encoder (104) generates the plurality of bits of the code word with the probability distribution matching a target probability distribution.
2. The communication apparatus (1 10) of claim 1 , wherein the precoder (102) is a systematic precoder, i.e., the pre-coded message contains the message.
3. The communication apparatus (1 10) of claim 1 or 2, wherein the communication apparatus (1 10) further comprises an interleaver (500) configured to interleave the plurality of bits of the code word and/or a modulator, in particular a symbol mapper (502) configured to map the code word to one or more symbols for transmission over the communication channel.
4. The communication apparatus (1 10) of any one of the preceding claims, wherein the polar transform is configured to take as an input a vector of frozen bits / and wherein the precoder (102) is configured to generate the pre-coded message on the basis of the message and the vector of frozen bits /.
5. The communication apparatus (1 10) of claim 4, wherein the precoder (102) is configured to generate the pre-coded message using one or more polar decoders, in particular successive cancellation or successive cancellation list decoders (120a).
6. The communication apparatus (1 10) of claim 4 or 5, wherein the precoder (102) is configured to take as an input a vector v comprising a vector of information bits e
representing the message and the vector of frozen bits / and wherein the precoder (102) is configured to decompose the vector v into m subvectors vt.
7. The communication apparatus (1 10) of claim 6, wherein the precoder (102) comprises m sub-precoders (102b-1 , 102b-m), wherein each sub-precoder (102b-1 , 102b-m) is configured to generate a respective subvector dt of a vector d representing the pre-coded message.
8. The communication apparatus (1 10) of claim 7, wherein the precoder (102) is configured to generate the vector d representing the pre-coded message on the basis of the respective subvectors generated by the respective sub-precoders (102b-1 , 102b-m).
9. The communication apparatus (1 10) of claim 7 or 8, wherein each sub-precoder (102b-1 , 102b-m) comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder (804).
10. The communication apparatus (1 10) of any one of claims 7 to 9, wherein each subvector vt of the vector v comprises a vector et, which is a subvector of the vector of information bits e, and a vector /;, which is a subvector of the vector of frozen bits /, and wherein each sub-precoder (102b-1 , 102b-m) is configured to generate a respective subvector dt of the vector d representing the pre-coded message on the basis of the respective subvector of information bits et and the respective subvector of frozen bits ft.
1 1 . The communication apparatus (1 10) of claim 10, wherein the target probability distribution comprises a plurality of target probabilities pt and wherein each sub-precoder
(102b-1 , 102b-m) is configured to generate a respective auxiliary channel decoder input vector y'i on the basis of the respective target probability pt.
12. The communication apparatus (1 10) of claim 1 1 , wherein each sub-precoder (102b-1 , 102b-m) is further configured to generate a subvector of auxiliary frozen bits f'i on the basis of the respective subvector of information bits et and the respective subvector of frozen bits
13. The communication apparatus (1 10) of claim 12, wherein each sub-precoder (102b-1 , 102b-m) comprises a polar decoder, in particular a successive cancellation decoder or a successive cancellation list decoder (804), configured to generate a respective shaping bit
vector Si on the basis of the respective auxiliary channel decoder input vector y and the respective subvector of auxiliary frozen bits f and wherein each sub-precoder (102b-1 , 102b-m) is configured to generate the respective subvector d; of the vector d representing the pre-coded message on the basis of the respective information bits subvector et and the respective shaping bit vector st.
14. The communication apparatus (1 10) of claim 13, wherein each sub-precoder (102b-1 , 102b-m) is configured to generate the respective subvector d; of the vector d representing the pre-coded message on the basis of the respective information bits subvector et and the respective shaping bit vector st by concatenating the respective shaping bit vector st with the respective information bits subvector et.
15. A method (900) for encoding a message to be transmitted over a communication channel, wherein the method (900) comprises: generating (902) on the basis of the message and a polar transform a pre-coded message; and encoding (904) the pre-coded message based on the polar transform into a code word, wherein the code word comprises a plurality of bits which have a probability distribution; wherein the pre-coded message is generated in such a way that the plurality of bits of the code word are generated with the probability distribution matching a target probability distribution.
16. A computer program comprising program code for performing the method (900) of claim 15, when executed on a computer or a processor.
17. A communication apparatus (120) for decoding a message received over a communication channel, wherein the communication apparatus (120) comprises: a channel decoder (120a) configured to generate an estimate of a vector d containing a vector of information bits e and a vector of shaping bits s by decoding the message on the basis of a polar transform on the basis of a vector of frozen bits /.
18. The communication apparatus (120) of claim 17, wherein the channel decoder (120a) is configured to discard the vector of shaping bits s.
19. The communication apparatus (120) of claim 17, wherein the channel decoder (120a) is configured to generate a sequence s' on the basis of the estimate of the vector d and to output an error message, in case the sequence s' is not equal to the vector of shaping bits s.
20. The communication apparatus (120) of claim 19, wherein the channel decoder (120a) comprises a list decoder configured to select a respective code word from a list of code words by selecting the code word, for which the sequence s' is equal to the vector of shaping bits s.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201780093271.8A CN110892659B (en) | 2017-07-17 | 2017-07-17 | Apparatus and method for encoding a message having a target probability distribution of encoded symbols |
PCT/EP2017/068035 WO2019015743A1 (en) | 2017-07-17 | 2017-07-17 | Apparatus and method for encoding a message having a target probability distribution of code symbols |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2017/068035 WO2019015743A1 (en) | 2017-07-17 | 2017-07-17 | Apparatus and method for encoding a message having a target probability distribution of code symbols |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2019015743A1 true WO2019015743A1 (en) | 2019-01-24 |
Family
ID=59366429
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2017/068035 WO2019015743A1 (en) | 2017-07-17 | 2017-07-17 | Apparatus and method for encoding a message having a target probability distribution of code symbols |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN110892659B (en) |
WO (1) | WO2019015743A1 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020156672A1 (en) * | 2019-01-31 | 2020-08-06 | Huawei Technologies Co., Ltd. | A transmitter and a transmission method using a pscm scheme |
WO2021083488A1 (en) * | 2019-10-28 | 2021-05-06 | Huawei Technologies Co., Ltd. | A distribution matcher and distribution matching method |
CN113557704A (en) * | 2019-03-29 | 2021-10-26 | 华为技术有限公司 | Method and apparatus for wireless communication using polarization-based signal space mapping |
RU2801163C1 (en) * | 2019-10-25 | 2023-08-02 | Хуавэй Текнолоджиз Ко., Лтд. | Device for multilevel coding |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112165442B (en) * | 2020-10-21 | 2021-09-07 | 北京邮电大学 | Adaptive weighted geometric shaping method and device |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105656604B (en) * | 2016-01-21 | 2019-03-26 | 北京邮电大学 | A kind of Bit Interleave Polarization Coding modulator approach and device |
CN106230555B (en) * | 2016-07-29 | 2019-02-19 | 西安电子科技大学 | The stages cycle redundancy check method of polarization code |
CN106850142A (en) * | 2017-01-19 | 2017-06-13 | 北京航空航天大学 | The polar code constructing methods of the code word Optimal Distribution encoded using Homophonic under memory channel |
-
2017
- 2017-07-17 CN CN201780093271.8A patent/CN110892659B/en active Active
- 2017-07-17 WO PCT/EP2017/068035 patent/WO2019015743A1/en active Application Filing
Non-Patent Citations (6)
Title |
---|
E. ARIKAN: "Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels", IEEE TRANS. INF. THEORY, vol. 55, no. 7, July 2009 (2009-07-01), pages 3051 - 3073 |
GOELA NAVEEN ET AL: "Polar Codes for Broadcast Channels", IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE PRESS, USA, vol. 61, no. 2, 1 February 2015 (2015-02-01), pages 758 - 782, XP011570486, ISSN: 0018-9448, [retrieved on 20150116], DOI: 10.1109/TIT.2014.2378172 * |
JUNYA HONDA ET AL: "Polar coding without alphabet extension for asymmetric channels", INFORMATION THEORY PROCEEDINGS (ISIT), 2012 IEEE INTERNATIONAL SYMPOSIUM ON, IEEE, 1 July 2012 (2012-07-01), pages 2147 - 2151, XP032225665, ISBN: 978-1-4673-2580-6, DOI: 10.1109/ISIT.2012.6283742 * |
JUNYA HONDA ET AL: "Polar Coding Without Alphabet Extension for Asymmetric Models", IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 59, no. 12, 1 December 2013 (2013-12-01), USA, pages 7829 - 7838, XP055463520, ISSN: 0018-9448, DOI: 10.1109/TIT.2013.2282305 * |
MARCO MONDELLI ET AL: "How to Achieve the Capacity of Asymmetric Channels", 11 September 2016 (2016-09-11), XP055462548, Retrieved from the Internet <URL:https://arxiv.org/pdf/1406.7373v3.pdf> [retrieved on 20180323], DOI: 10.1109/ALLERTON.2014.7028535 * |
MONDELLI ET AL.: "How to achieve the capacity of asymmetric channels", COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON, 2014 |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020156672A1 (en) * | 2019-01-31 | 2020-08-06 | Huawei Technologies Co., Ltd. | A transmitter and a transmission method using a pscm scheme |
CN113508542A (en) * | 2019-01-31 | 2021-10-15 | 华为技术有限公司 | Transmitter using PSCM scheme and transmission method |
US20210359784A1 (en) * | 2019-01-31 | 2021-11-18 | Huawei Technologies Co., Ltd. | Transmitter and a transmission method using a pscm scheme |
US11894923B2 (en) | 2019-01-31 | 2024-02-06 | Huawei Technologies Co., Ltd. | Transmitter and a transmission method using a PSCM scheme |
CN113557704A (en) * | 2019-03-29 | 2021-10-26 | 华为技术有限公司 | Method and apparatus for wireless communication using polarization-based signal space mapping |
EP3932039A4 (en) * | 2019-03-29 | 2022-07-20 | Huawei Technologies Co., Ltd. | A method and apparatus for wireless communication using polarization-based signal space mapping |
CN113557704B (en) * | 2019-03-29 | 2022-11-11 | 华为技术有限公司 | Method and apparatus for wireless communication using polarization-based signal space mapping |
RU2801163C1 (en) * | 2019-10-25 | 2023-08-02 | Хуавэй Текнолоджиз Ко., Лтд. | Device for multilevel coding |
WO2021083488A1 (en) * | 2019-10-28 | 2021-05-06 | Huawei Technologies Co., Ltd. | A distribution matcher and distribution matching method |
Also Published As
Publication number | Publication date |
---|---|
CN110892659A (en) | 2020-03-17 |
CN110892659B (en) | 2022-08-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10880037B2 (en) | Error detection using symbol distribution in a system with distribution matching and probabilistic amplitude shaping | |
US8526547B2 (en) | System and method performing Quadrature Amplitude Modulation by combining co-sets and strongly coded co-set identifiers | |
US10848270B2 (en) | Concatenated forward error correction | |
JP6138153B2 (en) | Method and system for mapping bit strings | |
WO2019015743A1 (en) | Apparatus and method for encoding a message having a target probability distribution of code symbols | |
CN110495106B (en) | Polarization encoding with dynamic freeze bits | |
US10367600B2 (en) | Forward error correction with contrast coding | |
CN110892658B (en) | Device and method for coding a message with a target probability distribution of coded symbols | |
JP2012519982A (en) | Method and device for providing a design of non-uniform error protection codes from stochastic constant composition codes | |
CN110233698B (en) | Method for encoding and decoding polarization code, transmitting device, receiving device, and medium | |
KR20220085049A (en) | Device for multi-level encoding | |
WO2019197043A1 (en) | Multi-composition coding for signal shaping | |
WO2015130473A1 (en) | Ternary line code design for controlled decision feedback equalizer error propagation | |
US11522635B2 (en) | Device and method for transmitting data by using multilevel coding, and communication system | |
CN111954990B (en) | Method for multi-stage encoding and decoding, and multi-stage encoder and decoder | |
CN109194336B (en) | Method, system and device for coding and decoding cascade Spinal code | |
CN115225202B (en) | Cascade decoding method | |
CN114070463B (en) | Communication device and communication system for transmitting data by using multi-layer coding | |
Runge et al. | Improved list decoding for polar-coded probabilistic shaping | |
US20220038117A1 (en) | Device and method for transmitting data by using multilevel coding, and communication system | |
WO2017157105A1 (en) | Modulation method and device | |
WO2023105685A1 (en) | Encoding circuit, decoding circuit, encoding method, decoding method, and computer program | |
WO2011049014A1 (en) | Parity control system and method, and communication system and method | |
JP2023088074A (en) | Data communication system, transmitting device, and receiving device | |
Tuan et al. | Joint Source-Channel Coding and Digital Modulation Technique with Index Assignment Optimization |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 17740735 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 17740735 Country of ref document: EP Kind code of ref document: A1 |