CN109257140B - Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device - Google Patents
Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device Download PDFInfo
- Publication number
- CN109257140B CN109257140B CN201710576782.7A CN201710576782A CN109257140B CN 109257140 B CN109257140 B CN 109257140B CN 201710576782 A CN201710576782 A CN 201710576782A CN 109257140 B CN109257140 B CN 109257140B
- Authority
- CN
- China
- Prior art keywords
- reliability
- polarized
- coset
- channel
- ith
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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
Abstract
The application relates to the technical field of communication, and discloses a polarized channel reliability sequencing method, a polarized code encoding method and a polarized code encoding device, which are used for improving the accuracy of polarized channel reliability sequencing. The method comprises the following steps: determining each of N polarized channelsReliability of the i-th polarized channel, wherein the reliability of the i-th polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, N is a mother code length of a polarized Polar code, and N ═ 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: a set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1; and determining a reliability sequencing sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.
Description
Technical Field
The embodiment of the application relates to the technical field of communication, in particular to a polarized channel reliability ranking method, a polarized code encoding method and a polarized code encoding device.
Background
Channel coding, the most basic radio access technology, plays a crucial role in ensuring reliable transmission of data. In a conventional wireless communication system, a Turbo code, a Low Density Parity Check (LDPC) code, and a Polar (Polar) code are generally used for channel coding. Turbo codes cannot support information transmission at too low or too high code rates. For medium and short packet transmission, Turbo codes and LDPC codes are difficult to achieve ideal performance under limited code length due to the characteristics of self coding and decoding. In the implementation aspect, Turbo codes and LDPC codes have higher computational complexity in the implementation process of coding and decoding. Polar codes are good codes which theoretically demonstrate that shannon capacity can be achieved and have relatively simple coding and decoding complexity, and thus are increasingly widely used.
However, with the rapid evolution of wireless communication systems, some new features will appear in future communication systems such as the fifth generation (5G) communication system. For example, the most typical three communication scenarios include enhanced mobile internet (eMBB), mass machine connectivity (mtc), and Ultra Reliable Low Latency Communication (URLLC). These communication scenarios put higher demands on the coding performance of Polar codes.
The reliability sequencing of the polarized channels plays an important role in the coding and decoding performance of the Polar codes, and at the present stage, the accuracy of the reliability sequencing of the polarized channels is not ideal, so that the further improvement of the coding and decoding performance of the Polar codes in the application process is influenced.
Disclosure of Invention
The embodiment of the application provides a polarized channel reliability sequencing method, a polarized code encoding method and a polarized code encoding device, which are used for improving the accuracy of the polarized channel reliability sequencing.
The embodiment of the application provides the following specific technical scheme:
in the embodiment of the application, the reliability of the polarized channels is determined by using the distance spectrum, and a reliability sequencing sequence is obtained, which is beneficial to improving the accuracy of the reliability sequencing of the polarized channels and improving the coding and decoding performance of Polar codes.
In one possible design, the reliability of each of the N polarized channels is determined, and the reliability ranking sequence of the N polarized channels is determined based on the reliability of each of the N polarized channels. Wherein the reliability of the ith polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to the physical channel state, i belongs to {1, 2, …, N }, N is the mother code length of the polarized Polar code, and N is 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: based on the set 0 th to (i-1) th decoded ratiosThe bit sequence and the set of encoded code words determined for the ith decoded bit to be 1.
In one possible design, the reliability of the ith polarized channel of the N polarized channels is determined according to one of the following equations:
alternatively, the first and second electrodes may be,
wherein L is(m)(i, P) represents the reliability of the ith polarization channel,
for a first distance spectrum between the first and second cosets,
and a second distance spectrum between the internal elements of the first coset, wherein w is the number of 1 contained in the code word, and ln is the natural logarithm operation.
In one possible design of the system,
the first coset is used
It is shown that,
for the second coset
It is shown that,
where Span (.) represents a linear space generated by a vector，gxRepresents the x-th row vector in the generating matrix of the Polar code,
represents the 0 th to (i-1) th decoded bit sequences, | is an operation for solving the number of elements.
In one possible design, the
In a second aspect, a method for coding Polar codes is provided, wherein a reliability sequencing sequence of N polarized channels is determined; and selecting information bit sequence numbers according to the reliability sequencing sequence, and carrying out Polar code coding on the bits to be coded according to the selected information bit sequence numbers. Wherein, N is the mother code length of Polar code, N is 2mAnd m is a positive integer.
In one possible design, when N is 512, the reliability ranking sequence is: {0124816323564691012817121833256203424653666740129116848131301914722572113222803525825136962603714426382646728411604244496927219215701317350288237452133813207613427568213725939973842984138261145309843881402621461002657145161511484610426616227375531521122681931642747754135578319428978168276588560861399919689290280141176901011471423110226347321292200322149296921052082673853243041631505510615322438632826911379165108154275592701141668719561156169277291278197170116177281916214338829319810333617228220112017829493151323392297202107284180209942042983523251842104003053001091553261151101672123063291572251171713302263873082164163371582711182793323891731211991792283383123901743932831222323404483533942031812952851241822056328629935418540121139634420630195186240327402213356307302111159417331227404309214119188360418408368217449420310229333218175391123313230339334220450424314233125287183341395355342234397316345241207403357187236126303452432242346398215405358361189456348419406244409362219421369311190410231248364464335422315221370425451412235222343372426480453317237433347318454243428399359238376457434349245458407127363350246436465411460249365466423191371440250413366468481373427414252223374482429455472377435319239430484459378437488461380438351247467441251462496442367469470415483253444375473485474431379486254476489439490381463382497443492498445471446475500487504255477491478493499494501383447502505506479508495503507509510511}.
In one possible design, when N is 1024, the reliability ranking sequence is: {0124816323564691012817121833256203424653666512740129116848131301914722572113222803525825136962603714426513385142646728411604244516496927219252052815701317350288544237452133813207613427568213725939973842984138261145309851543881402621461002657145161517576518511485214610426616227352264075531521122681931642747754529524530135578319428978168276588560861399919689290280545768141176901011471425325465363110226347321292200322577149296921052085485782673853243041631505510615322438632826911351955264179165108154275592701141665235805608719561156169277291278197170116177281525642531526916258476914338829319810333617228220112017829493533644534592547770151323392297202107284180209537942042983526486083251842104003053001091553261151107725496565385501672123063291572251171713302263873082164163371587762715791185405532793323891731211991792283383123901743932831222323404483533942031816725545565615812952851241822057847046328652758264358556229935418540121139634420630180095186240535586564645593327402213356307302832588646111539568594649771159417331227404309214551609896119188360418408368217449420541596650773657310229333218542610175391123313230339334220450424314555600652233774658612125287183341395355777583557673342234563660558616778674397316345241207403357187236785126587565664624780303452432242346705398676786589566647215405358569595361706189456348419801406244409362590680788570597219572421369598651611708601802311792190410653688602231248364464335422613659654315221370425451412235222343372426543480614453775317237433559833804712834661808604617720779347897318454836816675662243428399359238376457434349567618665736898840781625245458407591677620666787571782626678127363350246436465411460249365466599707573668681789803790709682628423689793603574191371440250413366468481373655900805710427414252615848684794713632690806605223374482663835904809714619796692429455472377721606716810864837696722912817435319812239621430484459378667838437488627622461380438351247679724818841669737629467441251462496442367683842738899820728928849670783630791844901685469633711470691740850824902686415483253444375473905795485634744852960865906715693807474797636694431717575798811866379486697913254723908856718476813607489698752839914725868819814439490623381463382497671929843739916821726631700872930920880729443492498445471961932822741845730446687903635825742851846732962936826745475500637487504799695853907867854746909828857753719915869699748638815964944754858910255477491478727917870493873701968499860494931918756921874731933881823702501922383743760876976847934827733882937963924747734855884938992447502505965506829749945859830966755940911871750888479969946861757970508919639875862758948977923972761877978495935703883952762503925878980993885939926764735886994941967984507889947831751942996971890949100097389250995086375951097995376397410089548799819829279957659568879859979869438919987669881001951100289397589410099551004101095798395898710129991016511767989100399010051011100610138959591014101710189911020100710151019102110221023}.
The sequence is helpful for improving the accuracy of the polarized channel reliability sequencing and further improving the coding and decoding performance of Polar codes.
In one possible design, the sequence is determined by any one of the methods as possible in the first aspect and the possible design of the first aspect.
In a third aspect, a method for ranking the reliability of polarized channels is provided, where at least one candidate polarized channel reliability ranking sequence is obtained, each candidate polarized channel reliability ranking sequence is related to a value of a constant P, and the constant P is used to indicate a channel state; selecting one reliability ranking sequence from the at least one candidate reliability ranking sequence as a polarized channel reliability ranking sequence of Polar codes according to an object code parameter, wherein the object code parameter comprises at least one of the following: the length of information bits to be coded, the width of a path appointed by a coding side and a decoding side and a target error rate. Therefore, the selected reliability ranking sequence can be more suitable for the target application scene, and better Polar code performance is obtained.
In one possible design, each candidate polarized channel reliability ranking sequence is determined by reliabilities of N polarized channels, wherein the reliability of an ith polarized channel of the N polarized channels is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and the constant P.
Wherein, i belongs to {1, 2, …, N }, N is the mother code length of the polarized Polar code, and N is 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: and the set of the code words is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1.
In one possible design, the reliability of the ith polarized channel of the N polarized channels is determined according to one of the following equations:
alternatively, the first and second electrodes may be,
wherein L is(m)(i, P) represents the reliability of the ith polarization channel,
for a first distance spectrum between the first and second cosets,
and a second distance spectrum between the internal elements of the first coset, wherein w is the number of 1 contained in the code word, and ln is the natural logarithm operation.
In one possible design of the system,
the first coset is used
It is shown that,
for the second coset
It is shown that,
where Span (.) represents the linear space generated by the vector, gxRepresents the x-th row vector in the generating matrix of the Polar code,
represents the 0 th to (i-1) th decoded bit sequences, | is an operation for solving the number of elements.
In one possible design, the
In a fourth aspect, there is provided an apparatus for polarization channel reliability ranking, the apparatus having the functionality of implementing the method of any one of the possible designs of the first aspect and the first aspect. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above-described functions.
In one possible design, when part or all of the functions are implemented by hardware, the apparatus for ranking the reliability of the polarized channels includes: logic circuitry for performing any one of the possible methods of the first aspect and the first aspect described above.
Alternatively, the apparatus for polarization channel reliability ranking may be a chip or an integrated circuit.
In one possible design, when part or all of the functions are implemented by software, the apparatus for ranking the reliability of the polarized channels includes: a memory for storing a program; a processor configured to execute the program stored in the memory, the apparatus for polarized channel reliability ranking may implement the method as described in the first aspect and any one of the possible designs of the first aspect above when the program is executed.
Alternatively, the memory may be a physically separate unit or may be integrated with the processor.
In one possible design, when part or all of the functions are implemented in software, the means for polarized channel reliability ranking includes a processor. The memory for storing programs is located outside the polarization channel reliability sequencing device, and the processor is connected with the memory through a circuit/wire and used for reading and executing the programs stored in the memory.
In a fifth aspect, an apparatus for coding Polar codes is provided, which has the function of implementing the method in any one of the possible designs of the second aspect and the second aspect. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above-described functions.
When part or all of the functions are implemented by hardware, the encoding means includes: the input interface circuit is used for acquiring bits to be coded; logic circuitry for performing the method of any one of the possible designs of the second aspect and the second aspect described above; and the output interface circuit is used for outputting the bit sequence after Polar coding.
Optionally, the coding device of the Polar code may be a chip or an integrated circuit.
In a possible design, when part or all of the functions are implemented by software, the coding device of the Polar code comprises: a memory for storing a program; a processor for executing the program stored in the memory, the encoding apparatus being capable of implementing the method as set forth in any one of the possible designs of the second aspect and the second aspect as described above when the program is executed.
Alternatively, the memory may be a physically separate unit or may be integrated with the processor.
In one possible design, when part or all of the functions are implemented by software, the coding means of the Polar code comprises a processor. The memory for storing the program is located outside the coding device, and the processor is connected with the memory through a circuit/wire and is used for reading and executing the program stored in the memory.
In a sixth aspect, there is provided an apparatus for polarization channel reliability ranking, the apparatus having the functionality of implementing the method in any one of the possible designs of the third and fourth aspects. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above-described functions.
In one possible design, when part or all of the functions are implemented by hardware, the apparatus for ranking the reliability of the polarized channels includes: logic circuitry for performing any one of the possible methods of the third and fourth aspects described above.
Alternatively, the apparatus for polarization channel reliability ranking may be a chip or an integrated circuit.
In one possible design, when part or all of the functions are implemented by software, the apparatus for ranking the reliability of the polarized channels includes: a memory for storing a program; a processor for executing the program stored in the memory, the apparatus for polarized channel reliability ranking may implement the method as set forth in any of the possible designs of the third and fourth aspects as described above when the program is executed.
Alternatively, the memory may be a physically separate unit or may be integrated with the processor.
In one possible design, when part or all of the functions are implemented in software, the means for polarized channel reliability ranking includes a processor. The memory for storing programs is located outside the polarization channel reliability sequencing device, and the processor is connected with the memory through a circuit/wire and used for reading and executing the programs stored in the memory.
A seventh aspect provides a communication system, which includes a transmitting end and a receiving end, where the transmitting end may perform the method as described in any one of the first to third aspects and possible designs thereof.
In an eighth aspect, a computer storage medium is provided, storing a computer program comprising instructions for performing the method of any of the possible implementations of the first to third aspects.
In a ninth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of the above aspects.
Drawings
FIG. 1 is a block diagram of a wireless communication system according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a method for ranking the reliability of the polarization channels according to an embodiment of the present application;
FIG. 3 is a second flowchart of a method for ranking the reliability of polarized channels according to an embodiment of the present application;
FIG. 4 is a flow chart of a Polar code encoding method in the embodiment of the present application;
FIG. 5 is a diagram illustrating an apparatus for polarization channel reliability ranking according to an embodiment of the present application;
FIG. 6 is a second schematic diagram of an apparatus for polarization channel reliability ranking in an embodiment of the present application;
FIG. 7 is a schematic structural diagram of a Polar code encoding apparatus in the embodiment of the present application;
FIG. 8 is a schematic structural diagram of an apparatus for polarization channel reliability ranking and a Polar code encoding apparatus in an embodiment of the present application;
FIG. 9 is a third exemplary diagram of an apparatus for polarization channel reliability ranking in accordance with an embodiment of the present invention;
fig. 10 is a fourth schematic diagram of an apparatus for polarization channel reliability ranking in an embodiment of the present application.
Detailed Description
The embodiments of the present application will be described in detail below with reference to the accompanying drawings.
The embodiment of the application provides a method and a device for sorting the reliability of a polarization channel. The higher the reliability of the polarization channel is, the higher the decoding correctness at the decoding side is. When the decoding side adopts a bit-by-bit decoding method for decoding, the decoding correctness of the current decoding bit has a direct relation with the distance spectrum between the encoded code word sets corresponding to the two sub-paths of the current decoding bit, and the closer the distance spectrum is, the higher the decoding correctness of the current decoding bit is, namely, the higher the reliability of the polarization channel is. In the embodiment of the application, the reliability of the polarized channel is determined by using the distance spectrum, and the reliability sequencing sequence is obtained, so that the accuracy of the reliability sequencing of the polarized channel is improved, and the coding and decoding performance of Polar codes is improved.
For the sake of understanding of the embodiments of the present application, the following briefly introduces Polar codes.
The coding strategy of Polar codes utilizes a noiseless channel to transmit useful information of users, and a full-noise channel to transmit appointed information or non-transmitted information. Polar code is also a linear block code with a coding matrix of GNThe coding process is
Wherein
Is a binary row vector with length N (i.e., code length); gNIs an N × N matrix, and
is defined as log2N matrices F2Kronecker (Kronecker) product of (a). The matrix is
In the encoding process of the Polar code,
a part of the bits used to carry information is called information bit set, and the set of indices of these bits is denoted as
The other part of the bits are set as fixed values predetermined by the receiving end and the transmitting end, which are called fixed bit sets or frozen bit sets (frozen bits), and the index sets are used
Complement of
And (4) showing. The encoding process of Polar code is equivalent to:
here, GN(A) Is GNMiddle group collection
Of (2) a sub-matrix, G, derived from those rows corresponding to the index of (a)N(AC) is GNMiddle group collection
The index in (1) corresponds to those rows of the resulting sub-matrix.
Is composed of
The number of the information bit sets is K;
is composed of
The fixed set of bits, whose number is (N-K), are known bits. These fixed bits are usually set to 0, but may be arbitrarily set as long as the receiving end and the transmitting end agree in advance. Thus, the coded output of Polar code can be simplified as:
here, the
Is composed of
The set of information bits in (1) is,
is a row vector of length K, i.e.
I.e. represents the number of elements in the set, K is the information block size,
is a matrix GNMiddle group collection
The sub-matrix obtained for those rows corresponding to the index in (1),
is a K × N matrix.
Polar code construction process or set
The selection process of (2) determines the performance of Polar codes. The Polar code construction process generally comprises the steps of determining that N polarized channels exist in total according to the code length N of a mother code, respectively corresponding to N rows of a coding matrix, and calculatingPolarization channel reliability by using the indexes of the first K polarization channels with higher reliability as set
The indexes corresponding to the remaining (N-K) polarized channels as the index set of the fixed bits
Of (2) is used. Collection
Determining the position, set, of information bits
The position of the fixed bit is determined.
The scheme provided by the embodiment of the application relates to how to calculate the reliability of the polarization channel. Some terms in the present application are explained below to facilitate understanding by those skilled in the art.
1) Background introduction
The effective decoding algorithm of Polar code is a Successive Cancellation (SC) algorithm or a Successive Cancellation List (SCL) algorithm. The SC algorithm is as follows: the value of the currently decoded bit can be determined by calculating the transition probability of a channel for which the currently decoded bit is 0 or 1, based on the received signal and the decoded bit sequence.
The SCL algorithm is: and storing a plurality of bit sequence paths with better metric values, splitting a plurality of sub-paths from the stored path bases, sequencing the metric values of the sub-paths, and selecting the optimal path of the current decoding bit from the sub-paths according to the sequencing.
Polar code has mother code length of N, N is 2mM is a positive integer, N polarized channels exist in the structural parameters of Polar, and the labels of the polarized channels can be 0 to (N-1) or 1 to N. In this embodiment of the application, when an ith polarization channel of the N polarization channels is determined, a value of i may be 1, 2, …, and N, and it should be noted that when the ith polarization channel is determinedIn the case of 1 polarization channel, the label of the corresponding polarization channel may be 0 in the label system of 0 to (N-1), or may be 1 in the label system of 1 to N.
2) A first coset and a second coset
Given a sequence of decoded bits consisting of the 0 th to (i-1) th decoded bits, also so to speak, a path is given, provided that the given path or the given decoded sequence is used
It is shown that,
i.e. the sequence u0、u1、…、ui}，
I.e. the sequence
The element in (1) is 0 or 1.
The first coset, which may also be referred to as the 0 coset, is defined as: a first set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0. Specifically, the decoding result of the ith decoded bit is unknown, and assuming that the decoding result of the ith decoded bit is 0, the (i +1) th to nth decoded bits are completely unknown. The first encoding codeword set may be considered to be formed by two subsets, the first encoding codeword subset is a codeword encoded by an encoding matrix of a sequence formed by 0 th to (i-1) th decoded sequences and an ith decoding bit of 0, and the second encoding codeword subset is a linear space formed by corresponding row vectors of (i +1) th to nth decoding bits in the encoding matrix.
The first coset may be represented by equation (1):
Similarly, the second coset may also be referred to as 1 coset, defined as: and a second encoding codeword set determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1. Specifically, the decoding result of the ith decoded bit is unknown, and assuming that the decoding result of the ith decoded bit is 1, the (i +1) th to nth decoded bits are completely unknown. The second encoding codeword set may be considered to be formed by two subsets (a third encoding codeword subset and a fourth encoding codeword subset), where the third encoding codeword subset is a codeword obtained by encoding a sequence formed by the 0 th to (i-1) th decoded sequences and the ith decoding bit being 1 by using an encoding matrix, and the fourth encoding codeword subset is a linear space formed by corresponding row vectors of the (i +1) th to nth decoding bits in the encoding matrix.
The second coset may be represented by equation (2):
The first coset and the second coset are two disjoint sets, and the non-overlapping union of the first coset and the second coset is expressed by formula (3).
3) Distance spectrum
First distance spectra, i.e., coset-to-coset distance spectra between a first coset and a second coset, are assumed to be
Representing, the first distance spectrum can be determined by equation (4).
Wherein the content of the first and second substances,
representing a second coset
In
And the coded code word set is determined by that the elements of the sequence are all 0 and the ith decoding bit is 1.
The decoding bits with the labels 0 to (i-1) are all 0 for 0 vector, in formula (4), the part d (0, y) w is the condition applied to the encoding codeword set, w is the weight (or row weight) of the codeword, the weight is the number of 1 included in the codeword, w belongs to {0, 1, …, N }, and the symbol |. in the formula is used for solving the number of elements in the set in the symbol. The calculation to the right of the equal sign of formula (4) can be interpreted as the number of code words with weight of w in the set of encoded code words determined based on the set 0 th to (i-1) th decoded bits being 0 and the i th decoded bit being 1.
Second distance spectra, i.e., coset-internal distance spectra between elements inside the first coset, assuming the second distance spectra
Then the second distance spectrum can be represented by a formula(5) To be determined.
Wherein the content of the first and second substances,
representing a first coset
In
And the coded code word set is determined by that the elements of the sequence are all 0 and the ith decoding bit is also 0.
A vector of 0 indicates that the decoded bits labeled 0-i are all 0. In the formula (5), the part d (0, y) ═ w is a condition applied to the set of encoded code words, w is the weight (or row weight) of the code words, the weight is the number of 1 included in the code words, w ∈ {0, 1, …, N }, and the symbol | in the formula is used for solving the number of elements in the set in the symbol. The calculation to the right of the equal sign of equation (5) can be interpreted as the number of code words with weight w in the encoded code word set determined based on the set 0 th to (i-1) th decoded bits being a sequence of 0 and the i th decoded bit also being 0.
The definitions of the same letters or symbols and the meanings of the same symbols in the embodiments of the present application should be the same, and repeated parts will not be described in detail. It should be understood that the formula mentioned in the embodiment of the present application is only an example, and those skilled in the art can obtain the scheme based on simple modification of the formula without affecting the performance of the formula, and all of the schemes belong to the protection scope of the embodiment of the present application.
As shown in fig. 1, a communication system 100 applied in the embodiment of the present application includes a transmitting end 101 and a receiving end 102. The transmitting end 101 may also be referred to as an encoding end, and the receiving end 102 may also be referred to as a decoding end. The sending end 101 may be a base station, and the receiving end 102 is a terminal; alternatively, the transmitting end 101 is a terminal, and the receiving end 102 is a base station. A base station is a device deployed in a radio access network to provide wireless communication functions for terminals. The base stations may include various forms of macro base stations, micro base stations, relay stations, access points, and the like. The method can be applied to systems of different radio access technologies, such as a Long Term Evolution (LTE) system, or a fifth generation (5G) communication system. The base station may also be other network devices having a base station function, and in particular, may also be a terminal serving as a base station function in D2D communication. A terminal may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem with wireless communication capabilities, as well as various forms of User Equipment (UE), Mobile Station (MS), and the like.
Based on the communication system architecture shown in fig. 1, in the embodiment of the present application, an execution main body of the method for performing polarization channel reliability ranking may be a sending end 101. The method for ranking the reliability of the polarization channel provided by the embodiment of the present application will be described in detail below.
Based on the above background introduction and the introduction of the wording description and the communication system architecture shown in fig. 1, as shown in fig. 2, a specific flow of the method for ranking the reliability of the polarization channel provided in the embodiment of the present application is as follows.
Wherein the reliability of the ith polarized channel is determined based on a first distance spectrum between the first coset and the second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, which can be considered as an influence parameter of the wireless channel on each coded transmission bit. The first coset is: based on the set 0 th to (i-1) th decoded bit sequences and the determined encoding code word set with the ith decoded bit being 0, the second coset is: and the set of the code words is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1.
After the reliability ranking sequence of the N polarized channels is determined, the information bit sequence number is selected according to the reliability ranking sequence, and the polarized Polar code encoding is carried out on the bits to be encoded according to the selected information bit sequence number, wherein the specific encoding process is as described above for the Polar code.
Specifically, the reliability of the ith polarized channel of the N polarized channels may be determined according to formula (6) or formula (7).
Wherein L is(m)(i, P) represents the reliability of the ith polarization channel,
a first distance spectrum between the first coset and the second coset,
is the second distance spectrum between the internal elements of the first coset, w is the number of 1's included in the encoded codeword, and ln is the natural logarithm operation.
P is some approximate values of the physical channel state, and has a certain value range, for example, the value range of P is
When the signal to noise ratio is high, the channel is in a better state, and the value of P should be lower; when the snr is low, the channel is in a poor state, and the value of P should be high, for example, the value of P can be taken
Because P takes different values, the reliability ranking sequences determined by the method for ranking the reliability of the polarization channel are different, and a group of reliability ranking sequences can be obtained within the value range of P. Based on this, on the basis of the method shown in fig. 2, as shown in fig. 3, the embodiment of the present application further provides another method for polarization channel reliability ranking. The method specifically comprises the following steps:
Optionally, the value of each candidate polarization channel reliability rank sequence is related to the value of a constant P, where the constant P is used to indicate a physical channel state, specifically, each candidate polarization channel reliability rank sequence may be determined by using the above steps S201 and S202, the values of the constants P corresponding to different candidate polarization channel reliability ranks are different, and for convenience of description, how to determine each candidate polarization channel reliability rank sequence is not described herein again.
Optionally, a reliability rank order sequence may be selected from the at least one candidate reliability rank order sequence as a target polarization channel reliability rank order sequence according to a target parameter, where the target code parameter includes at least one of: the length of information bits to be coded, the width of a path appointed by a coding side and a decoding side and a target error rate.
Specifically, performance simulation is performed on the candidate polarized channel reliability ranking sequences according to the target code parameters, and the performance of each candidate ranking sequence is obtained. And determining the performance advantages and disadvantages of each candidate sorting sequence according to the rule for judging the performance advantages and disadvantages, and further using the candidate sorting sequences for the reliability sorting sequences used by the Polar code codes.
It should be noted that, since it has been disclosed in the related prior art how to select one reliability rank order sequence from the at least one candidate reliability rank order sequence as the target polarization channel reliability rank order sequence according to the target parameter, details of this application are not repeated.
After the target polarization channel reliability sequencing sequence is determined, selecting an information bit sequence number according to the target polarization channel reliability sequencing sequence, and performing Polar code coding on bits to be coded according to the selected information bit sequence number.
In summary, the reliability ranking sequence generated according to the distance spectrum in the embodiment of the present application can more accurately reflect the reliability ranking of the polarized channel, which is helpful for improving the coding and decoding performance of Polar codes.
Based on the communication system architecture shown in fig. 1, an embodiment of the present application further provides a method for encoding Polar codes, and as shown in fig. 4, a specific process of the method for encoding Polar codes is as follows.
Wherein, N is the mother code length of Polar code, N is 2mM is a positive integer;
The embodiments of the present application provide the following examples of some alternative reliability ranking sequences. In Polar encoding process, the reliability sequencing sequence can be obtained by the method shown in FIG. 2 or FIG. 3; the obtained reliability ranking sequence may also be stored in advance, and the stored reliability ranking sequence may be applied, for example, obtained by using a table lookup. The following reliability rank ordering sequence may be obtained by the method shown in fig. 2 or fig. 3 in the embodiment of the present application, or may be obtained by other possible methods, which is not limited in the embodiment of the present application.
Example one,
When N is 512, the reliability rank order sequence may be:
{0 1 2 4 8 16 32 3 5 64 6 9 10 128 17 12 18 33 256 20 34 24 65 36 66 7 40 129 11 68 48 13 130 19 14 72 257 21 132 22 80 35 258 25 136 96 260 37 144 26 38 264 67 28 41 160 42 44 49 69 272 192 15 70 131 73 50 288 23 74 52 133 81 320 76 134 27 56 82 137 259 39 97 384 29 84 138 261 145 30 98 43 88 140 262 146 100 265 71 45 161 51 148 46 104 266 162 273 75 53 152 112 268 193 164 274 77 54 135 57 83 194 289 78 168 276 58 85 60 86 139 99 196 89 290 280 141 176 90 101 147 142 31 102 263 47 321 292 200 322 149 296 92 105 208 267 385 324 304 163 150 55 106 153 224 386 328 269 113 79 165 108 154 275 59 270 114 166 87 195 61 156 169 277 291 278 197 170 116 177 281 91 62 143 388 293 198 103 336 172 282 201 120 178 294 93 151 323 392 297 202 107 284 180 209 94 204 298 352 325 184 210 400 305 300 109 155 326 115 110 167 212 306 329 157 225 117 171 330 226 387 308 216 416 337 158 271 118 279 332 389 173 121 199 179 228 338 312 390 174 393 283 122 232 340 448 353 394 203 181 295 285 124 182 205 63 286 299 354 185 401 211 396 344 206 301 95 186 240 327 402 213 356 307 302 111 159 417 331 227 404 309 214 119 188 360 418 408 368 217 449 420 310 229 333 218 175 391 123 313 230 339 334 220 450 424 314 233 125 287 183 341 395 355 342 234 397 316 345 241 207 403 357 187 236 126 303 452 432 242 346 398 215 405 358 361 189 456 348 419 406 244 409 362 219 421 369 311 190 410 231 248 364 464 335 422 315 221 370 425 451 412 235 222 343 372 426 480 453 317 237 433 347 318 454 243 428 399 359 238 376 457 434 349 245 458 407 127 363 350 246 436 465 411 460 249 365 466 423 191 371 440 250 413 366 468 481 373 427 414 252 223 374 482 429 455 472 377 435 319 239 430 484 459 378 437 488 461 380 438 351 247 467 441 251 462 496 442 367 469 470 415 483 253 444 375 473 485 474 431 379 486 254 476 489 439 490 381 463 382 497 443 492 498 445 471 446 475 500 487 504 255 477 491 478 493 499 494 501 383 447 502 505 506 479 508 495 503 507 509 510 511}。
example two,
When N is 1024, the reliability rank order sequence may be:
{0 1 2 4 8 16 32 3 5 64 6 9 10 128 17 12 18 33 256 20 34 24 65 36 66 512 7 40 129 11 68 48 13 130 19 14 72 257 21 132 22 80 35 258 25 136 96 260 37 144 26 513 38 514 264 67 28 41 160 42 44 516 49 69 272 192 520 528 15 70 131 73 50 288 544 23 74 52 133 81 320 76 134 27 56 82 137 259 39 97 384 29 84 138 261 145 30 98 515 43 88 140 262 146 100 265 71 45 161 517 576 518 51 148 521 46 104 266 162 273 522 640 75 53 152 112 268 193 164 274 77 54 529 524 530 135 57 83 194 289 78 168 276 58 85 60 86 139 99 196 89 290 280 545 768 141 176 90 101 147 142 532 546 536 31 102 263 47 321 292 200 322 577 149 296 92 105 208 548 578 267 385 324 304 163 150 55 106 153 224 386 328 269 113 519 552 641 79 165 108 154 275 59 270 114 166 523 580 560 87 195 61 156 169 277 291 278 197 170 116 177 281 525 642 531 526 91 62 584 769 143 388 293 198 103 336 172 282 201 120 178 294 93 533 644 534 592 547 770 151 323 392 297 202 107 284 180 209 537 94 204 298 352 648 608 325 184 210 400 305 300 109 155 326 115 110 772 549 656 538 550 167 212 306 329 157 225 117 171 330 226 387 308 216 416 337 158 776 271 579 118 540 553 279 332 389 173 121 199 179 228 338 312 390 174 393 283 122 232 340 448 353 394 203 181 672 554 556 561 581 295 285 124 182 205 784 704 63 286 527 582 643 585 562 299 354 185 401 211 396 344 206 301 800 95 186 240 535 586 564 645 593 327 402 213 356 307 302 832 588 646 111 539 568 594 649 771 159 417 331 227 404 309 214 551 609 896 119 188 360 418 408 368 217 449 420 541 596 650 773 657 310 229 333 218 542 610 175 391 123 313 230 339 334 220 450 424 314 555 600 652 233 774 658 612 125 287 183 341 395 355 777 583 557 673 342 234 563 660 558 616 778 674 397 316 345 241 207 403 357 187 236 785 126 587 565 664 624 780 303 452 432 242 346 705 398 676 786 589 566 647 215 405 358 569 595 361 706 189 456 348 419 801 406 244 409 362 590 680 788 570 597 219 572 421 369 598 651 611 708 601 802 311 792 190 410 653 688 602 231 248 364 464 335 422 613 659 654 315 221 370 425 451 412 235 222 343 372 426 543 480 614 453 775 317 237 433 559 833 804 712 834 661 808 604 617 720 779 347 897 318 454 836 816 675 662 243 428 399 359 238 376 457 434 349 567 618 665 736 898 840 781 625 245 458 407 591 677 620 666 787 571 782 626 678 127 363 350 246 436 465 411 460 249 365 466 599 707 573 668 681 789 803 790 709 682 628 423 689 793 603 574 191 371 440 250 413 366 468 481 373 655 900 805 710 427 414 252 615 848 684 794 713 632 690 806 605 223 374 482 663 835 904 809 714 619 796 692 429 455 472 377 721 606 716 810 864 837 696 722 912 817 435 319 812 239 621 430 484 459 378 667 838 437 488 627 622 461 380 438 351 247 679 724 818 841 669 737 629 467 441 251 462 496 442 367 683 842 738 899 820 728 928 849 670 783 630 791 844 901 685 469 633 711 470 691 740 850 824 902 686 415 483 253 444 375 473 905 795 485 634 744 852 960 865 906 715 693 807 474 797 636 694 431 717 575 798 811 866 379 486 697 913 254 723 908 856 718 476 813 607 489 698 752 839 914 725 868 819 814 439 490 623 381 463 382 497 671 929 843 739 916 821 726 631 700 872 930 920 880 729 443 492 498 445 471 961 932 822 741 845 730 446 687 903 635 825 742 851 846 732 962 936 826 745 475 500 637 487 504 799 695 853 907 867 854 746 909 828 857 753 719 915 869 699 748 638 815 964 944 754 858 910 255 477 491 478 727 917 870 493 873 701 968 499 860 494 931 918 756 921 874 731 933 881 823 702 501 922 383 743 760 876 976 847 934 827 733 882 937 963 924 747 734 855 884 938 992 447 502 505 965 506 829 749 945 859 830 966 755 940 911 871 750 888 479 969 946 861 757 970 508 919 639 875 862 758 948 977 923 972 761 877 978 495 935 703 883 952 762 503 925 878 980 993 885 939 926 764 735 886 994 941 967 984 507 889 947 831 751 942 996 971 890 949 1000 973 892 509 950 863 759 510 979 953 763 974 1008 954 879 981 982 927 995 765 956 887 985 997 986 943 891 998 766 988 1001 951 1002 893 975 894 1009 955 1004 1010 957 983 958 987 1012 999 1016 511 767 989 1003 990 1005 1011 1006 1013 895 959 1014 1017 1018 991 1020 1007 1015 1019 1021 1022 1023}。
example III,
When N is 64, the reliability rank order sequence may be:
{0；1；2；4；8；16；32；3；5；6；9；10；17；12；18；33；20；34；24；7；36；40；11；48；13；19；14；21；22；35；25；37；26；38；28；41；42；15；49；44；50；23；52；27；56；39；29；30；43；45；51；46；53；54；57；31；58；60；47；55；59；61；62；63}；
example four,
When N is 128, the reliability rank order sequence may be:
{0；1；2；4；8；16；32；3；64；5；6；9；10；17；12；18；20；33；34；24；7；65；36；40；66；11；68；48；13；19；14；72；80；21；22；35；25；37；96；26；28；38；67；41；42；15；69；49；44；70；73；50；23；74；52；81；56；76；27；39；82；29；97；84；30；98；43；88；100；45；71；46；51；104；53；75；112；54；77；57；83；78；58；85；31；86；60；99；89；47；101；90；102；92；105；55；79；106；113；59；108；114；61；87；62；116；91；120；103；93；94；107；109；115；110；63；117；118；121；95；122；124；111；119；123；125；126；127}；
example five,
When N is 256, the reliability rank order sequence may be:
{0；1；2；4；8；16；32；3；64；5；128；6；9；10；17；12；18；33；20；34；24；36；65；7；40；66；68；11；48；129；72；13；14；19；130；80；132；21；22；35；25；136；96；144；26；37；28；38；160；192；67；41；42；69；49；15；44；70；50；131；73；23；52；74；133；81；56；76；134；82；27；39；137；29；97；84；138；98；43；145；30；140；88；146；100；71；45；51；46；148；161；104；162；152；112；75；53；164；193；54；77；57；83；78；135；194；31；58；168；85；139；196；176；60；86；99；141；89；200；147；47；101；142；90；208；102；149；92；105；224；150；106；163；55；153；113；79；165；108；154；59；114；166；156；195；87；61；116；169；62；143；170；91；197；177；198；120；172；178；201；103；93；202；180；151；209；94；107；204；184；155；109；115；210；167；110；225；157；212；63；158；117；226；171；118；216；121；199；173；228；179；174；122；95；232；203；124；181；240；205；182；185；211；111；206；186；159；213；188；119；214；227；217；175；229；218；123；230；220；125；233；183；234；126；207；187；241；236；215；242；189；244；190；219；248；231；221；127；235；222；237；243；238；245；191；246；249；223；250；252；239；247；251；253；254；255}；
example six,
When N is 512, the reliability rank order sequence may be:
{0；1；2；4；8；16；32；64；3；5；6；128；9；256；10；17；12；18；20；33；34；24；65；36；7；40；66；68；11；48；13；129；72；130；14；19；21；80；132；136；22；96；25；35；26；257；144；37；258；28；38；260；41；42；67；44；69；49；70；15；73；50；131；23；74；264；160；52；81；133；76；27；39；272；134；82；137；56；29；192；259；43；30；97；288；138；84；145；98；261；71；140；45；88；51；320；262；46；146；100；265；75；161；53；384；148；266；104；162；77；54；273；135；152；268；57；83；112；193；78；164；274；31；58；289；194；139；85；276；168；60；290；196；99；86；176；141；280；89；321；263；47；147；101；292；200；142；90；322；296；102；208；92；149；105；267；385；324；55；163；150；106；304；224；79；153；269；113；59；386；165；328；275；108；154；270；114；166；87；195；61；156；169；277；388；116；336；62；91；143；291；197；278；170；281；120；392；177；352；198；172；103；93；293；201；282；178；151；400；294；323；202；284；94；416；180；297；448；209；204；184；298；325；210；107；305；155；109；300；326；225；271；212；115；387；306；329；167；110；226；216；157；330；63；308；117；158；389；171；279；118；121；199；337；228；173；179；332；283；390；95；312；122；338；174；232；393；295；203；285；124；181；299；205；353；286；340；182；394；401；211；354；185；206；301；396；344；186；240；327；111；159；402；356；417；213；307；404；360；188；302；119；418；214；227；331；217；309；175；229；310；123；333；408；218；391；313；368；449；339；334；420；230；450；125；220；233；314；424；183；287；395；341；126；234；452；432；316；207；355；241；342；187；236；397；345；403；303；357；242；346；398；215；189；358；456；244；464；348；405；190；361；311；419；406；219；248；335；362；409；480；231；369；221；315；421；410；364；127；222；370；422；412；451；235；425；317；343；318；372；426；237；399；347；453；243；376；238；433；454；359；428；191；457；434；349；245；458；436；350；407；246；363；411；465；249；460；365；223；423；440；371；250；366；466；413；252；481；468；319；373；414；482；472；427；374；239；429；377；455；435；430；378；459；351；484；437；247；380；488；496；438；461；441；251；467；462；367；415；442；253；469；483；375；254；470；444；473；431；485；379；474；486；476；489；381；439；463；490；382；497；492；443；255；445；498；471；446；500；504；475；487；477；383；491；478；493；499；494；501；502；505；506；508；447；479；495；503；507；509；510；511}。
it should be noted that the reliability-ordered sequences are only examples, and the application of the reliability-ordered sequences to Polar encoding can help to improve the decoding performance of the Poalr code. In any example reliability ranking sequence, adjustments or equivalents including but not limited to the following may be made without affecting the overall effect of the sequence:
1. the positions between a few elements in the reliability-ordered sequence are interchanged. For example, the position of the serial number can be adjusted within a set range, for example, the set range is 5, and the position of the element with the serial number of 10 can be adjusted within 5 positions on the left and right;
2. the reliability sequencing sequence comprises N elements from 0 to N-1, wherein N is the code length of the mother code, and the N elements from 0 to N-1 represent the serial numbers of N polarized channels. In practice, the sequence numbers of the N polarized channels may also start from 1 to end with N. Of course, the serial number or the identifier of the above polarized channel may be expressed in other ways, and the specific expression does not affect the specific position of the polarized channel expressed in the sequence.
3. The elements in the reliability-ordered sequence may be in reverse order.
Based on the method for polarization channel reliability ranking shown in fig. 2, as shown in fig. 5, an embodiment of the present application further provides an apparatus 500 for polarization channel reliability ranking, where the apparatus 500 for polarization channel reliability ranking is used to execute the method for polarization channel reliability ranking shown in fig. 2, and the apparatus 500 for polarization channel reliability ranking includes:
a determining unit 501, configured to determine a reliability of each of N polarized channels, where the reliability of an ith polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, where N is a mother code length of a polarized Polar code, and N ═ 2mM is a positive integer, and the first coset is: based on the set 0 th to (i-1) th decoded bit sequences and the determined encoding code word set with the ith decoded bit being 0, the second coset is: a set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1;
a sorting unit 502, configured to determine a reliability sorting sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.
Based on the method for polarization channel reliability ranking shown in fig. 3, as shown in fig. 6, an embodiment of the present application further provides an apparatus 600 for polarization channel reliability ranking, where the apparatus 600 for polarization channel reliability ranking is used to execute the method for polarization channel reliability ranking shown in fig. 3, and the apparatus 600 for polarization channel reliability ranking includes:
a determining unit 601, configured to obtain at least one candidate sorted sequence of polarization channel reliability.
Optionally, the value of each candidate polarization channel reliability ranking sequence is related to a constant P, and the constant P is used for indicating a physical channel state;
a selecting unit 602, configured to select one reliability rank order sequence from the at least one candidate reliability rank order sequence as a polarization channel reliability rank order sequence of Polar codes according to the target code parameter.
Wherein the object code parameters include at least one of: the length of information bits to be coded, the width of a path appointed by a coding side and a decoding side and a target error rate.
Based on the Polar code encoding method shown in fig. 4, as shown in fig. 7, an embodiment of the present application further provides a Polar code encoding apparatus 700, where the Polar code encoding apparatus 700 is configured to execute the Polar code encoding method shown in fig. 4, and the Polar code encoding apparatus 700 includes:
a determining unit 701, configured to determine a reliability rank ordering sequence of N polarized channels, where N is a mother code length of Polar codes, and N is 2mM is a positive integer;
and the encoding unit 702 is configured to select the information bit sequence number according to the reliability ranking sequence, and perform Polar code encoding on the bits to be encoded according to the selected information bit sequence number.
Based on the same inventive concept of the method for ranking the reliability of the polarized channels shown in fig. 2, as shown in fig. 8, an embodiment of the present application further provides a device 800 for ranking the reliability of the polarized channels, where the device 800 is configured to execute the method for ranking the reliability of the polarized channels shown in fig. 2. Some or all of the method of the embodiment of fig. 2 may be implemented by hardware or may be implemented by software, and when implemented by hardware, the reliability ranking apparatus 800 may include a logic circuit for executing the method of the embodiment of fig. 2. The reliability ranking apparatus 800 may be applied to an encoding apparatus 900 for Polar codes, and the encoding apparatus 900 for Polar codes may include: an input interface circuit 901, configured to obtain a bit to be encoded; the reliability ranking device 800 is configured to execute the method in the embodiment of fig. 2, for specific reference, the description in the foregoing method embodiment is referred to, and details are not repeated herein; and an output interface circuit 902, configured to output the Polar encoded bit sequence.
Alternatively, the reliability ranking apparatus 800 may be a chip or an integrated circuit when implemented.
Optionally, when part or all of the method in the embodiment of fig. 2 is implemented by software, as shown in fig. 9 or fig. 10, the reliability ranking apparatus 800 includes: a memory 1001 for storing a program; the processor 1002 is configured to execute the program stored in the memory 1001, and when the program is executed, the reliability ranking apparatus 800 may implement the method provided in the embodiment of fig. 2.
Alternatively, the memory 1001 may be a physically separate unit as shown in fig. 9, or may be integrated together as shown in fig. 10.
Alternatively, when part or all of the method in the embodiment of fig. 2 is implemented by software, the reliability ranking apparatus 800 may also include only the processor 1002. A memory 1001 for storing programs is located outside the reliability ranking device 800, and a processor 1002 is connected with the memory 1001 through a circuit/wire for reading and executing the programs stored in the memory 1001.
The embodiment of the application provides a computer storage medium, which stores a computer program, wherein the computer program comprises a program for executing the method shown in any one of the embodiments of fig. 2 to 4.
Embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as shown in any of the embodiments of fig. 2 to 4.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present application without departing from the spirit and scope of the embodiments of the present application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to encompass such modifications and variations.
Claims (10)
1. A method for polarization channel reliability ranking, comprising:
determining a reliability of each of N polarized channels, wherein the reliability of an ith polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, N is a mother code length of a polarized Polar code, and N ═ 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: a set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1;
and determining a reliability sequencing sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.
2. The method of claim 1, wherein the reliability of the ith polarized channel of the N polarized channels is determined according to one of the following equations:
wherein L is(m)(i, P) represents the reliability of the ith polarization channel,
for a first distance spectrum between the first and second cosets,
and a second distance spectrum between the internal elements of the first coset, wherein w is the number of 1 contained in the code word, and ln is the natural logarithm operation.
3. The method of claim 2,
the first coset is used
It is shown that,
for the second coset
It is shown that,
where Span (.) represents the linear space generated by the vector, gxRepresents the x-th row vector in the generating matrix of the Polar code,
represents the 0 th to (i-1) th decoded bit sequences, | is an operation for solving the number of elements.
4. A method according to claim 2 or 3, wherein said method is as defined in claim 2 or 3
5. An apparatus for polarization channel reliability ranking, comprising:
a determining unit, configured to determine a reliability of each of N polarized channels, where the reliability of an ith polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, N is a mother code length of a polarized Polar code, and N ═ 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: a set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1;
and the sequencing unit is used for determining a reliability sequencing sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.
6. The apparatus of claim 5, wherein the determining unit determines the reliability of the ith polarized channel of the N polarized channels according to one of the following equations:
wherein L is(m)(i, P) represents the reliability of the ith polarization channel,
for a first distance spectrum between the first and second cosets,
and a second distance spectrum between the internal elements of the first coset, wherein w is the number of 1 contained in the code word, and ln is the natural logarithm operation.
7. The apparatus of claim 6,
the first coset is used
It is shown that,
for the second coset
It is shown that,
where Span (.) represents the linear space generated by the vector, gxRepresents the x-th row vector in the generating matrix of the Polar code,
represents the 0 th to (i-1) thThe decoded bit sequence, | - | is the operation of solving the number of elements.
8. The apparatus of claim 6 or 7, wherein the apparatus is a portable electronic device
9. An apparatus for polarization channel reliability ranking, comprising:
a memory for storing a program;
a processor for executing the program stored in the memory, the processor being configured, when the program is executed, to:
determining the reliability of each polarized channel in N polarized channels, and determining the reliability sequencing sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels; wherein the reliability of the ith polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to the physical channel state, i belongs to {1, 2, …, N }, N is the mother code length of the polarized Polar code, and N is 2mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: and the set of the code words is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1.
10. The apparatus of claim 9, wherein the means for polarized channel reliability ranking is a chip or an integrated circuit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710576782.7A CN109257140B (en) | 2017-07-14 | 2017-07-14 | Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710576782.7A CN109257140B (en) | 2017-07-14 | 2017-07-14 | Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109257140A CN109257140A (en) | 2019-01-22 |
| CN109257140B true CN109257140B (en) | 2021-03-30 |
Family
ID=65051163
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710576782.7A Active CN109257140B (en) | 2017-07-14 | 2017-07-14 | Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109257140B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114095123A (en) | 2017-08-02 | 2022-02-25 | 华为技术有限公司 | Polar code encoding method and device |
| US10659194B2 (en) | 2017-08-02 | 2020-05-19 | Huawei Technologies Co., Ltd. | Polar code encoding method and apparatus in wireless communications |
| CN112398484B (en) * | 2019-08-15 | 2024-04-23 | 华为技术有限公司 | Coding method and related equipment |
| CN113179101B (en) * | 2021-02-07 | 2024-04-12 | 睿信丰空天科技(北京)股份有限公司 | Symmetrical decoding device for polarization code |
| CN115314124B (en) * | 2022-09-28 | 2023-01-10 | 鹏城实验室 | Polar code construction method, system and device |
| CN117176185B (en) * | 2023-10-18 | 2024-02-09 | 苏州元脑智能科技有限公司 | Data encoding and decoding method and device based on polarization code and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104539393B (en) * | 2015-01-07 | 2018-01-12 | 北京邮电大学 | A kind of source coding method based on polarization code |
| CN104918063A (en) * | 2015-06-01 | 2015-09-16 | 中国农业大学 | Mistake resistance image transmission method based on Polar code technology |
| CN106877973B (en) * | 2015-12-10 | 2020-04-14 | 华为技术有限公司 | Method for processing polarization code and communication equipment |
-
2017
- 2017-07-14 CN CN201710576782.7A patent/CN109257140B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109257140A (en) | 2019-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109257140B (en) | Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device | |
| US10700808B2 (en) | Method and apparatus for encoding data using a polar code | |
| US11700545B2 (en) | Method and device for transmitting data | |
| CN111030707B (en) | Polar code encoding method and device | |
| CN109286404B (en) | Polar code encoding method and device | |
| CN109547034B (en) | Decoding method and device, decoder | |
| CN108574494B (en) | Coding and decoding method and device | |
| CN109286402B (en) | Polar code encoding method and device | |
| CN108809332B (en) | Polar code transmission method and device | |
| WO2019001436A1 (en) | Polar code encoding method and device | |
| CN111446969A (en) | Polarization code coding method and device for cascading CRC (Cyclic redundancy check) codes | |
| KR20180010849A (en) | Method for controlling decoding process based on path metric value and computing apparatus and mobile device for controlling the same | |
| CN109286403B (en) | Method and device for coding polarization code | |
| CN108880565B (en) | Coding and decoding method of polarization code and communication equipment | |
| CN108809485B (en) | Coding method and device | |
| CN109391358B (en) | Method and device for coding polarization code | |
| CN109088698B (en) | Coding method and communication equipment | |
| CN113078910A (en) | Bit field determination method, device, medium and electronic equipment | |
| CN117713842A (en) | Decoding method and device, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |