CN109510630A - It is a kind of to be polarized coding/decoding method based on synchronizing determining list ball-type - Google Patents
It is a kind of to be polarized coding/decoding method based on synchronizing determining list ball-type Download PDFInfo
- Publication number
- CN109510630A CN109510630A CN201811389749.4A CN201811389749A CN109510630A CN 109510630 A CN109510630 A CN 109510630A CN 201811389749 A CN201811389749 A CN 201811389749A CN 109510630 A CN109510630 A CN 109510630A
- Authority
- CN
- China
- Prior art keywords
- path
- sequence
- decoded
- bit
- paths
- 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.)
- Granted
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a kind of efficient list ball-type polarization coding/decoding methods, comprising: (1) calculates the in-degree set { T for each freezing position in sequence to be decodedd, 1≤d≤N }；(2) synchronous set { S of each information bit in sequence to be decoded is calculatedk, k=1 ..., K }, wherein synchronous set SkBy an information bit and can be determined by the information bit synchronization with receive code word distance all positions of freezing form；(3) inverted order polarization is decoded to the 1st synchronous set since k-th synchronous set；(4) after the completion of all synchronous set decodings, decoding sequence of the corresponding decoding sequence in the smallest path of path distance value as sequence to be decoded is selected.Decoding performance of the present invention is efficient, and it is low to be delayed.
Description
Technical field
The present invention relates to channel encode-decode technology more particularly to a kind of efficient list ball-type polarization coding/decoding methods.
Background technique
Since the eighties in last century, the made rapid progress of the communication technology makes human society march toward the information age.Wireless mobile is logical
The continuous development of letter technology provides very strong driving force for global IT application process.Radio honeycomb mobile communication is after first generation mould
The quasi- communication technology, second generation digital communication technology, third generation CDMA broadband communications technologies, have stepped into the industrialization of 4G system at present
With the commercialization stage.While 4G technology pushes industrialization and commercialization to, the mobile communication after 4G enters agenda, nothing
Line mobile communication evolution development faces completely new challenge.Apply and move with the popularization of intelligent terminals holding for new business demand
Continuous to increase, wireless transmission rate demand will be exponentially increased in coming 10 years.According to major carrier and authoritative advisory organization prediction:
To 2020, the transmission rate requirements of wireless communication will be at present at 1000 times of battalion's system.Existing 4G technology will be still difficult to
Superelevation transmission rate mobile interchange wireless communication needs need to draw in the case where frequency spectrum resource is increasingly in short supply after meeting 10 years
Enter the new technology for the property changed.Countries in the world have started to be conceived to the 5th generation wireless mobile while pushing 4G industrialization work
The research of the communication technology (5G) makes every effort to that mobile radio system performance and industry size is made to generate new leap.
It is well known that 1000 times of promotion in service traffics 10 years is the inherent base of 5G wireless mobile telecommunication technology and industry development
This demand.This core demand derives: continuous wide area covering, hot spot high capacity, low time delay is highly reliable, the big connection of terminal, sets
Five challenging index demands such as standby low-power consumption.To also to 5G wireless mobile telecommunication technology to corresponding channel coding
Realization proposes unprecedented high request and new challenge.Under the whole new set of applications scene of 5G mobile communication, polarization code at
For the standard of 5G channel coding control channel.Research is suitable for the efficient polarization code coder and decoder of 5G mobile communication system
With extremely strong theory significance and application value.
In recent mainstream document, based on the design of polarization code coding/decoding method, the most outstanding is successive elimination list pole
Change coding/decoding method.And in short code, list ball-type coding/decoding method also be can yet be regarded as a kind of selection.But current list ball
Type coding/decoding method is still defective: its decoding order is according to code word overall length, according to sequence from big to small, one asks
The minimum euclidean distance of each, but freezing position in fact does not have a power to make decision to the Euclidean distance of oneself, Euclidean distance can be by
The determination of a part of corresponding information bit value and determine therewith, such coding/decoding method may cause the loss of performance.
Summary of the invention
Goal of the invention: in view of the problems of the existing technology the present invention, provides a kind of efficient list ball-type polarization decoding
Method can solve the decoded inherent non-optimal property of decoding of list ball-type, can performance is substantially improved, while improving and understanding
Code stream journey can make decoding delay reduce.
Technical solution: efficient list ball-type polarization coding/decoding method of the present invention includes:
(1) the in-degree set { T for each freezing position in sequence to be decoded is calculatedd, 1≤d≤N }, wherein in-degree set Td
Indicating all has a directed edge to be directed toward the set for freezing the information bit of a d, and N is sequence bits number to be decoded, freezes a d table
Show and freezes position positioned at d of sequence to be decoded；
(2) synchronous set { S of each information bit in sequence to be decoded is calculatedk, k=1 ..., K }, wherein synchronous set Sk
It can be determined by an information bit and by the information bit synchronization and receive all positions of freezing of code word distance in sequence to be decoded
Serial number composition, K are sequence information position to be decoded number；
(3) inverted order polarization is decoded to the 1st synchronous set since k-th synchronous set；
(4) after the completion of the decoding of all synchronous sets, select the corresponding decoding sequence in the smallest path of path distance value as
The decoding sequence of sequence to be decoded.
Further, step (1) specifically includes:
(1-1) acquisition sequence bits number N to be decoded, information bit number K, freeze position set AC, code generator matrix GN；
(1-2) is by GNIt is mapped to the digraph of equal value for having N number of node, mapping ruler: if in GNThe i-th row jth column take
Value is 1, and i is not equal to j, then node i then has a corresponding directed edge to node j；
(1-3) finds out in digraph of equal value and freezes position set ACIn each freeze the in-degree set T of a dd, even node
J to node d has directed edge so j to belong to set Td, 1≤d≤N.
Further, step (2) specifically includes:
A counter k is arranged in (2-1), and assigning its initial value is 0；
A cyclic variable i, initial value N is arranged in (2-2)；
(2-3) increases by 1 if i-th of bit of sequence to be decoded belongs to information bit, by k, and S is arrangedk={ i }；
(2-4) is obtained according to code generator matrix GNThe digraph of equal value of mapping, and observe node i is pointed out it is every
One directed edge ei,jIf the in-degree that posterior nodal point j is left out on the side is equal to 0, S is added in jk, wherein ei,jFor digraph of equal value
The directed edge of interior joint i direction node j；
(2-5) is by i=i-1, if i is not 0, return step (2-3)；Otherwise terminate, to obtain each information bit
Synchronous set { Sk, k=1 ..., K }.
Further, step (3) specifically includes:
Variable k=K is arranged in (3-1)；
Variable l=1 is arranged in (3-2)；
(3-3) is for synchronous set SkWhen carrying out polarization decoding using first of decoding path candidate, perform the following operations:
(3-3-1) obtains synchronous set SkIn an element h, if the corresponding bit of h is information bit, by l points
Other value is 0 and 1, so that the l articles path candidate is extended to 2 paths, and calculates the path distance value of current two paths:
(3-3-2) if the corresponding bit of h is to freeze position, basis is included in synchronous set SkInterior unique information position value
It is 0 or 1, so that the l articles path candidate is extended to 2 paths, and calculates the path distance value of current two paths；
(3-3-3), which is returned, executes (3-3-1), until synchronous set SkAfter middle all elements are processed, execute (3-3)；
(3-4) judges whether l is equal to L, if so, executing (3-5), if it is not, then returning by l=l+1 and executing (3-3), L is
Maximum path number；
(3-5) retains from the small a path L before path selection distance value in 2L path, remaining route deletion；
(3-6) judges whether k is equal to 1, if so, (3-7) is executed, if it is not, then returning by k=k-1 and executing (3-2)；
(3-7) circulation terminates, and exports each synchronous set SkCorresponding path and path distance value.
Further, the path distance value of two paths is calculated according to following formula in step (3-3-1):
In formula,It indicates in l paths from N to the accumulated path distance value of kth position,For to the l articles
The path distance value in the path that Path extension obtains,Indicate XOR operation, g (i, h) presentation code generator matrix GNThe i-th row
H column element,Indicate exclusive or accumulating operation,Indicate i-th of bit of l paths, yhIt is h-th of sequence to be decoded
Bit.
Further, the path distance value of two paths is calculated according to following formula in step (3-3-2):
In formula,It indicates in l paths from N to the accumulated path distance value of kth position,For to the l articles
The path distance value in the path that Path extension obtains,Indicate XOR operation, ThIndicate in-degree set Th, g (i, h) presentation code
Generator matrix GNThe i-th row h column element,Indicate exclusive or accumulating operation,Indicate i-th of bit of l paths, yhFor
H-th of bit of sequence to be decoded.
The utility model has the advantages that compared with prior art, the present invention its remarkable advantage is: invention proposes a kind of based on synchronous set
List sphere decoding polarization coding/decoding method and system, the present invention is suitable for the polarization list-decoding method in the case of short code
Structure.The present invention, which devises, synchronizes determining technology, and decoding process once: each bit individually seeks minimum euclidean distance
Process, seek n times altogether, improve into: seeking the whole minimum euclidean distance of the same synchronous set, (calculating process has used jelly
Tie position in-degree set), it asks K times altogether.To greatly improve decoding performance.Because synchronous set and freezing an in-degree set
Determination can be carried out by way of precomputation under line, so the time delay of coding/decoding method is also significantly reduced.Particularly, for
Code rate R (R=K/N) lower code, performance boost of the invention and time delay reduction are more obvious.
Detailed description of the invention
Fig. 1 is the digraph exemplary diagram of equal value of the generator matrix mapping in the present invention, and N is 8, K 4, A in figureCFor 1,
2,3,5 }；
Fig. 2 is the exemplary diagram of the synchronous calculating in digraph of equal value in the present invention, and N is 8, K 4, A in figureCFor 1,2,
3,5 }, current decoded bit is the 6th bit；
Fig. 3 is another exemplary diagram of the synchronous calculating in digraph of equal value in the present invention, and N is 8, K 4, A in figureCFor
{ 1,2,3,5 }, current decoded bit are the 4th bit.
Specific embodiment
A kind of efficient list ball-type polarization coding/decoding method is present embodiments provided, applied list soccer star, which polarizes, to be decoded
List length be L, then total path quantity is 2L, in storage according to path to storage, i.e. the difference in path above and below
Not Jin Wei the last one bit value be 0 or 1, sequence length to be decoded be N, information bit length be K.List ball-type polarization
Coding/decoding method includes:
(1) the in-degree set { T for each freezing position in sequence to be decoded is calculatedd, 1≤d≤N }, wherein in-degree set Td
Indicating all has a directed edge to be directed toward the set for freezing the information bit of a d, and N is sequence bits number to be decoded, freezes a d table
Show and freezes position positioned at d of sequence to be decoded.It specifically includes:
(1-1) acquisition sequence bits number N to be decoded, information bit number K, freeze position set AC, coding generator matrix GN；
(1-2) is by GNIt is mapped to the digraph of equal value for having N number of node, mapping ruler: if in GNThe i-th row jth column take
Value is 1, and i is not equal to j, then node i then has a corresponding directed edge to node j；
(1-3) finds out in digraph of equal value and freezes position set ACIn each freeze the in-degree set T of a dd, even node
J to node d has directed edge so j to belong to set Td, 1≤d≤N.Fig. 1 be in the present invention generator matrix mapping etc.
Valence digraph exemplary diagram, N is 8, K 4, A in example in figureCFor { 1,2,3,5 }.
(2) synchronous set { S of each information bit in sequence to be decoded is calculatedk, k=1 ..., K }, wherein synchronous set Sk
It can be determined by an information bit and by the information bit synchronization and receive all positions of freezing of code word distance in sequence to be decoded
Serial number composition, K are sequence information position to be decoded number.Step (2) specifically includes:
A counter k is arranged in (2-1), and assigning its initial value is 0；
A cyclic variable i, initial value N is arranged in (2-2)；
(2-3) increases by 1 if i-th of bit of sequence to be decoded belongs to information bit, by k, and S is arrangedk={ i }；
(2-4) is obtained according to code generator matrix GNThe digraph of equal value of mapping, and observe node i is pointed out it is every
One directed edge ei,jIf the in-degree that posterior nodal point j is left out on the side is equal to 0, S is added in jk, wherein ei,jFor digraph of equal value
The directed edge of interior joint i direction node j；
(2-5) is by i=i-1, if i is not 0, return step (2-3)；Otherwise terminate, to obtain each information bit
Synchronous set { Sk, k=1 ..., K }.
(3) inverted order polarization is decoded to the 1st synchronous set since k-th synchronous set.It specifically includes:
Variable k=K is arranged in (3-1)；
Variable l=1 is arranged in (3-2)；
(3-3) is for synchronous set SkWhen carrying out polarization decoding using first of decoding path candidate, perform the following operations:
(3-3-1) obtains synchronous set SkIn an element h, if the corresponding bit of h is information bit, by l points
Other value is 0 and 1, so that the l articles path candidate is extended to 2 paths, and calculates the path distance value of current two paths:
In formula,It indicates in l paths from N to the accumulated path distance value of kth position,For to the l articles
The path distance value in the path that Path extension obtains,Indicate XOR operation, g (i, h) presentation code generator matrix GNThe i-th row
H column element,Indicate exclusive or accumulating operation,Indicate i-th of bit of l paths, yhIt is h-th of sequence to be decoded
Bit.
(3-3-2) if the corresponding bit of h is to freeze position, basis is included in synchronous set SkInterior unique information position value
It is 0 or 1, so that the l articles path candidate is extended to 2 paths, and calculates the path distance value of current two paths:
(3-3-3), which is returned, executes (3-3-1), until synchronous set SkAfter middle all elements are processed, execute (3-3)；
(3-4) judges whether l is equal to L, if so, executing (3-5), if it is not, then returning by l=l+1 and executing (3-3), L is
Maximum path number；
(3-5) retains from the small a path L before path selection distance value in 2L path, remaining route deletion；
(3-6) judges whether k is equal to 1, if so, (3-7) is executed, if it is not, then returning by k=k-1 and executing (3-2)；
(3-7) circulation terminates, and exports each synchronous set SkCorresponding path and path distance value.
For example, Fig. 2 is the exemplary diagram of the synchronous calculating in digraph of equal value in the present invention, example N is 8, K 4 in figure,
ACFor { 1,2,3,5 }, current decoded bit is the 6th bit, and the 6th bit and the 5th bit belong to synchronous set at this time
S2, the overall calculation that their Euclidean distance value can be synchronized comes out, and the method before improvement is only to consider the 6th here
Bit minimum euclidean distance, so can be because allow the 6th without the whole total distance value for considering the 6th bit and the 5th bit
It is a than particular solution mistake value, be here exactly the place for embodying improvement.
Fig. 3 is another exemplary diagram of the synchronous calculating in digraph of equal value in the present invention, and N is 8, K 4, A in figureCFor
{ 1,2,3,5 }, current decoded bit are the 4th bit, at this time the 4th bit and the 3rd bit and the 2nd bit and the 1st
A bit belongs to synchronous set S1, the overall calculation that their Euclidean distance value can be synchronized comes out, and the method before improvement is
The 4th bit minimum euclidean distance is only considered here, so can be because considering the 4th bit and the 3rd ratio without whole
The total distance value of special and the 2nd bit and the 1st bit and allow the 4th than particular solution mistake value, be here exactly to embody improvement
Place.
(4) after the completion of the decoding of all synchronous sets, select the corresponding decoding sequence in the smallest path of path distance value as
The decoding sequence of sequence to be decoded.
Above disclosed is only a preferred embodiment of the present invention, and the right model of the present invention cannot be limited with this
It encloses, therefore equivalent changes made in accordance with the claims of the present invention, is still within the scope of the present invention.
Claims (6)
- The coding/decoding method 1. a kind of efficient list ball-type polarizes, it is characterised in that this method comprises:(1) the in-degree set { T for each freezing position in sequence to be decoded is calculatedd, 1≤d≤N }, wherein in-degree set TdIt indicates All to have a directed edge to be directed toward the set for freezing the information bit of a d, N is sequence bits number to be decoded, freezes a d expression and is located at D s' of sequence to be decoded freezes position；(2) synchronous set { S of each information bit in sequence to be decoded is calculatedk, k=1 ..., K }, wherein synchronous set SkBy one Position information bit and all serial numbers for freezing position in sequence to be decoded that code word distance can be determined and received by the information bit synchronization Composition, K are sequence information position to be decoded number；(3) inverted order polarization is decoded to the 1st synchronous set since k-th synchronous set；(4) after the completion of all synchronous set decodings, select the corresponding decoding sequence in the smallest path of path distance value as wait translate The decoding sequence of code sequence.
- The coding/decoding method 2. efficient list ball-type according to claim 1 polarizes, it is characterised in that: step (1) is specifically wrapped It includes:(1-1) acquisition sequence bits number N to be decoded, information bit number K, freeze position set AC, code generator matrix GN；(1-2) is by GNIt is mapped to the digraph of equal value for having N number of node, mapping ruler: if in GNThe i-th row jth column value be 1, and i is not equal to j, then node i then has a corresponding directed edge to node j；(1-3) finds out in digraph of equal value and freezes position set ACIn each freeze the in-degree set T of a dd, even node j arrives Node d has directed edge so j to belong to set Td, 1≤d≤N.
- The coding/decoding method 3. efficient list ball-type according to claim 1 polarizes, it is characterised in that: step (2) is specifically wrapped It includes:A counter k is arranged in (2-1), and assigning its initial value is 0；A cyclic variable i, initial value N is arranged in (2-2)；(2-3) increases by 1 if i-th of bit of sequence to be decoded belongs to information bit, by k, and S is arrangedk={ i }；(2-4) is obtained according to code generator matrix GNThe digraph of equal value of mapping, and observe each pointed out for node i Directed edge ei,jIf the in-degree that posterior nodal point j is left out on the side is equal to 0, S is added in jk, wherein ei,jTo be saved in digraph of equal value The directed edge of point i direction node j；(2-5) is by i=i-1, if i is not 0, return step (2-3)；Otherwise terminate, to obtain the synchronization of each information bit Gather { Sk, k=1 ..., K }.
- The coding/decoding method 4. efficient list ball-type according to claim 1 polarizes, it is characterised in that: step (3) is specifically wrapped It includes:Variable k=K is arranged in (3-1)；Variable l=1 is arranged in (3-2)；(3-3) is for synchronous set SkWhen carrying out polarization decoding using first of decoding path candidate, perform the following operations:(3-3-1) obtains synchronous set SkIn an element h, if the corresponding bit of h is information bit, by l respectively values For 0 and 1, so that the l articles path candidate is extended to 2 paths, and the path distance value of current two paths is calculated:(3-3-2) if the corresponding bit of h is to freeze position, basis is included in synchronous set SkInterior unique information position value be 0 or Person 1, so that the l articles path candidate is extended to 2 paths, and calculates the path distance value of current two paths；(3-3-3), which is returned, executes (3-3-1), until synchronous set SkAfter middle all elements are processed, execute (3-3)；(3-4) judges whether l is equal to L, if so, executing (3-5), if it is not, then returning by l=l+1 and executing (3-3), L is maximum Path number；(3-5) retains from the small a path L before path selection distance value in 2L path, remaining route deletion；(3-6) judges whether k is equal to 1, if so, (3-7) is executed, if it is not, then returning by k=k-1 and executing (3-2)；(3-7) circulation terminates, and exports each synchronous set SkCorresponding path and path distance value.
- The coding/decoding method 5. efficient list ball-type according to claim 4 polarizes, it is characterised in that: in step (3-3-1) The path distance value of two paths is calculated according to following formula:In formula,It indicates in l paths from N to the accumulated path distance value of kth position,To expand l paths The path distance value in obtained path is opened up,Indicate XOR operation, g (i, h) presentation code generator matrix GNThe i-th row h arrange member Element,Indicate exclusive or accumulating operation,Indicate i-th of bit of l paths, yhFor h-th of bit of sequence to be decoded.
- The coding/decoding method 6. efficient list ball-type according to claim 4 polarizes, it is characterised in that: in step (3-3-2) The path distance value of two paths is calculated according to following formula:In formula,It indicates in l paths from N to the accumulated path distance value of kth position,To expand l paths The path distance value in obtained path is opened up,Indicate XOR operation, ThIndicate in-degree set Th, g (i, h) presentation code generation square Battle array GNThe i-th row h column element,Indicate exclusive or accumulating operation,Indicate i-th of bit of l paths, yhIt is to be decoded H-th of bit of sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811389749.4A CN109510630B (en) | 2018-11-21 | 2018-11-21 | List spherical polarization decoding method based on synchronous determination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811389749.4A CN109510630B (en) | 2018-11-21 | 2018-11-21 | List spherical polarization decoding method based on synchronous determination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109510630A true CN109510630A (en) | 2019-03-22 |
| CN109510630B CN109510630B (en) | 2022-05-31 |
Family
ID=65749309
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811389749.4A Active CN109510630B (en) | 2018-11-21 | 2018-11-21 | List spherical polarization decoding method based on synchronous determination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109510630B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116979973A (en) * | 2023-09-22 | 2023-10-31 | 为准（北京）电子科技有限公司 | Information decoding method and device, electronic equipment and readable storage medium |
| WO2024045544A1 (en) * | 2022-08-29 | 2024-03-07 | 网络通信与安全紫金山实验室 | Decoding path determination method and apparatus, and computer device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050008091A1 (en) * | 2003-06-26 | 2005-01-13 | Mitsubishi Denki Kabushiki Kaisha | Sphere decoding of symbols transmitted in a telecommunication system |
| CN103354466A (en) * | 2005-06-01 | 2013-10-16 | 高通股份有限公司 | Cqi and rank prediction for list sphere decoding and ml mimo receivers |
| US20170149444A1 (en) * | 2015-11-19 | 2017-05-25 | Westhold Corporation | Error correction using cyclic code-based ldpc codes |
| CN108063649A (en) * | 2017-12-14 | 2018-05-22 | 东南大学 | A kind of polarization code coding method of low time delay low complex degree |
| CN108809511A (en) * | 2018-04-12 | 2018-11-13 | 东南大学 | Combined decoding method based on successive elimination list decoding and list sphere decoding and device |
-
2018
- 2018-11-21 CN CN201811389749.4A patent/CN109510630B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050008091A1 (en) * | 2003-06-26 | 2005-01-13 | Mitsubishi Denki Kabushiki Kaisha | Sphere decoding of symbols transmitted in a telecommunication system |
| CN103354466A (en) * | 2005-06-01 | 2013-10-16 | 高通股份有限公司 | Cqi and rank prediction for list sphere decoding and ml mimo receivers |
| US20170149444A1 (en) * | 2015-11-19 | 2017-05-25 | Westhold Corporation | Error correction using cyclic code-based ldpc codes |
| CN108063649A (en) * | 2017-12-14 | 2018-05-22 | 东南大学 | A kind of polarization code coding method of low time delay low complex degree |
| CN108809511A (en) * | 2018-04-12 | 2018-11-13 | 东南大学 | Combined decoding method based on successive elimination list decoding and list sphere decoding and device |
Non-Patent Citations (3)
| Title |
|---|
| SEYYED ALI HASHEMI等: "A Fast Polar Code List Decoder Architecture Based on Sphere Decoding", 《 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS》 * |
| XIAO LIANG等: "Joint List Polar Decoder with Successive Cancellation and Sphere Decoding", 《2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING》 * |
| 王韬博: "LTE系统中高级MIMO检测算法研究", 《中国优秀硕士学位论文全文数据库 (信息科技辑)》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024045544A1 (en) * | 2022-08-29 | 2024-03-07 | 网络通信与安全紫金山实验室 | Decoding path determination method and apparatus, and computer device and storage medium |
| CN116979973A (en) * | 2023-09-22 | 2023-10-31 | 为准（北京）电子科技有限公司 | Information decoding method and device, electronic equipment and readable storage medium |
| CN116979973B (en) * | 2023-09-22 | 2023-12-15 | 为准（北京）电子科技有限公司 | Information decoding method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109510630B (en) | 2022-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7026706B2 (en) | Rate matching method and equipment and rate dematching method and equipment | |
| CN106487479B (en) | A kind of polarization code coding method based on multidigit judgement | |
| CN109510630A (en) | It is a kind of to be polarized coding/decoding method based on synchronizing determining list ball-type | |
| CN105392164B (en) | Select the method and station equipment of network controller | |
| CN104158855A (en) | Mobile service combined calculation discharge method based on genetic algorithm | |
| CN106253911B (en) | A kind of successive elimination list decoding method of software polarization code | |
| CN109936377A (en) | A kind of the polarization code coding and interpretation method of segmentation CRC auxiliary | |
| CN105119834A (en) | Source address and destination address combined searching method based on composite trie tree structure | |
| CN106656205A (en) | Polarization code decoding method and system capable of reducing memory consumption | |
| CN106249109A (en) | Electrical power distribution network fault location method and system | |
| CN110351780A (en) | A kind of communication means based on code cache, system and storage medium | |
| CN108574558A (en) | The method and apparatus of transmission control information | |
| CN110022188A (en) | Interpretation method and circuit are serially offset based on the polarization code encoding method and polarization code for freezing bit pair | |
| CN108809511A (en) | Combined decoding method based on successive elimination list decoding and list sphere decoding and device | |
| CN108923889B (en) | Coding method and device | |
| CN109067409A (en) | A kind of efficient list ball-type polarization coding/decoding method and system | |
| CN112507047B (en) | Optimal ordered path query method based on interest point preference | |
| CN105354253A (en) | SCD file decoupling method | |
| CN104486033A (en) | Downlink multimode channel coding system and method based on C-RAN platform | |
| CN105049064A (en) | Pipeline polar code encoder | |
| CN102076053B (en) | Method for quickly repairing Zigbee wireless sensor network | |
| CN109004939A (en) | Polarize decoder and method | |
| CN105610550B (en) | A kind of Viterbi interpretation method for power line carrier communication | |
| CN108880743A (en) | A kind of Polar decoding transmission method and device | |
| CN109741421A (en) | A kind of Dynamic Graph color method based on GPU |
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 |