CN105391455B - A kind of zero Turbo code starting point and depth blind-identification method - Google Patents
A kind of zero Turbo code starting point and depth blind-identification method Download PDFInfo
- Publication number
- CN105391455B CN105391455B CN201510729076.2A CN201510729076A CN105391455B CN 105391455 B CN105391455 B CN 105391455B CN 201510729076 A CN201510729076 A CN 201510729076A CN 105391455 B CN105391455 B CN 105391455B
- Authority
- CN
- China
- Prior art keywords
- depth
- zero
- turbo code
- starting point
- interleave depth
- 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
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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
Abstract
Method the invention belongs to be interleaved and interleave depth estimation at 7 points to zero Turbo code in the case where Turbo code interleave parameter blind recognition field more particularly to larger interleave depth (hundreds to thousands).The present invention is based on the interleaver depth of zero-reset structure and starting point recognition methods, the convolutional encoding that is widely present in practical application is utilized from zero-reset structure.Under such configuration, be either zeroed bit, or using all-zero state as the coded sequence for playing primary state, all there is certain architectural characteristic.By the statistics to codeword sequence, the codeword position for meeting specific structure is found, so that it is determined that the interleave depth of Turbo code and intertexture starting point.The method of the present invention greatly reduces the operand of Turbo code parameter blind recognition algorithm, is forced the step of taking multinest operation for multiple unknown numbers when having evaded total blindness's identification.Identification process is separated, parameter identifies one by one, thus while improving operation efficiency, but also the identification of big interleave depth has practical operability.
Description
Technical field
The invention belongs to Turbo code interleave parameter blind recognition field more particularly to larger interleave depths (hundreds to thousands)
In the case where, to zero Turbo code be interleaved 7 points and interleave depth estimation method.
Background technique
According to Shannon's theorems, as long as communication rate is lower than channel capacity, then certainly existing difference as code length levels off to infinite
Error rate level off to zero progressive number.The Turbo code coding and decoding scheme proposed in 1993, by making full use of randomness,
Under the conditions of 65536 random interleaver, so that 1/2 Rate Turbo Codes realize the excellent properties apart from shannon limit only 0.7dB.
It is widely used in wireless communication field from this Turbo code.The meaning of Turbo code is the provision of the grade under a kind of low signal-to-noise ratio
Join encoding scheme, and highlights the thought of iterative decoding, the research to fields such as later channel equalizations and signal detection
Also certain facilitation is suffered from.Present Turbo code has been widely used in major communication protocol, the third including 3GPP
Third-generation mobile communication agreement, LTE, CCSDS etc..One of the most common is the PCCC structure of 1/3 code rate.
Parallel cascade structure (PCCC) is mainly handed over by two 1/2 code rate recursive systematic convolutional code (RSC) encoders and one
Knit device composition.Input data is directly entered first encoder, exports information bit all the way and all the way check bit.At the same time, defeated
Enter data according to certain interleave depth, the carry out block of block-by-block is interior to interweave.Data after intertexture enter second encoder, only select
Take the check bit all the way of output.Finally, three data, which enters multiplexer, carries out deletion multiplexing, sequence after being encoded.
Identification work for PCCC structure Turbo code is concentrated mainly on the identification of component coder parameter and interleaver
Parameter identification.During blind recognition, the start bit determination, the determination of interleave depth, component for also relating to codeword sequence are compiled
Code device parameter whether consistent identification the problems such as.The uncertainty of these parameters is so that identifying that work operand is promoted common
Factor.It identifies specific to coder parameters, with convolutional code identification, is mainly tossed about using Matrix Elementary Transformation, Euclid
Be divided by, BM algorithm, Walsh-Hadamard transformation the methods of.And the estimation of random interleaver, intertexture is mainly considered as one group
The mapping one by one of completely random, is compared using the data of multiframe, so that it is determined that the mapping relations of lower each position.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of zero Turbo code starting point and the blind knowledges of depth
Other method so that the identification of interleave parameter and interleave depth can adapt to than in the past bigger intertexture scale, and greatly reduces
Operand improves error-resilient performance.
The present invention program are as follows: interleaver depth and starting point recognition methods based on zero-reset structure are utilized in practical application
The convolutional encoding being widely present is from zero-reset structure.Under such configuration, be either zeroed bit, or using all-zero state as starting
All there is certain architectural characteristic in the coded sequence of state.By the statistics to codeword sequence, the code word for meeting specific structure is found
Position, so that it is determined that the interleave depth of Turbo code and intertexture starting point.
A kind of zero Turbo code starting point and depth blind-identification method, comprising the following steps:
S1, received codeword sequence is set as C, length L, code rate 1/n create full null sequence X, length L, interweave deep
The estimation range of degree N is up to 40~[L/ (30n)], wherein n is the natural number being not zero；
S2, for 3≤i≤L-1, if Ci=Ci+1,Ci-1=Ci-2, then Xi=1,
For i=1,2, if Ci=Ci+1, then Xi=1, wherein CiIndicate i-th of bit；
S3, interleave depth conjecture value are set as N=40；
S4, full null sequence X structural matrix described in S1 is utilized
S5, each column and Y for seeking matrix A described in S41~YN, meet the Y of condition if it existsj, then the jth position of sequence C is first
The starting point of a complete interleaving block, and interleave depth is determined as N, otherwise, N=N+1, wherein j=1,2,3 ..., N, YNIt is matrix
The sum of A Nth column is that mould 2 adds, as a result, 1 or 0；The Y for meeting conditionjIt is characterized in: sets qualified YjRespectivelyFor 1≤p≤t, d is calculatedp=(j(p+1)modt-jp+ N) modN, finds out maximum value dg, then g is that correct interleaving block rises
Point, t are the qualified Y foundjNumber；
S6, step S4 and S5 are repeated, until finding correct interleave depth N or N=[L/ (30n)].
The beneficial effects of the present invention are:
The method of the present invention greatly reduces the operand of Turbo code parameter blind recognition algorithm, evaded total blindness identification when pair
It is forced the step of taking multinest operation in multiple unknown numbers.Identification process is separated, parameter identifies one by one, thus improving
While operation efficiency, but also the identification of big interleave depth has practical operability.
Detailed description of the invention
Fig. 1 is a kind of flow chart for realizing process of the invention under PCCC structure；
Fig. 2 be in the embodiment of the present invention 1 parameter recognition success rate with the variation of bit error rate；
Fig. 3 be in the embodiment of the present invention 1 parameter recognition success rate with the variation of interleave depth；
Fig. 4 is the parameter recognition success rate of several difference component coders in the embodiment of the present invention 2.
Specific embodiment
Below with reference to embodiment and attached drawing, the technical solution that the present invention will be described in detail.
A specific embodiment of the invention is described with reference to the accompanying drawing, preferably so as to those skilled in the art
Understand the present invention.Requiring particular attention is that in the following description, when known function and the detailed description of design perhaps
When can desalinate main contents of the invention, these descriptions will be ignored herein.
Fig. 1 is a kind of specific embodiment flow chart of the present invention when being applied to PCCC structure Turbo code.Such as Fig. 1 institute
Show, the zero Turbo code starting point and depth blind-identification method under the big interleave depth of the present invention the following steps are included:
S1: setting received codeword sequence as C, length L, code rate 1/n.Create full null sequence X, length L.Interweave deep
The estimation range of degree N is up to 40~[L/ (30n)]；
S2: for 3≤i≤L-1, if Ci=Ci+1,Ci-1=Ci-2, then Xi=1；For i=1,2, if Ci=Ci+1, then Xi
=1；
S3: interleave depth conjecture value is set as N=40；
S4: sequence X structural matrix is utilized
S5: each column and Y of A are asked1~YN.Meet the Y of condition if it existsj, then the jth position of sequence C is first complete intertexture
The starting point of block, and interleave depth is determined as N.Multiple Y if it existsj, then whole Y is recordedj.If it does not exist, then N=N+1；It is described
Meet the Y of conditionjIt is characterized in: sets qualified YjRespectivelyFor 1≤p≤t, d is calculatedp=(j(p+1)modt-
jp+ N) modN, finds out maximum value dg, then g is correct interleaving block starting point, and t is the qualified Y foundjNumber；
S6: step S4 and S5 are repeated, until finding correct interleave depth N or N=[L/ (30n)].
Embodiment 1,
The purpose of the present embodiment is to the parameter blind recognition success under the conditions of different interleaving depths and different bit error rates
Rate is emulated.With 1/3 code rate, PCCC structure, for two component coder parameters are all [13,15].In interleave depth 200
Under the conditions of adjust bit error rate, record recognition success rate, obtain Fig. 2.As can be seen that knowing with the raising of bit error rate
Other success rate gradually declines, but this method has fairly good error-resilient performance on the whole.It is adjusted under the conditions of the bit error rate 2.5%
Interleave depth records recognition success rate, obtains Fig. 3.It can be seen that influence very little of the interleave depth to recognition success rate, this is
This method is suitable for the theoretical foundation of big interleave depth.
Embodiment 2,
The purpose of the present embodiment is the recognition performance of this method under the different component coder parameters of research.Equally with 1/3
For the identical PCCC structure of code rate, two component coders, 682 generations between [101,103] to [177,175] have been probed into
Multinomial.Under conditions of interleave depth 200, bit error rate 2.5%, the recognition success rate of each coding polynomial is carried out
Statistic of classification, as a result such as Fig. 4.
As can be seen that the identification probability of most component coders is 85% or more.In fact, due to being opened up in example 1
The rule that the recognition success rate shown changes with bit error rate, in practice on the 0.1% common order of magnitude, the overwhelming majority point
The recognition success rate of amount encoder can achieve the effect that ideal.In order to protrude the recognition performance of different component coders
It can be slightly different, bit error rate is just increased to 2.5% herein.But still having a large amount of success rates is more than 90% encoder,
It can be seen that the scope of application of this method is wide.
Claims (1)
1. a kind of zero Turbo code starting point and depth blind-identification method, which comprises the following steps:
S1, received codeword sequence is set as C, length L, code rate 1/n, initialization sequence X are full null sequence, and length L is handed over
The estimation range for knitting depth N is 40~[L/ (30n)], wherein n is the natural number being not zero；
S2, for 3≤i≤L-1, if Ci=Ci+1,Ci-1=Ci-2, then Xi=1,
For i=1,2, if Ci=Ci+1, then Xi=1, wherein CiIndicate i-th of bit；
S3, interleave depth conjecture value are set as N=40；
S4, full null sequence X structural matrix described in S1 is utilized
S5, each column and Y for seeking matrix A described in S41~YN, meet the Y of condition if it existsj, then the jth position of sequence C be first just
True interleaving block starting point, and interleave depth is determined as N, otherwise, N=N+1, wherein j=1,2,3 ..., N, YNIt is matrix A N
The sum of column is that mould 2 adds, as a result, 1 or 0；The Y for meeting conditionjIt is characterized in: sets qualified YjRespectivelyFor 1≤p≤t, d is calculatedp=(j(p+1)modt-jp+ N) modN, finds out maximum value dg, then g is that correct interleaving block rises
Point, t are the qualified Y foundjNumber；
S6, step S4 and S5 are repeated, until finding correct interleave depth N or N=[L/ (30n)].
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510729076.2A CN105391455B (en) | 2015-10-31 | 2015-10-31 | A kind of zero Turbo code starting point and depth blind-identification method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510729076.2A CN105391455B (en) | 2015-10-31 | 2015-10-31 | A kind of zero Turbo code starting point and depth blind-identification method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105391455A CN105391455A (en) | 2016-03-09 |
| CN105391455B true CN105391455B (en) | 2019-03-12 |
Family
ID=55423334
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510729076.2A Active CN105391455B (en) | 2015-10-31 | 2015-10-31 | A kind of zero Turbo code starting point and depth blind-identification method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105391455B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107370566B (en) * | 2017-07-28 | 2020-07-14 | 西安电子科技大学 | Punctured Turbo code blind identification method under error code condition |
| CN110535478B (en) * | 2019-09-27 | 2023-02-07 | 电子科技大学 | Dual-input Turbo-like code closed set identification method in DVB-RCS2 protocol |
| CN112165337B (en) * | 2020-09-30 | 2024-01-26 | 电子科技大学 | Convolutional code random interleaving sequence interleaving relation estimation method based on linear constraint |
| CN113890546B (en) * | 2021-12-06 | 2022-03-04 | 成都星联芯通科技有限公司 | Interleaver configuration method, interleaver configuration device, electronic equipment and computer-readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102244521A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind identification method for coding parameter of return-to-zero Turbo code |
| KR101192201B1 (en) * | 2011-01-31 | 2012-10-17 | 국방과학연구소 | Blind convolutional deinterleaving method using interleaving period |
-
2015
- 2015-10-31 CN CN201510729076.2A patent/CN105391455B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102244521A (en) * | 2010-05-11 | 2011-11-16 | 中国电子科技集团公司第三十六研究所 | Blind identification method for coding parameter of return-to-zero Turbo code |
| KR101192201B1 (en) * | 2011-01-31 | 2012-10-17 | 국방과학연구소 | Blind convolutional deinterleaving method using interleaving period |
Non-Patent Citations (4)
| Title |
|---|
| Blind detection of interleaver parameters;Guillaume Sicot;《Signal Processing》;20081015;全文 * |
| Nover Blind Encoder Parameter Estimation for Turbo Codes;Yonas G.Debessu et al.;《IEEE COMMUNICATIONS LETTERS》;20121231;全文 * |
| 一种基于矩阵分析的Turbo码长识别算法;李啸天 等;《信号与信息处理》;20121231;全文 * |
| 归零Turbo码识别算法;李啸天 等;《西安电子科技大学学报（自然科学版）》;20130830;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105391455A (en) | 2016-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105391455B (en) | A kind of zero Turbo code starting point and depth blind-identification method | |
| US6728927B2 (en) | Method and system for high-spread high-distance interleaving for turbo-codes | |
| CN110278002A (en) | Polarization code belief propagation list decoding method based on bit reversal | |
| CN101388674B (en) | Decoding method, decoder and Turbo code decoder | |
| US20200083984A1 (en) | Polar code transmission method and apparatus | |
| CN107645358B (en) | Code rate self-adaptive data coordination method used in continuous variable quantum key distribution | |
| CN106059596A (en) | Packet Markov superposition coding method by taking binary BCH code as component code, and decoding method | |
| CN103236900B (en) | A kind of Serial concatenated turbo codes interleaver parameter blind estimating method | |
| CN107231158A (en) | A kind of polarization code iterative receiver, system and polarization code iterative decoding method | |
| Wu et al. | Blind recognition of BCH code based on Galois field Fourier transform | |
| CN103401568A (en) | RS code coding parameter blind identification method based on Galois field Fourier transform | |
| CN1254923C (en) | Decoding method and appts. | |
| CN108933606A (en) | A kind of systematic convolutional code blind-identification method of error-tolerant code | |
| CN110808740B (en) | Low-complexity decoding method based on polarization code under abridged channel | |
| CN108476027B (en) | Window interleaved TURBO (WI-TURBO) code | |
| CN112003672B (en) | Rate matching method, rate de-matching method and device for Polar codes | |
| CN102970048B (en) | A kind of BCH code blind identification method for coding parameters based on BCH code decoding | |
| CN110830052B (en) | Ultra-low code rate internal interleaving convolution coding and decoding method | |
| CN113395139A (en) | Convolutional code length blind identification method based on Gaussian column elimination | |
| CN103368695A (en) | Energy distribution method based on bit error rate distribution | |
| CN103701475B (en) | Decoding method for Turbo codes with word length of eight bits in mobile communication system | |
| CN105049063A (en) | Grid-shaped pulse interval encoding method | |
| CN113659994A (en) | Estimation method of low-complexity convolutional code random interleaving relation | |
| CN116488662B (en) | F-LDPC code check matrix weight compression method based on linear transformation | |
| CN1773867A (en) | Method for decoding Turbo code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |