[go: up one dir, main page]

WO2003090360A1 - Systeme de communication numerique tolerant les defaillances provoquees par la perte de synchronisation utilisant la correction d'effacement sans voie de retour - Google Patents

Systeme de communication numerique tolerant les defaillances provoquees par la perte de synchronisation utilisant la correction d'effacement sans voie de retour Download PDF

Info

Publication number
WO2003090360A1
WO2003090360A1 PCT/US2003/011969 US0311969W WO03090360A1 WO 2003090360 A1 WO2003090360 A1 WO 2003090360A1 US 0311969 W US0311969 W US 0311969W WO 03090360 A1 WO03090360 A1 WO 03090360A1
Authority
WO
WIPO (PCT)
Prior art keywords
superpackets
fxc
information
parity
synchronization loss
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.)
Ceased
Application number
PCT/US2003/011969
Other languages
English (en)
Inventor
Jill Macdonald Boyce
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.)
Thomson Licensing SAS
Original Assignee
Thomson Licensing SAS
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 Thomson Licensing SAS filed Critical Thomson Licensing SAS
Priority to EP03719826A priority Critical patent/EP1497925A4/fr
Priority to US10/511,638 priority patent/US8046667B2/en
Priority to CN038121182A priority patent/CN1656691B/zh
Priority to JP2003587012A priority patent/JP4226481B2/ja
Priority to MXPA04010332A priority patent/MXPA04010332A/es
Priority to AU2003222632A priority patent/AU2003222632A1/en
Priority to KR1020047016685A priority patent/KR100996619B1/ko
Publication of WO2003090360A1 publication Critical patent/WO2003090360A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/373—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon 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
    • 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
    • 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/0041—Arrangements at the transmitter 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/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/0057—Block 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/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1515—Reed-Solomon codes

Definitions

  • the present invention generally relates to communication systems and, more particularly, to a synchronization loss resilient digital communication system using Forward Erasure Correction (FXC).
  • FXC Forward Erasure Correction
  • Wireless digital communications systems are subject to multi-path and fades, which can lead to loss of synchronization.
  • the data transmitted during periods of lost synchronization are normally lost to the receiver.
  • the problem to be solved is how to design a wireless digital communication system that is resilient to synchronization loss due to multi-path and fading, with as low an overhead rate as possible.
  • the ATSC 8VSB system includes several types of channel coding to protect against noisy transmission, including trellis coding, interleaving, and Reed Solomon (RS) Forward Error Correction (FEC). But when synchronization loss occurs, the channel coding methods used do not assist in recovering the data.
  • RS Reed Solomon
  • FEC Forward Error Correction
  • Repeatedly transmitting data can improve system resiliency synchronization loss, but at the cost of high overhead. Allocating more of the available bandwidth to repeated transmission of data reduces the amount of original data that can be transmitted, which means fewer programs, or lower quality of transmitted programs. It has also been proposed that instead of repeatedly transmitting the original data, the overhead rate could be reduced by redundantly transmitting a lower bit- rate version of the original data. When the original data is lost due to synchronization loss, the reduced resolution version is used by the receiver. This allows graceful degradation, i.e., a lower quality version of the original data is available rather than the original data. However, if the original higher resolution data is required, the reduced resolution version may prove unsatisfactory.
  • an apparatus for enabling recovery of missing information in a digital communication system.
  • the apparatus includes a Forward Erasure Correction (FXC) encoder for computing FXC parity superpackets across information superpackets for subsequent recovery of any entire ones of the information superpackets that have been at least partially compromised due to synchronization loss.
  • FXC Forward Erasure Correction
  • an apparatus for recovering missing information in a digital communication system includes a Forward Erasure Correction (FXC) decoder for decoding FXC parity superpackets previously computed across information superpackets to recover any entire ones of the information superpackets that have been at least partially compromised due to synchronization loss.
  • FXC Forward Erasure Correction
  • a method for enabling recovery of missing information in a digital communication system includes the step of computing FXC parity superpackets across information superpackets for subsequent recovery of any entire ones of the information superpackets that have been at least partially compromised due to synchronization loss.
  • a method for recovering missing information in a digital communication system includes the step of decoding FXC parity superpackets previously computed across information superpackets to recover any entire ones of the information superpackets that have been at least partially compromised due to synchronization loss.
  • FIG. 1 is a schematic diagram illustrating a Vestigial Side Band (VSB) transmitter, according to an illustrative embodiment of the present invention
  • FIG. 2 is a schematic diagram illustrating a Vestigial Side Band (VSB) receiver, according to an illustrative embodiment of the present invention.
  • VSB Vestigial Side Band
  • FIG. 3 is a diagram illustrating an example pattern of superpacket loss, according to an illustrative embodiment of the present invention.
  • the present invention is directed to a synchronization loss resilient digital communication system using Forward Erasure Correction (FXC).
  • FXC Forward Erasure Correction
  • the present invention employs Forward Erasure Correction (FXC) codes to recover from synchronization loss, by treating periods of sync loss as packet erasures. Additional parity data to recover from those packet erasures is transmitted in a backwards- compatible manner. This allows a reduction in the overhead rate, as compared to repeatedly transmitting data.
  • FXC Forward Erasure Correction
  • the present invention may be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination thereof.
  • the present invention is implemented as a combination of hardware and software.
  • the software is preferably implemented as an application program tangibly embodied on a program storage device.
  • the application program may be uploaded to, and executed by, a machine comprising any suitable architecture.
  • the machine is implemented on a computer platform having hardware such as one or more central processing units (CPU), a random access memory (RAM), and input/output (I/O) interface(s).
  • CPU central processing units
  • RAM random access memory
  • I/O input/output
  • the computer platform also includes an operating system and microinstruction code.
  • various processes and functions described herein may either be part of the microinstruction code or part of the application program (or a combination thereof) that is executed via the operating system.
  • various other peripheral devices may be connected to the computer platform such as an additional data storage device and a printing device.
  • FXC Forward Erasure Correction
  • Reed Solomon codes are systematic codes, i.e., the original information bytes are transmitted as well as additional parity bytes. In the absence of channel loss, the receiver can merely use the received original information bytes, and does not need to do any FXC decoding. Packet networks tend to lose entire packets of data, rather than individual bytes in the packets. When FXC is used to protect against packet loss, typically (but not necessarily) one byte from each packet is used to form a FXC codeword. For example, if 10 packets of length 1024 bytes were coded using FXC, using RS (15, 10) codes, 10 information packets of length 1024 and 5 parity packets of length 1024 would be transmitted.
  • FXC Forward Erasure Correction
  • FXC is used in addition to other channel coding methods in the digital communications system that protect against impulse noise.
  • FXC coding is added to the system's trellis coding, interleaving and Reed Solomon (RS) Forward Error Correction (FEC) coding.
  • the FXC used can be any systematic forward erasure correction code including, but not limited to, for example, Reed Solomon (RS) codes.
  • the present invention can be backwards compatible. That is, an existing decoder can ignore the additional parity superpackets transmitted and decode the unchanged information superpackets normally.
  • the FXC encoder and decoder differ from any RS FEC codes already used in an existing digital communications system. For example, the FXC codewords are computed across superpackets (e.g., at one byte per superpacket) and protect against loss (erasure) of entire superpackets.
  • the existing RS FEC protects against random bit or byte errors, not erasures, inside a given packet, with the samples taken from nearby points in time.
  • the FXC parameters n and k, and the superpacket length s are selected based on desired loss protection level and allowable delay.
  • the parameter n denotes the block length of an FXC codeword.
  • the parameter k denotes the number of information symbols in an FXC codeword.
  • Additional storage may be required for the present invention, beyond what a standard ATSC 8VSB system would require, of s * n bytes, which for this example is 2.4 M Bytes. If multiple programs share the 19.2 Mbps channel bandwidth, storage requirements could be reduced by performing the FXC decoding only for the program being decoded.
  • FIG. 1 is a schematic diagram illustrating a Vestigial Side Band (VSB) transmitter 100, according to an illustrative embodiment of the present invention. It is to be appreciated that while an exemplary transmitter configuration has been described and shown herein for illustrative purposes with respect to FIG. 1 , the present invention may readily be applied to other transmitter configurations capable of VSB signal transmission while maintaining the spirit and scope of the present invention.
  • VSB Vestigial Side Band
  • the transmitter 100 includes 1 source encoder 105, an FXC encoder 110, a transport MUX 115, a frame synchronizer 120, a data randomizer 125, a Reed Solomon (RS) encoder 130, a data interleaver 135, a SYNC insertion module 140, a pilot insertion module 145, an 8-VSB modulator 150, and an analog up-converter 155.
  • RS Reed Solomon
  • the compressed bit stream from the source encoder 105 is processed by the FXC encoder 110, which adds redundancy by creating parity superpackets.
  • the inputs from various sources are combined by the transport MUX 115 into a composite stream that is fed to the frame sychronizer 120.
  • Data frames are created and delineated by the frame synchronizer 120. Each data frame includes two fields. Each data field has 313 data segments in the ATSC standard including a frame- synchronizing segment. Each data segment carries a 188-byte transport packet and associated Forward Error Correction (FEC) overhead.
  • the data randomizer 125 is used on all input data to randomize only the data payload (not including the overhead and synchronizing elements).
  • the Reed Solomon (RS) encoder 130 is a block encoder that takes in 187 bytes and adds 20 parity bytes for outer forward error correction at the receiver.
  • the byte data is interleaved by the data interieaver 135, which uses a convolutional interieaver operating over 52 data segments (about a sixth of a field deep).
  • a two-thirds rate, 4-state trellis-encoding scheme with one un-encoded bit that is pre-coded, is implemented by the trellis encoder 136.
  • a data segment sync is inserted into every data segment and a data field sync is inserted into every data field, by the sync insertion module 140.
  • a pilot signal is introduced by adding a Direct Current (DC) component to every symbol, by the pilot insertion module 145.
  • DC Direct Current
  • the 8-VSB modulator 150 maps the symbols (generated at 10.76 Msymbols/sec ) onto a 8-VSB constellation and generates a root Nyquist pulse corresponding to each symbol.
  • the analog upconverter 155 then converts the signal to the desired carrier frequency for transmission.
  • the ATSC 8VSB system uses MPEG-2 Transport Streams in the transport MUX 115, which allows multiple programs to be multiplexed and sent over the same channel, with each program assigned a different Process IDentifier (PID).
  • PID Process IDentifier
  • the information superpackets are unchanged from a system that does not use FXC.
  • additional parity superpackets are transmitted that are assigned different PIDs by the transport MUX 115 than the information superpackets. If multiple programs are to be transmitted, each with a different PID, then the parity superpackets can be either be computed based on all programs together, or based on one or more individual programs. All data is then sent to the remaining channel coding portions of the ATSC 8VSB, which need not be changed from a standard system.
  • special FXC Sync Transport Packets can be sent under a different PID, once for each n superpackets.
  • FIG. 2 is a schematic diagram illustrating a Vestigial Side Band (VSB) receiver 200, according to an illustrative embodiment of the present invention. It is to be appreciated that while an exemplary receiver configuration has been described and shown herein for illustrative purposes with respect to FIG. 2, the present invention may readily be applied to other receiver configurations capable of VSB signal reception while maintaining the spirit and scope of the present invention.
  • VSB Vestigial Side Band
  • the receiver 200 includes a tuner 205, an Intermediate Frequency (IF) Filter and SYNC Detector 210, a SYNC and timing module 215, an equalizer 220, a phase tracker 225, a trellis decoder 230, a data interieaver 235, a Reed Solomon (RS) decoder 240, a data de-randomizer 245, a transport DEMUX 250, an FXC decoder 260, and a source decoder 265.
  • IF Intermediate Frequency
  • SYNC and timing module 215 an equalizer 220
  • phase tracker 225 e.g., a phase tracker 225
  • a trellis decoder 230 e.g., a data interieaver 235
  • RS Reed Solomon
  • Signals are demodulated in the receiver 200 by applying the reverse principles that were applied in the transmitter 100 of FIG. 1. That is, incoming VSB signals are received, down-converted, filtered, and then detected. The segment synchronization and the frame synchronization are then recovered. An incoming signal is converted to an intermediate frequency by the tuner 205. Channel selectivity is performed by the IF filter and SYNC detector 210. Timing recovery and coarse carrier recovery are then accomplished by the SYNC and timing module 215. The signal is then equalized at the equalizer 220 to remove all multipath components.
  • One of the advantages of the VSB system is that complex equalization is not necessary since the equalizer operates only on the l-channel or real information.
  • the output of the equalizer 220 is applied to a phase tracker 225 to remove the residual phase jitter.
  • the output of the phase tracker 225 is applied to a trellis-decoder 230 that corresponds to the inner code of the concatenated Forward Error Correction (FEC) system.
  • the output of the trellis decoder 230 is applied to a data de-interleaver 235 that spreads burst errors induced by the trellis decoder.
  • the de-interleaved data is then applied to a block-based Reed Solomon (RS) decoder 240 that corresponds to the outer code in the concatenated coding system.
  • RS Reed Solomon
  • the output of the RS decoder 240 i.e., the channel decoded data, is then processed by the data de-randomizer 245, which corresponds to the inverse process at the transmitter.
  • the de-randomized data is then fed to the transport de- multiplexer 250 which separates the composite stream into component streams for processing respectively by an audio source decoder, a video source decoder, and data source decoder (collectively represented by source decoder 260).
  • the FXC decoder 260 is placed after the other channel decoding blocks (e.g., RS decoder 260) and the transport DEMUX 250, and before the source decoder 265.
  • Superpacket sequence numbers and positions can be determined using the FXC Sync Transport Packets. Erasure positions can be made available to the FXC decoder 260 using an error indication signal from one of the prior channel coding blocks, such as the RS decoder 240.
  • the transport_error_indicator field in the transport packet can be used to indicate the location of errors.
  • FXC decoding is not necessary, and the FXC decoder 260 just passes through the data in the information superpackets to the source decoder 265. If synchronization loss occurs, and is detected, those superpackets with missing or corrupted data are marked as erasures. If k or more superpackets are received correctly, whether information or parity superpackets, the FXC decoder 260 perfectly reconstructs the missing information packets, by performing decoding of s RS(n, k) codewords, taking one byte from each superpacket to form the codewords. Of course, more than one byte may be taken from each superpacket to form the codewords.
  • Superpackets 0-3 are information superpackets, and superpackets 4 and 5 are parity superpackets. Superpackets 3 and 4 are corrupted at the receiver due to synchronization loss.
  • FXC decoding is performed on 400 thousand codewords, each formed by taking the ith byte of superpackets 0, 1 , 2, and 5, with the 3rd and 4th positions marked as erasures.
  • Superpacket 3 is perfectly reconstructed by the FXC decoder 260, and superpackets 0-3 are sent onto the source decoder 265. An illustration of this example is provided in FIG.
  • FIG. 3 is a diagram illustrating an example pattern 300 of superpacket loss, according to an illustrative embodiment of the present invention.
  • ATSC Advanced Television Systems Committee
  • FIG. 3 is a diagram illustrating an example pattern 300 of superpacket loss, according to an illustrative embodiment of the present invention.
  • ATSC Advanced Television Systems Committee
  • FIG. 3 is a diagram illustrating an example pattern 300 of superpacket loss, according to an illustrative embodiment of the present invention.

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)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

L'invention concerne un dispositif permettant de récupérer des informations manquantes (Fig. 3) dans un système de communication numérique (100). Le dispositif comprend un codeur (110) à correction d'effacement sans voie de retour (FXC) conçu pour calculer les superpaquets à parité FXC parmi les superpaquets d'informations afin de récupérer ultérieurement tout superpaquet d'informations complet au moins en partie endommagé par la perte de synchronisation.
PCT/US2003/011969 2002-04-19 2003-04-17 Systeme de communication numerique tolerant les defaillances provoquees par la perte de synchronisation utilisant la correction d'effacement sans voie de retour Ceased WO2003090360A1 (fr)

Priority Applications (7)

Application Number Priority Date Filing Date Title
EP03719826A EP1497925A4 (fr) 2002-04-19 2003-04-17 Systeme de communication numerique tolerant les defaillances provoquees par la perte de synchronisation utilisant la correction d'effacement sans voie de retour
US10/511,638 US8046667B2 (en) 2002-04-19 2003-04-17 Synchronization loss resilient digital communication system using forward erasure correction
CN038121182A CN1656691B (zh) 2002-04-19 2003-04-17 使用前向消除校正的同步丢失弹性数字通信系统
JP2003587012A JP4226481B2 (ja) 2002-04-19 2003-04-17 前方消失訂正を使用する同期損失回復デジタル通信システム
MXPA04010332A MXPA04010332A (es) 2002-04-19 2003-04-17 Sistema de comunicacion digital flexible a perdida de sincronizacion usando correccion de eliminacion avanzada.
AU2003222632A AU2003222632A1 (en) 2002-04-19 2003-04-17 Synchronization loss resilient digital communication system using forward erasure correction
KR1020047016685A KR100996619B1 (ko) 2002-04-19 2003-04-17 순방향 소거 정정을 이용한 동기 손실에 탄력적인 디지털 통신 시스템

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US37405402P 2002-04-19 2002-04-19
US60/374,054 2002-04-19

Publications (1)

Publication Number Publication Date
WO2003090360A1 true WO2003090360A1 (fr) 2003-10-30

Family

ID=29251127

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/011969 Ceased WO2003090360A1 (fr) 2002-04-19 2003-04-17 Systeme de communication numerique tolerant les defaillances provoquees par la perte de synchronisation utilisant la correction d'effacement sans voie de retour

Country Status (7)

Country Link
EP (1) EP1497925A4 (fr)
JP (1) JP4226481B2 (fr)
KR (1) KR100996619B1 (fr)
CN (1) CN1656691B (fr)
AU (1) AU2003222632A1 (fr)
MX (1) MXPA04010332A (fr)
WO (1) WO2003090360A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102035912B1 (ko) * 2017-12-29 2019-10-24 주식회사 픽스트리 Ｉｐ 네트워크를 이용하여 스트림 패킷 전송 시 패킷 손실 검출 및 복구 방법 및 장치

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0996291A1 (fr) 1998-10-22 2000-04-26 Lucent Technologies Inc. Méthode et appareil de codage et transmission d'images codées par MPEG sur l'Internet
US6163870A (en) * 1997-11-06 2000-12-19 Compaq Computer Corporation Message encoding with irregular graphing
US6195777B1 (en) * 1997-11-06 2001-02-27 Compaq Computer Corporation Loss resilient code with double heavy tailed series of redundant layers

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002009692A (ja) * 2000-06-23 2002-01-11 Matsushita Electric Ind Co Ltd データ伝送装置及びデータ伝送方法
MXPA03000389A (es) * 2000-07-13 2003-09-25 Dow Global Technologies Inc Peliculas tubulares de capas tubulares, metodo y aparato para preparar las mismas.

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6163870A (en) * 1997-11-06 2000-12-19 Compaq Computer Corporation Message encoding with irregular graphing
US6195777B1 (en) * 1997-11-06 2001-02-27 Compaq Computer Corporation Loss resilient code with double heavy tailed series of redundant layers
EP0996291A1 (fr) 1998-10-22 2000-04-26 Lucent Technologies Inc. Méthode et appareil de codage et transmission d'images codées par MPEG sur l'Internet

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
ANNEX D, RF/TRANSMISSION SYSTEMS CHARACTERISTICS, 16 September 1995 (1995-09-16), pages 46 - 60
G. CARLE: "RTMC: An Error Control Protocol for IP-based Audio-Visual Multicast Applications", PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, 12 October 1998 (1998-10-12), pages 566 - 573, XP002128250
P. CHOU ET AL.: "Error Control for Receiver-Driven Layered Multicast of audio and Video", IEEE TRANSACTIONS ON MULTIMEDIA, vol. 3, no. 1, March 2001 (2001-03-01), pages 108 - 122, XP002638180, DOI: doi:10.1109/6046.909598
See also references of EP1497925A4 *

Also Published As

Publication number Publication date
KR100996619B1 (ko) 2010-11-25
CN1656691B (zh) 2010-05-12
EP1497925A4 (fr) 2008-07-30
JP2005523637A (ja) 2005-08-04
JP4226481B2 (ja) 2009-02-18
CN1656691A (zh) 2005-08-17
KR20050005449A (ko) 2005-01-13
MXPA04010332A (es) 2005-02-03
AU2003222632A1 (en) 2003-11-03
EP1497925A1 (fr) 2005-01-19

Similar Documents

Publication Publication Date Title
US7167212B2 (en) VSB reception system with enhanced signal detection or processing supplemental data
KR101532315B1 (ko) 모바일 역량을 지닌 고선명 텔레비전 송신
KR100708479B1 (ko) 디지털 방송 송신 장치 및 방법 그리고 디지털 방송 수신장치 및 방법
US8046667B2 (en) Synchronization loss resilient digital communication system using forward erasure correction
KR20070056882A (ko) 디지털 방송 시스템 및 처리 방법
KR101528647B1 (ko) 코드 개선된 스태거캐스팅
KR100996619B1 (ko) 순방향 소거 정정을 이용한 동기 손실에 탄력적인 디지털 통신 시스템
KR101314614B1 (ko) 디지털 방송 시스템 및 데이터 처리 방법

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 3098/DELNP/2004

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2003719826

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020047016685

Country of ref document: KR

Ref document number: 10511638

Country of ref document: US

Ref document number: 2003587012

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: PA/a/2004/010332

Country of ref document: MX

WWE Wipo information: entry into national phase

Ref document number: 20038121182

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 1020047016685

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 2003719826

Country of ref document: EP