GB2368759A - Error prevention method for multimedia data packets - Google Patents
Error prevention method for multimedia data packets Download PDFInfo
- Publication number
- GB2368759A GB2368759A GB0202514A GB0202514A GB2368759A GB 2368759 A GB2368759 A GB 2368759A GB 0202514 A GB0202514 A GB 0202514A GB 0202514 A GB0202514 A GB 0202514A GB 2368759 A GB2368759 A GB 2368759A
- Authority
- GB
- United Kingdom
- Prior art keywords
- decoding
- error
- packets
- packet
- channel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/0059—Convolutional codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
- H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
- H03M13/6375—Rate compatible punctured convolutional [RCPC] codes
-
- 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/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
- H04L1/1845—Combining techniques, e.g. code combining
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
An error prevention method for multimedia improves data recovery and channel throughput in channels which cause a random error and a burst error by using a rate compatible punctured convolutional code (RCPC) and an automatic retransmission on request (ARQ). In a process of decoding a plurality of packets of given information, the error prevention method includes the steps of a) decoding one of the plurality of packets, b) decoding another packet when an error occurs during the decoding in step a), c) decoding a combination of the packets from steps a) and b) when an error occurs in step b), d) receiving and decoding a further packet when an error occurs in step c), e) decoding combinations of received packets when an error occurs in step d), and repeating steps d) and e) until the decoding error no longer occurs. The error prevention method has the characteristics of both Type-1 and Type-2 ARQ methods. Therefore, one can obtain constant channel throughput in the burst error containing channel, the random error containing channel, and a channel wherein the two error patterns coexist simultaneously.
Description
I IIIc ERROR PREVENTION METHOD FOR MULTIMEDIA
Technical Field, The present invention relates to an error prevention method for multimedia. and more particularly. to a method for improving data recovery and channel throughput in channels wherein a random error and a burst error occur by using a rate compatible punctured convolutional code (RCPC) and an automatic retransmission on request (ARQ).
Background Art
Let us consider multimedia terminals which transmit and receive arbitrary packets of data (video, audio, data, or a mixed form of any of those three). The transmitter transmits information packets, for example, I, J, and other packets. For each information packet, the transmitter forms N-sized bit-streams which are different representations of given information packets. For example, the transmitter
can generate a packet A (B, C. or D) for given information packet I. Type-1 and p Type-2 are different in that they use different retransmission methods. The packets to be transmitted are formed using either convolutional code or RCPC.
FIG. 1 is a block diagram showing a general situation of data transmitted 9 -I and received using ARQ. The basic concept of Type-1 ARQ will be described as follows with reference to FIG. 1. When a transmitter transmits a packet A having a length of N. a packet decoder 120 in a receiver starts decoding the received packet A 110. At this time. if errors occur in the packet A and no further decoding is possible. for example, channel coding is not employed. channel coding having a 1-bit error or more is employed or. more errors than a channel coder can detect and correct occur. the receiver asks the transmitter to send the same packet A again. Here. retransmission would be repeated either until the decoder 120 receives an error-free packet A. or for some specific number of iterations to perform transmission and receiving with respect to the next packet. Type-1 ARQ is very effective in burst-error containing channel. Next. Type-2 ARQ will he described. Up to now. there are three types of Type-2 ARQ. i. e.. a basic type. a
Class A and a Class B. each of which uses RCPC given information I (J. K....).
FIG. 2 is a conceptual diagram showing the operation of the basic type, wherein arrows represent combination. Here, given information I, the transmitter generates packets A and B using RCPC at a rate of 112 and transmits only the packet
A. The decoder in the receiver attempts to decode the packet A. If successful. the decoder then attempts to decode the first packet of two for the next information J.
Otherwise. the receiver asks the transmitter to send the packet B. Also, the decoder attempts decoding a combination of packets A and B. If successful, the decoder then attempts to decode the first packet of two for the next information J.
Otherwise, the receiver asks the transmitter to send the packet A again and all of these procedures are repeated. The basic type has an advantage in that implementation is not so complicated.
FIG. 3 is a conceptual diagram showing the operation of the Class A packet (Lin-Yu), wherein * denotes self-decoding and arrows represent combination. The operational principle thereof is similar to the basic type except how to combine packets A and B when both packets fail to be decoded. Ttmt is, the decoder attempts decoding the combination of packets A and B. and if it fails, the receiver asks the transmitter to send the packet A again. Next. if the decoder succeeds decoding tir packet A. the next information J is processed. and if the decoder fails, the receiver combines the previously stored packet B and currently received packet A (i. e.. in general, interleaves the two) to attempt decoding. This method is more effective in a random error containing channel rather than in a burst error containing channel.
Next. Class B is significantly more complicated than the basic type and the
Class A. The basic concept thereof is based on the Class A. First. the Class A (Lin-Yu) is performed by generating the packets A and B given the information I using RCPC at a rate of'/2. As described above. the Type-1 ARQ is greatly effective in the burst error containing channel. However, with Type-1 ARQ. retransmission would be more frequent in the random error containing channel.
which causes drastically lower channel throughput. Even though Type-2 ARQ a) tows good performance in the random error containing channel, retransmission would be more frequent m [he hurst error containing charmel : [hcrefore. channel throughput can be lowered.
Disclosure of Invention It is an object of the present invention to provide a method for maintaining channel throughput at a certain level in a random error containing channel and a
burst error containing channel by operating like Type-1 in the burst error containing I It channel. while operating similarly to a basic type or a Class A of Type-2 in the random error containing channel.
To accomplish the above object, there is provided an error prevention method in a method for decoding a plurality of packets of given information, comprising the steps of a) decoding one of the plurality of packets. b) decoding another packet when an error occurs in the decoding in step a). c) decoding a combination of the decoding error packets when an error occurs in step b) or the third packet, and d) repeating step c) until the decoding error no longer occurs.
Brief Description of the Drawings
The above object and advantage of the present inventionUI become more apparent by describing in detail a preferred embodiment thereof with reference to the attached drawings in which: n FIG. Lis a biock diagram showing the general situation of data transmission and reception using an ARQ method :
FIG. 2 is a conceptual diagram showing the operation of a basic type;
FIG. 3 is a conceptual diagram showing the operation of a Class A :
FIG. 4 is a block diagram showing the structure of an apparatus for realizing error prevention according to the present invention ;
FIG. 5 is a conceptual diagram showing a procedure for processing of received packets A. B. C and D in a decoder of a receiver shown in FIG. 4: and
FIG. 6 is a flow chart showing a procedure for processing received packets
in a decoder according to the present invention. z Best Mode For Carrying out the Invention The present invention is a method for performing a hybrid-type ARQ which
mixes Type-l and Type-2 methods.
Referring to FIG. 4. an error prevention apparatus includes : a [ransmmer provided with a packet buffer 430 for producing packets A. B. C and D using an
RCPC 420 having a rate of 1/4 for given information packet I 410 ; an inverse RCPC 440 ; and a receiver provided with a buffer 450 for storing the received packet, for sending an ARQ and a packet number to the transmitter via a channel.
In FIG. 4, an RCPC logic is fixed at a rate of 1/4. A portion comprised of four arbitrary polynomials which satisfies a locally invertible characteristic simultaneously produces RCPC-processed packets A, B, C and D. Also, the transmitter has a maximum of four retransmissions. Here, the local inversion in the RCPC denotes that original information I can be obtained with any one of the packets A and B and with a combination of the packets A and B.
FIG. 5 is a conceptual view showing a procedure for processing the received packets A, B, C and D in the decoder of the receiver shown in FIG. 4, wherein * indicates self-decoding and a bracket indicates a combination of packets (generally, an interleaving operation).
FIG. 6 is a flow chart outlining a procedure for processing the received packets in a decoder according to the present invention.
As shown in FIG. 6, the transmitter produces packets A, B, C and D using the RCPC 420 in step 612. The first packet A is transmitted to the receiver in step 614. The decoder attempts decoding the packet A in step 616. In step 616. if the packet A is decoded, the decoded results are stored in the buffer 450 (step 642) and the job for other information (e. g., information J) proceeds (step 644); otherwise, an ARQ signal is sent to the transmitter to request transmission of the packet B (step 618). The decoder attempts decoding only the packet B in step 620. If successful, the decoded results are stored in the buffer 450 in step 642 and the job for other information (e. g., information J) proceeds in step 644. If the decoder fails. it then attempts to decode the combination of the packets A and B in step 622, which is indicated by *AB in FIG. 5. At this time, if the combination of the packets A and B as shown in FIG. 5 are decoded, the decoded results are stored in the buffer 450 (step 642) and the job for other information (e. g.. information J) proceeds (step 644). If the combination of the packets A and B is not decoded. the transmitter is requested to transmit the packet C by sending the ARQ signal thereto
in step 624. The decoder then attempts decoding only packet C in step 626. If successful. the decoded results are stored in the buffer 450 in step 642 and the job
*,-..- -1'.-- < -/. < ,-. f,-..-.- < . :, T\-. . ) : . \t. . < ii ULUt iimjiiiianii -c'* n't'* /pttu m Lt- -t-t /nif wu, m
decoder attempts to decode the combination of the packets B and C in step 628, which is indicated by *BC in FIG. 5. If the combination of the packets B and C is successfully decoded, the decoded results are stored in the buffer 450 (step 642) and the job for other information (e. g., information J) proceeds (step 644). If the combination thereof is not decoded, the combination of packets B and C is combined with packet A as shown in FIG. 5 as *ABC and decoding is attempted in step 630. Here, if the combination of packets A, B and C is decoded ; the decoded results are stored in the buffer 450 (step 642) and the job for other information (e. g. , information J) proceeds (step 644). Otherwise, the transmitter is requested to transmit the packet D by sending the ARQ signal thereto in step 632. The decoder then attempts decoding only the packet D in step 634. If successful, the decoded results are stored in the buffer 450 in step 642 and the job for other information (e. g., information J) proceeds in step 644. Otherwise, the decoder attempts to decode the combination of packets C and D in step 636, which is indicated by *CD in FIG. 5. If the combination of packets C and D is decoded, the receiver stores the decoded results in the buffer 450 (step 642) and performs the job for other information (e. g.. information J) (step 644). Otherwise. the receiver combines packets C and D with packet B as indicated by *BCD in FIG. 5 and attempts decoding the combination in step 638. Here, if the combination of packets
B, C and EL is decoded, the decoded results are stored in the buffer 450 (step 642) and the job for other information (e. g.. information J) proceeds (step 644).
Otherwise, the receiver combines packets B. C and D with packet A as indicated by *ABCD in FIG. 5 and attempts decoding combination in step 640. If the combination of packets A, B, C and D is decoded, the receiver stores the decoded results in the buffer 450 (step 642) and performs the job for other information (e. g., information J) (step 644). Otherwise, the process returns to step 614 to repeat all of these procedures until no errors occur. Meanwhile. the receiver stores the decoded results in the buffer 450 in step 642 and performs the job for the next information (e. g.. information J. K....) in step 644.
Industrial Applicability
As described above. the present invention has the characteristics of both
'r I r I ai-i'U'lype-, L uiic CCll'l t) t5tall-I L. 01-istti'ii throughput in the burst error containing channel, the random error containing channel, and a channel where the two error patterns coexist simultaneously. In the burst error containing channel, the method of the present invention is performed nearly the same as or better than the Type-l method and much better than the
Type-2 method. As for the random error containing channel, since the method of the present invention is performed similar to the Type-2 method, it also performs almost the same as the Type-2 method, but much better than the Type-1 method.
Claims (6)
1. A method of protecting against errors during the decoding of a plurality of packets of given information, comprising the steps of: a) decoding one of said plurality of packets; b) decoding another packet when an error occurs during said decoding in said step a); c) decoding a further packet when an error occurs during said decoding in step b); and d) repeating said step c) until no decoding error occurs.
2. A method for protecting against errors during the decoding of a plurality of packets of given information, comprising the steps of: a) receiving and decoding one of said plurality of packets; b) receiving and decoding another packet when an error occurs during said decoding in said step a); c) decoding a combination of any received packets when an error occurs during said decoding in said step b); and d) receiving a further one of said plurality of packets when an error occurs during said decoding in said step c),
and decoding a combination of said further packet and at least one of the other received packets.
3. A method for preventing errors during the decoding a plurality of packets of given information, comprising the steps of: a) decoding one of said plurality of packets; b) decoding another packet when an error occurs during said decoding in said step a); c) decoding a combination of said packets of said steps a) and b) or a third packet when an error occurs during said decoding in said step b); and d) repeating said step c) until said decoding error no longer occurs.
4. An error prevention method as claimed in claim 3, further comprising the step of, storing said decoded results and standing by decoding of a plurality of packets of the next information when said decoding error no longer occurs during said steps a) to d).
5. An error protecting method as claimed in claim 3, wherein, at least two decoding error packets are combined and decoded when the number of said packets in said step c) is at least three.
6. An error prevention method as claimed in claim 5, wherein decoding is sequentially performed starting from when the number of combined packets is two and including a latest packet determined to be a decoding error packet.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/782,174 US5954839A (en) | 1997-01-14 | 1997-01-14 | Error protection method for multimedia data |
| GB9916132A GB2347056B (en) | 1997-01-14 | 1998-01-12 | Method for protecting against errors |
Publications (3)
| Publication Number | Publication Date |
|---|---|
| GB0202514D0 GB0202514D0 (en) | 2002-03-20 |
| GB2368759A true GB2368759A (en) | 2002-05-08 |
| GB2368759B GB2368759B (en) | 2002-06-19 |
Family
ID=26315751
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| GB0202515A Expired - Fee Related GB2368760B (en) | 1997-01-14 | 1998-01-12 | Error prevention method for multimedia |
| GB0202514A Expired - Fee Related GB2368759B (en) | 1997-01-14 | 1998-01-12 | Error prevention method for multimedia |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| GB0202515A Expired - Fee Related GB2368760B (en) | 1997-01-14 | 1998-01-12 | Error prevention method for multimedia |
Country Status (1)
| Country | Link |
|---|---|
| GB (2) | GB2368760B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005041469A1 (en) * | 2003-10-23 | 2005-05-06 | Philips Intellectual Property & Standards Gmbh | Decoding and reconstruction of data |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007099468A1 (en) * | 2006-03-03 | 2007-09-07 | Koninklijke Philips Electronics N.V. | Method and apparatus for transmitting and receiving a data block in a wireless communication system |
| CN101304537B (en) * | 2008-03-24 | 2010-06-09 | 北京邮电大学 | 3g-ip wireless video transmission system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5487068A (en) * | 1994-07-29 | 1996-01-23 | Motorola, Inc. | Method for providing error correction using selective automatic repeat requests in a packet-switched communication system |
-
1998
- 1998-01-12 GB GB0202515A patent/GB2368760B/en not_active Expired - Fee Related
- 1998-01-12 GB GB0202514A patent/GB2368759B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5487068A (en) * | 1994-07-29 | 1996-01-23 | Motorola, Inc. | Method for providing error correction using selective automatic repeat requests in a packet-switched communication system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005041469A1 (en) * | 2003-10-23 | 2005-05-06 | Philips Intellectual Property & Standards Gmbh | Decoding and reconstruction of data |
Also Published As
| Publication number | Publication date |
|---|---|
| GB2368760B (en) | 2002-06-19 |
| GB2368759B (en) | 2002-06-19 |
| GB0202515D0 (en) | 2002-03-20 |
| GB2368760A (en) | 2002-05-08 |
| GB0202514D0 (en) | 2002-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| USRE40661E1 (en) | Error prevention method for multimedia data | |
| JP4083240B2 (en) | Turbo coding with gradual data transmission and processing | |
| KR100480251B1 (en) | Apparatus and method for generating codes in communication system | |
| KR101597733B1 (en) | Rate matching for a wireless communications system | |
| KR100724921B1 (en) | Code generating and decoding apparatus and method in communication system | |
| US7475330B2 (en) | Method and apparatus for generating a punctured symbol vector for a given information vector | |
| KR20020034226A (en) | Method for transfer packet form to automatic repeat request hybrid | |
| JPH10210016A (en) | Method and device for communicating data packet | |
| JP2002508894A (en) | Method and apparatus for communicating blocks of digital information between transmitting and receiving stations | |
| GB2368759A (en) | Error prevention method for multimedia data packets | |
| WO2002037741A9 (en) | Method and arrangement for providing optimal bit protection against transmission errors | |
| JPH10276100A (en) | Error correction system in digital communication | |
| US20120326898A1 (en) | Coding and Decoding by Means of a Trellis Coded Modulation System | |
| JP2004088388A (en) | Receiver, method for processing received data, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PCNP | Patent ceased through non-payment of renewal fee |
Effective date: 20150112 |