CA2278515C - Error prevention method for multimedia - Google Patents
Error prevention method for multimedia Download PDFInfo
- Publication number
- CA2278515C CA2278515C CA002278515A CA2278515A CA2278515C CA 2278515 C CA2278515 C CA 2278515C CA 002278515 A CA002278515 A CA 002278515A CA 2278515 A CA2278515 A CA 2278515A CA 2278515 C CA2278515 C CA 2278515C
- Authority
- CA
- Canada
- Prior art keywords
- error
- decoding
- 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.)
- Expired - Fee Related
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/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
-
- 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
-
- 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/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
-
- 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/0045—Arrangements at the receiver end
-
- 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/1816—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of the same, encoded, message
-
- 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/1825—Adaptation of specific ARQ protocol parameters according to transmission conditions
-
- 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
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) or a third packet when an error occurs in step b), and d) repeating step c) 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.
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
WO 98/31106 PCT/HIt98100004 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).
Backeround Art Let us consider multimedia terminals which transmit and receive arbitrary 0 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 packeta. For each information packet. the transmitter forms N-sized hit-streams which are different representations of given information packets. For example. the transmitter can generate a packet A (B. C. or D) fir given information packet I . Type-1 and 5 Type-~ are different in that they we different retransmission methods. The packet to he transmitted are formed using either convolutional code or RCPC.
FIG. 1 is a block diagram showing a Leneral situation of data transmitted and received using ARQ. The basic concept of Type-1 ARQ will he described a~
follows with reference tc> FIG. 1. When a transmoter transmits a packet A
havtn~
a leneth of M. a packet decoder I?0 in a receiver starts clecodin~ the rrcmyed packet A I1(). At this ume. if errors occur in the packet .1 and no further decudtn~_ is p()SSlble. for example. channel codin~_ is noa employed. channel coding havin~T
a l-hit error or more is employed or. more errors than a channel coder can detect and correct occur. the receiver asla the transmitter to send the same packet A
again. Here. retransmission would he repeated either until the decoder 120 receives an error-free packet A. or for some specific number of iterations t<~
perform transmission and receiyino vyith respect to the next packet. Type-1 ARQ
is very effective in burst-error containing channel. New. Type-? ARQ will be described. Up to now. there are three types of Type-~ ARQ. i.e.. a basic type.
a :, Class A and a Class B. each of which uses RCPC given information I
(J.Ii....l.
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).
Backeround Art Let us consider multimedia terminals which transmit and receive arbitrary 0 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 packeta. For each information packet. the transmitter forms N-sized hit-streams which are different representations of given information packets. For example. the transmitter can generate a packet A (B. C. or D) fir given information packet I . Type-1 and 5 Type-~ are different in that they we different retransmission methods. The packet to he transmitted are formed using either convolutional code or RCPC.
FIG. 1 is a block diagram showing a Leneral situation of data transmitted and received using ARQ. The basic concept of Type-1 ARQ will he described a~
follows with reference tc> FIG. 1. When a transmoter transmits a packet A
havtn~
a leneth of M. a packet decoder I?0 in a receiver starts clecodin~ the rrcmyed packet A I1(). At this ume. if errors occur in the packet .1 and no further decudtn~_ is p()SSlble. for example. channel codin~_ is noa employed. channel coding havin~T
a l-hit error or more is employed or. more errors than a channel coder can detect and correct occur. the receiver asla the transmitter to send the same packet A
again. Here. retransmission would he repeated either until the decoder 120 receives an error-free packet A. or for some specific number of iterations t<~
perform transmission and receiyino vyith respect to the next packet. Type-1 ARQ
is very effective in burst-error containing channel. New. Type-? ARQ will be described. Up to now. there are three types of Type-~ ARQ. i.e.. a basic type.
a :, Class A and a Class B. each of which uses RCPC given information I
(J.Ii....l.
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 'h 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 1 o these procedures are repeated. The basic type has an advantage in that implementation is not so complicated.
F1G. 3 is a conceptual diagram showing the operation of the Class A packet (Lin-Yu 1. wherein * denotes self-decoding and arrows represent combination.
The operational principle thereof is similar to the basic type exe:ept how to combine packets A and B when both packets fail to he decoded. That is. the decoder attempts deeding the combination of packets A and B. and if it fails, the receiver irSkS the transmitter to send the packet A again. Next, if the decoder succeeds demdin~~ only the packet A, the next information .1 is processed, and if the decoder fails. the receiver combines the previously stored packet I3 and currently received G packet A (i.e..~ in general, interleaves the two) m attempt dcc«din~~. This method is more effective in a random error containiniT channel rather than in a burst error cont:rinin« channel.
Mext. Class 13 is si~nificantlyaore complicated than the basic type and the Class A. 'hhe basic concept thereof is based on the Class A. First, the Class A
2~ (Lin-h'u) is performed by generating the packets A and R ~~iven the infornrttion 1 usin~~ RCPC at a rate of !! . As described ahov~, the Type-1 ARQ is ~reatlv effeCIIVC lIl the burst error containin<~ channel. However. with Type-1 ARQ.
retransmission would he more frequent in the random error containin'_ channel.
which causes drastically lower channel throughput. Even though Type-? ARQ
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 1 o these procedures are repeated. The basic type has an advantage in that implementation is not so complicated.
F1G. 3 is a conceptual diagram showing the operation of the Class A packet (Lin-Yu 1. wherein * denotes self-decoding and arrows represent combination.
The operational principle thereof is similar to the basic type exe:ept how to combine packets A and B when both packets fail to he decoded. That is. the decoder attempts deeding the combination of packets A and B. and if it fails, the receiver irSkS the transmitter to send the packet A again. Next, if the decoder succeeds demdin~~ only the packet A, the next information .1 is processed, and if the decoder fails. the receiver combines the previously stored packet I3 and currently received G packet A (i.e..~ in general, interleaves the two) m attempt dcc«din~~. This method is more effective in a random error containiniT channel rather than in a burst error cont:rinin« channel.
Mext. Class 13 is si~nificantlyaore complicated than the basic type and the Class A. 'hhe basic concept thereof is based on the Class A. First, the Class A
2~ (Lin-h'u) is performed by generating the packets A and R ~~iven the infornrttion 1 usin~~ RCPC at a rate of !! . As described ahov~, the Type-1 ARQ is ~reatlv effeCIIVC lIl the burst error containin<~ channel. However. with Type-1 ARQ.
retransmission would he more frequent in the random error containin'_ channel.
which causes drastically lower channel throughput. Even though Type-? ARQ
3 0 allows good performance in the random error containin '1 channel. r etransmlsslon would he more frequent in the burst error containing channel: therefore.
channel throughput can be lowered.
WO 98131106 PCTIKIt98/00004 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-I in the burst error containing ' S 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 h> or the third packet. and d) repeatin<~ step c) until the decoding error no longer occurs.
Brief Description of the Drawings 'I~hc above object and advantage of the present invention will become more 1 ~ apparent by describing in detail a preferred embodiment ther~af with rcfrrence to the attached drawines in which:
FIG. I is a block diagram shcnv~in~ the: <mnerwl situaticm ml data transmission :an~i receptian using an AR(~) method:
E;IG. ~ is a conceptual diagram shcnvine the operam~n uf- a hasiu type.
C; hIG. 3 is a COIICt:pIUal dlagf;ttll ~h()11'111L' the operatu,n of a Clans A:
hIG. 4 is a block diagram shuwin~_ the structure mt an apparatus ti,r rrallnt!_ error prevention accordin!~ to the present invenm,rt:
F1CJ. ~ is a ccmceptual diagram sh roving , pnmedurr Ior pnmeswn,~ of received packets A. B. C and D in a decoder of . receiver shown in FIG. -l:
,nd 2 5 FIG. (i is a flow chart showin~~ a procedure for prc~cessin;~ received packets in a decoder according to the preseta invent ion.
Best Mode For Carrvin~ out the Invention The present invention is a method for performin~_= a hybrid-type ARQ which mixes Type-1 and Type-2 methods.
3 o Referring to FIG. 4. an error prevention apparatus includes: a transmitter provided with a packet buffer 430 for producing packets A. B. C and D using an WO 98131106 PCTIKIt98/0000a RCPC 420 having a rate of 114 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 1 can be obtained with any one of the packets A and B and with a combination of the packets A and B.
l0 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 comblnatlon of packets (~~enerally.
an intcrleavin<~ operation).
FIG. 6 is a flow chart outfinin~ a procedure: for processin~~ the received 5 packets in a decoder according to the present invention.
AS StloV~r1 II7 FIG. 6. the transmitter produces packets A. B. C and D usinz the RCI'C 42t) in step 61 ~. The first packet A is transmitted to the receiver in step 61-1. The decoder attempts decodin~~ the packet A in step 616. In smp 616. if the packet A is dcccxicd. the decoded results are stored in the huf~ter 4s(1 (step 6421 and 2 C'~ the _joh for other information (.e;.!~. , inf~onnation J ) proceeds ( step 64-t ): otlZCrwisr.
an ARQ si~~nal is sent to the transmitter to request transmission ot~ the pue:kct 13 (step 618). 'rhe decoder attempts decoding only the packet R in step 62U. It successful. the decoded results arc oared in the: hul~lcr 45() in step 6-12 and the; jnh fmr onher information (e.~~.. intirrmaticm J) proceeds in step 64-I. If the decoder 2 5 Tails. it then attempts to decode Ih~ (:(lmbllltlc)n O1 the packets A and B in step 622. which is indicated by ''AI3 in FIG. 5. At this time. if the combination of the:
packets A and B as shown in FIG. ~ are decoded. the decoded results are stored in the buffer 450 (step 642) and the job f~c>r other information (e.;~. , information J) proceeds (step b44). If the comhination of the packets A and B is not decoded.
the 3 0 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 for other information (e.~~., information J) proceeds in step 644. Otherwise, the ..._._....____.....~..__~ ~
channel throughput can be lowered.
WO 98131106 PCTIKIt98/00004 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-I in the burst error containing ' S 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 h> or the third packet. and d) repeatin<~ step c) until the decoding error no longer occurs.
Brief Description of the Drawings 'I~hc above object and advantage of the present invention will become more 1 ~ apparent by describing in detail a preferred embodiment ther~af with rcfrrence to the attached drawines in which:
FIG. I is a block diagram shcnv~in~ the: <mnerwl situaticm ml data transmission :an~i receptian using an AR(~) method:
E;IG. ~ is a conceptual diagram shcnvine the operam~n uf- a hasiu type.
C; hIG. 3 is a COIICt:pIUal dlagf;ttll ~h()11'111L' the operatu,n of a Clans A:
hIG. 4 is a block diagram shuwin~_ the structure mt an apparatus ti,r rrallnt!_ error prevention accordin!~ to the present invenm,rt:
F1CJ. ~ is a ccmceptual diagram sh roving , pnmedurr Ior pnmeswn,~ of received packets A. B. C and D in a decoder of . receiver shown in FIG. -l:
,nd 2 5 FIG. (i is a flow chart showin~~ a procedure for prc~cessin;~ received packets in a decoder according to the preseta invent ion.
Best Mode For Carrvin~ out the Invention The present invention is a method for performin~_= a hybrid-type ARQ which mixes Type-1 and Type-2 methods.
3 o Referring to FIG. 4. an error prevention apparatus includes: a transmitter provided with a packet buffer 430 for producing packets A. B. C and D using an WO 98131106 PCTIKIt98/0000a RCPC 420 having a rate of 114 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 1 can be obtained with any one of the packets A and B and with a combination of the packets A and B.
l0 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 comblnatlon of packets (~~enerally.
an intcrleavin<~ operation).
FIG. 6 is a flow chart outfinin~ a procedure: for processin~~ the received 5 packets in a decoder according to the present invention.
AS StloV~r1 II7 FIG. 6. the transmitter produces packets A. B. C and D usinz the RCI'C 42t) in step 61 ~. The first packet A is transmitted to the receiver in step 61-1. The decoder attempts decodin~~ the packet A in step 616. In smp 616. if the packet A is dcccxicd. the decoded results are stored in the huf~ter 4s(1 (step 6421 and 2 C'~ the _joh for other information (.e;.!~. , inf~onnation J ) proceeds ( step 64-t ): otlZCrwisr.
an ARQ si~~nal is sent to the transmitter to request transmission ot~ the pue:kct 13 (step 618). 'rhe decoder attempts decoding only the packet R in step 62U. It successful. the decoded results arc oared in the: hul~lcr 45() in step 6-12 and the; jnh fmr onher information (e.~~.. intirrmaticm J) proceeds in step 64-I. If the decoder 2 5 Tails. it then attempts to decode Ih~ (:(lmbllltlc)n O1 the packets A and B in step 622. which is indicated by ''AI3 in FIG. 5. At this time. if the combination of the:
packets A and B as shown in FIG. ~ are decoded. the decoded results are stored in the buffer 450 (step 642) and the job f~c>r other information (e.;~. , information J) proceeds (step b44). If the comhination of the packets A and B is not decoded.
the 3 0 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 for other information (e.~~., information J) proceeds in step 644. Otherwise, the ..._._....____.....~..__~ ~
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 ' 5 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 joh for other information (e.g.) information J) proceeds (step 644). Otherwise, the transmitter 1 o is requested to transmit the packet D by sending the ARQ signal thereto in step 632 . The decoder then attempts decoding curly the packet 17 in step 634. I f successful. the decoded results arc stored in the huffier 45U 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 "CI7 in FIG. _5. If the combination of packets C' and h is decoded.
the receiver stores the decoded results in the buffer 45() (step 642 ) and performs the job for other int«rmation (e.~~., information J) (step 6441. C>therwise, the receiver combines packets C and D with packet R as indicated by ~HCh in FIG. 5 and attempts dccodin!~ the combination in step 63R. I Ierc:. if the c:umhination of packet:
B. C and 17 is dcccxlcd, the decoded results arc ste~rcd in th c buffer 450 lstep 642) and the juh ter other- information (e.~~.. information JI proceeds (step 644).
()therwisc. the receiver combines packets 13. C and I) with packet A as indicated by ' AI3CI) in FIG. 5 and attempts durudin~~ W~Illhlllatlllttl It1 SICp W().
If the combination of packets A. B. C and I) is decoded, the receiver stores the decoded results Irl tht.' buffer 450 (step 642) alld performs the job for other information (e.«.. information .l ) (step 644). Otherwise, the process returns m step 614 t«
repeat all of these procedures until no errors occur. Meamvhile. the receiver stores the decoded results in the buffer 450 in step 642 at~d performs the job for the next information (e.y.. information J. h....) in step 644.
Industrial Applicability As described above. the present invention has the characteristics of both Type-1 and Type-? ARQ methods: therefore. one can obtain constant channel 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-1 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.
r.. . ..... r
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 ' 5 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 joh for other information (e.g.) information J) proceeds (step 644). Otherwise, the transmitter 1 o is requested to transmit the packet D by sending the ARQ signal thereto in step 632 . The decoder then attempts decoding curly the packet 17 in step 634. I f successful. the decoded results arc stored in the huffier 45U 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 "CI7 in FIG. _5. If the combination of packets C' and h is decoded.
the receiver stores the decoded results in the buffer 45() (step 642 ) and performs the job for other int«rmation (e.~~., information J) (step 6441. C>therwise, the receiver combines packets C and D with packet R as indicated by ~HCh in FIG. 5 and attempts dccodin!~ the combination in step 63R. I Ierc:. if the c:umhination of packet:
B. C and 17 is dcccxlcd, the decoded results arc ste~rcd in th c buffer 450 lstep 642) and the juh ter other- information (e.~~.. information JI proceeds (step 644).
()therwisc. the receiver combines packets 13. C and I) with packet A as indicated by ' AI3CI) in FIG. 5 and attempts durudin~~ W~Illhlllatlllttl It1 SICp W().
If the combination of packets A. B. C and I) is decoded, the receiver stores the decoded results Irl tht.' buffer 450 (step 642) alld performs the job for other information (e.«.. information .l ) (step 644). Otherwise, the process returns m step 614 t«
repeat all of these procedures until no errors occur. Meamvhile. the receiver stores the decoded results in the buffer 450 in step 642 at~d performs the job for the next information (e.y.. information J. h....) in step 644.
Industrial Applicability As described above. the present invention has the characteristics of both Type-1 and Type-? ARQ methods: therefore. one can obtain constant channel 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-1 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.
r.. . ..... r
Claims (4)
1. 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.
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.
2. An error prevention method as claimed in claim 1, 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).
3. An error protecting method as claimed in claim 1, 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.
4. An error prevention method as claimed in claim 3, wherein decoding is sequentially performed starting from when the number of combined packets is two and including a latest packet determined to he a decoding error packets.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/782,174 US5954839A (en) | 1997-01-14 | 1997-01-14 | Error protection method for multimedia data |
| US08/782,174 | 1997-01-14 | ||
| PCT/KR1998/000004 WO1998031106A1 (en) | 1997-01-14 | 1998-01-12 | Error prevention method for multimedia |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2278515A1 CA2278515A1 (en) | 1998-07-16 |
| CA2278515C true CA2278515C (en) | 2003-07-15 |
Family
ID=25125221
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002278515A Expired - Fee Related CA2278515C (en) | 1997-01-14 | 1998-01-12 | Error prevention method for multimedia |
Country Status (13)
| Country | Link |
|---|---|
| US (2) | US5954839A (en) |
| EP (2) | EP1499058A3 (en) |
| JP (2) | JP3492380B2 (en) |
| KR (1) | KR100230331B1 (en) |
| CN (2) | CN100555926C (en) |
| AU (1) | AU731511B2 (en) |
| BR (1) | BR9806956A (en) |
| CA (1) | CA2278515C (en) |
| DE (1) | DE19881949T1 (en) |
| ES (1) | ES2156577B1 (en) |
| GB (1) | GB2347056B (en) |
| RU (3) | RU2294055C2 (en) |
| WO (1) | WO1998031106A1 (en) |
Families Citing this family (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI103540B (en) * | 1997-04-28 | 1999-07-15 | Nokia Mobile Phones Ltd | A method for transferring packet switched data from a mobile system |
| DE19749148C2 (en) * | 1997-11-06 | 1999-12-02 | Siemens Ag | Method and device for data transmission in a digital transmission system with ARQ |
| US6101168A (en) | 1997-11-13 | 2000-08-08 | Qualcomm Inc. | Method and apparatus for time efficient retransmission using symbol accumulation |
| US6704898B1 (en) * | 1998-10-23 | 2004-03-09 | Telefonaktiebolaget Lm Ericsson (Publ) | Combined hybrid automatic retransmission request scheme |
| DE19935911A1 (en) * | 1999-07-30 | 2001-02-15 | Siemens Ag | Process for the transmission of data packets |
| FI109251B (en) | 1999-09-10 | 2002-06-14 | Nokia Corp | Communication method, radio system, radio transmitter and radio receiver |
| EP1137217A1 (en) * | 2000-03-20 | 2001-09-26 | Telefonaktiebolaget Lm Ericsson | ARQ parameter negociation in a data packet transmission system using link adaptation |
| DE10022270B4 (en) * | 2000-05-08 | 2006-07-27 | Siemens Ag | Method and communication system for transmitting coded data packets |
| US7249185B1 (en) * | 2000-10-30 | 2007-07-24 | Cisco Technology, Inc. | Methods, devices and software for redundant transmission of voice data over a packet network connection established according to an unreliable communication protocol |
| AU2001230642A1 (en) * | 2000-10-30 | 2002-05-15 | Nortel Networks Limited | Automatic request protocol based packet transmission using punctured codes |
| KR100525384B1 (en) * | 2000-10-31 | 2005-11-02 | 엘지전자 주식회사 | Method for controlling packet retransmission in mobile communication system |
| DE10054022A1 (en) * | 2000-11-01 | 2002-05-08 | Bayerische Motoren Werke Ag | Method for operating a heat engine |
| US6621871B2 (en) * | 2001-03-30 | 2003-09-16 | Nokia Corporation | Incremental redundancy packet combiner and decoder |
| US20030039226A1 (en) * | 2001-08-24 | 2003-02-27 | Kwak Joseph A. | Physical layer automatic repeat request (ARQ) |
| US6700867B2 (en) * | 2001-12-20 | 2004-03-02 | Motorola, Inc. | Method and system for reduced memory hybrid automatic repeat request |
| US20050224596A1 (en) * | 2003-07-08 | 2005-10-13 | Panopoulos Peter J | Machine that is an automatic pesticide, insecticide, repellant, poison, air freshener, disinfectant or other type of spray delivery system |
| KR100989314B1 (en) * | 2004-04-09 | 2010-10-25 | 삼성전자주식회사 | display apparatus |
| US20060198442A1 (en) * | 2004-12-28 | 2006-09-07 | Curt Jutzi | Method, apparatus and system for frame level recovery using a collection of badly received frames |
| US7509568B2 (en) * | 2005-01-11 | 2009-03-24 | International Business Machines Corporation | Error type identification circuit for identifying different types of errors in communications devices |
| CN100384117C (en) * | 2005-09-16 | 2008-04-23 | 南京信风软件有限公司 | Data transmission error control |
| JP2009532954A (en) | 2006-03-31 | 2009-09-10 | クゥアルコム・インコーポレイテッド | Memory management for high-speed media access control |
| JP2008042338A (en) * | 2006-08-02 | 2008-02-21 | Oki Electric Ind Co Ltd | Error correction method for vehicle-to-vehicle communication, and vehicle-to-vehicle communication system |
| KR101397207B1 (en) * | 2007-06-12 | 2014-05-20 | 삼성전자주식회사 | Method and apparatus for receiving/transmitting common control channels in a mobile communication system |
| US20090031185A1 (en) * | 2007-07-23 | 2009-01-29 | Texas Instruments Incorporated | Hybrid arq systems and methods for packet-based networks |
| US8132069B2 (en) * | 2007-12-13 | 2012-03-06 | Qualcomm Incorporated | Selective HARQ combining scheme for OFDM/OFDMA systems |
| US8161342B2 (en) * | 2007-12-13 | 2012-04-17 | Qualcomm Incorporated | Forward and reverse shifting selective HARQ combining scheme for OFDMA systems |
| US8194588B2 (en) * | 2007-12-13 | 2012-06-05 | Qualcomm Incorporated | Coding block based HARQ combining scheme for OFDMA systems |
| ES2519766T3 (en) | 2007-12-20 | 2014-11-07 | Optis Wireless Technology, Llc | Control channel signaling using a common signaling field for the transport format and the redundancy version |
| CN101304537B (en) * | 2008-03-24 | 2010-06-09 | 北京邮电大学 | 3g-ip wireless video transmission system |
| US8473802B2 (en) * | 2009-06-30 | 2013-06-25 | Samsung Electronics Co., Ltd. | Technique for advanced ARQ buffer management in wireless communication system |
| US8543659B2 (en) | 2010-03-02 | 2013-09-24 | Qualcomm Incorporated | Apparatus and method for user equipment battery information reporting |
| CN102957511B (en) * | 2012-10-26 | 2015-05-20 | 中国船舶重工集团公司第七二二研究所 | Adaptive deceleration method of data transmission |
| RU2517717C1 (en) * | 2012-11-15 | 2014-05-27 | Ярослав Афанасьевич Хетагуров | Method of determining violations and correcting violated codes of bit positions in "1 from 4" coding |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4914699A (en) * | 1988-10-11 | 1990-04-03 | Itt Corporation | High frequency anti-jam communication system terminal |
| US5157687A (en) * | 1989-06-29 | 1992-10-20 | Symbol Technologies, Inc. | Packet data communication network |
| JPH04141896A (en) * | 1990-10-02 | 1992-05-15 | Nec Corp | Serial-parallel conversion circuit |
| WO1993006671A1 (en) * | 1991-09-20 | 1993-04-01 | Motorola, Inc. | Extended error correction of a transmitted data message |
| 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 |
| JP3388035B2 (en) | 1994-09-16 | 2003-03-17 | 富士通株式会社 | Data communication system, transmission apparatus and transmission method using hybrid automatic repeat request method |
| US5689439A (en) * | 1995-03-31 | 1997-11-18 | Lucent Technologies, Inc. | Switched antenna diversity transmission method and system |
| US5671156A (en) * | 1995-03-31 | 1997-09-23 | Lucent Technologies Inc. | Transmission method and system for JPEG images |
| US6012159A (en) * | 1996-01-17 | 2000-01-04 | Kencast, Inc. | Method and system for error-free data transfer |
| US6216250B1 (en) * | 1997-01-27 | 2001-04-10 | Hughes Electronics Corporation | Error encoding method and apparatus for satellite and cable signals |
-
1997
- 1997-01-14 US US08/782,174 patent/US5954839A/en not_active Ceased
- 1997-08-29 KR KR1019970042940A patent/KR100230331B1/en not_active IP Right Cessation
-
1998
- 1998-01-12 CA CA002278515A patent/CA2278515C/en not_active Expired - Fee Related
- 1998-01-12 RU RU2002114593/09A patent/RU2294055C2/en not_active IP Right Cessation
- 1998-01-12 EP EP04104501A patent/EP1499058A3/en not_active Withdrawn
- 1998-01-12 AU AU56809/98A patent/AU731511B2/en not_active Ceased
- 1998-01-12 CN CNB021443106A patent/CN100555926C/en not_active Expired - Fee Related
- 1998-01-12 EP EP98901114A patent/EP0953230B1/en not_active Expired - Lifetime
- 1998-01-12 CN CN98801824A patent/CN1106095C/en not_active Expired - Fee Related
- 1998-01-12 WO PCT/KR1998/000004 patent/WO1998031106A1/en active IP Right Grant
- 1998-01-12 DE DE19881949T patent/DE19881949T1/en not_active Withdrawn
- 1998-01-12 RU RU2001120239/09A patent/RU2234806C2/en not_active IP Right Cessation
- 1998-01-12 GB GB9916132A patent/GB2347056B/en not_active Expired - Fee Related
- 1998-01-12 BR BR9806956A patent/BR9806956A/en not_active IP Right Cessation
- 1998-01-12 RU RU99118011/09A patent/RU2195768C2/en not_active IP Right Cessation
- 1998-01-12 JP JP53076698A patent/JP3492380B2/en not_active Expired - Fee Related
- 1998-01-12 ES ES009950035A patent/ES2156577B1/en not_active Expired - Lifetime
-
2001
- 2001-09-21 US US09/996,086 patent/USRE40661E1/en not_active Expired - Lifetime
-
2002
- 2002-12-16 JP JP2002364268A patent/JP3727305B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JP2000508151A (en) | 2000-06-27 |
| US5954839A (en) | 1999-09-21 |
| AU731511B2 (en) | 2001-03-29 |
| KR100230331B1 (en) | 1999-11-15 |
| GB2347056B (en) | 2002-05-08 |
| RU2195768C2 (en) | 2002-12-27 |
| GB2347056A (en) | 2000-08-23 |
| KR19980069910A (en) | 1998-10-26 |
| GB9916132D0 (en) | 1999-09-08 |
| RU2002114593A (en) | 2004-02-10 |
| AU5680998A (en) | 1998-08-03 |
| ES2156577A1 (en) | 2001-06-16 |
| CN1106095C (en) | 2003-04-16 |
| CA2278515A1 (en) | 1998-07-16 |
| WO1998031106A1 (en) | 1998-07-16 |
| EP1499058A3 (en) | 2011-02-16 |
| EP0953230A1 (en) | 1999-11-03 |
| USRE40661E1 (en) | 2009-03-10 |
| ES2156577B1 (en) | 2002-03-01 |
| BR9806956A (en) | 2000-03-21 |
| RU2234806C2 (en) | 2004-08-20 |
| CN1423449A (en) | 2003-06-11 |
| CN1243617A (en) | 2000-02-02 |
| EP0953230B1 (en) | 2004-11-24 |
| RU2294055C2 (en) | 2007-02-20 |
| JP2003179579A (en) | 2003-06-27 |
| EP1499058A2 (en) | 2005-01-19 |
| JP3492380B2 (en) | 2004-02-03 |
| CN100555926C (en) | 2009-10-28 |
| JP3727305B2 (en) | 2005-12-14 |
| DE19881949T1 (en) | 2000-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2278515C (en) | Error prevention method for multimedia | |
| FI105734B (en) | Automatic retransmission | |
| US6904555B2 (en) | Decoding apparatus and decoding method, and data receiving apparatus and data receiving method | |
| KR100656982B1 (en) | Apparatus and method for decoding of portable internet mobile system | |
| KR101689906B1 (en) | Method and equipment for rate matching | |
| EP1206040A2 (en) | Low delay channel codes for correcting bursts of lost packets | |
| JPH08289295A (en) | Apparatus and method for transmitting and receiving jpeg image through communication medium | |
| JP2002501707A (en) | Method and apparatus for error protection of wireless file transfer | |
| JPH10210016A (en) | Method and device for communicating data packet | |
| KR20020085854A (en) | Apparatus and method for generating codes in communication system | |
| JP3658829B2 (en) | Data communication method | |
| JP4028176B2 (en) | Low latency decoding | |
| JP2002043953A (en) | Error correction method and error correction device | |
| US8077743B2 (en) | Method and apparatus for offset interleaving of vocoder frames | |
| GB2368759A (en) | Error prevention method for multimedia data packets | |
| EP1610468B1 (en) | Turbo decoder with detection of error-free sub-blocks | |
| JP3316730B2 (en) | Data communication device | |
| Cam et al. | Performance analysis of some hard-decision combining schemes | |
| JP3309278B2 (en) | Decoding device and encoding device | |
| JP3507894B2 (en) | Error correction method and error correction code generation device | |
| Kallel | Efficient adaptive cooling rate hybrid ARQ protocols | |
| KR0142312B1 (en) | Automatic sync. detection system of digital transmission signal | |
| Sherratt et al. | Manuscript for Journal of Circuits, Systems, and Computers | |
| Sherratt et al. | A block coprocessor for user data rate improvements to GPRS coding scheme 4 | |
| JPH08107365A (en) | Digital audio system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20160112 |