USRE40661E1 - Error prevention method for multimedia data - Google Patents

Error prevention method for multimedia data Download PDF

Info

Publication number
USRE40661E1
USRE40661E1 US09/996,086 US99608601A USRE40661E US RE40661 E1 USRE40661 E1 US RE40661E1 US 99608601 A US99608601 A US 99608601A US RE40661 E USRE40661 E US RE40661E
Authority
US
United States
Prior art keywords
packets
decoding
error
packet
combination
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 - Lifetime
Application number
US09/996,086
Inventor
Dong-Seek Park
John Villasenor
Feng Chen
Max Luttrell
Brendan Dowling
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
University of California
Original Assignee
Samsung Electronics Co Ltd
University of California
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Samsung Electronics Co Ltd, University of California filed Critical Samsung Electronics Co Ltd
Priority to US09/996,086 priority Critical patent/USRE40661E1/en
Application granted granted Critical
Publication of USRE40661E1 publication Critical patent/USRE40661E1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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
    • 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
    • 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

Definitions

  • 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). Further, this invention has been adopted by the ITUT/SG16/Q11Mobile Group.
  • RCPC rate compatible punctured convolutional code
  • ARQ automatic retransmission on request
  • the transmitter transmits information packets, for example, I, J, and other packets.
  • the transmitter forms N-sized bitstreams which are different representations of given information packets.
  • the transmitter can generate a packet A (B, C, or D) for given information packet Type-1 and 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 and received using ARQ.
  • the basic concept of Type-1 ARQ will be described as follows with reference to FIG. 1 .
  • a packet decoder 120 in a receiver starts decoding the received packet A 110 .
  • the receiver asks the transmitter to send the same packet A again.
  • Type-1 ARQ is very effective in burst-error containing channel.
  • Type-2 ARQ will be 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.
  • the transmitter generates packets A and B using RCPC at a rate of 1 ⁇ 2 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. That 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 only the 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.
  • Class B is significantly more complicated than the basic type and the Class A.
  • the basic concept thereof is based on the Class A.
  • the Class A (Lin-Yu) is performed by generating the packets A and B given the information I using RCPC at a rate of 1 ⁇ 2.
  • the Type-1 ARQ is greatly effective in the burst error containing channel.
  • retransmission would be more frequent in the random error containing channel, which causes drastically lower channel throughput.
  • Type-2 ARQ allows good performance in the random error containing channel, retransmission would be more frequent in the burst error containing channel; therefore, channel throughput can be lowered.
  • 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.
  • FIG. 1 is a block 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 ;
  • FIG. 6 is a flow chart showing a procedure for processing received packets in a decoder according to the present invention.
  • the present invention is a method for performing a hybrid-type ARQ which mixes Type-1 and Type-2 methods.
  • an error prevention apparatus includes: a transmitter 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.
  • 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.
  • the transmitter has a maximum of four retransmissions.
  • 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.
  • 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 .
  • 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 .
  • 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 .
  • 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 .
  • the decoded results are stored in the buffer 450 (step 642 ) and the job for other information (e.g., information J) proceeds (step 644 ).
  • the transmitter is requested to transmit the packet C by sending the ARQ signal thereto in step 624 .
  • the decoder 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.g., 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 a) 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.
  • step 630 decoding is attempted in step 630 .
  • the decoded results are stored in the buffer 450 (step 642 ) and the job for other information (e.g., information J) proceeds (step 644 ).
  • 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.
  • 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 .
  • 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 .
  • 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 .
  • information J information J
  • the present invention 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 where the two error patterns coexist simultaneously.
  • 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.
  • 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.

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)
  • Error Detection And Correction (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

An error protection 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 protection 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 protection method has the characteristics of both Type-1 and Type-2 ARQ methods. Therefore, one can obtain constant channel throughput in a channel containing burst errors, a channel containing random errors, and a channel in which the two types of error patterns coexist simultaneously.

Description

BACKGROUND OF THE INVENTION
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). Further, this invention has been adopted by the ITUT/SG16/Q11Mobile Group.
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 bitstreams 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 Type-1 and 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 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 be 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 ½ 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. That 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 only the 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 ½. 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 allows good performance in the random error containing channel, retransmission would be more frequent in the burst error containing channel; therefore, channel throughput can be lowered.
SUMMARY OF THE 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 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 invention will become more apparent by describing in detail a preferred embodiment thereof with reference to the attached drawings in which:
FIG. 1 is a block 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.
 DETAILED DESCRIPTION OF THE INVENTION
The present invention is a method for performing a hybrid-type ARQ which mixes Type-1 and Type-2 methods.
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 RCPC 420 having a rate of ¼ 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 ¼. 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 for other information (e.g., 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 a) 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. S. 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 D 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.
As described above, the present invention 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 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.

Claims (17)

1. A method of protecting error from occurring during 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 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) unit no decoding error occurs.
2. An error protecting method as claimed in claim 1, further comprising the step of, storing the decoded results and standing by decoding of a plurality of packets of next information when no decoding error 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 protection 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 have a decoding error.
5. A method of protecting from an error occurring during the decoding of a plurality of packets of given information, comprising:
a) decoding a first packet which is one of the plurality of packets; and
b) combining the first packet with two or more other packets of the plurality of packets when an error occurs in the decoding in a), wherein said two or more other packets are packets which had an error occur during decoding thereof.
6. A method of protecting from an error occurring during the decoding of a plurality of packets of given information, comprising:
a) decoding a first packet which is one of the plurality of packets;
b) combining the first packet with a second packet when an error occurs in the decoding in a), wherein said second packet is one of the plurality of packets and is a packet which had an error occur during decoding thereof;
c) combining the first packet with a combination of the second packet and at least a third packet and decoding the packets combined in c), when an error occurs in the decoding in b), wherein said third packet is one of the plurality of packets and is a packet which had an error occur during decoding thereof; and
d) repeating c) if an error occurs in the decoding of c).
7. An error protection method as claimed in claim 6, further comprising storing one of the decoded results and standing by the stored decoded result when no decoding error occurs in any one of a) to c).
8. A method of protecting errors during decoding of a plurality of packets of given information, comprising:
a) decoding a first packet of said plurality of packets;
b) decoding a second packet of said plurality of packets when an error occurs during the decoding of said first packet;
c) decoding a combination of said first and second packets when an error occurs, during decoding of the second packet; and
d) decoding a third packet of said plurality of packets when an error occurs during the decoding of said first and second packets, and when an error occurs in decoding said combination of said first and second packets.
9. An error protection method as claimed in claim 8, further comprising:
e) decoding a combination of two or more of said first through third packets when an error occurs during the decoding in step d).
10. An error protection method as claimed in claim 9, further comprising:
f) if an error occurs e), repeating step e) using a different combination of packets.
11. An error protection apparatus for protecting errors from occurring during decoding of a plurality of packets of given information, comprising:
a buffer coupled to a transmission channel and storing packets received from a transmitter;
a decoder unit which decodes one or more packets stored in the buffer,
wherein in response to generating an error upon decoding a combination of the packets, said decoder unit decodes a second combination of packets stored in said buffer, wherein said second combination of packets is different from said first combination of packets.
12. The error protection apparatus as claimed in claim 11, wherein in response to said decoder unit generating a decoding error, said buffer transmits a signal to the transmitter causing the transmitter to transmit another of the plurality of packets.
13. An error protection apparatus for protecting errors from occurring during decoding of a plurality of packets of given information, comprising:
a buffer coupled to a transmission channel and storing packets received from a transmitter;
decoder means for decoding one or more packets stored in the buffer,
wherein in response to generating an error upon decoding a combination of the packets, said decoder means decodes a second combination of packets stored in said buffer, wherein said second combination of packets is different from said first combination of packets.
14. The error protection apparatus as claimed in claim 13, wherein in response to said decoder means generating a decoding error, said buffer transmits a signal to the transmitter causing the transmitter to transmit another of the plurality of packets.
15. A method of protecting errors from occurring during 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); and
(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).
16. A method of protecting from an error occurring during the decoding of a plurality of packets of given information, comprising:
(a) decoding a first packet which is one of the plurality of packets; and
(b) combining the first packet with two or more other packets of the plurality of packets when an error occurs in the decoding in (a).
17. An error protection apparatus for protecting errors from occurring during decoding of a plurality of packets of given information, comprising:
a buffer coupled to a transmission channel and storing packets received from a transmitter; and
a decoder unit which decodes one or more packets stored in the buffer, wherein in response to generating an error upon decoding a combination of the packets, said decoder unit decodes a second combination of packets stored in said buffer.
US09/996,086 1997-01-14 2001-09-21 Error prevention method for multimedia data Expired - Lifetime USRE40661E1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US09/996,086 USRE40661E1 (en) 1997-01-14 2001-09-21 Error prevention method for multimedia data

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
US09/996,086 USRE40661E1 (en) 1997-01-14 2001-09-21 Error prevention method for multimedia data

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US08/782,174 Reissue US5954839A (en) 1997-01-14 1997-01-14 Error protection method for multimedia data

Publications (1)

Publication Number Publication Date
USRE40661E1 true USRE40661E1 (en) 2009-03-10

Family

ID=25125221

Family Applications (2)

Application Number Title Priority Date Filing Date
US08/782,174 Ceased US5954839A (en) 1997-01-14 1997-01-14 Error protection method for multimedia data
US09/996,086 Expired - Lifetime USRE40661E1 (en) 1997-01-14 2001-09-21 Error prevention method for multimedia data

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US08/782,174 Ceased US5954839A (en) 1997-01-14 1997-01-14 Error protection method for multimedia data

Country Status (13)

Country Link
US (2) US5954839A (en)
EP (2) EP0953230B1 (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) RU2195768C2 (en)
WO (1) WO1998031106A1 (en)

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI103540B1 (en) * 1997-04-28 1999-07-15 Nokia Mobile Phones Ltd Method of transmitting packet-shaped data in a mobile telephone 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
CA2427491A1 (en) * 2000-10-30 2002-05-10 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
CN101411134B (en) 2006-03-31 2013-08-21 高通股份有限公司 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
EP2383920B1 (en) 2007-12-20 2014-07-30 Optis Wireless Technology, LLC Control channel signaling using a common signaling field for transport format and 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

Citations (9)

* Cited by examiner, † Cited by third party
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
EP0479296A1 (en) * 1990-10-02 1992-04-08 Nec Corporation Serial-parallel converting circuit
US5157687A (en) * 1989-06-29 1992-10-20 Symbol Technologies, Inc. Packet data communication network
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
JPH0888620A (en) 1994-09-16 1996-04-02 Fujitsu Ltd Data communication system by hybrid automatic re-transmission request system
EP0735701A2 (en) 1995-03-31 1996-10-02 AT&T IPM Corp. Switched antenna diversity transmission method and system using ARQ techniques
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2940881B2 (en) * 1991-09-20 1999-08-25 モトローラ・インコーポレイテッド Extended error correction for transmitted data messages

Patent Citations (10)

* Cited by examiner, † Cited by third party
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
EP0479296A1 (en) * 1990-10-02 1992-04-08 Nec Corporation Serial-parallel converting circuit
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
JPH0888620A (en) 1994-09-16 1996-04-02 Fujitsu Ltd Data communication system by hybrid automatic re-transmission request system
EP0735701A2 (en) 1995-03-31 1996-10-02 AT&T IPM Corp. Switched antenna diversity transmission method and system using ARQ techniques
US5671156A (en) * 1995-03-31 1997-09-23 Lucent Technologies Inc. Transmission method and system for JPEG images
US5689439A (en) * 1995-03-31 1997-11-18 Lucent Technologies, Inc. Switched antenna diversity transmission method and system
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

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
Baker et al., "Mode S System Design and Architecture", IEEE, pp. 1689-1694, 1989. *
Gold et al., "Error Correction Strategy for Data Broadcasting", IEEE, pp. 323-327, 1988. *
Pingzhi et al., "Linear Unequal Error-Protection Array Codes", IEEE, pp. 333-334, Jan. 1988. *
Shiozaki, "Unequal Error-Protection of PCM Signals by Self-Orthogonal Convolutional Codes", IEEE, pp. 289-290, 1980. *
Stephen B. Wicker, "Adaptive Rate Error Control Through the Use of Diversity Combining and Majority Logic Decoding in a Hybrid-ARQ Protocol", IEEE, pp. 29.6.1-29.6.6, 1989. *

Also Published As

Publication number Publication date
KR100230331B1 (en) 1999-11-15
RU2195768C2 (en) 2002-12-27
EP1499058A3 (en) 2011-02-16
GB2347056A (en) 2000-08-23
CA2278515A1 (en) 1998-07-16
ES2156577A1 (en) 2001-06-16
GB9916132D0 (en) 1999-09-08
JP2000508151A (en) 2000-06-27
WO1998031106A1 (en) 1998-07-16
CN1423449A (en) 2003-06-11
EP1499058A2 (en) 2005-01-19
JP2003179579A (en) 2003-06-27
ES2156577B1 (en) 2002-03-01
CN1243617A (en) 2000-02-02
US5954839A (en) 1999-09-21
RU2234806C2 (en) 2004-08-20
JP3727305B2 (en) 2005-12-14
EP0953230A1 (en) 1999-11-03
CA2278515C (en) 2003-07-15
RU2002114593A (en) 2004-02-10
BR9806956A (en) 2000-03-21
CN1106095C (en) 2003-04-16
CN100555926C (en) 2009-10-28
KR19980069910A (en) 1998-10-26
EP0953230B1 (en) 2004-11-24
AU731511B2 (en) 2001-03-29
AU5680998A (en) 1998-08-03
DE19881949T1 (en) 2000-04-13
GB2347056B (en) 2002-05-08
JP3492380B2 (en) 2004-02-03
RU2294055C2 (en) 2007-02-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
JP3910770B2 (en) Error control method and receiver using the method
KR100480251B1 (en) Apparatus and method for generating codes in communication system
US6904555B2 (en) Decoding apparatus and decoding method, and data receiving apparatus and data receiving method
EP0855108B1 (en) A coding system and method providing unequal error protection by puncturing less significant symbols
CN101741527B (en) Rate adaption method and device
JPH10210016A (en) Method and device for communicating data packet
US6516441B1 (en) Device and method for transmitting subframe in mobile communication system
GB2368759A (en) Error prevention method for multimedia data packets
JPH10276100A (en) Error correction system in digital communication
JP2004088388A (en) Receiver, method for processing received data, and program
Liu et al. Performance of video transport over wireless networks using hybrid ARQ
JP2004080188A (en) Receiver, reception processing method for received data and program

Legal Events

Date Code Title Description
FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 12