WO2012005544A2 - Procédé et appareil de récupération de données perdues par salves par duplication par blocs de symboles de codes - Google Patents

Procédé et appareil de récupération de données perdues par salves par duplication par blocs de symboles de codes Download PDF

Info

Publication number
WO2012005544A2
WO2012005544A2 PCT/KR2011/005024 KR2011005024W WO2012005544A2 WO 2012005544 A2 WO2012005544 A2 WO 2012005544A2 KR 2011005024 W KR2011005024 W KR 2011005024W WO 2012005544 A2 WO2012005544 A2 WO 2012005544A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
fec
block
priority
priority buffer
Prior art date
Application number
PCT/KR2011/005024
Other languages
English (en)
Korean (ko)
Other versions
WO2012005544A3 (fr
Inventor
조재형
이상호
서덕영
김철근
Original Assignee
한국전자통신연구원
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
Priority claimed from KR1020110033741A external-priority patent/KR20120005371A/ko
Application filed by 한국전자통신연구원 filed Critical 한국전자통신연구원
Priority to US13/809,090 priority Critical patent/US8819526B2/en
Publication of WO2012005544A2 publication Critical patent/WO2012005544A2/fr
Publication of WO2012005544A3 publication Critical patent/WO2012005544A3/fr

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/63Joint error correction and other techniques
    • H03M13/6306Error 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
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/63Joint error correction and other techniques
    • H03M13/635Error control coding in combination with rate matching
    • H03M13/6356Error control coding in combination with rate matching by repetition or insertion of dummy data, i.e. rate reduction

Definitions

  • the following embodiments are directed to a method and apparatus for recovering data loss.
  • a method and apparatus for recovering burst data loss by overlapping block code symbols is disclosed.
  • the error correction technique additionally generates parity data for error correction such as forward error correction (FEC) and transmits the parity data to the receiving terminal, thereby allowing the receiving terminal to recover lost data.
  • FEC forward error correction
  • a transmitting server collects IP packets carrying encoded video, voice, and text data in symbol units to form a single FEC source block.
  • the FEC parity is then calculated for the data of the collected FEC source blocks.
  • the calculated FEC parity data and IP data packets are each independently transmitted on separate logical channels.
  • the receiving terminal uses a block coding error correction scheme for recovering lost IP packets using the received FEC parity data.
  • the loss recovery capability of the error correction techniques described above is usually proportional to the amount of parity data generated.
  • an encoding apparatus and method for applying block code symbols repeatedly may be provided.
  • a decoding apparatus and method for recovering data loss using redundant block code symbols may be provided.
  • a low-priority buffer, a high-priority buffer, a data stream indicated by importance are received, time information is displayed on the data stream, and the data stream is low-priority according to the importance.
  • a priority classifier for classifying and storing a priority buffer and a high-priority buffer, and extracting data of the same first time zone from the low-priority buffer and the high-priority buffer, respectively, to forward error collection (FEC).
  • FEC forward error collection
  • a FEC encoding apparatus for constructing a source block, extracting data of a second time zone different from the first time zone from the high-priority buffer, and adding the same to the FEC source block to perform encoding calculation for generating FEC parity data.
  • the second time zone may be a time zone that is L time earlier than the first time zone or a time zone that is late by the L time relative to the first time zone.
  • the L may be the maximum length to recover the data of high importance from successive burst loss.
  • the data of the low-priority buffer and the high-priority buffer may be buffered for at least the L time.
  • the second time zone may be a time zone that is L time earlier than the first time zone and a time zone that is later than the first time zone by L time.
  • the FEC encoder may transmit the data of the low-priority buffer by an L time delay from the data of the high-priority buffer.
  • the FEC encoder may indicate a block identifier in the output data constituting the block and the FEC parity data, and the high importance data in the high-priority buffer added in duplicate to two or more of the blocks may include two or more pieces of data. May be indicated by block identifiers.
  • the FEC encoder may output the output data indicated by the block identifier and the FEC parity data in order.
  • the data stream may be a scalable video coding stream
  • the data of the high-priority buffer may be base frame data
  • the data of the low-priority buffer may be enhancement frame data.
  • a low-priority buffer, a high-priority buffer, a forward error collection (FEC) buffer, a data stream in which importance and a block identifier are displayed, and FEC data are received.
  • a priority classifier for displaying time information in the FEC data, classifying and storing the data stream in the low-priority buffer and the high-priority buffer, and storing the FEC data in an FEC buffer and the low-priority
  • a FEC decoder for constructing and decoding an FEC block based on data of a priority buffer, data of the high-priority buffer, and the FEC data, wherein the FEC decoder detects lost data in a first time zone The block to be used for loss recovery using the block identifier information of the unlost data of the first time zone.
  • Infer an identifier fetch all intact data corresponding to the inferred block identifier from the low-priority buffer and the high-priority buffer, and remove all corruptions corresponding to the inferred block identifier from the FEC buffer.
  • a decoding apparatus for extracting FEC data that is not present to form the FEC block, and performing the FEC decoding by performing an FEC decoding calculation on the FEC block.
  • the FEC decoder infers the block identifier of a second time zone that is different from the first time zone, and fetches all intact data corresponding to the inferred block identifier from the low-priority buffer and the high-priority buffer.
  • the FEC block may be configured to extract all intact FEC data corresponding to the inferred block identifier from the FEC buffer to construct the FEC block, and perform FEC decoding on the FEC block to recover the lost data.
  • the second time zone may be a time zone that is L time earlier than the first time zone or a time zone that is late by the L time relative to the first time zone.
  • the L may be the maximum length that the decoding apparatus wants to recover data of high importance from consecutive burst loss.
  • the data of the low-priority buffer and the high-priority buffer may be buffered for at least L hours, and the FEC data of the FEC buffer may be buffered for at least the L time.
  • the low priority data stored in the low-priority buffer may be transmitted with a delay of at least L time compared to the high priority data stored in the high-priority buffer, and the data of the high-priority buffer may be It can be buffered for more than time.
  • the FEC decoder fetches a block identifier of the input data by further buffering the data stream and the FEC data by the L time, and extracts the block identifier of the input data from the low-priority buffer, the high-priority buffer and the FEC buffer.
  • the FEC block may be constructed by extracting all undamaged data and FEC data corresponding to the block identifier, and the lost data may be recovered by performing decoding on the FEC block.
  • the second time zone may be a time zone that is L time earlier than the first time zone and a time zone that is later than the first time zone by L time.
  • an operation for receiving a data stream indicated by importance, displaying time information on the data stream, and a low-priority buffer and high-based data stream on which the time information is displayed according to the importance Classifying and storing the data into a priority buffer, extracting data of a specific time zone from the low-priority buffer and the high-priority buffer, and configuring a Forward Error Collection (FEC) source block; -Extracting L time preceding or L time trailing data from the priority buffer to the FEC source block, calculating FEC parity data of the FEC source block, and the FEC source block and the An encoding method is provided, which includes an operation of outputting FEC parity data.
  • FEC Forward Error Collection
  • an encoding apparatus and a method for applying block code symbols redundantly.
  • a decoding apparatus and method are provided for recovering data loss using redundant block code symbols.
  • FIG. 1 illustrates a frame reference structure of a layered SVC stream according to an embodiment of the present invention.
  • FIG. 2 is a structural diagram of a block coding encoding apparatus according to an embodiment of the present invention.
  • FIG. 3 is a timing diagram illustrating a FEC block encoding method according to an embodiment of the present invention.
  • FIG. 4 is a structural diagram of a block coding decoding apparatus according to an embodiment of the present invention.
  • FIG. 5 is a timing diagram illustrating a FEC block decoding method according to an embodiment of the present invention.
  • FIG. 6 is a timing diagram illustrating an FEC block decoding method using interleaving according to an embodiment of the present invention.
  • FIG. 7 is a flowchart illustrating an operation of the block coding encoding apparatus 200 according to an embodiment of the present invention.
  • FIG. 8 is a flowchart illustrating an operation of a block coding decoding apparatus 400 according to an embodiment of the present invention.
  • FIG. 1 illustrates a frame reference structure of a layered SVC stream according to an embodiment of the present invention.
  • the scalable video coding (SVC) technology standardized in the Joint Video Team (JVT) of ITU-T and ISO / IEC JTC 1 enables the conversion of video frames into low bit rate base frames.
  • the video coding method comprises a stream composed of enhancement frames hierarchized in various steps referring to the base frames.
  • FIG. 1 an interframe reference relationship of a video stream divided into two layers and layered using SVC technology is illustrated.
  • base frames 120 having a low bit rate but high importance may be independently decoded.
  • enhancement frames 110 cannot be decoded without base frame information.
  • Enhancement frames 110 that directly or indirectly refer to N may not be fully decoded.
  • the base frame 120 having a low bit rate is most important.
  • the base frame 120 is enhanced by adding a large proportion of the parity data to the base frame 120 having a low bit rate but a high importance. It can be more robust against loss than (110).
  • this method also adds and limits the recovery performance in proportion to the amount of parity data transmitted. Therefore, in order to prepare for a situation such as link outage where data loss occurs continuously, a problem such as a large amount of parity data must be transmitted may occur.
  • FIG. 2 is a structural diagram of a block coding encoding apparatus according to an embodiment of the present invention.
  • the block coding encoding apparatus 200 may include a priority classifier 210, a low-priority buffer 220, a high-priority buffer 230, and an FEC encoder 240. ).
  • the priority classifier 210 receives a data stream 250 indicating importance from the outside.
  • the data stream 250 may include I frames, B frames, and P frames.
  • Data stream 250 may be separated according to priority.
  • Data stream 250 includes low-priority low-priority data and high-priority high-priority data.
  • the data stream 250 may be a scalable video coding (SVC) stream hierarchically separated, the high importance data may be base frame data, and the low importance data is an enhancement frame. Data.
  • the data stream 250 may be a multimedia stream in which voice and video are mixed, and the data having high importance may be a voice stream.
  • the data stream 250 may be a 3D stream in which left and right images are separated, and the data having high importance may be one piece of image data having high importance.
  • the priority classifier 210 displays time information on the received data stream, and classifies and stores the data stream into an internal low-priority buffer 220 and a high-priority buffer 230 (according to importance). .
  • the low-priority buffer 220 may store data of low importance in the data stream.
  • the high-priority buffer 220 may store high importance data in the data stream.
  • FEC encoder 240 fetches data from low-priority buffer 220 and high-priority buffer 230, respectively.
  • the high importance data fetched from the low-priority buffer 220 and the low importance data fetched from the high-priority buffer 230 may be data of the same first time zone.
  • the FEC encoder 240 constructs an FEC source block for FEC calculation using the extracted data.
  • the FEC encoder 240 further fetches data of high importance in a second time zone different from the first time zone in the high-priority buffer 230 and adds it to the FEC source block.
  • the FEC encoder 240 uses encoding calculations for generating FEC parity data using the FEC source block.
  • high priority data stored in the high-priority buffer 230 is included in the FEC block twice. That is, data of high importance is included in the FEC block twice, and encoding calculation is performed.
  • the second time zone may be a time zone that is L time earlier than the first time zone. This is called post-duplicate calculation.
  • the second time zone may be a time zone that is L time later than the first time zone. This is called transposition redundancy calculation.
  • the second time zone may be a time zone that is L time earlier than the first time zone and a time zone that is L time later than the first time zone. That is, the FEC encoder 240 further fetches the data of high importance in the time zone that is L time earlier in the first time zone and the data of high importance in the time zone that is late by L time in the first time zone in the high-priority buffer 230. Can be added to the FEC source block.
  • the time value L may be the maximum length to which data of high importance is to be recovered from successive burst losses. That is, for the FEC block configuration, the data of the low-priority buffer 220 and the high-priority buffer 230 may be buffered for at least L hours.
  • the FEC encoder 240 displays a block identifier in the data constituting the block and the calculated FEC parity data. Therefore, the data of high importance calculated by overlapping addition of two or more blocks is represented by two or more block identifiers.
  • the FEC encoder 240 outputs the output data 260 in which the block identifier is indicated and the FEC parity data 270 in which the block identifier is indicated in order.
  • the FEC encoder 240 may be configured by applying an interleaving method. That is, the FEC encoder 240 may delay and transmit data having low importance of the low-priority buffer 220 by L time than data having high importance of the high-priority buffer 230. As a result, the buffering burden of the receiving terminal can be reduced.
  • FIG. 3 is a timing diagram illustrating a FEC block encoding method according to an embodiment of the present invention.
  • FIG. 3 a method in which the FEC encoder 240 of the block coding encoding apparatus 200 performs FEC block encoding is described in the form of a logical timing diagram.
  • the FEC encoder 240 fetches the data of i11 and p12 from the low-priority buffer 220 and the data of I11, B12 , P13 and B14 from the high-priority buffer 230 during the time interval t1 to t4 . To extract the FEC source block for performing FEC block coding.
  • the FEC encoder 240 fetches i31 and p32 of high importance data after L time and adds it to the FEC source block in the high-priority buffer 230 when 'prediction redundancy calculation' is set. Perform FEC encoding calculation.
  • i31 and p32 which are data of high importance in the high-priority buffer 230, overlap with both the first FEC block 310 and the second FEC block 320 before and after L time. Included.
  • FEC encoder 240 and 'post double counting "is set if, for the time period t17 to t20 in the drawing the data of I51, B52, P53, B54, i51 and p52 constitute a FEC source block.
  • the FEC encoder 240 fetches i31 and p32 , which are high priority data L-time earlier in the high-priority buffer 230, adds them to the FEC source block and performs FEC encoding calculation.
  • i31 and p32 which are the data of high importance of the high-priority buffer 230, overlap with both the second FEC block 320 and the third FEC block 330 before and after L time. Included.
  • i31 and p32 which are data of high importance of the high-priority buffer 230, in performing block encoding calculation, are the first FEC blocks 310 before and after L time.
  • the second FEC block 320 and the third FEC block 330 are all included in duplicate.
  • FIG. 4 is a structural diagram of a block coding decoding apparatus according to an embodiment of the present invention.
  • the block coding decoding apparatus 400 includes a priority classifier 410, a low-priority buffer 420, a high-priority buffer 430, an FEC buffer 440, and an FEC decoder 450.
  • the priority classifier 410 receives input data (ie, data stream) 260 and FEC data 270 from the outside.
  • the input data 260 and the FEC data 270 are marked with importance and block identifier, respectively.
  • the priority classifier 410 displays time information on the received data stream 260 and the FEC data 270.
  • the priority classifier 410 classifies and stores the data stream in which the time information is displayed in the low-priority buffer 420 and the high-priority buffer 430, and stores the FEC data in which the time information is displayed in the FEC buffer 440. Save it.
  • the data stored in the low-priority buffer 420 is low importance data
  • the data stored in the high-priority buffer 430 is high importance data.
  • the data of the low-priority buffer 420, the high-priority buffer 430, and the FEC buffer 440 are buffered for at least L time for FEC block configuration. That is, the data of the low-priority buffer, the data of the high-priority buffer, and the FEC data of the FEC buffer 440 are buffered for at least L hours.
  • interleaving may be applied to the FEC decoder 450 or the block coding decoding apparatus 400. That is, in the data 260 input from the outside of the block coding encoding apparatus 400, data having low importance may be transmitted by being delayed for more than L time compared to data having high importance. In this case, since only the data of high importance of the high-priority buffer 430 is buffered for L time or more, the buffering burden of the fishery terminal including or using the block coding decoding apparatus 400 may be reduced.
  • the FEC decoder 430 configures and decodes the FEC block based on the data of the low-priority buffer 420, the data of the high-priority buffer 430, and the FEC data.
  • the result of the decoding is output as the stream data 460 by the FEC decoder 430.
  • the FEC decoder 450 may include data lost from input data (eg, data in the low-priority buffer 420, data in the high-priority buffer 430, FEC data, or data input from outside 260). If is detected, recover the lost data by performing FEC decryption.
  • the first time zone is a time zone in which the lost data corresponds.
  • the FEC decoder 450 may determine the first data among the unlost data (eg, data of the low-priority buffer 420, data of the high-priority buffer 430, and FEC data).
  • the block identifier is inferred only when it is used for loss recovery by using the block identifier information of the time lost data).
  • the FEC decoder 450 can determine all the intact data corresponding to the block identifier inferred from the low-priority buffer 420 and the high-priority buffer 430 (ie, high importance data). And low-importance data), and extracts all intact FEC data corresponding to the block identifier inferred from the FEC buffer 440, constructs an FEC block based on the retrieved data and the FEC data, and decodes the FEC. Do this.
  • the FEC decoder 430 recovers data lost by the decryption.
  • the lost data may be recovered by the following method.
  • the FEC decoder 450 infers a block identifier of a second time zone that is different from the first time zone, and extracts all intact data corresponding to the block identifier inferred from the low-priority buffer 420 and the high-priority buffer.
  • the lost data can be recovered by fetching, extracting all intact FEC data corresponding to the block identifier inferred from the FEC buffer, constructing the FEC block, and performing FEC decoding on the configured FEC block.
  • the second time zone may be a time zone that is L time earlier than the first time zone or a time zone that is late by the L time relative to the first time zone.
  • the second time zone may be a time zone that is L time earlier than the first time zone and a time zone that is late by the L time relative to the first time zone.
  • L is the maximum length that the block coded decoding apparatus 400 wants to recover data of high importance from consecutive burst loss.
  • the second time zone is L time ahead of the first time zone.
  • the FEC decoder 450 infers the block identifier preceded by L time, and all intact data corresponding to the block identifier inferred in the low-priority buffer 420 and the high-priority buffer 430. And extract all the undamaged FEC data corresponding to the block identifier inferred from the FEC buffer 440 to construct the FEC block, and perform decoding on the configured FEC block to recover the lost high importance data. Can be.
  • the second time zone is L time later than the first time zone.
  • the FEC decoder 450 fetches a block identifier of the input data by further buffering the data stream 260 and the FEC data 270 by L time, and the low-priority buffer 420, high-priority.
  • the FEC block By constructing the FEC block by extracting all the undamaged data and the FEC data corresponding to the block identifier fetched from the buffer 430 and the FEC buffer 440, and performing the decoding to the configured FEC block, the data of high importance lost Can be recovered
  • high priority data often has a chance to be recovered in one FEC block with less damage among two or more FEC blocks, at least L time apart. Therefore, even if continuous data loss occurs on the wired / wireless communication path, a continuous real-time multimedia service of minimum quality can be provided by increasing a recovery rate of high importance data.
  • FIG. 5 is a timing diagram illustrating a FEC block decoding method according to an embodiment of the present invention.
  • FIG. 5 a method in which the block coding decoding apparatus 400 recovers data of high importance from successive data loss occurring during a time interval of t9 to t12 will be described in the form of a logical timing diagram.
  • the FEC decoder 450 detects data loss of I31, B32, P33, B34, i32, and p32 occurring during the times t9 to t12 , configures the second FEC block 520, and attempts to recover the loss. Data recovery failed because of the large amount.
  • the FEC decoder 450 Infers the FEC block identifier (eg, the first FEC block 510) of the time zone preceded by L time, I11, B12, P13, B14, i11, p12 and FEC-1 are extracted from the priority buffer 420, the high-priority buffer 430 and the FEC buffer 440 to construct the first FEC block 510.
  • An FEC decoding calculation is performed to recover i31 and p32 , which are lost high-value data.
  • the FEC decoder 450 When the pre-duplicate calculation is performed in the block coding encoding apparatus 200, the FEC decoder 450 further buffers the data stream 260 and the FEC data 270 for L time, and the low-priority buffer 420. From the high-priority buffer 430 and the FEC buffer 440, I51, B52, P53, B54, i51, p52 and FEC-3 are extracted to form the third FEC block 530 and perform FEC decoding calculation. I31 and p32 , which are lost critical data, are recovered.
  • the receiving terminal including or using the block coding decoding apparatus 400 can withstand the loss of continuous input data for L time, the larger L, the larger the amount of data to be buffered by the receiving terminal. Therefore, as L increases, the buffering burden of the receiving terminal increases. However, even if the buffering burden of the receiving terminal increases, the amount of parity data to be used for loss recovery does not increase. Therefore, the transmission bit rate to the receiving terminal does not increase.
  • FIG. 6 is a timing diagram illustrating an FEC block decoding method using interleaving according to an embodiment of the present invention.
  • the interleaving method is applied to the block coding encoding apparatus 200. That is, the block coding encoding apparatus 200 transmits data having low importance by L time rather than data having high importance.
  • the block coding decoding apparatus 400 may recover data having high importance from continuous data loss while reducing the buffering burden.
  • the block coding decoding apparatus 400 reduces the overall buffering burden by buffering only the data stored in the high-priority buffer 420 for L time or more.
  • the FEC decoder 450 When the FEC decoder 450 detects data loss occurring during the times t9 to t12 , the FEC decoder 450 first fetches data of i31 and p32 previously stored in the high-priority buffer 430 to play the media. By utilizing it to maintain a streaming service of minimal quality.
  • the FEC decoder 450 decodes previously stored data of i41 and p42 and newly received data of I41, B42, P43, and B44 for a period of t13 to t16 and utilizes it for normal quality media playback.
  • the FEC decoder 450 constructs a third FEC block 630 using the data of I51, B52, P53, B54, i71, p72 and FEC-3 received during the times t17 to t20 and performs FEC decoding calculation. It is lost to recover the high priority data, the i51 and p52. FEC decoder 450 then decodes the recovered utilizing i51 and p52 in normal media playback quality.
  • FIG. 7 is a flowchart illustrating an operation of the block coding encoding apparatus 200 according to an embodiment of the present invention.
  • data ie, data stream 250 indicated by importance
  • Time information is displayed on the input data, and the priority of the input data is classified.
  • input data is buffered. That is, data streams in which time information is displayed are classified into low-priority buffers 220 and high-priority buffers 230 and stored according to importance.
  • an FEC source block is configured. Data of a specific time zone is fetched from the low-priority buffer 220 and the high-priority buffer 230, and an FEC source block is configured based on the data of the specific time zone fetched.
  • high priority data i.e., high-priority data
  • L the high-priority buffer
  • FEC parity for the FEC source block is calculated.
  • block identifiers are indicated in the data and FEC parity that make up the FEC source block.
  • the low importance data ie, low-priority data
  • the low importance data is delayed L time.
  • stream data ie, output data 260 with block identifiers
  • FEC data ie, FEC parity data 270 with block identifiers
  • FIG. 8 is a flowchart illustrating an operation of a block coding decoding apparatus 400 according to an embodiment of the present invention.
  • data stream 260 and FEC parity data 270 indicative of importance and block identifier are input as input data.
  • the priority of the input data is classified.
  • Time information may be displayed in the data stream 260 and the FEC data 270.
  • input data is buffered. That is, the data stream 260 is classified and stored in the low-priority buffer 420 and the high-priority buffer 430, and the FEC data is stored in the FEC buffer 440.
  • operation 820 it is checked whether data has been lost. If no data loss is detected, the following operation 895 is performed. If data loss is detected, the following operation 830 is performed.
  • a first block identifier is retrieved.
  • the FEC source block is constructed and decoded. That is, an FEC block is configured based on the data of the low-priority buffer 420 and the high-priority buffer 430 and the FEC data. FEC decoding calculation is performed on the configured FEC block.
  • operation 895 If FEC decoding calculation can be performed with the constructed FEC block, operation 895 is performed. If data recovery is needed, operation 850 is performed.
  • operation 855 data is fetched from high-priority buffer 430, and operation 895 is performed.
  • operation 860 is performed.
  • operation 860 a duplicate calculation method is selected. If post-duplicate calculations are performed, operation 865 is performed. If transposition redundancy calculation is performed, operation 870 is performed.
  • a second block identifier is retrieved L time preceding the first block identifier of operation 830.
  • a second block identifier is retrieved.
  • data corresponding to the second block identifier is retrieved from the low-priority buffer 420, the high-priority buffer 430, and the FEC buffer 440 to form an FEC block.
  • FEC decoding calculation is performed on the configured FEC block.
  • operation 895 is performed, and if data recovery is not completed, the procedure ends.
  • stream data 460 is output.
  • the data stream 260 input from the outside to the block coding decoding apparatus 400 is a hierarchically separated SVC stream, continuous data by applying base frame data of high importance to pre-duplicate calculation or post-duplicate calculation. If a loss occurs, the base frame may be recovered to maintain a service of at least low image quality.
  • the data stream 260 input from the outside to the block coding decoding apparatus 400 is a multimedia stream in which voice and video are mixed, continuous data by applying high importance voice data to pre-duplicate calculation or post-duplicate calculation. In the event of a loss, the voice data can be recovered to maintain a minimum uninterrupted voice service.
  • At least one piece of image data having high importance may be reproduced without interruption.
  • Method according to an embodiment of the present invention is implemented in the form of program instructions that can be executed by various computer means may be recorded on a computer readable medium.
  • the computer readable medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks.
  • Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.
  • the hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

La présente invention concerne un procédé et un appareil de codage et de décodage utilisant un codage par blocs. Le procédé et l'appareil de codage et de décodage à base de codage par blocs peuvent récupérer de manière fiable des données hautement significatives même lors d'une perte de données continue sur un trajet de transmission câblé/sans fil, assurant ainsi un service ininterrompu même lorsque la qualité atteint un minimum. Les données hautement significatives sont calculées par pré-duplication ou post-duplication. Les données perdues pendant un intervalle de temps donné peuvent être récupérées à partir des données dupliquées pendant un autre intervalle de temps.
PCT/KR2011/005024 2010-07-08 2011-07-08 Procédé et appareil de récupération de données perdues par salves par duplication par blocs de symboles de codes WO2012005544A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/809,090 US8819526B2 (en) 2010-07-08 2011-07-08 Method and apparatus for recovering burst data loss by duplicating block code symbols

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20100065642 2010-07-08
KR10-2010-0065642 2010-07-08
KR1020110033741A KR20120005371A (ko) 2010-07-08 2011-04-12 블록 코드 심볼을 중복하여 버스트 데이터 손실을 복구하는 방법 및 장치
KR10-2011-0033741 2011-04-12

Publications (2)

Publication Number Publication Date
WO2012005544A2 true WO2012005544A2 (fr) 2012-01-12
WO2012005544A3 WO2012005544A3 (fr) 2012-04-19

Family

ID=45441677

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2011/005024 WO2012005544A2 (fr) 2010-07-08 2011-07-08 Procédé et appareil de récupération de données perdues par salves par duplication par blocs de symboles de codes

Country Status (1)

Country Link
WO (1) WO2012005544A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013165155A1 (fr) * 2012-04-30 2013-11-07 Samsung Electronics Co., Ltd. Procédé et appareil pour transmettre et recevoir un paquet dans un système de communication
US8819526B2 (en) 2010-07-08 2014-08-26 Electronics And Telecommunications Research Institute Method and apparatus for recovering burst data loss by duplicating block code symbols

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030120983A1 (en) * 2001-12-26 2003-06-26 Vieregge Richard Charles System and method for performing pre-emptive protection switching
US20080098284A1 (en) * 2006-10-18 2008-04-24 Kencast, Inc. Systems, methods, apparatus, and computer program products for providing forward error correction with low latency
US20100223535A1 (en) * 2007-11-12 2010-09-02 Dongyu Geng Method and apparatus for encoding and decoding data
KR100981500B1 (ko) * 2006-02-07 2010-09-10 삼성전자주식회사 저밀도 패러티 검사 부호 기반의 하이브리드 재전송 방법
US7861132B1 (en) * 2004-11-19 2010-12-28 The Directv Group, Inc. Adaptive error correction

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030120983A1 (en) * 2001-12-26 2003-06-26 Vieregge Richard Charles System and method for performing pre-emptive protection switching
US7861132B1 (en) * 2004-11-19 2010-12-28 The Directv Group, Inc. Adaptive error correction
KR100981500B1 (ko) * 2006-02-07 2010-09-10 삼성전자주식회사 저밀도 패러티 검사 부호 기반의 하이브리드 재전송 방법
US20080098284A1 (en) * 2006-10-18 2008-04-24 Kencast, Inc. Systems, methods, apparatus, and computer program products for providing forward error correction with low latency
US20100223535A1 (en) * 2007-11-12 2010-09-02 Dongyu Geng Method and apparatus for encoding and decoding data

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8819526B2 (en) 2010-07-08 2014-08-26 Electronics And Telecommunications Research Institute Method and apparatus for recovering burst data loss by duplicating block code symbols
WO2013165155A1 (fr) * 2012-04-30 2013-11-07 Samsung Electronics Co., Ltd. Procédé et appareil pour transmettre et recevoir un paquet dans un système de communication
US9106376B2 (en) 2012-04-30 2015-08-11 Samsung Electronics Co., Ltd. Method and apparatus for transmitting and receiving packet in a communication system
US9450702B2 (en) 2012-04-30 2016-09-20 Samsung Electronics Co., Ltd. Method and apparatus for transmitting and receiving packet in a communication system
US9673933B2 (en) 2012-04-30 2017-06-06 Samsung Electronics Co., Ltd. Method and apparatus for transmitting and receiving packet in a communication system

Also Published As

Publication number Publication date
WO2012005544A3 (fr) 2012-04-19

Similar Documents

Publication Publication Date Title
WO2013122438A1 (fr) Appareil et procédé de transmission/réception de paquet de données
FI117844B (fi) Menetelmä kompressoidun videodatan järjestämiseksi siirtoa varten
WO2011108868A2 (fr) Appareil et procédé pour enregistrer et lire un fichier média et support d'enregistrement pour celui-ci
WO2013019042A1 (fr) Appareil et procédé d'émission et appareil et procédé de réception permettant de fournir un service 3d par le biais d'une liaison avec une image de référence émise en temps réel ainsi qu'avec une image et un contenu supplémentaires émis séparément
WO2015199420A1 (fr) Technique pour transmettre et recevoir des informations temporelles de système dans un système de diffusion
WO2013162312A1 (fr) Procédé et appareil permettant l'émission-réception de données destinées à un système de transmission multimédia
WO2009134105A2 (fr) Procédé et appareil de réception d’un signal de diffusion
EP2786578A1 (fr) Appareil et procédé de transmission/réception de données de radiodiffusion
WO2013168964A1 (fr) Appareil et procédé d'émission et de réception d'un paquet dans un système de diffusion et de communication
CN101584221A (zh) 在iptv系统中使用低比特率流的视频数据丢失恢复
WO2020096148A1 (fr) Procédé et dispositif de commutation de canaux de service multimédia
WO2014058278A1 (fr) Appareil et méthode de transmission et de réception de paquet dans un système de diffusion et de communication
WO2015137727A1 (fr) Procédé et dispositif d'émission/réception d'un signal de diffusion
WO2012005544A2 (fr) Procédé et appareil de récupération de données perdues par salves par duplication par blocs de symboles de codes
WO2015060653A1 (fr) Procédé de transmission/réception de paquets dans un système de communication, au moyen d'un code de correction d'erreur
WO2015147613A1 (fr) Procédé et appareil pour générer et récupérer un paquet dans un système de diffusion et/ou de communication
WO2011126344A2 (fr) Procédé et appareil pour générer des paquets vidéo, procédé et appareil pour restaurer une vidéo
WO2015037894A1 (fr) Appareil de traitement d'image utilisant la surveillance de mémoire vidéo
JP2006333367A (ja) 映像伝送システム及び映像伝送方法
WO2017047848A1 (fr) Système de publicité de zapping utilisant des caractéristiques de multiplexage
WO2017128593A1 (fr) Procédé et dispositif pour traiter une transmission à débit de code élevé d'une télévision numérique et télévision numérique de haute définition
WO2017099371A1 (fr) Procédé et dispositif de codage et de décodage d'informations de mode de saut intra-image
KR20120005371A (ko) 블록 코드 심볼을 중복하여 버스트 데이터 손실을 복구하는 방법 및 장치
WO2014107098A1 (fr) Procédé et dispositif de génération d'ensemble de paramètres pour l'encodage/le décodage d'image
JP2001007786A (ja) データ通信方法およびシステム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11803830

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase in:

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 13809090

Country of ref document: US

122 Ep: pct application non-entry in european phase

Ref document number: 11803830

Country of ref document: EP

Kind code of ref document: A2