CN100440739C - A method for acquiring interlace table - Google Patents
A method for acquiring interlace table Download PDFInfo
- Publication number
- CN100440739C CN100440739C CNB2004100089365A CN200410008936A CN100440739C CN 100440739 C CN100440739 C CN 100440739C CN B2004100089365 A CNB2004100089365 A CN B2004100089365A CN 200410008936 A CN200410008936 A CN 200410008936A CN 100440739 C CN100440739 C CN 100440739C
- Authority
- CN
- China
- Prior art keywords
- interweaves
- weaving length
- memory block
- length
- current
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Television Signal Processing For Recording (AREA)
- Studio Devices (AREA)
Abstract
The present invention discloses a method for obtaining interleaving tables, which is applied to an encoder using a Turbo code or a system of a Turbo code decoder. The interleaving lengths are selected in advance, and the coincidence relation of each selected interleaving length and a corresponding interleaving table thereof is stated. When the interleaving table is obtained, the length of a data block of the Turbo encoding or decoding is used as the current interleaving length, and whether the coincidence relation has the current interleaving length is judged; if true, the interleaving table corresponding to the current interleaving length is obtained according to the coincidence relation; or else, the interleaving table corresponding to the current interleaving length is calculated according to interleaving table arithmetic. The method of the present invention largely reduces the time of obtaining the interleaving table by limited memory space, and the period update of the storage area of the interleaving table can flexibly adapt the change of the common interleaving length according to practical service situations.
Description
Technical field
The present invention relates to coding techniques, particularly relate to a kind of method of obtaining the table that interweaves.
Background technology
Turbine code (Turbo code) is a kind of channel coding schemes commonly used at present, is suitable for two-forty but the data transmission service not high to delay requirement.Turbo code can reduce the transmitting power of system greatly and increase the capacity of system.Simultaneously, Turbo code can reach excellent coding gain effect.Can reach approximately and Shannon (Shannon) limit coding gain of poor 0.2dB only such as, Turbo code, thereby provide splendid error correction function for system.Therefore, Turbo code is in third generation communication system and deep space communication, satellite communication, and all there is important use in fields such as Video processing.
On channel, can have influence on a string in succession bit owing to continue long deep fade valley point, so often being bunchiness, bit error takes place.Yet, chnnel coding and decoding only when detecting and proofreading and correct single error and short mistake string just effectively.Therefore, in Turbo code coding and Turbo code decoded operation, the bit error of bunchiness occurs, thereby cause the bigger error rate through regular meeting.
Fig. 1 is the structural representation of Turbo code encoder, and Fig. 2 is the structural representation of Turbo code decoder.Referring to Fig. 1 and Fig. 2, in order to solve the problem that the bit error bunchiness causes the big error rate, in Turbo code encoder and Turbo code decoder, used interleaver, interleaving technology by interleaver sends the subsequent bits in a piece of news in non-mode in succession, even the bunchiness mistake has taken place in transmission course so, when reverting to the message of a subsequent bits string, mistake has also just become the very short mistake of single error or length, at this moment correct mistake with the chnnel coding error correction again, recover former message, then can reduce the error rate greatly.
In Turbo coding or decoding, the core content of interleaving technology calculates the table that interweaves exactly.The calculating table that interweaves is exactly to calculate a sequence that puts in order to all integer values (n-1) from 0 according to weaving length n.The span of weaving length is (40～5114).Such as, weaving length is 40, the gained table that interweaves is 40 integer-valued sequences between 0～39, as (2,0,31 ..., 39,6).
The method that prior art is obtained the table that interweaves is:
Method one, real-time computing method.
Calculate in real time according to the current weaving length and the table algorithm that interweaves, obtain the required table that interweaves.For example, the data block length when carrying out Turbo coding or decoding is 100, when obtaining when interweaving table, with data block length 100 as current weaving length, after using the set table algorithm that interweaves, the table that interweaves that obtains is 100 integer-valued sequences between 0～99, as the table (2 that interweaves, 5,81 ..., 16,99,89).Obtaining this when table of interweaving, the numerical value in the table that interweaves on each all needs to calculate according to the set table algorithm that interweaves, and therefore need carry out 100 times and calculate.
Method two, search method.
Use the set table algorithm that interweaves to calculate the interweave table corresponding respectively in advance, and preserve each weaving length and the interweave table corresponding with it with all weaving lengths.Obtaining when table of interweaving, directly search the keeping records in the system.For example, the data block length when carrying out Turbo coding or decoding is 5100, when obtaining when interweaving table, with data block length 5100 as current weaving length, obtaining when table of interweaving, finding the interweave table of preserving in the system corresponding with current weaving length 5100, as the table (51 that interweaves, 0,88 ..., 16,4302,5099).System stores in advance and corresponding with current weaving length 5100 interweaves during table 5100 integer values needing to preserve from 0 to 5099.
As seen, there is following shortcoming in prior art:
In method one, when carrying out Turbo coding or decoding at every turn, all to calculate the table that interweaves according to the weaving length and the table algorithm that interweaves, so when the weaving length that uses is very big, need carry out a large amount of computings and just can draw the numerical value on each in the table that interweaves, thereby reduced the speed of obtaining the table that interweaves, caused system to encode or the decoding business by fast processing Turbo.Method one all needs to calculate for the weaving length of each use just can obtain the interweave table corresponding with it, and the weaving length of each time use is identical probably, thereby causes unnecessary double counting, has wasted the resource of system, has reduced the performance of system.
During using method two, store all weaving lengths and the interweave table corresponding with it in advance and can take a large amount of memory spaces, its storage demand often can't be satisfied in the space in the sheet of system processor.If utilize the sheet external space storage of processor, then can increase cost, and can't judge also in use whether the outer memory space of sheet damages, thereby cause to judge whether the table that interweaves that obtains is correct.Simultaneously, when the weaving length scope is changed, cured sheets external memory district again then, thereby be unfavorable for Turbo coding or the professional development of decoding.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of method of obtaining the table that interweaves, make it obtain the table that interweaves fast with finite storage space.
In order to achieve the above object, technical scheme of the present invention is achieved in that
A kind of method of obtaining the table that interweaves is applied to use in the system of Turbo code encoder or Turbo code decoder, and this method may further comprise the steps:
A, allocate the table memory block that interweaves in advance, choosing the table memory block that interweaves and to store the weaving length of number, and the corresponding relation of each the selected weaving length and the corresponding table that interweaves thereof is set, this corresponding relation is kept in the table memory block that interweaves;
B, when obtaining when table of interweaving, with the data block length of this Turbo coding or decoding as current weaving length, judge in the corresponding relation of preserving the table memory block that interweaves whether current weaving length is arranged, if have, then from the corresponding relation that preserve the table memory block that interweaves, obtain the table that interweaves of current weaving length correspondence, otherwise, calculate the table that interweaves of current weaving length correspondence according to the table algorithm that interweaves.
When being set to first described in the steps A, the pairing table that interweaves of each weaving length described in the steps A is directly to calculate by the table algorithm that interweaves.
The corresponding relation that is provided with and is kept at each weaving length that interweaves in the table memory block and the corresponding table that interweaves thereof in the steps A upgrades by the cycle and is provided with and preserves.
Cycle described in the steps A upgrades to be provided with and to preserve and comprises:
A1, choose weaving length, judge whether all weaving lengths and current all weaving lengths of choosing in the described corresponding relation of preserving the table memory block that interweaves are identical, if it is identical, then jump out the more newly-installed flow process of current period, if it is all inequality, then execution in step A2 is identical as fruit part, then execution in step A3;
A2, calculate the interweave table corresponding with current each weaving length of choosing according to the table algorithm that interweaves, and the corresponding relation of current selected each weaving length and the corresponding table that interweaves thereof is set, utilize this corresponding relation to upgrade to interweave the described corresponding relation of preserving in the table memory block, jump out the more newly-installed flow process of current period then;
A3, for the current weaving length of choosing that in the described corresponding relation that preserve the table memory block that interweaves, does not have, then calculate the interweave table corresponding, upgrade the weaving length corresponding corresponding relation different in the described corresponding relation of preserving the table memory block that interweaves with this weaving length with the corresponding relation of the table that interweaves then with the current weaving length of choosing with it according to the table algorithm that interweaves.
When each execution in step B, write down the access times of current weaving length, when upgrading described corresponding relation, the weaving length of choosing in the steps A 1 is to choose according to the access times value order from big to small of all weaving lengths of system log (SYSLOG).
Before described steps A 1, comprise: judge whether and need weaving length and the corresponding corresponding relation that interweaves table thereof that the table that interweave is preserved in the memory block be upgraded, if desired, execution in step A1 then, otherwise, jump out this flow process.
Preestablish frequency threshold value, whether whether and register system obtained the number of times of the table that interweaves, describedly need weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof to upgrade to be number of times that system by record obtained the table that interweaves and predefined frequency threshold value to equate to judge;
After the weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof upgrade, the value zero setting of the system of record having been obtained the number of times of the table that interweaves.
Preestablish time threshold, and the time value of register system operation, described whether the needs upgrades to the weaving length preserved in the table memory block that interweaves and the corresponding corresponding relation that interweaves table thereof whether the time value that is the system's operation by record and predefined time threshold equate to judge;
After the weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof upgrade, with the time value zero setting of system's operation of record.
This method further comprises: set in advance record sheet, preserve the weaving length and the corresponding table that interweaves thereof that used last time in this record sheet;
In step B, after the data block length of this Turbo being encoded or deciphering is as current weaving length, and before in judgement interweaves the corresponding relation of showing to preserve the memory block, whether current weaving length being arranged, further comprise: judge whether the weaving length that uses last time of preserving in current weaving length and the record sheet is identical, if it is identical, then obtain preserve in the record sheet with the corresponding table that interweaves of weaving length that used last time, finish current flow process, if inequality, then continue carry out described judgement and interweave whether the step of current weaving length is arranged in the corresponding relation that the table memory block preserves.
As seen, the method for the present invention's proposition has the following advantages:
1, because in the regular hour, weaving length commonly used does not have bigger variation, so method of using the present invention to propose, directly in the table memory block that interweaves, search current weaving length and the interweave table corresponding with it, then saved and calculated the process of table that interweaves, thereby significantly reduced the time of obtaining the table that interweaves.
2, the method for the present invention's proposition is only stored weaving length commonly used and the interweave table corresponding with it, thereby has reduced occupying system resource to greatest extent.
3, according to the proposed method, regular update weaving length and with it corresponding the interweave table of table in the memory block that interweave, thereby realized change, and then satisfied the demand of Turbo code business development and variation according to practical business situation flexible adaptation weaving length commonly used.
4, in the method that the present invention proposes, preserve the weaving length and the interweave table corresponding that used last time with it, current weaving length and preservation last time, weaving length was identical the time directly output and the corresponding table that interweaves of weaving length last time, obtain the time that interweaves and show thereby saved greatly.
Description of drawings
Fig. 1 is the structural representation of Turbo code encoder;
Fig. 2 is the structural representation of Turbo code decoder;
Fig. 3 is the flow chart that obtains the table that interweaves in realizing embodiments of the invention behind the usage counter;
Fig. 4 obtains the flow chart that interweaves and show use timer in realizing embodiments of the invention after.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.
Present embodiment sets in advance the table memory block that interweaves, when choosing weaving length first, weaving length commonly used when in the past carrying out Turbo coding or decoding, choose the table memory block that interweaves and to store number (N 's) weaving length, use the set table algorithm that interweaves to calculate respectively and the N that chooses the corresponding table that interweaves of weaving length commonly used then, N weaving length commonly used and the interweave table of choosing corresponding with it is kept in the table memory block that interweaves.
Present embodiment sets in advance weaving length access times table, is used to preserve all weaving lengths and access times thereof.
Present embodiment sets in advance record sheet, is used to preserve weaving length and the interweave table corresponding with it that used last time.
Present embodiment sets in advance undated parameter, is used to judge whether the table memory block that interweaves is upgraded.
Present embodiment sets in advance counter, and described undated parameter is the currency of counter.
Fig. 3 is the flow chart that obtains the table that interweaves in realizing embodiments of the invention behind the usage counter.Referring to Fig. 3, the detailed process that present embodiment obtains the table that interweaves may further comprise the steps:
Step 301: whether the currency of judging counter equate with system predefined frequency threshold value, if the currency of counter equates that with system predefined frequency threshold value then execution in step 302, otherwise execution in step 306.
Here, upgrade to interweave and show the purpose of memory block in order to reach the cycle, at first judge the current update condition that whether satisfies, whether the currency of promptly judging counter equates with system predefined frequency threshold value.If the currency of counter equates with system predefined frequency threshold value, think that then the current reply table memory block that interweaves is upgraded, be weaving length commonly used in the cycle and the table that interweaves corresponding with what guarantee in the table memory block that interweaves, to preserve with it.If the predefined frequency threshold value of the currency of counter and system is unequal, think that then current the needs upgrades the table memory block that interweaves, and can directly obtain the subsequent step of the table that interweaves.
Step 302: with counter zero setting.
With counter zero setting, be in order in following one-period, to add up the number of times that has obtained the table that interweaves again.
Step 303: in weaving length access times table, choose N weaving length according to weaving length access times value order from big to small, judge whether N the weaving length of preserving in the table memory block that interweaves be identical with N the weaving length of choosing, N the weaving length of preserving in the table memory block if interweave is all inequality with N the weaving length of choosing, then execution in step 304, the a part of weaving length in a part of weaving length preserved and the N that the chooses weaving length is identical in the table memory block if interweave, then execution in step 305, N the weaving length of preserving in the table memory block if interweave is identical with N the weaving length of choosing, and then execution in step 306.
Here, N the weaving length of preserving in the table memory block if interweave is all inequality with N the weaving length of choosing, show that then N the weaving length of preserving in the table memory block that interweaves all is not weaving length commonly used in the cycle, must upgrade the full content of showing storage area stores that interweaves.
Here, the a part of weaving length in a part of weaving length preserved and the N that the chooses weaving length is identical in the table memory block if interweave, show that then a part of weaving length of preserving in the table memory block that interweaves is a weaving length commonly used in the cycle, and another part weaving length is not a weaving length commonly used in the cycle, must carry out partial update to the table memory block that interweaves.
Here, if N the weaving length of preserving in the table memory block that interweaves is identical with N the weaving length of choosing, show that then N the weaving length of preserving in the table memory block that interweaves still is weaving length commonly used in the cycle, need not the table memory block that interweaves is upgraded.
Step 304: calculate the interweave table corresponding with the N that a chooses weaving length respectively according to the table algorithm that interweaves, and N weaving length and the interweave table of choosing corresponding with it is kept in the table memory block that interweaves, execution in step 306 then.
Step 305: in the table memory block that interweaves, preserve the weaving length identical and reach and its corresponding table that interweaves with the weaving length of choosing; Deleting the weaving length different with the weaving length of choosing reaches and its corresponding table that interweaves, in the N that a chooses weaving length, for with the weaving length all inequality weaving length of table in the memory block that interweave, calculate the interweave table corresponding respectively according to the table algorithm that interweaves, and will be somebody's turn to do that the corresponding table that interweaves is kept to interweave and shows in the memory block with the weaving length of table in the memory block that interweave weaving length all inequality and with it with it.
Step 306: the length of data block finds current weaving length as current weaving length during with this Turbo coding or decoding in weaving length access times table, and the access times value with current weaving length adds one then, and the value of counter is added one.
The access times value of current weaving length is added one, is in order to upgrade the access times value of the current weaving length of preserving in the weaving length access times table; The value of counter is added one, is the number of times that obtains the table that interweaves that writes down for refresh counter.
Step 307: judge whether the weaving length of preserving in current weaving length and record sheet last time is identical, if identical, then execution in step 308, otherwise, execution in step 309.
Because professional continuity, this Turbo coding or decoding are identical probably with the weaving length that last time, Turbo coding or decoding were used, be current weaving length with last time weaving length identical probably, in order to improve the speed of obtaining the table that interweaves, directly judge whether the weaving length of preserving in record sheet last time is identical with current weaving length, if it is identical, the table that interweaves that then shows the preservation in the record sheet is the required table that interweaves, if inequality, then show the subsequent step that also need obtain the table that interweaves.
Step 308: obtain preserve in the record sheet with the corresponding table that interweaves of weaving length last time, and jump out this flow process.
Step 309: search the weaving length identical with current weaving length in the table memory block that interweaves, if find the weaving length identical with current weaving length, then execution in step 310, otherwise, execution in step 311.
The table that interweaves commonly used in the cycle that is of preserving in the table memory block owing to interweave, so in order to improve the speed of obtaining the table that interweaves, directly in the table memory block that interweaves, search whether the weaving length identical with current weaving length is arranged, if find the weaving length identical with current weaving length, then show and to utilize the table of preserving in the table memory block that interweaves that interweaves, if search, then show to calculate and just can obtain the required table that interweaves less than the weaving length identical with current weaving length.
Step 310: in the table memory block that interweaves, obtain the interweave table corresponding with the weaving length that finds, execution in step 312 then.
Step 311:, calculate the table that interweaves according to the current weaving length and the table algorithm that interweaves.
Step 312: upgrade record sheet with current weaving length and corresponding with it table that interweaves of obtaining.
Because no matter be from the table memory block that interweaves, to obtain the required table that interweaves, still calculate the required table that interweaves according to the current weaving length and the table algorithm that interweaves, all show preserve in the record sheet last time weaving length and current weaving length inequality, so the reply record sheet upgrades, delete original keeping records, current weaving length and corresponding with it table that interweaves of obtaining are kept in the record sheet, are always weaving length and the interweave table corresponding last time with it with what guarantee to preserve in the record sheet.
In addition, the present invention also can use timer to replace counter, and promptly described undated parameter is the currency of timer.
Because no matter usage counter or timer, all be value with its record as undated parameter, upgrade to judge whether reply table memory block cycle of carrying out that interweaves.When usage counter, when obtaining of counter records interweaves the number of times of table when reaching the predefined frequency threshold value of system, think then and finish one-period that reply interweaves and shows the memory block and upgrade.Correspondingly, when using timer, when the time of timer record reaches the predefined time threshold of system, then think and finished one-period, tackle the table memory block that interweaves and upgrade.
Fig. 4 obtains the flow chart that interweaves and show use timer in realizing embodiments of the invention after.Referring to Fig. 4, when using timer, the present invention obtains in the process of showing that interweaves above-mentioned,
Step 301 is changed to step 401, and whether the currency of promptly judging timer equate with system predefined time threshold, if the currency of timer equates that with system predefined time threshold then execution in step 402, otherwise execution in step 403;
Step 302 is changed to step 402, is about to timer zero setting;
Step 306 is changed to step 403, and the value of promptly deleting in the step 306 counter adds one step.
Obtain in the process of showing that interweaves above-mentioned, described other content remains unchanged.
In a word, the above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1, a kind of method of obtaining the table that interweaves is applied to use in the system of Turbo code encoder or Turbo code decoder, it is characterized in that this method may further comprise the steps:
A, allocate the table memory block that interweaves in advance, choosing the table memory block that interweaves and to store the weaving length of number, and the corresponding relation of each the selected weaving length and the corresponding table that interweaves thereof is set, this corresponding relation is kept in the table memory block that interweaves;
B, when obtaining when table of interweaving, with the data block length of this Turbo coding or decoding as current weaving length, judge in the corresponding relation of preserving the table memory block that interweaves whether current weaving length is arranged, if have, then from the corresponding relation that preserve the table memory block that interweaves, obtain the table that interweaves of current weaving length correspondence, otherwise, calculate the table that interweaves of current weaving length correspondence according to the table algorithm that interweaves.
2, method according to claim 1 is characterized in that, when being set to first described in the steps A, the pairing table that interweaves of each weaving length described in the steps A is directly to calculate by the table algorithm that interweaves.
3, method according to claim 1 is characterized in that, the corresponding relation that is provided with and is kept at each weaving length that interweaves in the table memory block and the corresponding table that interweaves thereof in the steps A upgrades by the cycle and is provided with and preserves.
4, method according to claim 3 is characterized in that, the cycle described in the steps A upgrades to be provided with and to preserve and comprises:
A1, choose weaving length, judge whether all weaving lengths and current all weaving lengths of choosing in the described corresponding relation of preserving the table memory block that interweaves are identical, if it is identical, then jump out the more newly-installed flow process of current period, if it is all inequality, then execution in step A2 is identical as fruit part, then execution in step A3;
A2, calculate the interweave table corresponding with current each weaving length of choosing according to the table algorithm that interweaves, and the corresponding relation of current selected each weaving length and the corresponding table that interweaves thereof is set, utilize this corresponding relation to upgrade to interweave the described corresponding relation of preserving in the table memory block, jump out the more newly-installed flow process of current period then;
A3, for the current weaving length of choosing that in the described corresponding relation that preserve the table memory block that interweaves, does not have, then calculate the interweave table corresponding, upgrade the weaving length corresponding corresponding relation different in the described corresponding relation of preserving the table memory block that interweaves with this weaving length with the corresponding relation of the table that interweaves then with the current weaving length of choosing with it according to the table algorithm that interweaves.
5, method according to claim 4, it is characterized in that, when each execution in step B, write down the access times of current weaving length, when upgrading described corresponding relation, the weaving length of choosing in the steps A 1 is to choose according to the access times value order from big to small of all weaving lengths of system log (SYSLOG).
6, according to claim 4 or 5 described methods, it is characterized in that, before described steps A 1, comprise: judge whether and need weaving length and the corresponding corresponding relation of preserving in the table memory block that interweave that interweaves table thereof be upgraded, if desired, execution in step A1 then, otherwise, jump out this flow process.
7, method according to claim 6, it is characterized in that, preestablish frequency threshold value, whether whether and register system obtained the number of times of the table that interweaves, describedly need weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof to upgrade to be number of times that system by record obtained the table that interweaves and predefined frequency threshold value to equate to judge;
After the weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof upgrade, the value zero setting of the system of record having been obtained the number of times of the table that interweaves.
8, method according to claim 6, it is characterized in that, preestablish time threshold, and the time value of register system operation, described whether the needs upgrades to the weaving length preserved in the table memory block that interweaves and the corresponding corresponding relation that interweaves table thereof whether the time value that is the system's operation by record and predefined time threshold equate to judge;
After the weaving length that the table that interweaves is preserved in the memory block and the corresponding corresponding relation that interweaves table thereof upgrade, with the time value zero setting of system's operation of record.
9, according to claim 1,2,3,4,5,7 or 8 described methods, it is characterized in that this method further comprises: set in advance record sheet, in this record sheet, preserve the weaving length and the corresponding table that interweaves thereof that used last time;
In step B, after the data block length of this Turbo being encoded or deciphering is as current weaving length, and before in judgement interweaves the corresponding relation of showing to preserve the memory block, whether current weaving length being arranged, further comprise: judge whether the weaving length that uses last time of preserving in current weaving length and the record sheet is identical, if it is identical, then obtain preserve in the record sheet with the corresponding table that interweaves of weaving length that used last time, finish current flow process, if inequality, then continue carry out described judgement and interweave whether the step of current weaving length is arranged in the corresponding relation that the table memory block preserves.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100089365A CN100440739C (en) | 2004-03-15 | 2004-03-15 | A method for acquiring interlace table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100089365A CN100440739C (en) | 2004-03-15 | 2004-03-15 | A method for acquiring interlace table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1671057A CN1671057A (en) | 2005-09-21 |
| CN100440739C true CN100440739C (en) | 2008-12-03 |
Family
ID=35042149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100089365A Expired - Fee Related CN100440739C (en) | 2004-03-15 | 2004-03-15 | A method for acquiring interlace table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100440739C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104509058B (en) * | 2013-03-27 | 2017-11-17 | 华为技术有限公司 | A kind of acquisition methods and user equipment of interleaver information |
| US10033483B2 (en) * | 2015-05-18 | 2018-07-24 | Microsoft Technology Licensing, Llc | Adjustable interleaving for communication data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1178436A (en) * | 1996-09-21 | 1998-04-08 | 三星电子株式会社 | Base-band interleaver for code devision multiple access mobile telecommunication system |
| CN1336738A (en) * | 2001-07-11 | 2002-02-20 | 信息产业部电信传输研究所 | Inner interleaver alogithm and device for in-situ real-time generation of wideband CDMA Turbo code |
| CN1347200A (en) * | 2001-07-06 | 2002-05-01 | 清华大学 | Error correcting Turbo code encoder in ground system of digital television broadcast |
| US6404360B1 (en) * | 1999-11-04 | 2002-06-11 | Canon Kabushiki Kaisha | Interleaving method for the turbocoding of data |
-
2004
- 2004-03-15 CN CNB2004100089365A patent/CN100440739C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1178436A (en) * | 1996-09-21 | 1998-04-08 | 三星电子株式会社 | Base-band interleaver for code devision multiple access mobile telecommunication system |
| US6404360B1 (en) * | 1999-11-04 | 2002-06-11 | Canon Kabushiki Kaisha | Interleaving method for the turbocoding of data |
| CN1347200A (en) * | 2001-07-06 | 2002-05-01 | 清华大学 | Error correcting Turbo code encoder in ground system of digital television broadcast |
| CN1336738A (en) * | 2001-07-11 | 2002-02-20 | 信息产业部电信传输研究所 | Inner interleaver alogithm and device for in-situ real-time generation of wideband CDMA Turbo code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1671057A (en) | 2005-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6460161B1 (en) | Processing of state histories in Viterbi decoding | |
| US4630032A (en) | Apparatus for decoding error-correcting codes | |
| US7372379B1 (en) | Method and system for decoding N-tuple variable length code | |
| US5619514A (en) | In-place present state/next state registers | |
| US8566683B2 (en) | Power-reduced preliminary decoded bits in viterbi decoders | |
| US5533065A (en) | Decreasing length tracebacks | |
| KR100336246B1 (en) | Integrated circuit with digital processor and co-processor | |
| CN100440739C (en) | A method for acquiring interlace table | |
| US7205915B2 (en) | Method of decoding variable length prefix codes | |
| CN109032834A (en) | A kind of code rate adaptive approach based on Polar code | |
| CN108959977B (en) | Soft and hard hybrid decoding method suitable for SRAM PUF | |
| CN102142848B (en) | Decoding method and decoder of tail-biting convolutional code | |
| KR101030726B1 (en) | Memory efficient multimedia huffman decoding method and apparatus for adapting huffman table based on symbol from probability table | |
| US20070201586A1 (en) | Multi-rate viterbi decoder | |
| CN202602827U (en) | Variable-length decoding device based on universal format code table | |
| US6269130B1 (en) | Cached chainback RAM for serial viterbi decoder | |
| EP1727288B1 (en) | Determination of the bit error rate in a European DAB receiver | |
| CN1647391B (en) | Equipment and method for providing grid decoding data | |
| US8856630B2 (en) | Continuous parallel Viterbi decoder | |
| CN113992213B (en) | Dual-path parallel decoding storage device and method | |
| US6842490B1 (en) | Viterbi decoder with adaptive traceback | |
| KR20010071792A (en) | Fast metric calculation for viterbi decoder implementation | |
| TWI384377B (en) | Data encoding and decoding method | |
| JP2006314054A (en) | Turbo decoder | |
| US8243825B2 (en) | Decoding and encoding method for deinterleaver |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081203 Termination date: 20140315 |