CA2310997A1 - A method of encoding a cell by a product code, for a satellite application - Google Patents
A method of encoding a cell by a product code, for a satellite application Download PDFInfo
- Publication number
- CA2310997A1 CA2310997A1 CA 2310997 CA2310997A CA2310997A1 CA 2310997 A1 CA2310997 A1 CA 2310997A1 CA 2310997 CA2310997 CA 2310997 CA 2310997 A CA2310997 A CA 2310997A CA 2310997 A1 CA2310997 A1 CA 2310997A1
- Authority
- CA
- Canada
- Prior art keywords
- code
- cell
- codes
- encoding
- bits
- 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.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Radio Relay Systems (AREA)
- Detection And Correction Of Errors (AREA)
Abstract
The invention relates to a method of encoding a short cell by means of a product code enabling a good compromise to be obtained between the transmitter power and the bandwidth required in the context of satellite transmission. According to the invention, the row code and the column code making up the product code are both binary linear block codes selected in such a manner that one of them has the capacity to correct one error and the other has the capacity to correct two errors.
Description
A METHOD OF ENCODING A CELL BY A PRODUCT CODE, FOR A
SATELLITE APPLICATION
The field of the invention is that of encoding data.
More precisely, the present invention relates to a method enabling data blocks to be encoded by means of a product code using special families of row codes and column codes. The invention applies in particular to encoding ATM cells.
Product code encoding is a known form of encoding that serves to encode data that is to be transmitted, e.g. by radio. Figures 1 and 2 show the principle of product encoding.
We consider here a block of 90 data bits to be encoded, these bits being referenced dl to d90. The bits are organized in an array as shown in Figure 1, the array comprising a number k1 of rows and a number k2 of columns, where kl = 9 and k2 - 10. Product code encoding consists in applying a first block code (known as a row code) to each of the k1 rows so as to obtain additional bits referenced dli (Figure 2) corresponding to encoding each of the kl rows. By way of example, bits dll, d12, and d13 correspond to encoding the bits dl to d10. In this case, n2 - 13 represents the total number of columns after the code has been applied and n2 - k2 - 3 represents the number of additional columns due to applying the code. Depending on the block code used, this generates kl*(n2-k2) additional bits. These bits are placed following the bits from which they are derived, thus providing an array having kl rows and n2 columns.
After this first encoding operation, a second kind of block encoding (referred to as a column encoding) is applied to the n2 columns so as to generate (nl-kl)*n2 additional bits. Thus, in Figure.2, 20 additional bits dci are generated by encoding the k2 columns, and 6 more additional bits dlci are generated by encoding the (n2-k2) columns. In this case the value of nl is equal to 11 and nl-kl = 2. By way of example, encoding the data in the first column of the array in Figure 1 gives rise to extra bits dcl and dc2.
A product code is defined on the basis of the parameters (nl, kl) and (n2, k2) of the row and column codes. The efficiency r of a product code is equal to the product of the efficiencies of the row code and of the column code making it up. I.e. in this case:
kl * k2 r =
nl * n2 Another characteristic of a block code is its capacity for correction t. This depends directly on the minimum Hamming distance dmin relating to the block code in question.
Specifically:
t = Cdmin 1J
where [x] designates the integer portion of x.
In the state of the art, product codes are used in particular for encoding ATM cells. For short cells of this type, it is necessary to use appropriate encoding;
convolutional codes or Reed Solomon codes turn out to be poorly adapted to encoding ATM cells and provide mediocre performance.
French patent application FR 2 769 776 describes a method of encoding a block of data comprising a first zone and a second zone. The method consists in applying a product code to the data block defined as follows:
- a first block code is applied to the first zone of the data block;
- a second block code is applied to the second zone of the data block; and - a third block code is applied to the data obtained by the first two encoding operations in a direction perpendicular to the first two codes.
With product codes, it is common practice to apply a row code having correction capacity t=1 and to apply a column code having the same correction capacity t=1.
This practice has the drawback of obtaining efficiency for the product code that is always greater than 0.5, regardless of the code chosen. Unfortunately, with satellite transmission, in order to obtain a good compromise between the power that needs to be transmitted and the bandwidth that is occupied, it is desirable for code efficiency to come as close as possible to 0.5.
A particular object of the present invention is to devise families of row codes and column codes which make it possible to obtain an encoding rate that is adapted to satellite transmission.
More precisely, one of the objects of the invention is to determine a family of error correcting product codes, and thus of the row codes and the column codes making it up, such that when applied to a short cell they imply a product code efficiency close to 0.5. To select a code compatible with the objects of the invention, it is necessary to satisfy the following conditions:
kl *k2 >_ Dell ( 1 ) kl*k2 r= X0.5 (2) nl * n2 where Dell is the number of bits in the cell.
Condition (1) expresses the fact that the product code is applied to blocks of at least cell size, with additional bits, in particular bits referred to in this description below as "padding" bits, and that do not belong to the cell, optionally being added thereto in order to pad it out to the quantity of information required for applying the code. Preferably, it is desirable to use codes for which the product of the parameters k1 and k2 comes close to the value Icell~
Condition (2) determines that the product of the efficiencies of the row code multiplied by the efficiency of the column code must be close to 0.5 so as to provide encoding that is suitable for satellite transmission.
Preferably, any padding bits added to make up the quantity of information necessary for applying the code are not transmitted. This method amounts to shortening the product code. The decoder knows the non-transmitted sequence that needs to be added in order to decode the sequence of received bits correctly. Under such circumstances, condition (2) is given by:
Icell ( 2 ) r= X0.5 nl * n2 - ( kl *k2 - Icell) Furthermare, in order to adapt the efficiency of the code finely, it is possible to avoid transmitting certain redundancy bits, the number omitted being npunct~ using a "code puncturing" method applied to the product code.
Under such circumstances, condition (2) is given by:
r = Icel1 ,:; 0 . 5 ( 2 ) n l * n2 - ( kl * k2 - Iceii) - np~ct These objects, and others that appear below, are achieved by a method of encoding a cell made up of bits by means of a product code, given that the cell is presented for coding purposes in the form of an array and that the encoding consists specifically in:
a) applying a first binary linear block code to one dimension of the array (rows or columns) containing the cell; and b) applying a second binary linear block code to the other dimensions of the array (column or row) containing the cell.
The linear block codes used satisfy the following criterion: one of them has the capacity to correct one error (t=1) and the other has the capacity to correct two errors (t=2) .
SATELLITE APPLICATION
The field of the invention is that of encoding data.
More precisely, the present invention relates to a method enabling data blocks to be encoded by means of a product code using special families of row codes and column codes. The invention applies in particular to encoding ATM cells.
Product code encoding is a known form of encoding that serves to encode data that is to be transmitted, e.g. by radio. Figures 1 and 2 show the principle of product encoding.
We consider here a block of 90 data bits to be encoded, these bits being referenced dl to d90. The bits are organized in an array as shown in Figure 1, the array comprising a number k1 of rows and a number k2 of columns, where kl = 9 and k2 - 10. Product code encoding consists in applying a first block code (known as a row code) to each of the k1 rows so as to obtain additional bits referenced dli (Figure 2) corresponding to encoding each of the kl rows. By way of example, bits dll, d12, and d13 correspond to encoding the bits dl to d10. In this case, n2 - 13 represents the total number of columns after the code has been applied and n2 - k2 - 3 represents the number of additional columns due to applying the code. Depending on the block code used, this generates kl*(n2-k2) additional bits. These bits are placed following the bits from which they are derived, thus providing an array having kl rows and n2 columns.
After this first encoding operation, a second kind of block encoding (referred to as a column encoding) is applied to the n2 columns so as to generate (nl-kl)*n2 additional bits. Thus, in Figure.2, 20 additional bits dci are generated by encoding the k2 columns, and 6 more additional bits dlci are generated by encoding the (n2-k2) columns. In this case the value of nl is equal to 11 and nl-kl = 2. By way of example, encoding the data in the first column of the array in Figure 1 gives rise to extra bits dcl and dc2.
A product code is defined on the basis of the parameters (nl, kl) and (n2, k2) of the row and column codes. The efficiency r of a product code is equal to the product of the efficiencies of the row code and of the column code making it up. I.e. in this case:
kl * k2 r =
nl * n2 Another characteristic of a block code is its capacity for correction t. This depends directly on the minimum Hamming distance dmin relating to the block code in question.
Specifically:
t = Cdmin 1J
where [x] designates the integer portion of x.
In the state of the art, product codes are used in particular for encoding ATM cells. For short cells of this type, it is necessary to use appropriate encoding;
convolutional codes or Reed Solomon codes turn out to be poorly adapted to encoding ATM cells and provide mediocre performance.
French patent application FR 2 769 776 describes a method of encoding a block of data comprising a first zone and a second zone. The method consists in applying a product code to the data block defined as follows:
- a first block code is applied to the first zone of the data block;
- a second block code is applied to the second zone of the data block; and - a third block code is applied to the data obtained by the first two encoding operations in a direction perpendicular to the first two codes.
With product codes, it is common practice to apply a row code having correction capacity t=1 and to apply a column code having the same correction capacity t=1.
This practice has the drawback of obtaining efficiency for the product code that is always greater than 0.5, regardless of the code chosen. Unfortunately, with satellite transmission, in order to obtain a good compromise between the power that needs to be transmitted and the bandwidth that is occupied, it is desirable for code efficiency to come as close as possible to 0.5.
A particular object of the present invention is to devise families of row codes and column codes which make it possible to obtain an encoding rate that is adapted to satellite transmission.
More precisely, one of the objects of the invention is to determine a family of error correcting product codes, and thus of the row codes and the column codes making it up, such that when applied to a short cell they imply a product code efficiency close to 0.5. To select a code compatible with the objects of the invention, it is necessary to satisfy the following conditions:
kl *k2 >_ Dell ( 1 ) kl*k2 r= X0.5 (2) nl * n2 where Dell is the number of bits in the cell.
Condition (1) expresses the fact that the product code is applied to blocks of at least cell size, with additional bits, in particular bits referred to in this description below as "padding" bits, and that do not belong to the cell, optionally being added thereto in order to pad it out to the quantity of information required for applying the code. Preferably, it is desirable to use codes for which the product of the parameters k1 and k2 comes close to the value Icell~
Condition (2) determines that the product of the efficiencies of the row code multiplied by the efficiency of the column code must be close to 0.5 so as to provide encoding that is suitable for satellite transmission.
Preferably, any padding bits added to make up the quantity of information necessary for applying the code are not transmitted. This method amounts to shortening the product code. The decoder knows the non-transmitted sequence that needs to be added in order to decode the sequence of received bits correctly. Under such circumstances, condition (2) is given by:
Icell ( 2 ) r= X0.5 nl * n2 - ( kl *k2 - Icell) Furthermare, in order to adapt the efficiency of the code finely, it is possible to avoid transmitting certain redundancy bits, the number omitted being npunct~ using a "code puncturing" method applied to the product code.
Under such circumstances, condition (2) is given by:
r = Icel1 ,:; 0 . 5 ( 2 ) n l * n2 - ( kl * k2 - Iceii) - np~ct These objects, and others that appear below, are achieved by a method of encoding a cell made up of bits by means of a product code, given that the cell is presented for coding purposes in the form of an array and that the encoding consists specifically in:
a) applying a first binary linear block code to one dimension of the array (rows or columns) containing the cell; and b) applying a second binary linear block code to the other dimensions of the array (column or row) containing the cell.
The linear block codes used satisfy the following criterion: one of them has the capacity to correct one error (t=1) and the other has the capacity to correct two errors (t=2) .
5 Advantageously, the binary linear block codes correspond to BCH codes of length n and dimension k, said BCH codes belonging to any one of the following families:
(n, k), (n, k-1), (n+1, k), (n-s, k-s), or (n-s, k-1-s) and (n+1-s, k-s), where k, n, and s are integers and where s<k, define the above-mentioned criterion.
Preferably, the method of the invention consists in interlacing the data obtained during step a) prior to step b) .
Other characteristics and advantages of the invention will appear on reading the following description of a preferred implementation given by way of non-limiting illustration, and with reference to the accompanying drawings, in which:
- Figures 1 and 2 show the principle of product encoding;
- Figure 3 shows an example of a product code of the invention applied to encoding an ATM cell; and - Figure 4 shows the efficiency characteristics of a family of BCH codes of the invention.
Figures 1 and 2 are described above with reference to the state of the art.
In a particular implementation of the present invention, the row and column codes used for constructing the product code are (n, k) BCH binary codes, their (n+1, k) extended codes, their (n, k-1) expurgated codes, and the (n-s, k-s), (n-s, k-1-s), and (n+1-s, k-s) shortened codes of these codes, with k, n, and s integers, and with s<k.
The extended codes are obtained by adding a parity bit to each word of a BCH code having an odd minimum Hamming distance. In other words, its generator polynomial g(x) does not contain the factor (x+1). An expurgated code is obtained from a BCH code having g(x) as its generating polynomial, where g(x) does not contain the factor (x+1). The expurgated code is obtained by the new generator polynomial (x+1) *g (x) .
The term BCH code is used below for any of the variants described above.
A pair of codes constituting a product code of the invention comprises the (26,32) extended BCH code whose correction capacity is t=1, and the (21,32) extended BCH
code whose correction capacity is t=2. The list of basic BCH codes and of their correction capacities is given at p. 437 of the second edition of the work entitled "Digital communication" by John G. Proakis, published by Mac Graw Hill.
Figure 3 shows an ATM cell (31) comprising 424 bits arranged for encoding purposes.in an array of 21 rows by 26 columns for the case where the (32,21) BCH code having t=2 is selected as the row code and the (32,26) BCH code having t=1 is selected as the column code. It is also possible to envisage interchanging the row and column codes. The method whereby the ATM cell is arranged in the array in this case is filling the first row sequentially from left to right, then the second, etc., until all of the bits of the cell have been arranged in the array. In the present case, the first 16 rows are filled completely with bits of the ATM cell, while the 17th cell contains the last 8 bits of the ATM cell. The remaining locations of the array (32) can be filled by optionally random padding bits which need not be transmitted, which amounts to shortening the product code. This method of arrangement has been described because of its simplicity, however it is entirely possible to define some other method of arrangement providing that decoding means are available for distinguishing bits of the ATM cell from any padding bits or puncturing bits, and for reconstituting the ATM cell correctly after decoding.
(n, k), (n, k-1), (n+1, k), (n-s, k-s), or (n-s, k-1-s) and (n+1-s, k-s), where k, n, and s are integers and where s<k, define the above-mentioned criterion.
Preferably, the method of the invention consists in interlacing the data obtained during step a) prior to step b) .
Other characteristics and advantages of the invention will appear on reading the following description of a preferred implementation given by way of non-limiting illustration, and with reference to the accompanying drawings, in which:
- Figures 1 and 2 show the principle of product encoding;
- Figure 3 shows an example of a product code of the invention applied to encoding an ATM cell; and - Figure 4 shows the efficiency characteristics of a family of BCH codes of the invention.
Figures 1 and 2 are described above with reference to the state of the art.
In a particular implementation of the present invention, the row and column codes used for constructing the product code are (n, k) BCH binary codes, their (n+1, k) extended codes, their (n, k-1) expurgated codes, and the (n-s, k-s), (n-s, k-1-s), and (n+1-s, k-s) shortened codes of these codes, with k, n, and s integers, and with s<k.
The extended codes are obtained by adding a parity bit to each word of a BCH code having an odd minimum Hamming distance. In other words, its generator polynomial g(x) does not contain the factor (x+1). An expurgated code is obtained from a BCH code having g(x) as its generating polynomial, where g(x) does not contain the factor (x+1). The expurgated code is obtained by the new generator polynomial (x+1) *g (x) .
The term BCH code is used below for any of the variants described above.
A pair of codes constituting a product code of the invention comprises the (26,32) extended BCH code whose correction capacity is t=1, and the (21,32) extended BCH
code whose correction capacity is t=2. The list of basic BCH codes and of their correction capacities is given at p. 437 of the second edition of the work entitled "Digital communication" by John G. Proakis, published by Mac Graw Hill.
Figure 3 shows an ATM cell (31) comprising 424 bits arranged for encoding purposes.in an array of 21 rows by 26 columns for the case where the (32,21) BCH code having t=2 is selected as the row code and the (32,26) BCH code having t=1 is selected as the column code. It is also possible to envisage interchanging the row and column codes. The method whereby the ATM cell is arranged in the array in this case is filling the first row sequentially from left to right, then the second, etc., until all of the bits of the cell have been arranged in the array. In the present case, the first 16 rows are filled completely with bits of the ATM cell, while the 17th cell contains the last 8 bits of the ATM cell. The remaining locations of the array (32) can be filled by optionally random padding bits which need not be transmitted, which amounts to shortening the product code. This method of arrangement has been described because of its simplicity, however it is entirely possible to define some other method of arrangement providing that decoding means are available for distinguishing bits of the ATM cell from any padding bits or puncturing bits, and for reconstituting the ATM cell correctly after decoding.
The efficiency of the product code based on the (32,26) BCH row code and the (32,21) BCH column code is:
26 * 21 r = = 0.53 32 * 32 Figure 4 is made up of Figures 4a, 4b, 4c, 4d, 4e, and 4f and shows the characteristics of pairs of codes making up a product code. These diagram should be considered in pairs (4a, 4b) , (4c, 4d) , (4e, 4f) where each pair shows the results of simulations for particular families of raw and column codes.
In the charts, the X direction represents the shortening value for the row code, and the Y direction of the chart represents the shortening value for the column code. For each combination of a row code and a column code, the direction Z1 in the charts of Figures 4a, 4c, and 4e gives the numbers of code bits generated by the code, while the Z2 direction of charts 4b, 4d, and 4f gives the efficiency of the code.
For the pair (4a, 4b), the row codes and the column codes are derived by shortening the (32,26) BCH code and both have a correction capacity t=1. The efficiencies of the various codes considered in this case extend over the range about 0.55 to about 0.65.
For the pair (4c, 4d), the row codes and the column codes are derived by shortening the (32,21) BCH code and both have a correction capacity t=2. The efficiencies of the various codes considered in this case extend over the range about 0.30 to about 0.45.
For the pair (4e, 4f), the row codes are derived by shortening the (32,26) BCH code and all have a correction capacity t=1, while the column codes are derived by shortening the (32,21) BCH code and all have a correction capacity t=2. The efficiencies of the various codes considered in this case covers the range about 0.45 to about 0.52.
26 * 21 r = = 0.53 32 * 32 Figure 4 is made up of Figures 4a, 4b, 4c, 4d, 4e, and 4f and shows the characteristics of pairs of codes making up a product code. These diagram should be considered in pairs (4a, 4b) , (4c, 4d) , (4e, 4f) where each pair shows the results of simulations for particular families of raw and column codes.
In the charts, the X direction represents the shortening value for the row code, and the Y direction of the chart represents the shortening value for the column code. For each combination of a row code and a column code, the direction Z1 in the charts of Figures 4a, 4c, and 4e gives the numbers of code bits generated by the code, while the Z2 direction of charts 4b, 4d, and 4f gives the efficiency of the code.
For the pair (4a, 4b), the row codes and the column codes are derived by shortening the (32,26) BCH code and both have a correction capacity t=1. The efficiencies of the various codes considered in this case extend over the range about 0.55 to about 0.65.
For the pair (4c, 4d), the row codes and the column codes are derived by shortening the (32,21) BCH code and both have a correction capacity t=2. The efficiencies of the various codes considered in this case extend over the range about 0.30 to about 0.45.
For the pair (4e, 4f), the row codes are derived by shortening the (32,26) BCH code and all have a correction capacity t=1, while the column codes are derived by shortening the (32,21) BCH code and all have a correction capacity t=2. The efficiencies of the various codes considered in this case covers the range about 0.45 to about 0.52.
It can be seen from the various charts that for combinations of codes in which one has correction capacity t=1 and the other has correction capacity t=2, i.e. charts 4e and 4f, the conditions (1) and (2) for encoding an ATM cell for satellite transmission are satisfied much better than for codes both having a correction capacity t=1, charts 4a and 4b, or for codes both having a correction capacity t=2, charts 4c and 4d.
Claims (7)
1/ A method of encoding a cell by a product code, said cell being contained in an array whose rows and columns each represent one dimension of said array, the method consisting in:
- applying a first binary linear block code to one dimension of said table;
- applying a second binary linear block code to the other dimension of said array;
said binary linear block codes being represented by their correction capacity;
the method being characterized in that one of said binary linear block codes has the capacity to correct one error while the other of said binary linear block codes has the capacity to correct two errors.
- applying a first binary linear block code to one dimension of said table;
- applying a second binary linear block code to the other dimension of said array;
said binary linear block codes being represented by their correction capacity;
the method being characterized in that one of said binary linear block codes has the capacity to correct one error while the other of said binary linear block codes has the capacity to correct two errors.
2/ A method according to claim 1, characterized in that said binary linear block codes are BCH block codes or derivatives thereof, one having the capacity to correct one error and the other having the capacity to correct two errors.
3/ A method according to claim 1 or 2, characterized in that said product code applied to said cell has an efficiency close to 0.5.
4/ A method according to any one of claims 1 to 3, characterized in that said cell to be encoded is an ATM
cell.
cell.
5/ A method according to any one of claims 1 to 4, characterized in that said cell is to be transmitted in a communications system that includes a satellite.
6/ A method according to any one of claims 1 to 5, characterized in that said array containing said cell also contains other bits for padding.
7/ A method according to any one of claims 1 to 5, characterized in that said array containing said cell also contains puncturing bits.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP99440140A EP1059757A1 (en) | 1999-06-11 | 1999-06-11 | Method of block coding an ATM cell using a product code |
| EP99440140.4 | 1999-06-11 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2310997A1 true CA2310997A1 (en) | 2000-12-11 |
Family
ID=8242336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2310997 Abandoned CA2310997A1 (en) | 1999-06-11 | 2000-06-08 | A method of encoding a cell by a product code, for a satellite application |
Country Status (5)
| Country | Link |
|---|---|
| EP (1) | EP1059757A1 (en) |
| JP (1) | JP2001028549A (en) |
| CN (1) | CN1277494A (en) |
| CA (1) | CA2310997A1 (en) |
| EA (1) | EA002212B1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7716559B2 (en) | 2003-10-23 | 2010-05-11 | Thomson Licensing | Method for lost packet reconstruction and device for carrying out said method |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100486120C (en) * | 2005-12-15 | 2009-05-06 | 大唐移动通信设备有限公司 | Turbo decoder and decoding method |
| CN101409599B (en) * | 2007-10-11 | 2011-07-13 | 电信科学技术研究院 | Method and apparatus for decoding Turbo code |
| CN102035557B (en) * | 2009-09-27 | 2013-02-27 | 中兴通讯股份有限公司 | Method and device for interweaving turbo codes in parallel |
| CN102098061B (en) * | 2009-12-15 | 2014-09-17 | 上海贝尔股份有限公司 | Parallel Turbo coder |
| CN102130695B (en) * | 2010-01-15 | 2013-06-12 | 中兴通讯股份有限公司 | Decoding method and device of concatenated codes |
| CN101969309B (en) * | 2010-09-28 | 2014-07-16 | 电子科技大学 | MAP modulating and coding method of FFH communication system coded by Turbo and modulated by BFSK |
| JP2012080283A (en) * | 2010-09-30 | 2012-04-19 | Jvc Kenwood Corp | Decoder and decoding method |
| CN102281075B (en) * | 2011-03-21 | 2013-03-06 | 中国人民解放军信息工程大学 | Hierarchical encoding, operation and indexing method of hexagonal grid with aperture of 4 |
| CN102281076B (en) * | 2011-03-25 | 2014-01-15 | 武汉中元通信股份有限公司 | RS (Reed-Solomon) cascade code design method based on increase of frequency hopping radio station anti-interference capabilities |
| CN102270994B (en) * | 2011-03-30 | 2013-03-06 | 清华大学 | Overflow control method for state metric of Turbo code decoder |
| CN102751996B (en) * | 2011-04-19 | 2015-03-25 | 深圳清华大学研究院 | High-performance low-complexity decoding method of block product codes TPC (Turbo Product Code) |
| WO2012164929A1 (en) * | 2011-05-31 | 2012-12-06 | 三菱電機株式会社 | Error correction coding device, error correction decoding device and method therefor |
| CN102571108B (en) * | 2012-02-24 | 2014-02-26 | 清华大学深圳研究生院 | Self-adaptive iterative decoding method for Turbo product codes |
| CN103618584A (en) * | 2013-04-28 | 2014-03-05 | 张涛 | Coding and decoding method and coding and decoding system of power line communication channel |
| CN105515591B (en) * | 2014-09-23 | 2019-10-25 | 中国科学院计算技术研究所 | A kind of Turbo code decoding system and method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0603932B1 (en) * | 1992-12-14 | 1998-04-08 | Koninklijke Philips Electronics N.V. | Method and apparatus for implementing a quasi-product code with different degrees of protection against errors |
| JP3139737B2 (en) * | 1996-07-31 | 2001-03-05 | 日本電気株式会社 | Data communication system |
| FR2769776B1 (en) * | 1997-10-09 | 1999-12-17 | Alsthom Cge Alcatel | BLOCK CODING PROCESS BY PRODUCT CODE APPLICABLE IN PARTICULAR TO THE CODING OF AN ATM CELL |
-
1999
- 1999-06-11 EP EP99440140A patent/EP1059757A1/en not_active Withdrawn
-
2000
- 2000-05-29 JP JP2000157672A patent/JP2001028549A/en not_active Withdrawn
- 2000-06-08 CA CA 2310997 patent/CA2310997A1/en not_active Abandoned
- 2000-06-09 CN CN 00118144 patent/CN1277494A/en active Pending
- 2000-06-09 EA EA200000510A patent/EA002212B1/en not_active IP Right Cessation
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7716559B2 (en) | 2003-10-23 | 2010-05-11 | Thomson Licensing | Method for lost packet reconstruction and device for carrying out said method |
Also Published As
| Publication number | Publication date |
|---|---|
| EA200000510A3 (en) | 2001-02-26 |
| CN1277494A (en) | 2000-12-20 |
| JP2001028549A (en) | 2001-01-30 |
| EA200000510A2 (en) | 2000-12-25 |
| EA002212B1 (en) | 2002-02-28 |
| EP1059757A1 (en) | 2000-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2264925B1 (en) | Error-correcting encoding apparatus | |
| US7831896B2 (en) | Iterative forward error correction | |
| CA2310997A1 (en) | A method of encoding a cell by a product code, for a satellite application | |
| EP2093886B1 (en) | Method and apparatus for channel encoding and decoding in a communication system using low-density parity-check codes | |
| US8887021B2 (en) | Continuously interleaved error correction | |
| CN1192536C (en) | Method for decreasing frame error rate in data transmission in form of data frames | |
| WO1998032231A1 (en) | Method and apparatus for transmitting and receiving concatenated code data | |
| WO2013001706A1 (en) | Wireless transceiver device, communication system and channel-coding processing method used in same device and system | |
| US7296212B1 (en) | Multi-dimensional irregular array codes and methods for forward error correction, and apparatuses and systems employing such codes and methods | |
| US6279132B1 (en) | Concatenated error control method and system for a processing satellite uplink | |
| EP2271018B1 (en) | A decoding method and device for reed-solomon code | |
| JP2002100996A (en) | Method and system for concatenated encoding/decoding communications signal | |
| CN100488057C (en) | Optimized interleaving of digital signals | |
| EP1000480B1 (en) | Transmission system with adaptive channel encoder and decoder | |
| US6185715B1 (en) | Method of product code block encoding applicable to encoding an ATM cell | |
| US6901550B2 (en) | Two-dimensional interleaving in a modem pool environment | |
| US11309913B2 (en) | Zero padding apparatus for encoding variable-length signaling information and zero padding method using same | |
| CN109412746B (en) | Data processing method and related device | |
| US7102549B1 (en) | Method and apparatus for programmable codeword encoding and decoding using truncated codewords | |
| US20060044162A1 (en) | Fibre optic communications | |
| CN113541871A (en) | Method for generating code words and coder-decoder | |
| US20230261674A1 (en) | Systems and methods for improving communication throughput | |
| Baumert et al. | A Golay-Viterbi concatenated coding scheme for MJS'77 | |
| Jensen et al. | Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding | |
| JP2002094477A (en) | Method for coding frame of multiplexing payload and frame-coding module |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Dead |