CN114866194B - Self-synchronizing decoding method based on polarization code - Google Patents

Self-synchronizing decoding method based on polarization code Download PDF

Info

Publication number
CN114866194B
CN114866194B CN202210788761.2A CN202210788761A CN114866194B CN 114866194 B CN114866194 B CN 114866194B CN 202210788761 A CN202210788761 A CN 202210788761A CN 114866194 B CN114866194 B CN 114866194B
Authority
CN
China
Prior art keywords
sequence
stage
decoding
self
candidate
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
Application number
CN202210788761.2A
Other languages
Chinese (zh)
Other versions
CN114866194A (en
Inventor
张靖
黄子轩
周家喜
赵靓
何家皓
徐思远
曹山
郭伟
李湘豪
刘振语
戴世纪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tiandi Information Network Research Institute Anhui Co Ltd
Original Assignee
Tiandi Information Network Research Institute Anhui Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tiandi Information Network Research Institute Anhui Co Ltd filed Critical Tiandi Information Network Research Institute Anhui Co Ltd
Priority to CN202210788761.2A priority Critical patent/CN114866194B/en
Publication of CN114866194A publication Critical patent/CN114866194A/en
Application granted granted Critical
Publication of CN114866194B publication Critical patent/CN114866194B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00—Arrangements for synchronising receiver with transmitter
    • 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

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)

Abstract

The invention discloses a self-synchronizing decoding method based on a polarization code, which combines the sum of absolute values of log-likelihood ratios with a convergence criterion to judge the correct synchronous position without the help of a synchronous sequence, reduces the cost of channel resources, improves the information transmission efficiency, realizes synchronous decoding and reduces the integral time delay of a communication system on the premise of ensuring the frame error rate of the communication system; the self-synchronizing decoding method adopts a multi-stage decoding mode, and effectively reduces the calculation complexity and the synchronization time delay.

Description

Self-synchronizing decoding method based on polarization code
Technical Field
The invention relates to the technical field of synchronous detection, in particular to a self-synchronous decoding method based on a polarization code.
Background
Synchronization is crucial to a communication system, and normal communication can be performed only after carrier frequency and phase synchronization, symbol synchronization and frame synchronization are completed by a transmitting side and a receiving side. In order to realize synchronization, most communication systems choose to insert a segment of synchronization sequence known by both the transmitting and receiving parties into the transmitted signal, and after the receiving end receives the signal, the correct synchronization position is obtained by using the synchronization sequence through a corresponding synchronization algorithm. However, the additionally added synchronization sequence occupies valuable channel resources, which reduces the transmission efficiency of information, and meanwhile, the synchronization algorithm also increases the computational complexity of the communication system, so it is of great significance to research a self-synchronization method without the help of the synchronization sequence.
The polar code is a channel coding scheme which is proved by theory to reach the shannon capacity, has excellent performance, and is already selected as a coding scheme for controlling a channel in a fifth generation mobile communication (5G) enhanced mobile broadband scene. The decoding algorithm of the polarization code has a great influence on the error correction capability of the polarization code in practical application, wherein the Belief Propagation (BP) decoding algorithm of the polarization code has the advantages of high throughput and low decoding delay, and the parallel decoding characteristic of the polarization code is convenient for the realization of a hardware architecture.
Disclosure of Invention
Aiming at the defects of the existing synchronization mode, the invention provides a self-synchronization decoding method based on polarization codes, which realizes synchronous decoding at the same time, effectively improves the communication transmission efficiency, saves the communication cost and reduces the integral time delay of a communication system.
The invention provides a self-synchronizing decoding method based on a polarization code, which comprises the following steps:
step S1, the sending end carries out polar code coding on the information bit, and sends the information bit after modulation;
step S2, the receiving end receives the signal, adds synchronous correction, and gets after demodulation
Figure 854251DEST_PATH_IMAGE001
A candidate sequence, wherein the synchronization correction comprises one or more of carrier frequency correction, carrier phase correction, symbol synchronization correction, and frame synchronization correction;
step S3, the receiving end uses the self-synchronization decoding method based on belief propagation to process the candidate sequence
Figure 279285DEST_PATH_IMAGE002
Front in stage decoding
Figure 797991DEST_PATH_IMAGE003
Stage decoding and defining the number of candidate sequences per stage, i.e. the first
Figure 225561DEST_PATH_IMAGE004
From stage to stage
Figure 896845DEST_PATH_IMAGE005
Is selected out
Figure 509092DEST_PATH_IMAGE006
The sequence is used as a candidate sequence of the next stage until
Figure 124881DEST_PATH_IMAGE003
The stage decoding is finished to obtain the stage I
Figure 198885DEST_PATH_IMAGE002
Of stages
Figure 442785DEST_PATH_IMAGE007
A candidate sequence, wherein
Figure 711086DEST_PATH_IMAGE008
，
Figure 781548DEST_PATH_IMAGE009
；
Step S4, the receiving end uses the self-synchronization decoding method based on belief propagation to process the candidate sequence
Figure 144396DEST_PATH_IMAGE002
In stage decoding
Figure 259114DEST_PATH_IMAGE002
Stage decoding from
Figure 354109DEST_PATH_IMAGE007
Screening out the correct sequence from the candidate sequenceAnd returning the corresponding decoding result and the synchronous position information, wherein the judgment criterion of the correct sequence is one or the combination of two judgment criteria:
calculating the sum of the absolute values of the log-likelihood ratios of the information bits in each sequence
Figure 69124DEST_PATH_IMAGE010
And is denoted as
Figure 642188DEST_PATH_IMAGE011
In the sequence of
Figure 375526DEST_PATH_IMAGE012
Metric values after a sub-iteration, wherein
Figure 500477DEST_PATH_IMAGE013
，
Figure 187942DEST_PATH_IMAGE014
，
Figure 830276DEST_PATH_IMAGE015
Is as follows
Figure 168853DEST_PATH_IMAGE002
Number of iterations of a stage, selected by ordering
Figure 713973DEST_PATH_IMAGE010
The largest sequence is used as a correct sequence, and a corresponding decoding result and synchronous position information are returned;
versus log-likelihood ratio per bit obtained by decoding
Figure 13367DEST_PATH_IMAGE007
And if the sequence is converged, the sequence is a correct sequence and returns a corresponding final decoding result and synchronous position information.
Further, the first
Figure 787288DEST_PATH_IMAGE004
From stage to stage
Figure 996684DEST_PATH_IMAGE005
Selecting from a candidate sequence
Figure 197858DEST_PATH_IMAGE006
The selection mode of each sequence is as follows:
for the purpose of
Figure 827291DEST_PATH_IMAGE005
Candidate sequences, calculating the sum of the absolute values of the log-likelihood ratios of the information bits in each sequence
Figure 670482DEST_PATH_IMAGE016
And is denoted as
Figure 859018DEST_PATH_IMAGE017
In the sequence of
Figure 247405DEST_PATH_IMAGE018
Metric values after a sub-iteration, wherein
Figure 646025DEST_PATH_IMAGE019
，
Figure 276596DEST_PATH_IMAGE020
，
Figure 319638DEST_PATH_IMAGE021
Is as follows
Figure 393773DEST_PATH_IMAGE004
Number of iterations of a stage, selected by ordering
Figure 764843DEST_PATH_IMAGE022
In the front of the sequence
Figure 90782DEST_PATH_IMAGE006
And (5) taking the sequence as a candidate sequence of the next stage.
Further, the method can be used for preparing a novel materialIs judged to be
Figure 378544DEST_PATH_IMAGE011
Whether the sequence converges is determined by determining that the sequence is in the second place
Figure 498947DEST_PATH_IMAGE002
In stage decoding
Figure 387006DEST_PATH_IMAGE012
The sub-iteration and
Figure 251057DEST_PATH_IMAGE023
whether the value of the metric of the information bit changes in the sub-iteration, i.e. calculation
Figure 393325DEST_PATH_IMAGE024
Whether or not it is 0, if
Figure 684629DEST_PATH_IMAGE025
It indicates that the sequence converged if
Figure 295870DEST_PATH_IMAGE026
It indicates that the sequence does not converge.
Further, when judging
Figure 557087DEST_PATH_IMAGE007
Whether the sequences are converged or not, and selecting a metric value among the converged sequences when a plurality of converged sequences are obtained
Figure 694808DEST_PATH_IMAGE010
The largest sequence was taken as the correct sequence.
Further, when judging
Figure 288773DEST_PATH_IMAGE007
Whether or not the sequence has converged, when no converged sequence is obtained, in
Figure 370998DEST_PATH_IMAGE007
Selecting metric values in a sequence
Figure 842431DEST_PATH_IMAGE010
The largest sequence was taken as the correct sequence.
The invention also discloses a self-synchronizing decoding system based on the polarization code, which comprises a sending end and a receiving end and is characterized in that the sending end and the receiving end execute the self-synchronizing decoding method based on the polarization code.
The invention has the beneficial effects that: the method has the advantages that a synchronization sequence is not needed, on the premise of ensuring the frame error rate of the communication system, the channel resource overhead is reduced, the information transmission efficiency is improved, the synchronous and decoding are realized, and the overall time delay of the communication system is reduced; the self-synchronizing decoding method adopts a multi-stage decoding mode, and effectively reduces the calculation complexity and the synchronization time delay.
Drawings
FIG. 1 is a flow chart of a self-synchronizing decoding method from a transmitting end to a receiving end;
FIG. 2 is a flow chart of a two-stage BP decoding self-synchronization method.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments. The embodiments of the present invention have been presented for purposes of illustration and description, and are not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Example 1
The present embodiment takes two-stage decoding as an example to illustrate the self-synchronization decoding process based on the polarization code disclosed in the present invention, as shown in fig. 1 and fig. 2, which includes the following steps:
firstly, a sending end carries out polarization code coding on information bits, and the information bits are sent after modulation.
Wherein the length of the information bit
Figure 710024DEST_PATH_IMAGE027
Code length after polar code encoding
Figure 77551DEST_PATH_IMAGE028
(ii) a And after the coding is finished, modulating the coded code words by adopting binary phase shift keying modulation to obtain a modulation symbol sequence and then sending the modulation symbol sequence.
It should be understood that, according to actual needs, other polar codes with code length and code rate and other modulation modes may also be selected, and how to encode the polar codes and how to modulate the polar codes belong to the prior art in the field, which is not the core content discussed in the present invention, and therefore, will not be described in detail.
Secondly, the receiving end receives the signal, adds frame synchronization correction and obtains the signal after demodulation
Figure 912652DEST_PATH_IMAGE001
And (5) a candidate sequence.
As is known in the art, when a communication system is in different channel conditions, a receiving end needs to add different synchronization corrections, and the number of candidate sequences obtained will also change according to information such as code length, the type of synchronization correction added, and the like. In this embodiment, the code length after the information bit polarization code is coded is as
Figure 922196DEST_PATH_IMAGE028
To avoid loss of generality, 1024 candidate sequences are selected (i.e.
Figure 142831DEST_PATH_IMAGE029
) To ensure that the correct frame synchronization position is always included in the candidate sequence.
Thirdly, the receiving end performs first-stage decoding in two-stage decoding on the candidate sequence by using a belief propagation-based self-synchronization decoding method to obtain
Figure 618943DEST_PATH_IMAGE030
And (5) a candidate sequence.
First, the candidate sequences of the first stage and the second stage need to be definedNumber of
Figure 190607DEST_PATH_IMAGE001
、
Figure 862897DEST_PATH_IMAGE030
1024, 256, number of iterations of the first and second stages, respectively
Figure 173924DEST_PATH_IMAGE031
、
Figure 148833DEST_PATH_IMAGE032
Respectively 8 and 15, that is, after the two-stage decoding is finished, 256 candidate sequences are obtained.
BP decoding is adopted in each stage, the initial log-likelihood ratio of the frozen bit is set to be infinite, the variation of the frozen bit in iteration is negligible, and therefore only the information bit is considered when the sum of absolute values of the log-likelihood ratios is calculated.
In the first stage of decoding, 256 candidate sequences are screened from 1024 candidate sequences, where a conventional candidate sequence screening method may be adopted, and the following selection method may also be adopted:
calculating metric values of information bits in each of 1024 candidate sequences
Figure 427368DEST_PATH_IMAGE033
Wherein
Figure 152616DEST_PATH_IMAGE034
To represent
Figure 832996DEST_PATH_IMAGE035
After the second iteration
Figure 323014DEST_PATH_IMAGE036
Log likelihood ratio of individual bits，
Figure 964211DEST_PATH_IMAGE037
，
Figure 243883DEST_PATH_IMAGE038
，ARepresenting sets of information bits, selected by ordering
Figure 919715DEST_PATH_IMAGE016
And sequencing the top 256 candidate sequences to obtain the candidate sequences of the second stage.
And fourthly, the receiving end performs second-stage decoding in the two-stage decoding on the candidate sequences by using a confidence propagation-based self-synchronization decoding method, and selects correct sequences from the 256 candidate sequences.
This example presents the following two screening methods.
1. And (4) performing screening by simply passing the judgment criterion:
calculating metric values of information bits in each sequence for 256 candidate sequences
Figure 875907DEST_PATH_IMAGE039
Wherein
Figure 269980DEST_PATH_IMAGE040
To represent
Figure 822184DEST_PATH_IMAGE012
After the second iteration
Figure 493468DEST_PATH_IMAGE041
Log likelihood ratio of individual bits，
Figure 246660DEST_PATH_IMAGE042
，
Figure 721504DEST_PATH_IMAGE043
，ARepresenting sets of information bits, selected by ordering
Figure 218344DEST_PATH_IMAGE010
The largest sequence is used as the correct sequence, and the corresponding decoding result and the synchronous position information are returned.
2. Firstly, judging whether a unique convergence sequence exists in the 256 candidate sequences for screening through a judgment criterion, wherein the screening method corresponds to a flow chart shown in FIG. 2:
if the only convergence sequence exists, the convergence sequence is the correct sequence;
if there are multiple convergence sequences, selecting metric value from multiple convergence sequences
Figure 977090DEST_PATH_IMAGE010
The largest sequence is taken as the correct sequence;
and thirdly, if the convergence sequence does not exist, screening through a judgment criterion.
In this embodiment, the judgment is made
Figure 760239DEST_PATH_IMAGE011
Whether the sequence converges is determined by determining that the sequence is in the second place
Figure 738690DEST_PATH_IMAGE002
In stage decoding
Figure 773642DEST_PATH_IMAGE012
The sub-iteration and
Figure 403207DEST_PATH_IMAGE023
whether the value of the metric of the information bit changes in the sub-iteration, i.e. calculation
Figure 498201DEST_PATH_IMAGE024
Whether or not it is 0, if
Figure 196905DEST_PATH_IMAGE025
It indicates that the sequence converged if
Figure 35548DEST_PATH_IMAGE026
It indicates that the sequence does not converge.
Here, the sequence is set to
Figure 785198DEST_PATH_IMAGE002
In stage decoding
Figure 51094DEST_PATH_IMAGE012
The sub-iteration and
Figure 4138DEST_PATH_IMAGE023
the question of whether the log-likelihood ratio of each bit in the sub-iteration changes, is simplified for the sequence at the second
Figure 380893DEST_PATH_IMAGE002
In stage decoding
Figure 719470DEST_PATH_IMAGE012
The sub-iteration and
Figure 264590DEST_PATH_IMAGE023
whether the metric of the information bits changes in the sub-iteration.
Example 2
Based on embodiment 1, the two-stage decoding is adjusted to three-stage decoding, and the number of candidate sequences in the first, second and third stages is limited
Figure 157460DEST_PATH_IMAGE001
、
Figure 947692DEST_PATH_IMAGE030
、
Figure 547301DEST_PATH_IMAGE044
1024, 512, 256, first, second, and third stage iterations respectively
Figure 591218DEST_PATH_IMAGE031
、
Figure 377908DEST_PATH_IMAGE032
、
Figure 955520DEST_PATH_IMAGE045
Respectively 8, 12 and 15, that is, after the three-stage decoding is finished, 256 candidate sequences are obtained.
Then, the first stage of decoding is performed to screen 512 candidate sequences from 1024 candidate sequences, which is the same as the third step in embodiment 1; second-stage decoding, namely screening 256 candidate sequences from 512 candidate sequences, wherein the method is also the same as the third step in the embodiment 1; and in the third stage of decoding, screening out a correct sequence from 256 candidate sequences, wherein the method is the same as the fourth step in the embodiment 1. More stages of decoding are split in the same manner, and are not described herein again.
It is to be understood that the described embodiments are merely a few embodiments of the invention, and not all embodiments. All other embodiments, which can be derived by one of ordinary skill in the art and related arts based on the embodiments of the present invention without any creative effort, shall fall within the protection scope of the present invention.

Claims (6)

1. A self-synchronization decoding method based on polarization codes is characterized by comprising the following steps:
step S1, the sending end carries out polar code coding on the information bit, and sends the information bit after modulation;
step S2, the receiving end receives the signal, adds synchronous correction, and gets after demodulation
Figure 153851DEST_PATH_IMAGE001
A candidate sequence, wherein the synchronization correction comprises one or more of carrier frequency correction, carrier phase correction, symbol synchronization correction, and frame synchronization correction;
step S3, the receiving end uses the self-synchronization decoding method based on belief propagation to process the candidate sequence
Figure 169211DEST_PATH_IMAGE002
Front in stage decoding
Figure 608283DEST_PATH_IMAGE003
Stage decoding and defining the number of candidate sequences per stage, i.e. the first
Figure 274757DEST_PATH_IMAGE004
From stage to stage
Figure 773871DEST_PATH_IMAGE005
In selecting
Figure 604424DEST_PATH_IMAGE006
The sequence is used as a candidate sequence of the next stage until
Figure 722553DEST_PATH_IMAGE003
The stage decoding is finished to obtain the stage I
Figure 118899DEST_PATH_IMAGE002
Of stages
Figure 208821DEST_PATH_IMAGE007
A candidate sequence, wherein
Figure 198774DEST_PATH_IMAGE008
，
Figure 245227DEST_PATH_IMAGE009
；
Step S4, the receiving end uses the self-synchronization decoding method based on belief propagation to process the candidate sequence
Figure 620714DEST_PATH_IMAGE002
In stage decoding
Figure 461631DEST_PATH_IMAGE002
Stage decoding from
Figure 938880DEST_PATH_IMAGE007
Screening out correct sequences from the candidate sequences, and returning a decoding result and synchronous position information corresponding to the correct sequences, wherein the judgment criterion of the correct sequences is one or the combination of two judgment criteria:
calculating the absolute log-likelihood ratio of information bits in each sequenceSum of values
Figure 523445DEST_PATH_IMAGE010
And is denoted as
Figure 520482DEST_PATH_IMAGE011
In the sequence of
Figure 532300DEST_PATH_IMAGE012
Metric values after a sub-iteration, wherein
Figure 496845DEST_PATH_IMAGE013
，
Figure 619522DEST_PATH_IMAGE014
，
Figure 969601DEST_PATH_IMAGE015
Is a first
Figure 417900DEST_PATH_IMAGE002
Number of iterations of a stage, selected by ordering
Figure 932058DEST_PATH_IMAGE010
The largest sequence is used as a correct sequence, and a corresponding decoding result and synchronous position information are returned;
versus log-likelihood ratio per bit obtained by decoding
Figure 733792DEST_PATH_IMAGE007
And if the sequence is converged, the sequence is a correct sequence and returns a corresponding final decoding result and synchronous position information.
2. The polar-code-based self-synchronous decoding method according to claim 1, wherein the first step
Figure 79322DEST_PATH_IMAGE004
From stage to stage
Figure 56112DEST_PATH_IMAGE005
Selecting from a candidate sequence
Figure 791987DEST_PATH_IMAGE006
The selection mode of each sequence is as follows:
to is directed at
Figure 646679DEST_PATH_IMAGE005
Candidate sequences, calculating the sum of the absolute values of the log-likelihood ratios of the information bits in each sequence
Figure 846717DEST_PATH_IMAGE016
And is denoted as
Figure 246605DEST_PATH_IMAGE017
In the sequence of
Figure 532093DEST_PATH_IMAGE018
Metric values after a sub-iteration, wherein
Figure 426362DEST_PATH_IMAGE019
，
Figure 153009DEST_PATH_IMAGE020
，
Figure 769804DEST_PATH_IMAGE021
Is as follows
Figure 542588DEST_PATH_IMAGE004
Number of iterations of a stage, selected by ordering
Figure 224236DEST_PATH_IMAGE022
Ranked top
Figure 133287DEST_PATH_IMAGE006
And (5) taking the sequence as a candidate sequence of the next stage.
3. The polar-code-based self-synchronous decoding method according to claim 1, wherein the judgment of the second order is
Figure 177376DEST_PATH_IMAGE011
Whether the sequence converges is determined by determining that the sequence is in the second place
Figure 109560DEST_PATH_IMAGE002
In stage decoding
Figure 844167DEST_PATH_IMAGE012
The sub-iteration and
Figure 873303DEST_PATH_IMAGE023
whether the value of the metric of the information bit changes in the sub-iteration, i.e. calculation
Figure 785895DEST_PATH_IMAGE024
Whether or not it is 0, if
Figure 267692DEST_PATH_IMAGE025
It indicates that the sequence converged if
Figure 104192DEST_PATH_IMAGE026
It indicates that the sequence does not converge.
4. The self-synchronous decoding method of claim 3, wherein the judgment is made
Figure 863201DEST_PATH_IMAGE007
Whether the sequences are converged or not, and selecting a metric value among the converged sequences when a plurality of converged sequences are obtained
Figure 336908DEST_PATH_IMAGE010
The largest sequence was taken as the correct sequence.
5. The self-synchronous decoding method of claim 3, wherein the judgment is made
Figure 430634DEST_PATH_IMAGE007
Whether or not the sequence has converged, when no converged sequence is obtained, in
Figure 382410DEST_PATH_IMAGE007
Selecting metric values in a sequence
Figure 261504DEST_PATH_IMAGE010
The largest sequence was taken as the correct sequence.
6. A self-synchronization decoding system based on polarization codes, comprising a transmitting end and a receiving end, wherein the transmitting end and the receiving end execute the self-synchronization decoding method based on polarization codes according to any one of claims 1 to 5.
CN202210788761.2A 2022-07-06 2022-07-06 Self-synchronizing decoding method based on polarization code Active CN114866194B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210788761.2A CN114866194B (en) 2022-07-06 2022-07-06 Self-synchronizing decoding method based on polarization code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210788761.2A CN114866194B (en) 2022-07-06 2022-07-06 Self-synchronizing decoding method based on polarization code

Publications (2)

Publication Number Publication Date
CN114866194A CN114866194A (en) 2022-08-05
CN114866194B true CN114866194B (en) 2022-09-06

Family

ID=82625941

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210788761.2A Active CN114866194B (en) 2022-07-06 2022-07-06 Self-synchronizing decoding method based on polarization code

Country Status (1)

Country Link
CN (1) CN114866194B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102694625B (en) * 2012-06-15 2014-11-12 北京邮电大学 Polarization code decoding method for cyclic redundancy check assistance
CN109245853B (en) * 2018-08-06 2020-09-08 华中科技大学 Polarization code-based synchronization-free communication method
US11139839B1 (en) * 2020-07-07 2021-10-05 Huawei Technologies Co., Ltd. Polar code decoder and a method for polar code decoding

Also Published As

Publication number Publication date
CN114866194A (en) 2022-08-05

Similar Documents

Publication Publication Date Title
EP3718228B1 (en) Communication system and method using a set of distribution matchers
CN107612560B (en) Polarization code early iteration stopping method based on partial information bit likelihood ratio
CN107395319B (en) Code rate compatible polarization code coding method and system based on punching
US7668267B2 (en) Search efficient MIMO trellis decoder
CN1695307A (en) Trellis-based receiver
CN109951190B (en) Self-adaptive Polar code SCL decoding method and decoding device
US10548158B2 (en) Message passing algorithm decoder and methods
JP2006191543A (en) Decoder for multiplex transmission system
US20110044407A1 (en) Adaptive qrd-m algorithm based signal detecting method by using constellation set grouping in spatial multiplexing multiple-input multiple-output system
JPH07221655A (en) Communication system and information processing method
CN110336639B (en) Polar code multilayer coding modulation method based on capacity distribution and application
CN107659318B (en) Self-adaptive polar code decoding method
WO2001035549A1 (en) Adaptive array communication system and receiver
CN112332864A (en) Polar code decoding method and system for self-adaptive ordered mobile pruning list
CN109194336B (en) Method, system and device for coding and decoding cascade Spinal code
EP2064825B1 (en) Multiple-input-multiple-output transmission using non-binary ldpc coding
US20070183489A1 (en) Apparatus for decoding a signal and method thereof and a trellis coded modulation decoder and method thereof
CN107094026B (en) Graph merging detection decoding method for NB-LDPC coding
CN114866194B (en) Self-synchronizing decoding method based on polarization code
CN110601699B (en) Method for realizing code rate dynamic variable multi-element LDPC code
CN109586848B (en) Message transmission decoding method in SCMA system
CN107707333B (en) Method and device for stopping early iteration of polarization code based on code word estimated value
CN114257342A (en) Coding and decoding method for two-user multiple access system based on non-binary polarization code
CN109257077B (en) Novel spatial modulation method combining Huffman coding and BCH coding
CN107682122B (en) Iterative demodulation decoding method of wireless optical communication multilevel coding modulation system

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