CN1333599C - Bit interleaving method for digital TV ground transmission - Google Patents
Bit interleaving method for digital TV ground transmission Download PDFInfo
- Publication number
- CN1333599C CN1333599C CNB2004100299077A CN200410029907A CN1333599C CN 1333599 C CN1333599 C CN 1333599C CN B2004100299077 A CNB2004100299077 A CN B2004100299077A CN 200410029907 A CN200410029907 A CN 200410029907A CN 1333599 C CN1333599 C CN 1333599C
- Authority
- CN
- China
- Prior art keywords
- piece
- bit
- tpc
- order
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention discloses a bit interleaving method for digital TV ground transmission. The present invention has the technical scheme that the method carries out bit interleaving treatment on data blocks TPC (M<2>*N<2>) after TPC (M<2>, M<1>; N<2>, N<1>) coding; K data blocks TPC (M<2>xN<2>) take part in the bit interleaving each tim after TPC coding e. The present invention comprises the following steps that in the first step, one bit datum in the same position on each TPC block is orderly output according to a TPC block order (1 to K), and data inside each TPC block are output according to a diagonal order; in the second step, a bit stream is equidistantly divided into L blocks taking P bits as a unit, wherein the orders of every adjacent two bits of data inside the <L/2> or the <L/2>+1 blocks are exchanged, and the order of bits in the other blocks remains unchanged. The present invention can further strengthen the capacity of resisting sudden errors of a digital TV ground transmission system.
Description
Technical field
The invention belongs to digital signal transmission field, particularly in the digital television ground broadcast transmission system data are carried out the processing method of Bit Interleave.
Background technology
Typical digital television ground broadcast transmission system comprises transmitter and receiver.Digital modulation technique adds necessary supplementary more often with encoding digital signals, as: synchronizing signal, pilot signal etc.Digital signal behind the coding forms baseband signal through behind the channel filtering.This baseband signal sends after being modulated onto frequency band corresponding through upconverter.At receiving terminal, tuner transforms to base band after analog to digital converter obtains digital signal with high-frequency signal.This digital signal is resumed the information consistent with transmitting terminal after treatment.
In digital television broadcasting, sudden error code can take place in transfer of data, and mistake appears in promptly a large amount of continuous data, and general error correcting code can't be corrected.For the burst noise (Burst Noise) that tackles in the channel disturbs, and tackle the decline in the channel when move receiving, and cooperation chnnel coding, digital television and broadcasting transinission system carries out interleaving treatment to data, the burst error of channel is spread out, thereby the available channel error correcting code give error correction.
Interleaver is divided into block interleaving and convolutional interleave two classes.In actual the use, because in digital television ground broadcast transmission system, according to the requirement of systematic function, adopted multiple coded system cascade, therefore the existing convolution byte-interleaved of system cooperates outer sign indicating number (RS sign indicating number), has also adopted block interleaving to cooperate block encoding, and sign map.And the data structure of system also affects the mode that interweaves.
Referring to Fig. 1, in U.S. ATSC system, there are two kinds to interweave: immediately following outer interweaving---the convolution byte-interleaved after the RS sign indicating number; The bit convolution that combines with TCM interweaves.Data are divided into 12 the tunnel behind the convolutional interleave, carry out bit convolution and interweave.Afterwards, send into the TCM encoder encodes of each road correspondence.Specifically, the transmission data are carried out after the convolutional interleave, and data flow is one group through parallel serial conversion with 2 bits, and order is sent into 12 identical grid (Trellis) encoders and precoder respectively, and as circulation.
Referring to Fig. 2, in European DVB-T system, also there are two kinds to interweave: immediately following outer interweaving---the convolution byte-interleaved after the RS sign indicating number; The bit block that combines with TCM interweaves and symbolic blocks interweaves.Data after the convolution byte-interleaved are carried out Bit Interleave after carrying out the TCM coding along separate routes, carry out symbol interleaving at last.Specifically, after carrying out separately that outer sign indicating number encode, interweaved, ISN is encoded outward and be mapped to symbol for the data flow of different priorities in the DVB-T system, the bit stream of being made up of each bit of each symbol under the equal priority is carried out block interleaving respectively.Bit after bit block interweaves is formed symbol, and is unit with the symbol, and the symbolic blocks that carries out the OFDM symbol lengths interweaves.
Referring to Fig. 3, similar to DVB-T, the ISDB-T system of Japan carries out chnnel codings such as TCM earlier to data, then send into each road and carry out simple bit delay block interleaving.Carry out after the sign map time domain convolutional interleave and the area block that carries out symbol again interweave (carrier wave is moved).
Fig. 4 has provided the schematic diagram of convolutional deinterleaver.The numbers of branches of convolutional deinterleaver is called interleaver depth B, and first branch is time-delay not, below each branch introduce extra symbol time-delay successively.During deinterleaving, each branch's complementation of the time-delay of each branch and interleaver, i.e. not time-delay of last branch, more than each branch introduce extra symbol time-delay successively.With above-mentioned interweaving and de-interweaving method, each symbol produces a constant time lag after by interleaver and deinterleaver.
Carry out Bit Interleave in the piece for a two-dimensional blocks of data, often adopt the Helical deinterleaving method, promptly in coding module, use the diagonal interweaving method.For two-dimensional blocks of data, data are by the order output from the piece upper left corner to the lower right corner.First round output is since the element of first row, first row, and second takes turns since the first row secondary series ... finish until the output of piece interior element.Fig. 5 has provided TPC (128,120; 128,120) the piece Nepit of data block interweaves element output in proper order, and promptly the output of data is in proper order in each TPC piece:
(0，0)，(1，1)，(2，2)，...(127，127)
(0，1)，(1，2)，(2，3)，...(127，0)
(0，2)，(1，3)，(2，4)，...(127，1)
...，...，...，...，...
(0，127)，(1，0)，(2，1)，...(127，126)。
Consider Turbo product code (Turbo Product code, be abbreviated as TPC) performance be better than systematic codes such as convolutional encoding, in the digital terrestrial television transmission system (ADTB-T system) of the applicant's design, adopt the interior coding of TPC coding as chnnel coding.Above-mentioned inner opposite angle line deinterleaving method can improve transmission system to a certain extent and tackle burst noise interference capability in the channel.But under the abominable channel condition of digital TV ground transmission, only carrying out interweaving in the piece also is not enough to satisfy the demand.Therefore need carry out interblock and interweave and improve the ability of system's antiburst error, referring to the patent application of denomination of invention for " a kind of Bit Interleave method that is used for digital TV ground transmission ", application number is 200410006172.6.Under the high code check 16-OQAM transmission mode of ADTB-T system, because the gray mappings that is connect behind Bit Interleave height bit confidence coefficient difference, cause error code skewness in the receiving end data artificially, signal-noise ratio threshold is caused certain damage, influenced systematic function.Therefore, we propose a kind of new Bit Interleave method, on original Bit Interleave basis, processing are again done effectively in its output.
Summary of the invention
The purpose of this invention is to provide a kind of new Bit Interleave method.This deinterleaving method is at the high code check 16-OQAM of ADTB-T transmission mode, can more effectively improve ISN and be the ability of antiburst error of the digital terrestrial television transmission system of TPC coding, and can be under the high code check transmission mode, since adopt former patent (application number: 200410006172.6) described interblock interweave cause after the gray mappings before and after different average dispersion of 2 bit confidence coefficients, further reduce signal-noise ratio threshold.
In the chnnel coding of the high code check transmission mode of ADTB-T system, adopted TPC (M
2, M
1N
2, N
1) coding.The present invention is to TPC (M
2, M
1N
2, N
1) encoded data piece TPC (M
2* N
2) carry out Bit Interleave and handle.This Bit Interleave method was divided into for 2 steps.K the data block TPC (M behind the TPC coding can be arranged at every turn
2* N
2) participating in Bit Interleave, K is a positive integer.
For above-mentioned each two-dimentional TPC piece (M
2* N
2), at first as follows each bit in the piece is addressed:
The addressing method of each bit is in the TPC piece: first row (0,0), (0,1) ..., (0, M
2-1) }, second row (1,0), (1,1) ..., (1, M
2-1) } ..., N
2Row { (N
2-1,0), (N
2-1,1) ..., (N
2-1, M
2-1) }.
Obviously, also have other multiple addressing methods, as long as can provide the unique address of each bit in the TPC piece.But the addressing method of above-mentioned K TPC piece must be identical.
The first step of Bit Interleave of the present invention: the data in each TPC piece are pressed the output of diagonal sequence arrangement, export in the following order such as data in each TPC piece:
Suppose M
2〉=N
2
The first round: initial value be (0,0%M
2), output successively later on (1,1%M
2); (2,2%M
2); ...; (N
2-1, (N
2-1) %M
2), the full N of output
2Enter next round during individual bit;
Second takes turns: initial value for (0,1%M
2), output successively later on (1,2%M
2); (2,3%M
2); ...; (N
2-1, N
2%M
2), the full N of output
2Enter next round during individual bit;
Third round: initial value be (0,2%M
2), output successively later on (1,3%M
2); (2,4%M
2); ...; (N
2-1, (N
2+ 1) %M
2), the full N of output
2Enter next round during individual bit;
Four-wheel: initial value be (0,3%M
2), output successively later on (1,4%M
2); (2,5%M
2); ...; (N
2-1, (N
2+ 2) %M
2), the full N of output
2Enter next round during individual bit;
M
2The wheel: initial value be (0, (M
2-1) %M
2), output successively later on (1, M
2%M2); (2, (M
2+ 1) %M
2); ...; (N
2-1, (N
2+ M
2-2) %M
2).
The above-mentioned a kind of mode that has provided by data in the diagonal order IOB.In fact, based on same principle, multiple output order can also be arranged.
K the data block TPC (M behind the TPC coding arranged
2* N
2) participate under the situation of Bit Interleave, export data on the same position of each TPC piece successively according to the order of TPC piece during the output of the Bit Interleave first step, promptly export (0 of the 1st TPC piece successively, 0), (0 of the 2nd TPC piece, 0), (0 of the 3rd TPC piece, 0) ... until (0,0) of K TPC piece; Then, export (1,1) of (1,1) of the 1st TPC piece, the 2nd TPC piece, (1,1) of the 3rd TPC piece again ... until (1,1) of K TPC piece ....
Second step of Bit Interleave of the present invention: make that P is M
2With N
2In less number; Finishing after the operation of the above-mentioned first step first with every K TPC piece and be output as starting point, is unit with bit stream with P bit, equally spaced is divided into the L piece.Data in the L piece in every of all even numbered blocks or the odd number piece, every adjacent two bit exchange order, every bit only participates in once exchanging, and all the other piece Nepit order remain unchanged.Wherein, L=M
2* N
2* K/P promptly works as M
2＜N
2The time, P=M
2, L=N
2* K; And work as M
2＞N
2The time, P=N
2, L=M
2* K.
Can select per 2 bit exchange order in all even numbered blocks in L the piece and odd number piece Nepit order is constant, step is: first, promptly the 1st to P bit keeps former order constant; And second, promptly P+1 to the 2P bit is incited somebody to action wherein every adjacent two bit exchange order, and every bit only participates in once exchanging, and as P+1 bit and P+2 bit exchange order, P+3 bit and P+4 bit exchange order, the rest may be inferred; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and final realization is with per 2 bit exchange order in all even numbered blocks.
Also can be and even numbered blocks Nepit order is constant with per 2 bit exchange order in all odd number pieces in L the piece, step is: first, i.e. the 1st to P bit, to wherein every adjacent two bit exchange order, every bit only participates in once exchanging, as the 1st bit and the 2nd bit exchange order, the 3rd bit and the 4th bit exchange order, the rest may be inferred; And second, promptly P+1 to the 2P bit keeps former order constant; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and final realization is with per 2 bit exchange order in all odd number pieces.
The present invention has reached the purpose of Bit Interleave by the order of K TPC piece Nepit data output of above control, and can be under the high code check transmission mode, since adopt former patent (application number: 200410006172.6) described interblock interweave cause after the gray mappings before and after different average dispersion of 2 bit confidence coefficients, further reduce signal-noise ratio threshold.
Description of drawings
Fig. 1 is the Trellis code interleaver in the ATSC system.
Fig. 2 is the processing procedure of interleaver in the DVB-T system.
Fig. 3 is the processing procedure of interleaver in the ISDB-T system.
Fig. 4 is the convolutional deinterleaver schematic diagram.
Fig. 5 is TPC (128,120; 128,120) the piece Nepit of the data block example that interweaves.
Fig. 6 is K the Bit Interleave that two-dimentional TPC data block participates in.
Fig. 7 is the chnnel coding structure of ADTB-T system.
Embodiment
Further describe the present invention below in conjunction with drawings and Examples.
The present invention can be applied under the high code check 16-OQAM transmission mode of digital terrestrial television transmission system (ADTB-T system) of the applicant's design, with TPC (M
2, M
1N
2, N
1) encode in conjunction with the ability with raising system antiburst error.To TPC (M
2, M
1N
2, N
1) encoded data piece TPC (M
2* N
2) carry out Bit Interleave and handle.Data block TPC (M behind each total K TPC coding
2* N
2) the participation Bit Interleave.In the ADTB-T system, M
2, M
1, N
2, N
1Be respectively 128,120,128 and 120.Interweave when output, export the data on the same position of each TPC piece according to the order of K TPC piece successively; The diagonal sequence arrangement is pressed in the output of data in each TPC piece.
For high code check 16-OQAM transmission mode, K can be chosen as 32,64,128 or 256.
To 128 two-dimentional TPC pieces (128,128), at first each bit in the piece is carried out following addressing:
The 1st row: (0,0), (0,1) ..., (0,127) }
The 2nd row: (1,0), (1,1) ..., (1,127) }
The 128th row: (127,0), (127,1) ..., (127,127) }.
Fig. 5 has provided M
2=128, N
2Addressing in the piece under=128 situations, and a kind of data output sequence of interweaving of piece inner opposite angle line.The first round exports in proper order by arrow 1 direction; Second takes turns at first and exports in proper order according to arrow 2_a direction, output be over (to (126,127)) continue output according to arrow 2_b direction again; Third round is at first exported in proper order according to arrow 3_a direction, and output is over (to (125,127)) again according to arrow 3_b direction continuation output; The rest may be inferred, takes turns until the 128.
According to the present invention, participate at 128 TPC pieces under the situation of Bit Interleave:
The Bit Interleave first step, data output sequence are such: export (0,0) of (0,0) of the 1st TPC piece, the 2nd TPC piece, (0,0) of the 3rd TPC piece successively ... until (0,0) of the 128th TPC piece; Then, export (1,1) of (1,1) of the 1st TPC piece, the 2nd TPC piece, (1,1) of the 3rd TPC piece ... until (1,1) of the 128th TPC piece; ...; Then, export (127,127) of (127,127) of the 1st TPC piece, the 2nd TPC piece, (127,127) of the 3rd TPC piece ... until (127,127) of the 128th TPC piece; Then, export (0,1) of (0,1) of the 1st TPC piece, the 2nd TPC piece, (0,1) of the 3rd TPC piece ... until (0,1) of the 128th TPC piece; ...; Then, export (127,0) of (127,0) of the 1st TPC piece, the 2nd TPC piece, (127,0) of the 3rd TPC piece ... until (127,0) of the 128th TPC piece; At last, export (127,126) of (127,126) of the 1st TPC piece, the 2nd TPC piece, (127,126) of the 3rd TPC piece ... until (127,126) of the 128th TPC piece.
Second step of Bit Interleave, with per 2 bit exchange order in all even numbered blocks in L=128 * 128 piece (128 bits in every) of above Bit Interleave first step output and odd number piece Nepit order is constant, concrete steps are: first, promptly the 1st to the 128th bit keeps former order constant; And second, promptly the 129th to the 256th bit is incited somebody to action wherein every adjacent two bit exchange order, and every bit only participates in once exchanging, and as the 129th bit and the 130th bit exchange order, the 131st bit and the 132nd bit exchange order, the rest may be inferred; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and final realization is with per 2 bit exchange order in all even numbered blocks.
Then, order is carried out following 128 TPC block interleavings according to this.
As seen, reached the purpose of Bit Interleave of the present invention by the order of 128 TPC pieces of above control Nepit data output.
In fact the Bit Interleave first step has multiple output order.With suffix among Fig. 5 is that the direction of arrow of a is called a group, and suffix is that the direction of arrow of b is called the b group, and the number before a or the b is called label.It is right that the direction of arrow that label is identical among two groups of a, the b constitutes an output, and label to be 1 the direction of arrow do not belong to a or b organizes, it is right to constitute an output separately.Output order can be appointed in a group earlier and got a direction of arrow and along this direction elder generation line output (is example with 4 TPC pieces, then corresponding each addressing position should 4 data of corresponding output), find the identical direction of arrow of label in the b group then, along this direction line output again.Then, in a group, carry out as yet again in the direction of arrow of output, appoint and get one and carry out output, find out the identical direction of arrow of label again in the b group and along this direction line output again, the data on all directions of arrow are all exported and finished along this direction.Be numbered 1 the direction of arrow and can carry out output, also can after any output is to the end of transmission, carry out output at the section start of Bit Interleave.Certainly, output order also can be appointed in the b group earlier and got a direction of arrow and along this direction elder generation line output, find the identical direction of arrow of label in a group then, along this direction line output again.Then, in b group, carry out as yet again in the direction of arrow of output, appoint and get one and carry out output, find out the identical direction of arrow of label again in a group and along this direction line output again, the data on all directions of arrow are all exported and finished along this direction.
Also there is multiple output order in second step of Bit Interleave.As with per 2 bit exchange order in all odd number pieces in L=128 * 128 piece (128 bits in every) of first step output and even numbered blocks Nepit order is constant, concrete steps are: first, i.e. the 1st to the 128th bit, to wherein every adjacent two bit exchange order, every bit only participates in once exchanging, as the 1st bit and the 2nd bit exchange order, the 3rd bit and the 4th bit exchange order, the rest may be inferred; And second, promptly the 129th to the 256th bit keeps former order constant; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and final realization is with per 2 bit exchange order in all odd number pieces.
Above-mentioned all output orders and other output orders based on the principle of the invention, may be summarized to be: under the high code check 16-OQAM transmission mode, during the output of the Bit Interleave first step, (1～K) exports 1 Bit data on the same position of each TPC piece successively, and the data in each TPC piece press the diagonal order and exported according to the order of TPC piece.In Bit Interleave second step, first after finishing the above-mentioned first step and operate with every K TPC piece is output as starting point, is unit with bit stream with P bit, equally spaced is divided into the L piece.Data in the L piece in every of all even numbered blocks or the odd number piece, every adjacent two bit exchange order, every bit only participates in once exchanging, and all the other piece Nepit order remain unchanged.
Claims (7)
1. Bit Interleave method that is used for digital TV ground transmission is in chnnel coding, to two-dimentional Turbo product code coding TPC (M
2, M
1N
2, N
1) afterwards data block TPC (M
2* N
2) carry out the Bit Interleave processing, it is characterized in that: K the data block TPC (M behind the described TPC coding arranged at every turn
2* N
2) participating in Bit Interleave, K is a positive integer;
Described Bit Interleave method comprises following two steps;
The first step at first addresses each bit in K the TPC piece by same procedure; (1～K) exports 1 Bit data on the same position of each TPC piece successively, and the data in each TPC piece press the diagonal order and exported according to the order of TPC piece;
In second step, first after finishing the above-mentioned first step and operate with every K TPC piece is output as starting point, is unit with bit stream with P bit, and P is M
2With N
2In less number, equally spaced be divided into the L piece, L=M
2* N
2* K/P, the data in the L piece in every of all even numbered blocks or the odd number piece, every adjacent two bit exchange order, every bit only participates in once exchanging, and all the other piece Nepit order remain unchanged;
Realize the purpose of Bit Interleave by the order of K TPC piece Nepit data output of above control.
2. Bit Interleave method according to claim 1 is characterized in that: the addressing method to each bit in the two-dimentional TPC piece piece is: first row (0,0), (0,1) ..., (0, M
2-1) }, second row (1,0), (1,1) ..., (1, M
2-1) } ..., N
2Row { (N
2-1,0), (N
2-1,1) ..., (N
2-1, M
2-1) }.
3. Bit Interleave method according to claim 2, it is characterized in that: during the first step that interweaves output, export (0 of (0,0) of the 1st piece, the 2nd piece successively, 0) ... up to (0 of K piece, 0), exports (1 of (1,1) of the 1st piece, the 2nd piece then, 1) ... up to (1 of K piece, 1) ..., export (the N of the 1st piece then
2-1, M
2-1), (N of the 2nd piece
2-1, M
2-1) ... until (the N of K piece
2-1, M
2-1), export then (0,1) of the 1st TPC piece, the 2nd TPC piece (0,1) ... up to (0 of K piece, 1), exports (1,2) of the 1st TPC piece, (1,2) of the 2nd TPC piece then ... up to (1 of K piece, 2) ..., export (the N of the 1st TPC piece then
2-1,0), (N of the 2nd TPC piece
2-1,0) ... until (the N of K piece
2-1,0) ..., export (the N of the 1st TPC piece at last
2-1, M
2-2), (N of the 2nd TPC piece
2-1, M
2-2) ... until (the N of K piece
2-1, M
2-2).
4. according to claim 1 or 2 or 3 described Bit Interleave methods, it is characterized in that: second step that interweaved, first, promptly the 1st to P bit kept former order constant when exporting; And second, i.e. P+1 to the 2P bit, with P+1 bit and P+2 bit exchange order, P+3 bit and P+4 bit exchange order, the rest may be inferred; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and the rest may be inferred; Final realization is with every adjacent 2 bit exchange order in all even numbered blocks, and it is constant to post several piece Nepit order.
5. according to claim 1 or 2 or 3 described Bit Interleave methods, it is characterized in that: interweaved for second when output step, first, i.e. the 1st to P bit, with the 1st bit and the 2nd bit exchange order, the 3rd bit and the 4th bit exchange order, the rest may be inferred; And second, promptly P+1 to the 2P bit keeps former order constant; The 3rd identical with first processing method, and the 4th then the processing method with second is identical, and the rest may be inferred; Final realization is with every adjacent 2 bit exchange order in all odd number pieces, and even numbered blocks Nepit order is constant.
6. Bit Interleave method according to claim 4 is characterized in that: described M
2, M
1, N
2, N
1Be respectively 128,120,128 and 120; Described K is taken as 32 or 64 or 128 or 256.
7. Bit Interleave method according to claim 5 is characterized in that: described M
2, M
1, N
2, N
1Be respectively 128,120,128 and 120; Described K is taken as 32 or 64 or 128 or 256.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100299077A CN1333599C (en) | 2004-03-29 | 2004-03-29 | Bit interleaving method for digital TV ground transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100299077A CN1333599C (en) | 2004-03-29 | 2004-03-29 | Bit interleaving method for digital TV ground transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1638477A CN1638477A (en) | 2005-07-13 |
| CN1333599C true CN1333599C (en) | 2007-08-22 |
Family
ID=34845713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100299077A Expired - Fee Related CN1333599C (en) | 2004-03-29 | 2004-03-29 | Bit interleaving method for digital TV ground transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1333599C (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1248363A (en) * | 1997-12-16 | 2000-03-22 | 日本放送协会 | Transmitter and receiver |
| CN1264509A (en) * | 1997-07-30 | 2000-08-23 | 三星电子株式会社 | Adaptive channel encoding method and device |
-
2004
- 2004-03-29 CN CNB2004100299077A patent/CN1333599C/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1264509A (en) * | 1997-07-30 | 2000-08-23 | 三星电子株式会社 | Adaptive channel encoding method and device |
| CN1248363A (en) * | 1997-12-16 | 2000-03-22 | 日本放送协会 | Transmitter and receiver |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1638477A (en) | 2005-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1186932C (en) | Digital television system | |
| CN1166192C (en) | Data frame structure and synchronization system for digital television signal | |
| CN1281062C (en) | Digital television (DTV) transmission system using enhanced coding schemes | |
| US8799735B2 (en) | Channel interleaver having a constellation-based unit-wise permuation module | |
| CN1163037C (en) | Data vestigial sideband transmitting system | |
| CN1131870A (en) | Trellis coded modulation employing lower dimension ality convolutional encoder | |
| CN104426630B (en) | A kind of Bit Interleaved Coded Modulation method and system | |
| CN1245833C (en) | Transmitter for digital broadcasting system with comprehensive error correcting coding function and method thereof | |
| CN1558558A (en) | Transmitter, receiver and operation method for using the same | |
| CN101779453A (en) | System and method for digital communication having a circulant bit interleaver for equal error protection (eep) and unequal error protection (uep) | |
| CN101453221A (en) | Mapper based on bit weaving code modulation system and mapping process thereof | |
| CN1280993C (en) | Digital broadcasting apparatus and method with different error correcting codes under communication environment | |
| CN1228975C (en) | Transmitting device and method of digital broadcasting system with improved internal random mechanism | |
| CN1333599C (en) | Bit interleaving method for digital TV ground transmission | |
| CN1333598C (en) | Bit interleaving method for digital television ground transmission | |
| CN1200564C (en) | Data interweaving method in digital TV and broadcasting transmission | |
| CN1232117C (en) | Transmitter for digital broadcasting system with comprehensive error correcting coding function and method thereof | |
| CN1251498C (en) | Digital broadcasting system transmitter and method | |
| CN1177475C (en) | Data interlacing method in digital television transmission | |
| CN1333600C (en) | Channel coding method for digital TV ground broadcasting mixing transmission system | |
| CN1245834C (en) | Digital broadcasting transmitter for different error correcting code by communication environment and method thereof | |
| CN100425076C (en) | Data interleaving method in digital TV broadcast transmission | |
| CN1521965A (en) | Method of signal transmission in digital terrestrial broadcast transmission system | |
| CN1228976C (en) | Digital broadcasting system transmitter and method | |
| CN100356784C (en) | Data interlacing method in digital telerision broundcasting transmission |
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: 20070822 Termination date: 20130329 |