CN114598419A - Interleaver, deinterleaver, and methods of performing the same - Google Patents
Interleaver, deinterleaver, and methods of performing the same Download PDFInfo
- Publication number
- CN114598419A CN114598419A CN202111342269.4A CN202111342269A CN114598419A CN 114598419 A CN114598419 A CN 114598419A CN 202111342269 A CN202111342269 A CN 202111342269A CN 114598419 A CN114598419 A CN 114598419A
- Authority
- CN
- China
- Prior art keywords
- interleaver
- interleaving
- data
- original input
- input data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/0071—Use of interleaving
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/10—Frequency-modulated carrier systems, i.e. using frequency-shift keying
- H04L27/12—Modulator circuits; Transmitter circuits
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The embodiment of the invention provides an interleaver, a deinterleaver and an execution method thereof, belonging to the technical field of communication. The execution method of the interleaver comprises the following steps: receiving original input data according to the interleaving depth; acquiring an interleaving step length; starting from first bit data of the original input data, and taking the interleaving step as an interval, and performing multiple rounds of non-repeated reading on all data in the original input data to obtain interleaved data; and outputting the interleaved data. The interleaver, the deinterleaver and the execution method thereof have wide application range, are easy to realize and have strong randomness.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to an interleaver, a deinterleaver, and a method for executing the interleaver and the deinterleaver.
Background
In a wireless communication system, an interleaver and a deinterleaver are important modules in the communication system, and have a large influence on the system performance. The interleaver generally performs a regular permutation on the input original information sequence and then reads the information sequence from front to back. The conventional interleaver mainly includes: row list (column out) matrix interleaver. Such an approach is simple to implement, but is not widely applicable, for example, it is not well suited for Chirp Spread Spectrum (CSS) modulation systems. A circular diagonal interleaver may also be included. However, the interleaving depth of the interleaving method is related to the coding rate and the spreading factor, and the memory utilization efficiency is low.
Disclosure of Invention
The embodiments of the present invention provide an interleaver, a deinterleaver, and a method for executing the interleaver and the deinterleaver, which have the advantages of wide application range, easy implementation, and strong randomness.
In order to achieve the above object, an embodiment of the present invention provides an execution method of an interleaver, where the method includes: receiving original input data according to the interleaving depth; acquiring an interleaving step length; starting from first bit data of the original input data, and taking the interleaving step as an interval, and performing multiple rounds of non-repeated reading on all data in the original input data to obtain interleaved data; and outputting the interleaved data.
Preferably, the interleaving step size and the greatest common divisor of all spreading factors in the spreading factor range are 1.
Preferably, the receiving original input data according to the interleaving depth comprises: receiving original input data such that a length of the received original input data is less than or equal to the interleaving depth.
Preferably, the interleaving depth is determined by: determining a memory of the interleaver; dividing the memory of the interleaver by the spreading factor needed currently to obtain a first remainder; and subtracting the first remainder from the memory of the interleaver to obtain the interleaving depth.
Preferably, the memory of the interleaver satisfies the following condition: dividing the memory of the interleaver by all the spreading factors in the spreading factor range to obtain second remainders which are all smaller than or equal to a first threshold; dividing the memory of the interleaver by the coding length of the original input data to obtain a third remainder which is less than or equal to the first threshold; the memory of the interleaver is less than or equal to a second threshold.
An embodiment of the present invention further provides an executing method of a deinterleaver, where the deinterleaver corresponds to the interleaver described above, and the method includes: receiving the interleaved data; acquiring a de-interleaving step length; starting from the first bit data of the interleaved data, and taking the de-interleaving step as an interval, performing multiple rounds of non-repeated reading on all data in the interleaved data to obtain the original input data; and outputting the raw input data.
Preferably, the deinterleaving step size is determined by: dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder; when the interleaved data is read in the first n rounds, dividing the depth of the interleaver by the interleaving step length, rounding and adding 1 to serve as the de-interleaving step length, wherein n is equal to the fourth remainder; at the beginning of the (n + 1) th round of reading the interleaved data, the depth of the interleaver is divided by the interleaving step size and rounded as the de-interleaving step size.
An embodiment of the present invention further provides an interleaver, where the interleaver includes: the device comprises a first receiving unit, a first obtaining unit, an interleaving unit and a first output unit, wherein the first receiving unit is used for receiving original input data according to interleaving depth; the first obtaining unit is used for obtaining an interleaving step length; the interleaving unit is used for carrying out multiple rounds of non-repeated reading on all data in the original input data by taking the interleaving step as an interval from first bit data of the original input data to obtain interleaved data; and the first output unit is used for outputting the interleaved data.
Preferably, the interleaving step size and the greatest common divisor of all spreading factors in the spreading factor range are 1.
Preferably, the first receiving unit is configured to: receiving original input data such that a length of the received original input data is less than or equal to the interleaving depth.
Preferably, the interleaving depth is determined by: determining a memory of the interleaver; dividing the memory of the interleaver by the spreading factor needed currently to obtain a first remainder; and subtracting the remainder from the memory of the interleaver to obtain the interleaving depth.
Preferably, the memory of the interleaver satisfies the following condition: dividing the memory of the interleaver by all the spreading factors in the spreading factor range to obtain second remainders which are all smaller than or equal to a first threshold; dividing the memory of the interleaver by the coding length of the original input data to obtain a third remainder which is less than or equal to the first threshold; the memory of the interleaver is less than or equal to a second threshold.
An embodiment of the present invention further provides a deinterleaver, where the deinterleaver corresponds to the interleaver described above, and the deinterleaver includes: the device comprises a second receiving unit, a second obtaining unit, a de-interleaving unit and a second output unit, wherein the second receiving unit is used for receiving the interleaved data; the second obtaining unit is used for obtaining a de-interleaving step length; the de-interleaving unit is used for carrying out multiple rounds of non-repeated reading on all data in the interleaved data by taking the de-interleaving step length as an interval from first bit data of the interleaved data so as to obtain the original input data; and the second output unit is used for outputting the original input data.
Preferably, the deinterleaving step size is determined by: dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder; when the interleaved data is read in the first n rounds, dividing the depth of the interleaver by the interleaving step length, rounding and adding 1 to serve as the de-interleaving step length, wherein n is equal to the fourth remainder; and at the beginning of reading the interleaved data in the (n + 1) th round, dividing the depth of the interleaver by the interleaving step size and rounding the depth to be used as the de-interleaving step size.
By the technical scheme, the interleaver, the de-interleaver and the execution method thereof are suitable for a CSS modulation system, have wide application range, are easy to realize by reading with fixed step length, have strong interleaving randomness and can obtain the performance gain of channel coding with 1-bit error correction capability.
Additional features and advantages of embodiments of the invention will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the embodiments of the invention without limiting the embodiments of the invention. In the drawings:
fig. 1 is a flowchart of an implementation method of an interleaver according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for determining an interleaving depth according to an embodiment of the present invention;
fig. 3 is a flowchart of an implementation method of a deinterleaver according to an embodiment of the present invention.
Fig. 4 is a block diagram of an interleaver according to an embodiment of the present invention;
fig. 5 is a block diagram of a deinterleaver according to an embodiment of the present invention.
Description of the reference numerals
401 first receiving unit 402 first obtaining unit
403 interleaving unit 404 first output unit
501 second receiving unit 502 second obtaining unit
503 deinterleaving unit 504 second output unit
Detailed Description
The following detailed description of embodiments of the invention refers to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating embodiments of the invention, are given by way of illustration and explanation only, not limitation.
Fig. 1 is a flowchart of an implementation method of an interleaver according to an embodiment of the present invention. As shown in fig. 1, the method includes:
step S11, receiving original input data according to the interleaving depth;
specifically, original input data is received such that a length of the received original input data is less than or equal to the interleaving depth. For example, assuming that the interleaving depth of the interleaver is 143, only 143-bit data is received even if the original input data is 144-bit data. If the interleaving depth is 144, the original input data of 144-bit data can be received in its entirety.
The present invention provides a way to determine the interleaving depth as follows, as shown in fig. 2:
step S21, determining a memory of the interleaver;
for example, the memory of the interleaver satisfies the following condition:
first, the memory of the interleaver is divided by all spreading factors in the spreading factor range, and the obtained second remainder needs to be less than or equal to a first threshold, and in order to make the memory of the interleaver approximate to a multiple of all spreading factors, the first threshold may preferably be 4, that is, the following formula is expressed:
mod (C, SF1) is less than or equal to 4, mod is division and then remainder is returned, C is memory of the interleaver, SF1 is all spreading factors in the spreading factor range, wherein the spreading factor range is usually 6-12.
Secondly, dividing the memory of the interleaver by the coding length of the original input data to obtain a third remainder which needs to be smaller than or equal to the first threshold. In general, the data entering the interleaver is encoded. As described above, in order to make the memory of the interleaver approximate to a multiple of the code length of the original input data, the first threshold value may preferably take 4, that is, expressed as the following formula;
mod (C, CL) is less than or equal to 4, mod is division and then returns a remainder, C is the memory of the interleaver, and CL is the code length of the original input data.
Third, the memory requirement of the interleaver is less than or equal to a second threshold. In order to reduce the storage space and the processing delay, the memory of the interleaver is not too large, and the second threshold may preferably be 200, which is expressed by the following formula:
C≤200。
step S22, dividing the memory of the interleaver by the current needed spreading factor to obtain a first remainder;
for example, the first remainder is calculated as follows:
mod (C, SF2), mod being the division and then returning the remainder, C being the interleaver memory, SF2 being the spreading factor currently needed. In different scenarios, the required spreading factor is different, and the currently required spreading factor may be used here.
Step S23, subtracting the first remainder from the memory of the interleaver to obtain the interleaving depth.
For example, after the first remainder is obtained, the memory may be used to subtract the first remainder to obtain the interleaving depth.
Step S12, obtaining the interleaving step length;
specifically, after the original input data is received at the above step S11, the interleaving step size may be acquired. The interleaving step size refers to the distance that needs to be spanned during interleaving. For example, the interleaving step size is 2, i.e., 2 distances of 1-2 and 2-3 are spanned from the 1 st bit data, and then the 3 rd bit data is obtained. In the embodiment of the present invention, a preferred interleaving step size is provided, that is, the interleaving step size and the greatest common divisor of all spreading factors in the spreading factor range are 1. Represented by the formula:
gcd (step _ size, SF1) is 1, where gcd is the greatest common divisor, step _ size is the interleaving step size, and SF1 is all spreading factors within the spreading factor range.
Step S13, starting from the first bit data of the original input data, and performing multiple rounds of non-repeated reading on all data in the original input data with the interleaving step as an interval to obtain interleaved data;
specifically, reading is started from the first bit data of the original input data, then across the interleaving step, the next bit data reading is performed until the round of reading is stopped when the reading across the interleaving step can no longer be performed, and the next round of reading is started from the beginning (in order to avoid repetition, reading should be started from the second bit data of the original input data), and the above operations are repeated until all the data in the original input data are read. The read data are arranged according to the reading sequence, and the data are interlaced data.
Step S14, the interleaved data is output.
Specifically, the interleaved data is output, i.e., the interleaving is completed.
Fig. 3 is a flowchart of an implementation method of a deinterleaver according to an embodiment of the present invention. As shown in fig. 3, the deinterleaver corresponds to the interleaver described above, and the method includes:
step S31, receiving the interleaved data;
in particular, the deinterleaver may receive interleaved data output by the interleaver as described above.
Step S32, obtaining a de-interleaving step length;
specifically, an embodiment of the present invention provides a method for determining a deinterleaving step of a deinterleaver corresponding to the interleaver. The method is specifically determined by the following method: dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder; when the interleaved data is read in the first n rounds, dividing the depth of the interleaver by the interleaving step length, rounding and adding 1 to serve as the de-interleaving step length, wherein n is equal to the fourth remainder; at the beginning of the (n + 1) th round of reading the interleaved data, the depth of the interleaver is divided by the interleaving step size and rounded as the de-interleaving step size.
Step S33, starting from the first bit data of the interleaved data, and taking the de-interleaving step as an interval, performing multiple rounds of non-repeated reading on all data in the interleaved data to obtain the original input data;
specifically, interleaving the original input data as described above is similar, where the interleaved data is deinterleaved, reading is started from the first bit data of the interleaved data, then across the deinterleaving step, the next bit data reading is performed until the round of reading is stopped when reading across the deinterleaving step is no longer possible, and the next round of reading is started from the beginning (reading should be started from the second bit data of the interleaved data to avoid repetition), and the above operations are repeated until all the data in the interleaved data is read. The read data are arranged according to the reading sequence, and the data are original input data.
And step S34, outputting the original input data.
Specifically, the original input data is output, i.e., the deinterleaving is completed.
For ease of understanding, the present invention also provides an example of specific interleaving and deinterleaving as follows:
using 4/7 hamming code (CL: 7), all spreading factors SF 1: 6, 7, 8, 9, 10, 11, 12 in the spreading factor range, the interleaver memory 144 is obtained, when the current spreading, therefore SF 2: 9, the interleaver depth 144, and gcd (13, SF1) 1, therefore the interleaving step size 13. Assume that the original input data is 144-bit data, as follows:
| 1 | 2 | 3 | 。。。 | 143 | 144 |
reading 1 first, according to the interleaving compensation 13, the next read data is 14, and thus the data read in the first round is:
| 1 | 14 | 27 | 。。。 | 131 | 144 |
after reading 144, the next data to be read should be 157, but the interleaver does not have 157, so the second round of reading is from the beginning:
| 2 | 15 | 28 | 。。。 | 119 | 132 |
in the above manner, the third round reads data as follows:
| 3 | 16 | 29 | 。。。 | 120 | 133 |
for simplicity, the data read in the fourth to twelfth rounds are not described in detail herein.
The data read in the thirteenth round are:
| 13 | 26 | 39 | 。。。 | 130 | 143 |
therefore, all data in the original input data are read, and the interleaved data is the data obtained by arranging the read data according to the reading sequence to obtain 144-bit data:
| 1 | 14 | 。。。 | 。。。 | 130 | 143 |
the interleaved data may then be deinterleaved.
First, the depth 144 of the interleaver is divided by the step size 13 of the interleaver to yield 11 a remainder 1. Thus, at round 1, a deinterleaving step of 11+1 is used, and starting at round 2, a deinterleaving step of 11 is used.
Thus, the first round of deinterleaving reads:
| 1 | 2 | 3 | 。。。 | 12 | 13 |
and reading by the second round of deinterleaving to obtain:
| 14 | 15 | 16 | 。。。 | 25 | 26 |
the third round of deinterleaving reads:
| 27 | 28 | 29 | 。。。 | 38 | 39 |
for simplicity, the data read from the fourth round to the tenth round will not be described in detail herein.
Reading by the eleventh deinterleaving:
| 131 | 132 | 133 | 。。。 | 142 | 143 |
reading by the twelfth round of deinterleaving:
| 144 |
therefore, all the data in the interleaved data are read, and therefore, the original input data is the data obtained by arranging the read data according to the reading sequence to obtain 144-bit data:
| 1 | 2 | 3 | 。。。 | 143 | 144 |
the interleaver, the deinterleaver and the implementation method thereof have the following advantages:
1. the depth of the interleaver is properly selected, and the utilization rate of the storage space is high.
2. And the reading is carried out by adopting a fixed interleaving step length, so that the method is easy to realize.
3. The interleaving has good randomness, and the performance gain of channel coding (such as Hamming code with code rate 4/7) with 1-bit error correction capability can be obtained.
Fig. 4 is a block diagram of an interleaver according to an embodiment of the present invention. As shown in fig. 4, the interleaver includes: a first receiving unit 401, a first obtaining unit 402, an interleaving unit 403, and a first output unit 404, where the first receiving unit 401 is configured to receive original input data according to an interleaving depth; the first obtaining unit 402 is configured to obtain an interleaving step; the interleaving unit 403 is configured to perform multiple rounds of non-repeated reading on all data in the original input data, starting from the first bit data of the original input data, with the interleaving step as an interval, to obtain interleaved data; and the first output unit 404 is configured to output the interleaved data.
Preferably, the interleaving step size and the greatest common divisor of all spreading factors in the spreading factor range are 1.
Preferably, the first receiving unit 401 is configured to: receiving original input data such that a length of the received original input data is less than or equal to the interleaving depth.
Preferably, the interleaving depth is determined by: determining a memory of the interleaver; dividing the memory of the interleaver by the spreading factor needed currently to obtain a first remainder; and subtracting the remainder from the memory of the interleaver to obtain the interleaving depth.
Preferably, the memory of the interleaver satisfies the following condition: dividing the memory of the interleaver by all the spreading factors in the spreading factor range to obtain second remainders which are all smaller than or equal to a first threshold; dividing the memory of the interleaver by the coding length of the original input data to obtain a third remainder which is less than or equal to the first threshold; the memory of the interleaver is less than or equal to a second threshold.
Fig. 5 is a block diagram of a deinterleaver according to an embodiment of the present invention. As shown in fig. 5, the deinterleaver corresponds to the interleaver described above, and includes: a second receiving unit 501, a second obtaining unit 502, a deinterleaving unit 503 and a second output unit 504, where the second receiving unit 501 is configured to receive interleaved data; the second obtaining unit 502 is configured to obtain a deinterleaving step size; the deinterleaving unit 503 is configured to perform multiple rounds of non-repeated reading on all data in the interleaved data, starting from the first bit data of the interleaved data, with the deinterleaving step as an interval, to obtain the original input data; and the second output unit 504 is configured to output the raw input data.
Preferably, the deinterleaving step size is determined by: dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder; when reading the interleaved data in the first n rounds, dividing the depth of the interleaver by the interleaving step length, rounding and adding 1 to serve as the de-interleaving step length, wherein n is equal to the fourth remainder; at the beginning of the (n + 1) th round of reading the interleaved data, the depth of the interleaver is divided by the interleaving step size and rounded as the de-interleaving step size.
The embodiments of the interleaver and the deinterleaver are similar to the embodiments of the interleaver and the deinterleaver, and are not described herein again.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (14)
1. A method for performing an interleaver, the method comprising:
receiving original input data according to the interleaving depth;
acquiring an interleaving step length;
starting from first bit data of the original input data, and taking the interleaving step as an interval, and performing multiple rounds of non-repeated reading on all data in the original input data to obtain interleaved data; and
outputting the interleaved data.
2. The method of claim 1, wherein the interleaving step size is 1, which is the greatest common divisor of all spreading factors in the spreading factor range.
3. The method of claim 1, wherein receiving the original input data according to the interleaving depth comprises:
receiving original input data such that a length of the received original input data is less than or equal to the interleaving depth.
4. The method of claim 1, wherein the interleaving depth is determined by:
determining a memory of the interleaver;
dividing the memory of the interleaver by the spreading factor needed currently to obtain a first remainder;
and subtracting the first remainder from the memory of the interleaver to obtain the interleaving depth.
5. The method of claim 4, wherein the memory of the interleaver satisfies the following condition:
dividing the memory of the interleaver by all the spreading factors in the spreading factor range to obtain second remainders which are all smaller than or equal to a first threshold;
dividing the memory of the interleaver by the coding length of the original input data to obtain third remainders which are all smaller than or equal to the first threshold;
the memory of the interleaver is less than or equal to a second threshold.
6. A method of performing a deinterleaver, the deinterleaver corresponding to the interleaver of any one of claims 1 to 5, the method comprising:
receiving the interleaved data;
acquiring a de-interleaving step length;
starting from the first bit data of the interleaved data, and taking the de-interleaving step as an interval, performing multiple rounds of non-repeated reading on all data in the interleaved data to obtain the original input data; and
and outputting the original input data.
7. The deinterleaver execution method according to claim 6, wherein the deinterleaving step is determined by:
dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder;
dividing the depth of the interleaver by the interleaving step size, rounding and adding 1 to serve as the de-interleaving step size of the data interleaved in the first n rounds of reading, wherein n is equal to the fourth remainder;
at the beginning of the (n + 1) th round of reading the interleaved data, the depth of the interleaver is divided by the interleaving step size and rounded as the de-interleaving step size.
8. An interleaver, comprising:
a first receiving unit, a first obtaining unit, an interleaving unit and a first output unit,
the first receiving unit is used for receiving original input data according to the interleaving depth;
the first obtaining unit is used for obtaining an interleaving step length;
the interleaving unit is used for carrying out multiple rounds of non-repeated reading on all data in the original input data by taking the interleaving step as an interval from first bit data of the original input data to obtain interleaved data; and
the first output unit is used for outputting the interleaved data.
9. The interleaver of claim 8 wherein the interleaving step size is 1, the greatest common divisor of all spreading factors in the range of spreading factors.
10. The interleaver of claim 8, wherein the first receiving unit is configured to:
receiving original input data such that a length of the received original input data is less than or equal to the interleaving depth.
11. The interleaver of claim 8 wherein the interleaving depth is determined by:
determining a memory of the interleaver;
dividing the memory of the interleaver by the spreading factor needed currently to obtain a first remainder;
and subtracting the remainder from the memory of the interleaver to obtain the interleaving depth.
12. The interleaver according to claim 11, wherein the memory of the interleaver satisfies the following condition:
dividing the memory of the interleaver by all the spreading factors in the spreading factor range to obtain second remainders which are all smaller than or equal to a first threshold;
dividing the memory of the interleaver by the coding length of the original input data to obtain third remainders which are all smaller than or equal to the first threshold;
the memory of the interleaver is less than or equal to a second threshold.
13. A deinterleaver, characterized in that the deinterleaver corresponds to the interleaver of any one of claims 1 to 5, and comprises:
a second receiving unit, a second obtaining unit, a de-interleaving unit and a second output unit, wherein,
the second receiving unit is used for receiving the interleaved data;
the second obtaining unit is used for obtaining a de-interleaving step length;
the de-interleaving unit is used for carrying out multiple rounds of non-repeated reading on all data in the interleaved data by taking the de-interleaving step length as an interval from first bit data of the interleaved data so as to obtain the original input data; and
the second output unit is used for outputting the original input data.
14. The deinterleaver as claimed in claim 13, wherein the deinterleaving step is determined by:
dividing the depth of the interleaver by the interleaving step size to obtain a fourth remainder;
dividing the depth of the interleaver by the interleaving step size, rounding and adding 1 to serve as the de-interleaving step size of the data interleaved in the first n rounds of reading, wherein n is equal to the fourth remainder;
at the beginning of the (n + 1) th round of reading the interleaved data, the depth of the interleaver is divided by the interleaving step size and rounded as the de-interleaving step size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111342269.4A CN114598419B (en) | 2021-11-12 | 2021-11-12 | Interleaver, deinterleaver, and methods of performing the same |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111342269.4A CN114598419B (en) | 2021-11-12 | 2021-11-12 | Interleaver, deinterleaver, and methods of performing the same |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114598419A true CN114598419A (en) | 2022-06-07 |
| CN114598419B CN114598419B (en) | 2023-08-01 |
Family
ID=81813821
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111342269.4A Active CN114598419B (en) | 2021-11-12 | 2021-11-12 | Interleaver, deinterleaver, and methods of performing the same |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114598419B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115514379A (en) * | 2022-09-16 | 2022-12-23 | 深圳华海尖兵科技有限公司 | Method and device for improving robustness of short-wave data transmission |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06350575A (en) * | 1993-06-11 | 1994-12-22 | Fujitsu Ltd | Data communication protocol for mobile communication |
| KR20020036373A (en) * | 2000-11-09 | 2002-05-16 | 구자홍 | Data Rate Matching Method in 3GPP2 |
| US20040152468A1 (en) * | 2003-01-30 | 2004-08-05 | Nokia Corporation | Flexible layer overlay for seamless handovers between full rate and half rate channels |
| US20050102599A1 (en) * | 2003-11-11 | 2005-05-12 | Ping-Chung Yang | Address generator for block interleaving |
| CN1773896A (en) * | 2004-11-10 | 2006-05-17 | 北京三星通信技术研究有限公司 | Information channel interleaving device and method adapted to adaptive modulating system |
| US20060236045A1 (en) * | 2005-04-13 | 2006-10-19 | Analog Devices, Inc. | Apparatus for deinterleaving interleaved data using direct memory access |
| CN101291313A (en) * | 2007-04-19 | 2008-10-22 | 华为技术有限公司 | Wireless signal transmitting method, system and mobile station |
| US20160232089A1 (en) * | 2015-02-06 | 2016-08-11 | Mstar Semiconductor, Inc. | Convolutional de-interleaver and convolutional de-interleaving method |
| WO2017010655A1 (en) * | 2015-07-16 | 2017-01-19 | 엘지전자 주식회사 | Broadcast signal transmitting device, broadcast signal receiving device, broadcast signal transmitting method, and broadcast signal receiving method |
| CN106411467A (en) * | 2016-09-19 | 2017-02-15 | 深圳市锐能微科技股份有限公司 | Method and device for transmitting and receiving information based on chirp signal |
| CN107017975A (en) * | 2016-12-09 | 2017-08-04 | 中国电力科学研究院 | A kind of time-frequency diversity copy method based on OFDM |
| US20190349011A1 (en) * | 2015-06-19 | 2019-11-14 | Orange | Design of the interleaver for turbo codes as a function of the puncturing pattern |
| CN112152641A (en) * | 2020-09-28 | 2020-12-29 | Oppo广东移动通信有限公司 | Data interleaving method and device and data sending equipment |
| CN112398487A (en) * | 2020-12-14 | 2021-02-23 | 中科院计算技术研究所南京移动通信与计算创新研究院 | Implementation method and system for reducing complexity of Turbo parallel decoding |
-
2021
- 2021-11-12 CN CN202111342269.4A patent/CN114598419B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06350575A (en) * | 1993-06-11 | 1994-12-22 | Fujitsu Ltd | Data communication protocol for mobile communication |
| KR20020036373A (en) * | 2000-11-09 | 2002-05-16 | 구자홍 | Data Rate Matching Method in 3GPP2 |
| US20040152468A1 (en) * | 2003-01-30 | 2004-08-05 | Nokia Corporation | Flexible layer overlay for seamless handovers between full rate and half rate channels |
| US20050102599A1 (en) * | 2003-11-11 | 2005-05-12 | Ping-Chung Yang | Address generator for block interleaving |
| CN1773896A (en) * | 2004-11-10 | 2006-05-17 | 北京三星通信技术研究有限公司 | Information channel interleaving device and method adapted to adaptive modulating system |
| US20060236045A1 (en) * | 2005-04-13 | 2006-10-19 | Analog Devices, Inc. | Apparatus for deinterleaving interleaved data using direct memory access |
| CN101291313A (en) * | 2007-04-19 | 2008-10-22 | 华为技术有限公司 | Wireless signal transmitting method, system and mobile station |
| US20160232089A1 (en) * | 2015-02-06 | 2016-08-11 | Mstar Semiconductor, Inc. | Convolutional de-interleaver and convolutional de-interleaving method |
| US20190349011A1 (en) * | 2015-06-19 | 2019-11-14 | Orange | Design of the interleaver for turbo codes as a function of the puncturing pattern |
| WO2017010655A1 (en) * | 2015-07-16 | 2017-01-19 | 엘지전자 주식회사 | Broadcast signal transmitting device, broadcast signal receiving device, broadcast signal transmitting method, and broadcast signal receiving method |
| CN106411467A (en) * | 2016-09-19 | 2017-02-15 | 深圳市锐能微科技股份有限公司 | Method and device for transmitting and receiving information based on chirp signal |
| CN107017975A (en) * | 2016-12-09 | 2017-08-04 | 中国电力科学研究院 | A kind of time-frequency diversity copy method based on OFDM |
| CN112152641A (en) * | 2020-09-28 | 2020-12-29 | Oppo广东移动通信有限公司 | Data interleaving method and device and data sending equipment |
| CN112398487A (en) * | 2020-12-14 | 2021-02-23 | 中科院计算技术研究所南京移动通信与计算创新研究院 | Implementation method and system for reducing complexity of Turbo parallel decoding |
Non-Patent Citations (1)
| Title |
|---|
| 黄丽;谌稳固;黄雨佳;陈虹;: "信道编码中交织器的盲识别", 强激光与粒子束, no. 10 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115514379A (en) * | 2022-09-16 | 2022-12-23 | 深圳华海尖兵科技有限公司 | Method and device for improving robustness of short-wave data transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114598419B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107370489B (en) | Data processing method and device for structured L DPC code | |
| KR20080067987A (en) | Formulaic flexible collision-free memory accessing for parallel turbo decoding with quadratic polynomial permutation(qpp) interleave | |
| KR20110123637A (en) | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes | |
| CN111147183A (en) | Interleaving mapping method and de-interleaving de-mapping method of LDPC code words | |
| KR20160105311A (en) | Apparatus of parity interleaving for encoding variable-length signaling information and method using the same | |
| CN114598419B (en) | Interleaver, deinterleaver, and methods of performing the same | |
| CN101707490A (en) | Parallel Turbo code interleaving method | |
| KR20080041488A (en) | Parallel interleaving method | |
| CN109474373B (en) | Interleaving method and interleaving apparatus | |
| EP2012434A1 (en) | De-interleaving and interleaving based on the same address index generation process | |
| US7969332B2 (en) | Method and apparatus for encoding based on a linear block code | |
| KR101022730B1 (en) | Turbo decoder with circular redundancy code signature comparison | |
| US8082479B2 (en) | Methods and apparatus for generating permutations | |
| US9374109B2 (en) | QPP interleaver/DE-interleaver for turbo codes | |
| CN108574491B (en) | Data processing method, data processing device and communication equipment | |
| JP2009246474A (en) | Turbo decoder | |
| CN104796160A (en) | Decoding method and device | |
| CN101336517A (en) | Apparatus and method for controlling an interleaver/deinterleaver memory in a mobile communication system | |
| CN101667839B (en) | Interleaving method | |
| CN110784283B (en) | Method, device and decoding system for determining forward error correction frame boundary | |
| CN104901774B (en) | interleaving mapping method and de-interleaving de-mapping method of LDPC code words | |
| US9128888B2 (en) | Method and apparatus for turbo decoder memory collision resolution | |
| EP2728755B1 (en) | Efficient implementation of a Quadratic Polynomial Permutation (QPP) interleaver for parallel processing using interleaver parameters in quotient-remainder form | |
| CN110784287B (en) | Interleaving mapping method and de-interleaving de-mapping method of LDPC code words | |
| CN111384976A (en) | Storage method and reading method of sparse check matrix |
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 |