CN102355271A - Coding/decoding method of random row/column cyclic shift interleaver - Google Patents

Coding/decoding method of random row/column cyclic shift interleaver Download PDF

Info

Publication number
CN102355271A
CN102355271A CN2011103357676A CN201110335767A CN102355271A CN 102355271 A CN102355271 A CN 102355271A CN 2011103357676 A CN2011103357676 A CN 2011103357676A CN 201110335767 A CN201110335767 A CN 201110335767A CN 102355271 A CN102355271 A CN 102355271A
Authority
CN
China
Prior art keywords
matrix
row
cyclic shift
random
displacement
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
Application number
CN2011103357676A
Other languages
Chinese (zh)
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.)
Nanjing Post and Telecommunication University
Original Assignee
Nanjing Post and Telecommunication University
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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN2011103357676A priority Critical patent/CN102355271A/en
Publication of CN102355271A publication Critical patent/CN102355271A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Error Detection And Correction (AREA)

Abstract

The invention discloses a coding method of a random row/column cyclic shift interleaver. The method comprises the following steps: writing a data sequence into an m*n matrix C according to the row order; randomly generating a shift bit number Pi of the ith column in the matrix C, performing cyclic shift operation of Pi bits, and performing cyclic shift of all columns in the matrix C to generate a matrix C1; randomly generating a shift bit number Kj of the jth row in the matrix C1, performing cyclic shift of Kj bits and performing cyclic shift of all rows in the matrix C1 to generate a matrix C2; and outputting the matrix C2 in rows. The invention also discloses a decoding method of a random row/column cyclic shift interleaver. Through adopting the coding/encoding method, the shortcomings of relatively low output code weight and incomplete correlation elimination of a block interleaver are overcome, and the problem of unconspicuous effect of the random interleaver in resetting a low-weight input sequence can be improved.

Description

A kind of decoding method of the cyclic shift of ranks at random interleaver
Technical field
The present invention relates to a kind of cyclic shift of ranks at random Design of Interleaver method, belong to the channel coding schemes technical field of mobile communication technology.
Background technology
1993, scholars such as Berrou C proposed a kind of channel coding schemes of novelty, i.e. Turbo code on international communication conference.This encoding scheme is used interleaver and deinterleaver in coder; Realized the thought of randomness coding effectively; And utilize effective combination of short code to generate long code; Can reach the performance near the shannon theoretical limit, the advantage of Turbo code is that superior decoding performance is arranged under the low signal-to-noise ratio, and very strong anti-fading and antijamming capability is arranged.
Turbo code is used in 3G (Third Generation) Moblie WCDMA and CDMA2000 scheme and is main encoding scheme, also is simultaneously the main channel coding schemes of next-generation mobile communications LTE (Long Term Evolution, Long Term Evolution) technology.
In the Turbo code encoder and decoder structure, interleaver is a chief component, and it is to the improvement of coding efficiency, important influence such as the raising of data rate.At present, the interleaver that adopts in the Turbo code has multiple method for designing and concrete way of realization, all is to design to concrete the application, like block interleaved device, random interleaver, QPP interleaver etc.Wherein, there is the raising that is unfavorable for the Turbo code free distance in the block interleaved device, the halfway defective of decorrelation, and random interleaver is for the problem of the DeGrain of low weight list entries replacement.Up to today, Design of Interleaver also there is not monolithic method.
Summary of the invention
Technical problem to be solved by this invention is for the lower situation of interleaver output code weight; Overcome the halfway defective of raising, decorrelation that the block interleaved device is unfavorable for the Turbo code free distance; Solve simultaneously the shortcoming of random interleaver well for the DeGrain of low weight list entries replacement; A kind of cyclic shift of ranks at random Design of Interleaver method is proposed, simplicity of design not only, and also committed memory is less.
The present invention adopts following technical scheme for solving the problems of the technologies described above:
A kind of coding method of the cyclic shift of ranks at random interleaver comprises the steps:
Step 1 at first writes m * n Matrix C with data sequence by the order of going, and m, n are the integer greater than 0;
Step 2 produces in the Matrix C at random iThe displacement figure place P of row i , wherein i∈ (0, n-1), and 0≤P i ≤n-1 is at first in the Matrix C iRow carry out P i The circulative shift operation of position is carried out generator matrix C1 after the cyclic shift to row all in the Matrix C then, and the cyclic shift formula is:
Figure 2011103357676100002DEST_PATH_IMAGE002
，0≤ i≤n-1,?0≤ j≤m-1
Step 3 produces in the Matrix C 1 at random jThe displacement figure place K of row j , wherein j∈ (0, m-1), and 0≤K j ≤m-1 is at first in the Matrix C 1 jRow carries out K j The cyclic shift of position is carried out generator matrix C2 after the cyclic shift to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 2011103357676100002DEST_PATH_IMAGE004
,?0≤ i≤n-1,?0≤ j≤m-1
Step 4, Matrix C 2 is pressed line output:
Figure 2011103357676100002DEST_PATH_IMAGE006
Wherein,
Figure 2011103357676100002DEST_PATH_IMAGE008
,
Figure 2011103357676100002DEST_PATH_IMAGE010
, sRepresentative input position,
Figure 2011103357676100002DEST_PATH_IMAGE012
Represent carry-out bit.
The present invention also proposes a kind of coding/decoding method of the coding method based on the above-mentioned cyclic shift of ranks at random interleaver, comprises the steps:
Step (1) at first writes m * n Matrix C 2 with data sequence by the order of going, and m, n are the integer greater than 0;
Step (2), produce at random when interweaving jThe displacement figure place K of row j , at first in the Matrix C 2 jRow carries out K j The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C1 to row all in the Matrix C 2 then, and the cyclic shift formula is:
Figure 2011103357676100002DEST_PATH_IMAGE014
；
Step (3), produce at random when interweaving iThe displacement figure place P of row i , at first in the Matrix C 1 iRow carry out P i The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 2011103357676100002DEST_PATH_IMAGE016
；
Step (4), Matrix C is pressed line output:
，
Wherein
Figure 2011103357676100002DEST_PATH_IMAGE020
,
Figure 886933DEST_PATH_IMAGE010
, sRepresentative input position,
Figure 224374DEST_PATH_IMAGE012
Represent carry-out bit.
Modification as the coding method of the cyclic shift of the ranks at random interleaver of the invention described above, can also adopt following steps:
Steps A at first writes m * n Matrix C with data sequence by the order that is listed as;
Step B produces in the Matrix C at random iThe displacement figure place P of row i , wherein i∈ (0, n-1), and 0≤P i ≤n-1 is at first in the Matrix C iRow carries out P i The circulative shift operation of position is carried out generator matrix C1 after the cyclic shift to row all in the Matrix C then, and the cyclic shift formula is:
Figure 701402DEST_PATH_IMAGE002
，0≤ i≤n-1,?0≤ j≤m-1
Step C produces in the Matrix C 1 at random jThe displacement figure place K of row j , wherein j∈ (0, m-1), and 0≤K j ≤m-1 is at first in the Matrix C 1 jRow carry out K j The cyclic shift of position is carried out generator matrix C2 after the cyclic shift to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 98885DEST_PATH_IMAGE004
,?0≤ i≤n-1,?0≤ j≤m-1
Step D, export by row Matrix C 2:
Figure 640856DEST_PATH_IMAGE006
Wherein,
Figure 719671DEST_PATH_IMAGE008
,
Figure 279965DEST_PATH_IMAGE010
, sRepresentative input position,
Figure 864661DEST_PATH_IMAGE012
Represent carry-out bit.
A kind of coding/decoding method of the coding method based on the aforesaid cyclic shift of ranks at random interleaver comprises the steps:
Step (1) at first writes m * n Matrix C 2 with data sequence by the order that is listed as, and m, n are the integer greater than 0;
Step (2), produce at random when interweaving jThe displacement figure place K of row j , at first in the Matrix C 2 jRow carry out K j The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C1 to row all in the Matrix C 2 then, and the cyclic shift formula is:
Figure 877616DEST_PATH_IMAGE014
；
Step (3), produce at random when interweaving iThe displacement figure place P of row i , at first in the Matrix C 1 iRow carries out P i The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C to row all in the Matrix C 1 then, and the cyclic shift formula is:
；
Step (4), Matrix C is exported by row:
Figure 987972DEST_PATH_IMAGE018
，
Wherein
Figure 740640DEST_PATH_IMAGE020
,
Figure 240891DEST_PATH_IMAGE010
, sRepresentative input position,
Figure 536875DEST_PATH_IMAGE012
Represent carry-out bit.
The present invention adopts above technical scheme compared with prior art, has following technique effect:
Simulation result shows; Under the same terms; Ranks cyclic shift interleaver performance of BER obviously is superior to block interleaved device, regular ranks cyclic shift interleaver and random interleaver at random, and is approaching with the performance of the twice replaced polynomial interleaver that adopts in the channel coding schemes of next-generation mobile communications Long Term Evolution.
Simultaneously, the interleaver that the present invention proposes can overcome the block interleaved device for the lower situation of output code weight, the halfway defective of decorrelation; Also can improve the problem of random interleaver to low weight list entries replacement DeGrain, this interleaver designs is simple simultaneously, and committed memory is few; Algorithm is simple; In the realization of hardware, be easier to, be easy to further optimization, can be generalized in the practical application.
Description of drawings
Fig. 1 is the coding flow chart of the cyclic shift of ranks at random interleaver of the present invention.
Fig. 2 is the decoding process figure of the cyclic shift of ranks at random interleaver of the present invention.
Fig. 3 is the another kind of modification of the present invention coding flow chart of ranks cyclic shift interleaver at random.
Fig. 4 is the another kind of modification of the present invention decoding process figure of ranks cyclic shift interleaver at random.
Embodiment
Below in conjunction with accompanying drawing technical scheme of the present invention is done further detailed description:
As shown in Figure 1, the concrete design procedure of ranks cyclic shift interleaver is following at random:
The first step at first writes m * n Matrix C with data sequence by the order of going, and with m=8, n=8 is an example, writes shown in the data like table (a).
Figure 2011103357676100002DEST_PATH_IMAGE022
(a) write data
Second step, produce at random the iThe displacement figure place P of row i , wherein i∈ (0, n-1), the i row are carried out P i The cyclic shift of position, the matrix that all row are carried out generating after the cyclic shift is C1, presses shown in the row cyclic shift number like table (b), wherein 0≤P i ≤n-1, and P i ≠ P j ( i≠ j).Corresponding formula is:
Figure 884810DEST_PATH_IMAGE002
，0≤ i≤n-1,?0≤ j≤m-1 (1)
Figure 2011103357676100002DEST_PATH_IMAGE024
(b) press row cyclic shift number
The 3rd step, produce at random the jThe displacement figure place K of row j , wherein j∈ (0, m-1), to jRow carries out K j The cyclic shift of position, the matrix that all row are carried out generating after the cyclic shift is C2, presses shown in the row cyclic shift number like table (c), wherein 0≤K j ≤m-1, and K i ≠ K j ( i≠ j).Corresponding formula is:
Figure 2011103357676100002DEST_PATH_IMAGE026
,?0≤ i≤n-1,?0≤ j≤m-1 (2)
(c) by row cyclic shift number
The 4th step is by line output.
Suppose to provide at random P i And K j , P wherein i Be C → C1 iThe displacement figure place of row, K j Be C1 → C2 jThe displacement figure place of row, then:
(3)
The corresponding position of i.e. output:
Figure 559112DEST_PATH_IMAGE006
(4)
Wherein
Figure 546660DEST_PATH_IMAGE008
,
Figure 584017DEST_PATH_IMAGE010
.
As the special case of the coding method of a kind of cyclic shift of ranks at random interleaver of the present invention, said cyclic shift is counted P i And K j It is the cyclic shift interleaver of a fixed value.
As shown in Figure 2, the deinterleaving process that more than cyclic shift of the ranks at random interleaver of design is corresponding is:
The first step at first writes m * n Matrix C 2 with data sequence by the order of going.
Second step, produce at random when interweaving the jThe displacement figure place K of row j , wherein j∈ (0, m-1) and 0≤K j ≤m-1 is to jRow carries out K j The reverse circulation displacement of position, the matrix that all row is carried out reverse circulation displacement back generation is C1, corresponding formula does
Figure 2011103357676100002DEST_PATH_IMAGE032
,?0≤ i≤n-1,?0≤ j≤m-1 (5)
The 3rd step, produce at random when interweaving the iThe displacement figure place P of row i , wherein i∈ (0, n-1) and 0≤P i ≤n-1 is to iRow carry out P i The reverse circulation displacement of position, the matrix that all row is carried out reverse circulation displacement back generation is C, corresponding formula does
Figure 2011103357676100002DEST_PATH_IMAGE034
,?0≤ i≤n-1,?0≤ j≤m-1 (6)
The 4th step is by line output.
Provide P when supposing to interweave i And K j , P i Be C → C1 iThe displacement figure place of row, K j Be C1 → C2 jThe displacement figure place of row, then
Figure 2011103357676100002DEST_PATH_IMAGE036
(7)
Promptly corresponding carry-out bit is:
(8)
Wherein
Figure 268683DEST_PATH_IMAGE020
, .
As shown in Figure 3, the modification as the coding method of a kind of cyclic shift of ranks at random interleaver of the present invention, can also adopt following steps:
Steps A at first writes m * n Matrix C with data sequence by the order that is listed as;
Step B produces in the Matrix C at random iThe displacement figure place P of row i , wherein i∈ (0, n-1), and 0≤P i ≤n-1 is at first in the Matrix C iRow carries out P i The circulative shift operation of position is carried out generator matrix C1 after the cyclic shift to row all in the Matrix C then, and the cyclic shift formula is:
，0≤ i≤n-1,?0≤ j≤m-1
Step C produces in the Matrix C 1 at random jThe displacement figure place K of row j , wherein j∈ (0, m-1), and 0≤K j ≤m-1 is at first in the Matrix C 1 jRow carry out K j The cyclic shift of position is carried out generator matrix C2 after the cyclic shift to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 931242DEST_PATH_IMAGE004
,?0≤ i≤n-1,?0≤ j≤m-1
Step D, export by row Matrix C 2:
Figure 925874DEST_PATH_IMAGE006
Wherein,
Figure 177864DEST_PATH_IMAGE008
,
Figure 887806DEST_PATH_IMAGE010
.
As the special case of the coding method of a kind of cyclic shift of ranks at random interleaver of the present invention, said cyclic shift is counted P i And K j It is the cyclic shift interleaver of a fixed value.
As shown in Figure 4, a kind of coding/decoding method of the coding method based on the aforesaid cyclic shift of ranks at random interleaver comprises the steps:
Step (1) at first writes m * n Matrix C 2 with data sequence by the order that is listed as;
Step (2), produce at random when interweaving jThe displacement figure place K of row j , at first in the Matrix C 2 jRow carry out K j The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C1 to row all in the Matrix C 2 then, and the cyclic shift formula is:
Figure 516234DEST_PATH_IMAGE014
；
Step (3), produce at random when interweaving iThe displacement figure place P of row i , at first in the Matrix C 1 iRow carries out P i The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 630952DEST_PATH_IMAGE016
；
Step (4), Matrix C is exported by row:
Figure 53843DEST_PATH_IMAGE018
，
Wherein
Figure 254011DEST_PATH_IMAGE020
,
Figure 686129DEST_PATH_IMAGE010
.
More than can be by from top to bottom order, also can be to carry out cyclic shift described in the coding method certain row being carried out cyclic shift by order from bottom to up; Describedly certain row is carried out cyclic shift can be by from left to right order, also can be to carry out cyclic shift by order from right to left;
More than described in the coding/decoding method certain row carried out the reverse circulation displacement and certain row carried out the reverse circulation displacement then be according to the respective coding method in the direction of the direction of displacement contrary set carry out.
Can find out from top statement; When weaving length is very big; This Design of Interleaver significantly reduces taking of register space than random interleaver; In the implementation procedure of random interleaver, take the register space of 2m * n, and the interleaver of this paper design only need take the register space of m * n+m+n.In physics realization, the available cycles shift register is realized easily.
Simulation result shows that under the same terms, ranks cyclic shift interleaver performance of BER obviously is superior to block interleaved device, regular ranks cyclic shift interleaver and random interleaver at random, and newly-designed interleaver is easier in the realization of hardware.Therefore, through further optimization, can promote the use of in the channel coding schemes of next-generation mobile communications technology.

Claims (4)

1. the coding method of ranks cyclic shift interleaver at random is characterized in that, comprises the steps:
Step 1 at first writes m * n Matrix C with data sequence by the order of going, and m, n are the integer greater than 0;
Step 2 produces in the Matrix C at random iThe displacement figure place P of row i , wherein i∈ (0, n-1), and 0≤P i ≤n-1 is at first in the Matrix C iRow carry out P i The circulative shift operation of position is carried out generator matrix C1 after the cyclic shift to row all in the Matrix C then, and the cyclic shift formula is:
，0≤ i≤n-1,?0≤ j≤m-1
Step 3 produces in the Matrix C 1 at random jThe displacement figure place K of row j , wherein j∈ (0, m-1), and 0≤K j ≤m-1 is at first in the Matrix C 1 jRow carries out K j The cyclic shift of position is carried out generator matrix C2 after the cyclic shift to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 2011103357676100001DEST_PATH_IMAGE004
,?0≤ i≤n-1,?0≤ j≤m-1
Step 4, Matrix C 2 is pressed line output:
Figure 2011103357676100001DEST_PATH_IMAGE006
Wherein,
Figure 2011103357676100001DEST_PATH_IMAGE008
, , sRepresentative input position,
Figure 2011103357676100001DEST_PATH_IMAGE012
Represent carry-out bit.
2. the coding/decoding method based on the coding method of the described ranks at random of claim 1 cyclic shift interleaver is characterized in that, comprises the steps:
Step (1) at first writes m * n Matrix C 2 with data sequence by the order of going;
Step (2), produce at random when interweaving jThe displacement figure place K of row j , at first in the Matrix C 2 jRow carries out K j The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C1 to row all in the Matrix C 2 then, and the cyclic shift formula is:
Figure 2011103357676100001DEST_PATH_IMAGE014
；
Step (3), produce at random when interweaving iThe displacement figure place P of row i , at first in the Matrix C 1 iRow carry out P i The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 2011103357676100001DEST_PATH_IMAGE016
；
Step (4), Matrix C is pressed line output:
Figure 2011103357676100001DEST_PATH_IMAGE018
，
Wherein
Figure 2011103357676100001DEST_PATH_IMAGE020
, , sRepresentative input position, Represent carry-out bit.
3. the coding method of ranks cyclic shift interleaver at random is characterized in that, comprises the steps:
Steps A at first writes m * n Matrix C with data sequence by the order that is listed as, and m, n are the integer greater than 0;
Step B produces in the Matrix C at random iThe displacement figure place P of row i , wherein i∈ (0, n-1), and 0≤P i ≤n-1 is at first in the Matrix C iRow carries out P i The circulative shift operation of position is carried out generator matrix C1 after the cyclic shift to row all in the Matrix C then, and the cyclic shift formula is:
Figure 512853DEST_PATH_IMAGE002
，0≤ i≤n-1,?0≤ j≤m-1
Step C produces in the Matrix C 1 at random jThe displacement figure place K of row j , wherein j∈ (0, m-1), and 0≤K j ≤m-1 is at first in the Matrix C 1 jRow carry out K j The cyclic shift of position is carried out generator matrix C2 after the cyclic shift to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 970379DEST_PATH_IMAGE004
,?0≤ i≤n-1,?0≤ j≤m-1
Step D, export by row Matrix C 2:
Wherein,
Figure 482580DEST_PATH_IMAGE008
,
Figure 583170DEST_PATH_IMAGE010
, sRepresentative input position, Represent carry-out bit.
4. the coding/decoding method based on the coding method of the described ranks at random of claim 3 cyclic shift interleaver is characterized in that, comprises the steps:
Step (1) at first writes m * n Matrix C 2 with data sequence by the order that is listed as;
Step (2), produce at random when interweaving jThe displacement figure place K of row j , at first in the Matrix C 2 jRow carry out K j The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C1 to row all in the Matrix C 2 then, and the cyclic shift formula is:
Figure 326316DEST_PATH_IMAGE014
；
Step (3), produce at random when interweaving iThe displacement figure place P of row i , at first in the Matrix C 1 iRow carries out P i The reverse circulation displacement of position is carried out reverse circulation displacement back generator matrix C to row all in the Matrix C 1 then, and the cyclic shift formula is:
Figure 381996DEST_PATH_IMAGE016
；
Step (4), Matrix C is exported by row:
，
Wherein ,
Figure 85138DEST_PATH_IMAGE010
, sRepresentative input position,
Figure 577299DEST_PATH_IMAGE012
Represent carry-out bit.
CN2011103357676A 2011-10-31 2011-10-31 Coding/decoding method of random row/column cyclic shift interleaver Pending CN102355271A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011103357676A CN102355271A (en) 2011-10-31 2011-10-31 Coding/decoding method of random row/column cyclic shift interleaver

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011103357676A CN102355271A (en) 2011-10-31 2011-10-31 Coding/decoding method of random row/column cyclic shift interleaver

Publications (1)

Publication Number Publication Date
CN102355271A true CN102355271A (en) 2012-02-15

Family

ID=45578775

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011103357676A Pending CN102355271A (en) 2011-10-31 2011-10-31 Coding/decoding method of random row/column cyclic shift interleaver

Country Status (1)

Country Link
CN (1) CN102355271A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130111715A (en) * 2012-04-02 2013-10-11 삼성전자주식회사 Method of generating random permutations, random permutation generating device, and encryption/decryption device having the same
CN105703782A (en) * 2016-03-11 2016-06-22 深圳大学 Incremental shift matrix construction method, network coding method and system
CN106817198A (en) * 2017-01-03 2017-06-09 中国科学院微电子研究所 Interleaving and de-interleaving method suitable for Turbo decoding in LTE system
CN110098891A (en) * 2018-01-30 2019-08-06 华为技术有限公司 Deinterleaving method and interlaced device
CN110519010A (en) * 2019-08-25 2019-11-29 中国电子科技集团公司第二十研究所 A kind of improvement ranks deinterleaving method using torsion and pseudorandom mapping
CN111262592A (en) * 2018-11-30 2020-06-09 展讯半导体(南京)有限公司 Sequence cyclic shift device and method, and storage medium
CN112910473A (en) * 2019-12-04 2021-06-04 中国科学院上海高等研究院 Block interleaving method and system based on cyclic shift
CN115658145A (en) * 2022-12-13 2023-01-31 摩尔线程智能科技(北京)有限责任公司 Data cyclic shift method and circuit, and chip

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090315742A1 (en) * 2008-06-23 2009-12-24 Marco Breiling Interleaver for scrambling and information word
CN101719810A (en) * 2009-11-13 2010-06-02 清华大学 Simulation generation method for parallel interleaver
CN101741505A (en) * 2008-11-27 2010-06-16 华为技术有限公司 Method and device for interweaving internal codes in communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090315742A1 (en) * 2008-06-23 2009-12-24 Marco Breiling Interleaver for scrambling and information word
CN101741505A (en) * 2008-11-27 2010-06-16 华为技术有限公司 Method and device for interweaving internal codes in communication system
CN101719810A (en) * 2009-11-13 2010-06-02 清华大学 Simulation generation method for parallel interleaver

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
汪汉新 等: "一种新型的Turbo码交织器的设计", 《中南民族大学学报（自然科学版）》 *

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103368729A (en) * 2012-04-02 2013-10-23 三星电子株式会社 Method of generating random permutation, and random permutation generating device
CN103368729B (en) * 2012-04-02 2019-05-10 三星电子株式会社 Generate the method and random alignment generation device of random alignment
KR101977823B1 (en) * 2012-04-02 2019-05-13 삼성전자주식회사 Method of generating random permutations, random permutation generating device, and encryption/decryption device having the same
KR20130111715A (en) * 2012-04-02 2013-10-11 삼성전자주식회사 Method of generating random permutations, random permutation generating device, and encryption/decryption device having the same
CN105703782B (en) * 2016-03-11 2019-08-06 深圳大学 A kind of network coding method and system based on incremental shift matrix
CN105703782A (en) * 2016-03-11 2016-06-22 深圳大学 Incremental shift matrix construction method, network coding method and system
CN106817198A (en) * 2017-01-03 2017-06-09 中国科学院微电子研究所 Interleaving and de-interleaving method suitable for Turbo decoding in LTE system
WO2019149180A1 (en) * 2018-01-30 2019-08-08 华为技术有限公司 Interleaving method and interleaving device
CN110098891A (en) * 2018-01-30 2019-08-06 华为技术有限公司 Deinterleaving method and interlaced device
CN110098891B (en) * 2018-01-30 2021-09-07 华为技术有限公司 Interleaving method and interleaving apparatus
CN111262592A (en) * 2018-11-30 2020-06-09 展讯半导体(南京)有限公司 Sequence cyclic shift device and method, and storage medium
CN111262592B (en) * 2018-11-30 2022-10-25 展讯半导体(南京)有限公司 Sequence cyclic shift device and method, and storage medium
CN110519010A (en) * 2019-08-25 2019-11-29 中国电子科技集团公司第二十研究所 A kind of improvement ranks deinterleaving method using torsion and pseudorandom mapping
CN110519010B (en) * 2019-08-25 2022-03-15 中国电子科技集团公司第二十研究所 Improved row-column interleaving method using torsion and pseudo-random mapping
CN112910473A (en) * 2019-12-04 2021-06-04 中国科学院上海高等研究院 Block interleaving method and system based on cyclic shift
CN112910473B (en) * 2019-12-04 2024-01-26 中国科学院上海高等研究院 Block interleaving method and system based on cyclic shift
CN115658145A (en) * 2022-12-13 2023-01-31 摩尔线程智能科技(北京)有限责任公司 Data cyclic shift method and circuit, and chip
CN115658145B (en) * 2022-12-13 2023-03-28 摩尔线程智能科技(北京)有限责任公司 Data cyclic shift method and circuit, and chip

Similar Documents

Publication Publication Date Title
CN102355271A (en) Coding/decoding method of random row/column cyclic shift interleaver
WO2009004601A3 (en) Generation of parity-check matrices
MX2009009143A (en) Method and apparatus for encoding and decoding data.
CN102857324B (en) Low density parity check (LDPC) serial coder in deep space communication and based on lookup table and coding method
RU2015132106A (en) DATA PROCESSING DEVICE AND DATA PROCESSING METHOD
CN103152058B (en) Based on the Low Bit-rate Coding method of LDPC-BCH grid
CN101252409B (en) New algorithm of combined signal source channel decoding based on symbol level superlattice picture
CN102857239A (en) LDPC (Low Density Parity Check) serial encoder and encoding method based on lookup table in CMMB (China Mobile Multimedia Broadcasting)
Yuan et al. A novel super-FEC code based on concatenated code for high-speed long-haul optical communication systems
CN102868495B (en) Lookup table based LDPC (low-density parity-check) serial encoder and encoding method in near-earth communication
Huo et al. Design and Implementation of Shared Memory for Turbo and LDPC Code Interleaver
CN102035558B (en) Turbo decoding method and device
KR20060121312A (en) Convolutional turbo code interleaver
CN100592642C (en) Interweaver and encoder/decoder and interweaving realization method
CN101141132A (en) Quasi-circulation low density parity code encoder and check bit generating method
CN110730003B (en) LDPC (Low Density parity check) coding method and LDPC coder
CN102227097A (en) Generation method of variable length S random interleaver
CN102098061B (en) Parallel Turbo coder
CN101582737B (en) Convolution Turbo code interleaver and convolution de-interleaver
CN102833044B (en) Combined processing device and method of RS (reed-solomon) encoding and byte interlacing in CMMB (China mobile multimedia broadcasting) system
CN105306071A (en) LDPC (Low Density Parity Check) code word aiming at next generation wireless radio, coding method and coder decoder
CN104821830A (en) LDPC structure, codeword, and corresponding encoder, decoder and encoding method
Ma et al. Efficient implementation of quadratic permutation polynomial interleaver in turbo codes
Liu et al. 10Gb/s orthogonally concatenated BCH encoder for fiber communications
CN108683424B (en) Full-parallel bidirectional recursion pipeline LDPC encoder and method

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: 20120215