CN102868478A - Method for designing Turbo code puncturing device for joint channel safety codes - Google Patents
Method for designing Turbo code puncturing device for joint channel safety codes Download PDFInfo
- Publication number
- CN102868478A CN102868478A CN2011101887235A CN201110188723A CN102868478A CN 102868478 A CN102868478 A CN 102868478A CN 2011101887235 A CN2011101887235 A CN 2011101887235A CN 201110188723 A CN201110188723 A CN 201110188723A CN 102868478 A CN102868478 A CN 102868478A
- Authority
- CN
- China
- Prior art keywords
- code
- sequence
- bit
- remaining device
- delete
- 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.)
- Pending
Links
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention relates to a method for designing a puncturing device based on key control in order to solve the problem that a conventional Turbo code puncturing device does not have code rate self-adaption and encryption functions. According to the method, an interleaver is associated with the puncturing device, firstly, the length of the interleaver is set as N, S is a natural number sequence with the length N, a random natural number arrangement S1 with the length N is generated by a Key, namely, S1=f (S, Key), the f refers to a random function, secondly, the overall bit number P needing to be deleted is calculated according to a code rate R, finally, a code bit sequence is punctured, code bits of sequence numbers smaller than or equal to P after mapping f in the S are deleted, and code stream is outputted. When in puncturing release, the sequence numbers smaller than or equal to the P after mapping f in the S are positioned at 0, the rest code bits are determined by input N-P long sequences, and the code stream with the length N can be released from puncturing.
Description
Technical field
The present invention relates to Turbo code, be also referred to as Parallel Concatenated Convolutional Code (Parallel Concatenated Convolutional Cade, PCCC) a kind of encoder design method, relate generally to have encoder bit rate self adaptation and an encrypted bit stream function delete remaining device (Puncturer) method for designing.
Background technology
In order to carry out transmitting at noisy channel, need to overcome the Noise and Interference in the channel.Chnnel coding (Channel Coding) or title forward error correction coding (Forward Error Correction, FEC), in information code element to be sent, add necessary verification code element according to certain criterion, receiving terminal utilizes the coding criterion between verification code element and the information code element, detect and correct mistake, improve the reliability of information code element transmission.The target of research chnnel coding is to utilize minimum verification code element, obtains higher reliability transmission, namely under the prerequisite that guarantees transmission reliability, improves code efficiency as far as possible.Channel coding schemes commonly used mainly comprises: Hamming code, linear block codes, convolution code, BCH code, RS code etc.
Along with the development of channel coding theorem and computer hardware technology, on the international communication conference of holding in 1993, the scholars such as C.Berrou have proposed volume, the decoding scheme of Turbo code.It is by two recursive systematic convolutional codes (Recursive System Convolutional Code, RSCC) be combined into by the mode of interleaver with parallel cascade, therefore be also referred to as Parallel Concatenated Convolutional Code (Parallel Concatenated Convolutional Code, PCCC).Turbo code adopts iterated algorithm decoding, and Simulation results shows, through 18 iterative decodings, at signal to noise ratio E
b/ N
0During 〉=0.7dB, code check is 1/2 bit error rate (Bite Error Rate, the BER) P of Turbo code on additive white Gaussian noise (Additive White Gaussian Noise, AWGN) channel
b≤ 10
-8, reached the performance that nearly Shannon (Shannon) is limit.So far, the research of Turbo has been advanced to a new height with channel coding technology: make thereafter the chnnel coding performance no longer take mutually relatively as target, but directly compare with shannon limit.Turbo encoder block diagram as shown in Figure 1.
Can find out that from encoder block diagram 1 in order to obtain suitable code efficiency, adopting and deleting remaining device is a kind of simply and easily implementation method.At the Yu Qizhong that deletes commonly used, its method for designing is fairly simple so that the variation of obtainable code efficiency very limited, and do not possess encryption function.For example, in classical Turbo code encoder shown in Figure 1, do not adopt and delete remaining device, bit rate output is R
c=1/3, in order to obtain the encoder of higher code check, residual matrix commonly used is
" 1 " in the residual matrix represents that this bit keeps, " 0 " expression deletion.Turbo code encoder among Fig. 1 is through the above-mentioned Yu Qihou that deletes, and code check is by R
c=1/3 becomes R=1/2.Because residual matrix is less, can only obtain limited several code check.
To 2 * 2 residual matrixs of above-mentioned employing, the code check of deleting 1 bit acquisition is 2/5, and the code check of deleting 2 bits acquisitions is 1/2, and the code check of deleting 3 bits acquisitions is 2/3, and the code check of deleting 4 bits acquisitions is 1.Therefore, delete under the remaining device above-mentioned, candidate's code check is 1/3,2/5,1/2,2/3,1, optional code check kind very little, time varying channel that can not the Adaptive change multiterminal does not more possess the encryption function to code stream.
For adapting to time varying channel, obtaining trickleer code check changes, the Turbo code encoder is carried out simple modification, as shown in Figure 2, adopt again the remaining device of deleting that the present invention designs, then can obtain trickleer code check to the Turbo code encoder and change, the more important thing is, by deleting the remaining code stream that can also obtain to encrypt afterwards.
Summary of the invention
To delete the optional code check kind that remaining device obtains in the classical Turbo code encoder few in order to solve, and encoding code stream does not possess the problem of encryption function, and the present invention has designed a kind of based on method more than the stochastic censored of cipher controlled.The method has designed a kind of stochastic censored remaining device isometric with interleaver (Interleaver) the Turbo code encoder, has realized code check self adaptation and the encrypted bit stream function of Turbo code encoder.
The technical scheme that technical solution problem of the present invention adopts is: adopting key K ey is seed, produces one and equates random sequence with interleaver sizes N.Encoder bit rate R as required calculates the bit number P that needs deletion, and output code flow is carried out the grouping that length is N, uses every group of deletion of random sequence P bit, and last every group output length is N-P.Solution is deleted when remaining, and output code flow is carried out the grouping that length is N-P, adopts and deletes N personal attendant's machine sequence identical when remaining, uses every group of random sequence to insert the P bit, exports at last the long sequence of N.
Beneficial effect is, the present invention design delete remaining device, make encoding code stream have the adaptive while of code check, realized the encrypted bit stream function, thereby channel encoder and encryption equipment merging are become a combined channel safe coding device, reduced the channel encoder of separation and the encoder complexity of encryption equipment.On the other hand, be N personal attendant's machine sequence that seed produces by key K ey, this random sequence is used for simultaneously interleaver and deletes remaining device, thus the present invention does not significantly increase encoder complexity.
Description of drawings
The encoder model of Fig. 1 tradition Turbo code
Among the figure: 1. the first component convolutional codes encoder, 2. random sequence interleaver, 3. the second component encoder for convolution codes is 4. deleted remaining device, 5. multiplexer, u is input sequence to be encoded, u
IBe interleaver output sequence, c
1And c
2Be respectively two recursive convolution code coder output sequences, c
pFor deleting remaining device output sequence, c is the multiplexer output sequence.
The amended Turbo code encoder model of Fig. 2
Among the figure: Key is the input key.
Fig. 3 deletes remaining device model, is the specific implementation of the module 4 among Fig. 2
Among the figure: 6 is decision device.
Fig. 4 deletes remaining device working example figure
Among the figure: m
1, m
2, m
3, m
4, m
5, m
6, m
7, m
8, m
9Be list entries, I
3, I
5, I
8, I
6, I
9, I
1, I
4, I
2, I
7Be random sequence, * be delete flag, m
2, m
3, m
4, m
5, m
9For deleting the output sequence after remaining.
Fig. 5 solution is deleted remaining device working example figure
Among the figure: m
1, m
2, m
3, m
4, m
5Be list entries, 0 for inserting the mark of bit symbol 0,0, m
1, m
2, m
3, m
4, 0,0,0, m
5For solution is deleted output sequence after remaining.
Embodiment
Of the present inventionly delete remaining device method for designing, mainly be divided into deleting of encoding code stream remaining conciliate delete more than, realize code check adaptive change and the encrypted bit stream function of code stream.
1. delete remaining device method for designing
Analyze the code stream of Turbo code encoder as can be known: on the one hand, in order to improve encoder bit rate, can be in code stream the deletion coded-bit; On the other hand, if the coded-bit of deleting is at random, in the situation that output code flow is intercepted and captured, the listener-in can not rebuild and delete remaining front coded sequence, thereby has realized the confidentiality of encoding code stream.Of the present inventionly delete the Turbo code coded system that remaining device is used for Fig. 2, delete remaining device and be comprised of random sequence generator and decision device, it is input as coded sequence, is output as through deleting the remaining sequence of deleting after remaining, and detailed construction as shown in Figure 3.The specific embodiments of deleting remaining device of the present invention's design is as follows, sets forth as an example of amended Turbo code encoder (Fig. 2) example.
At first list entries u is encoded.In Fig. 2, establishing interleaver sizes is N, and sequence u is carried out the long grouping of N, and obtain 3 tunnel outputs by following encoding scheme: the first via is output as sequence u to be encoded.The the second tunnel output: list entries u is through the output c of the first component convolutional codes coding module 1
1Third Road output: list entries u exports u through interleaver module 2 after the rearrangement
I, with u
IAs the input of second component convolution code module 3, the output encoder code stream is c
2Multiplexer module 5 is with 3 tunnel input u, c
1And c
2Be complex as a code stream, output encoder code stream c.In design of the present invention, the randomly ordered key K ey by user's input of random interleaver module 2 determines that the component convolutional codes encoder of module 1 and module 3 adopts identical recursive systematic convolutional code encoder.
Secondly, code stream c is carried out the long grouping of N, remaining device module 4 is deleted in input, and it realizes block diagram as shown in Figure 3.If the code check of code stream c is R
c, i.e. information bit in the long grouping of N is NR
cCode check R (R according to user's request
cTotal bit number P that≤R≤1), can need to delete satisfies equation
(R
cN)/(N-P)＝R
Solve and under round
In the formula
Be lower bracket function.Delete remaining device and adopt the random order of being determined by Key: { I
1, I
2..., I
N, then natural order 1,2 ..., set up one-to-one relationship: f:i → I between N} and the random order
i, i=1,2 ..., N.Delete i the coded-bit of all f (i)≤P, N-P the bit that output is remaining.
For example, establish N=9, R
c=1/3, the code stream c of multiplexer module 5 output is: 110101001, the random order that key K ey determines be 3,5,8,6,9, Isosorbide-5-Nitrae, 2,7}.Now need to be by deleting the remaining code stream that obtains code check R=2/5, can be calculated P=4, position number is less than or equal to 4 coded-bits after the mapping of then deletion process, because f (1)=3, f (6)=1, f (7)=4, f (8)=2, then delete the 1st, the 6th, the 7th, the 8th bit among the code stream c, the code stream of output is c
p=m
2m
3m
4m
5m
9, namely 10101.Delete remaining device working example schematic diagram as shown in Figure 4.
2. the code stream solution is deleted remaining method design
After the receiving terminal of communication system is received through the modulation code stream, carry out more than solution deletes through following four steps: at first, code stream is carried out demodulation, obtain the digital code stream signal; Secondly, digital code stream is carried out the long grouping of N-P; Again, use the key identical with coding side, produce N personal attendant's machine sequence; At last, add bit symbol 0 in the delete position, can recover the long sequence of N.Solution is deleted remaining device working example schematic diagram as shown in Figure 5.
For example, establish N=9, R
c=1/3, by deleting the code stream of remaining device acquisition code check R=2/5.Can be calculated P=4, receiving terminal obtains code stream by demodulation and after carrying out the long grouping of N-P: 10101.The random sequence that key K ey determines be 3,5,8,6,9, Isosorbide-5-Nitrae, 2,7}, natural order 1,2 ..., set up one-to-one relationship f between 9} and this random order.Suppose that output sequence is { o
1, o
2..., o
9, because f (1)=3, f (6)=1, f (7)=4, f (8)=2, as can be known in the output sequence, o
1, o
6, o
7And o
8Be delete bit, their coded identification is set to 0, other position is for keeping the position, and its coded identification determined by the long grouping of the N-P of input, thereby must solution delete remaining being output as at last: 010100001.
Claims (3)
1. the adaptive Turbo of the code check based on cipher controlled deletes remaining device method for designing, it is characterized in that data are through the Turbo encoder encodes after, utilize and delete deleting complementary work and improving code efficiency of remaining device, realize code check self adaptation and encryption function.
2. according to claim 1 based on the remaining device method for designing of deleting of cipher controlled, it is characterized in that: it is relevant with interleaver to delete remaining device, adopt key to produce the interleaver that length is the random sequence of N, between natural sequence and random sequence, set up one by one mapping relations, the total bit number P that deletes as required, be the coded blocks of bits of N to length, according to sequence number in the mapping deletion encoding code stream one by one through mapping after less than or equal to the coded-bit of P.
3. according to claim 1 based on the remaining device method for designing of deleting of cipher controlled, it is characterized in that: the code stream that decoding end is received, delete when remaining in solution, produce random sequence by the key identical with coding side, between natural sequence and random sequence, set up one by one mapping relations, during less than or equal to P, add bit symbol 0 after sequence number is through mapping, all the other positions are definite by the long bit block of the N-P that receives code stream.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101887235A CN102868478A (en) | 2011-07-07 | 2011-07-07 | Method for designing Turbo code puncturing device for joint channel safety codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101887235A CN102868478A (en) | 2011-07-07 | 2011-07-07 | Method for designing Turbo code puncturing device for joint channel safety codes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102868478A true CN102868478A (en) | 2013-01-09 |
Family
ID=47447099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101887235A Pending CN102868478A (en) | 2011-07-07 | 2011-07-07 | Method for designing Turbo code puncturing device for joint channel safety codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102868478A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332572A (en) * | 2017-06-08 | 2017-11-07 | 中国电子科技集团公司第五十四研究所 | A kind of Turbo encoder that quickly can configure and coding method |
| CN108234077A (en) * | 2017-12-26 | 2018-06-29 | 中国电子科技集团公司第三十研究所 | A kind of punctured safe Turbo coding methods of dynamic by cipher control |
| CN109032834A (en) * | 2018-06-11 | 2018-12-18 | 南京邮电大学 | A kind of code rate adaptive approach based on Polar code |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1585321A (en) * | 2004-06-07 | 2005-02-23 | 北京交通大学 | Digital information anti-interference soft encrypted method and system based on Turbo code-encode |
| CN1794590A (en) * | 2005-10-27 | 2006-06-28 | 中国科学院研究生院 | Coding-decoding method for integrated source and channel variable-length symbol Turbo |
| EP1724933A1 (en) * | 2005-05-20 | 2006-11-22 | NTT DoCoMo, Inc. | Communication apparatus and method for providing encrypted data |
-
2011
- 2011-07-07 CN CN2011101887235A patent/CN102868478A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1585321A (en) * | 2004-06-07 | 2005-02-23 | 北京交通大学 | Digital information anti-interference soft encrypted method and system based on Turbo code-encode |
| EP1724933A1 (en) * | 2005-05-20 | 2006-11-22 | NTT DoCoMo, Inc. | Communication apparatus and method for providing encrypted data |
| CN1794590A (en) * | 2005-10-27 | 2006-06-28 | 中国科学院研究生院 | Coding-decoding method for integrated source and channel variable-length symbol Turbo |
Non-Patent Citations (1)
| Title |
|---|
| 陈绍宏等: "基于变长Turbo码的低复杂度联合信源信道译码", 《中国科学院研究生院学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332572A (en) * | 2017-06-08 | 2017-11-07 | 中国电子科技集团公司第五十四研究所 | A kind of Turbo encoder that quickly can configure and coding method |
| CN107332572B (en) * | 2017-06-08 | 2020-06-30 | 中国电子科技集团公司第五十四研究所 | Quick configurable Turbo encoder and encoding method |
| CN108234077A (en) * | 2017-12-26 | 2018-06-29 | 中国电子科技集团公司第三十研究所 | A kind of punctured safe Turbo coding methods of dynamic by cipher control |
| CN109032834A (en) * | 2018-06-11 | 2018-12-18 | 南京邮电大学 | A kind of code rate adaptive approach based on Polar code |
| CN109032834B (en) * | 2018-06-11 | 2021-07-09 | 南京邮电大学 | Code rate self-adaption method based on Polar code |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101942530B1 (en) | Method and apparatus for enhancement of crypto system based on error corrction code | |
| KR101313782B1 (en) | Method and apparatus for transmitting and receiving a data block in a wireless communication system | |
| CN103414478A (en) | Computationally efficient convolutional coding with rate-matching | |
| EP2134018A1 (en) | Method for recovery of lost and/ or corrupted data | |
| CN103414540A (en) | Degraded eavesdropping channel rate compatible method based on Polar code | |
| KR101559076B1 (en) | Efficient information reconciliation method using turbo codes over the quantum channel | |
| CN103236900B (en) | A kind of Serial concatenated turbo codes interleaver parameter blind estimating method | |
| CN100571046C (en) | A kind of apparatus and method that in the SCDMA system, realize Turbo coding and decoding scheme | |
| CN101848002B (en) | Iterative decoding device of RS (Reed-solomon) cascading grid modulation code and decoding method thereof | |
| CN102868478A (en) | Method for designing Turbo code puncturing device for joint channel safety codes | |
| Liu et al. | Punctured turbo code ensembles | |
| CN106233683B (en) | Method and apparatus for generating codeword and method and apparatus for recovering codeword | |
| CN102308507B (en) | Wireless communication apparatus | |
| CN111130572A (en) | Turbo code quick realizing method | |
| CN103475462A (en) | Random modulation-based combined channel and secure coding and decoding design method | |
| CN103107816A (en) | Turbo code complexor design method in joint channel secure coding | |
| CN108476027A (en) | TURBO (WI-TURBO) code that window interweaves | |
| TWI589125B (en) | Method and device for de-puncturing turbo-coded digital data, and turbo decoder system | |
| Magli et al. | Joint source, channel coding, and secrecy | |
| Zbaid et al. | Design and Implementation of Convolutional Encoder and Viterbi Decoder Using FPGA. | |
| Zhou et al. | Blind recognition of binary BCH codes for cognitive radios | |
| Ferrari et al. | Performance of concatenated Reed-Solomon and turbo codes with non ideal interleaving | |
| KR20070112326A (en) | High code rate turbo coding method for the high speed data transmission and therefore apparatus | |
| Lin et al. | An improved iterative decoding scheme based on error-resistant arithmetic code | |
| Zivic | Increasing of coding gain of Soft Input Soft Output channel decoding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130109 |