WO2005020607A2 - Methode de transmission d'un message multimedia - Google Patents

Methode de transmission d'un message multimedia Download PDF

Info

Publication number
WO2005020607A2
WO2005020607A2 PCT/EP2004/051831 EP2004051831W WO2005020607A2 WO 2005020607 A2 WO2005020607 A2 WO 2005020607A2 EP 2004051831 W EP2004051831 W EP 2004051831W WO 2005020607 A2 WO2005020607 A2 WO 2005020607A2
Authority
WO
WIPO (PCT)
Prior art keywords
channel
code
rlc
coding
word length
Prior art date
Application number
PCT/EP2004/051831
Other languages
English (en)
Other versions
WO2005020607A3 (fr
Inventor
Hrvoje Jenkac
Markus Kaindl
Günther LIEBL
Thomas Stockhammer
Wen Xu
Original Assignee
Siemens Aktiengesellschaft
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 Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2005020607A2 publication Critical patent/WO2005020607A2/fr
Publication of WO2005020607A3 publication Critical patent/WO2005020607A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • 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/27—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 using interleaving techniques
    • 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2909—Product codes
    • H03M13/2915—Product codes with an error detection code in one dimension
    • 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2933—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using a block and a convolutional code
    • H03M13/2936—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using a block and a convolutional code comprising an outer Reed-Solomon code and an inner convolutional code
    • 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957—Turbo codes and decoding
    • H03M13/296—Particular turbo code structure
    • H03M13/2966—Turbo codes concatenated with another code, e.g. an outer block code
    • 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
    • H03M13/353—Adaptation to the channel
    • 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
    • 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
    • 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/0072—Error control for data other than payload data, e.g. control data
    • 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • 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/11—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 using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] 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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/58—Message adaptation for wireless communication

Definitions

  • This invention relates to a method for transmitting a multimedia message.
  • Typical MBMS services could be data, software, audio, or video clip distribution to a large group of users resulting in realtime or non real-time transmission scenarios.
  • the purpose of the current standardization effort is to provide a stage 2 description of the changes required in existing specifications for the "Introduction of the Multimedia Broadcast Multicast Service (MBMS) in GERAN” feature for Release 6.
  • MBMS Multimedia Broadcast Multicast Service
  • MBMS data transfer shall be downlink only.
  • QoS attributes shall be the same for MBMS Multicast and Broadcast modes .
  • MBMS does not support individual retransmissions at the radio link layer, nor does it support retransmissions based on feedback from individual subscribers at the radio level.
  • UE User Equipment
  • a notification procedure shall be used to indicate the start of MBMS data transmission. This procedure shall contain MBMS RB information. The MBMS notification requirements and recommendations are listed in sub-clause 5.3.
  • MBMS UE multicast activation shall be transparent to UTRAN/GERAN.
  • a mechanism is required that enables the non- transmission of MBMS multicast mode in a cell which does not contain any MBMS UEs joined to the multicast group.
  • a mechanism to provide UTRAN the received QoS per UE is not required as part of MBMS .
  • MBMS Multicast mode transmissions should use dedicated resources (p-t-p) or common resources (p-t-m) .
  • the selection of the connection type (p-t-p or p-t-m) is operator dependent, typically based on downlink radio resource environment such as radio resource efficiency.
  • a "threshold" related to the number of users may be utilised, resulting in the need for a mechanism to identify the number of subscribers in a given "area".
  • MBMS solutions to be adopted should minimise the impact on the RAN physical layer and maximise reuse of existing physical layer and other RAN functionality.
  • MBMS charging should be transparent to the RAN.
  • MBMS should allow for low UE power consumption.
  • MBMS should not prevent support for SGSN in pool.
  • the introduced invention addresses and solves particularly several of the listed requirements and recommendations, namely requirements 1 and 3 as well as recommendations 1 and 2.
  • the invention does not conflict with any other requirements or recommendations.
  • requirement 3 and recommendation 2 are taken into account.
  • GERAN Global System for Mobile Communications
  • PDTCH Packet Data Traffic CHannel
  • MDTCH Multicast Data Traffic CHannel
  • p-t-m point-to-multipoint
  • Payload size and RLC/MAC block loss rates at C/l 7dB, different coding schemes with and without frequency hopping.
  • the invention can be applied not only to GERAN MBMS, but also to any other packet loss channels with similar characteristics. However, we will focus on the latter system in the following to avoid a too superficial description. The final patent might be formulated in a more general way.
  • MBMS GERAN standardization efforts Given that for MBMS p-t-m streams data is sent in unacknowledged mode as no feedback from the users is possible, one of the methods that have been proposed to reduce the SDU error rate is to use "repetition redundancy". Several options are possible for the addition of repetition redundancy: One method could be to add the redundancy at the BM-SC: each SDU would be repeated K times . This is clearly described in subclause 6.7 of TR 23.846 D[3] , which states that one of the BM-SC functions is :
  • each RLC/MAC block is repeated K times in the BSC 2 .
  • a scheme for the UTRAN has been investigated in which the Node B repeats each transport block a specified number of times, and the receiver performs soft combining of the received replicas of each block.
  • a similar scheme could also be used in the GERAN, with or without soft combining. Without soft combining, the receiver would just decode each replica of
  • Incremental Redundancy instead of repeating the same RLC/MAC block K times, one possible alternative could be to use Incremental Redundancy (this is suitable only in situations where puncturing is performed, see D[8]).
  • a rate 1/n convolutional code instead of using a rate 1/n convolutional code to encode the RLC/MAC blocks and then send the same block K times (i.e. K exact replicas of the same encoded block), it may be possible to use a rate l/ (K- n) code, and use K different puncturing patterns to produce K different redundancy versions of the same block.
  • K different redundancy versions could then either be sent sequentially, or each of them could be sent a certain number of blocks after the previous one.
  • the receiver would then combine as many redundancy versions as required to perform a correct decoding of the block. It certainly requires significant additional complexity both in the network and in the MS . Although within the standardization this scheme is denoted as incremental redundancy, this terminology is misleading:
  • the proposal is identical to
  • Inner code - rate 1/3 turbo code with a 16-bit CRC a. Each inner block of 20 ms TTI spans 1 row of the outer block. b. Eight information bits of the inner code correspond to one outer code symbol.
  • the first class describes forward error correction for packet loss channels.
  • the decoder is a simple erasure decoder, as the data symbols are only erased, but not altered on the channel.
  • a backward- compatible pure packet-based forward error correction using binary codes is applied. In this case the initial data packets are sent unaltered.
  • parity packets are generated and sent, which allow smart receivers to combine correctly received packets to reconstruct lost ones .
  • DVB-T deep space error correction schemes
  • DVB-S DVB-S
  • GSM ECSD inner convolutional codes
  • CDs and Turbo codes apply block interleaving
  • DVB a convolutional interleaver is applied, which is beneficial due to its constant delay and its excellent spreading properties.
  • DVB as well as all other standards, have been designed for different purposes than MBMS, i.e. all parameters have been adjusted appropriately.
  • the parameters of the RS code are fixed to the specific application and the convolutional interleaver is adapted to the inner and outer coding.
  • the outer RS decoder is in general an error decoder, as the inner code usually does include error detection capabilities.
  • Decoding algorithms for RS codes are known which are not exclusively error or erasure decoders. Soft decoding of RS codes might help to improve the overall system of concatenated coding schemesD[22] . This also includes principles such as iterative decoding of serially concatenated codes with outer RS codes G[23] .
  • Tornado codes D[24] have been proposed to be used in high-speed applications as they have slightly lower efficiency than RS codes, but encoding and decoding is significantly less complex. However, for our proposed block lengths this seems to be of little relevance.
  • new advanced channel coding schemes could be designed including Turbo codes, low-density parity check (LDPC) codes, etc., as the delay in MBMS is less critical and, therefore, codes with longer block lengths are applicable. However, this requires a redesign of the RAN layer, which should be avoided according to recommendation 2.
  • RLC-SDU For example it is one idea to split up an RLC-SDU into segments of length k [bytes] (in order to avoid stuffing in the final segment of an RLC-SDU, the remaining byte positions could be filled up with data from the next RLC-SDU similar to the acknowledged mode in p-t-p transmission) .
  • GF Galois field
  • Each of the RLC-SDU segments can therefore be viewed as an information word of exactly k symbols (bytes) , which can be RS encoded into blocks of length n symbols (bytes) .
  • the turbo-encoded blocks with a TTI of 20ms are replaced by GSM GPRS RLC/MAC blocks, including or excluding the CRCs .
  • CRC erasure decoding as mentioned above can be performed, otherwise error decoding at RLC level has to be performed.
  • Any advanced decoding scheme can be applied, including mixtures of erasure and error decoding, soft decoding of RS codes, and iterative
  • any block length ⁇ « can be decoding schemes including the inner convolutional code.
  • the interleaver not necessarily has to be a block interleaver. Any other reasonable spreading of the coded symbols of the outer code is possible.
  • the choice of the interleaver determines the maximum delay, the storage requirements, the achievable coding gain, or the possibility to reuse existing schemes .
  • this invention can be extended in a straightforward way to incorporate multi-slot transmission: If an MBMS service can use a total of M MDTCHs (each mapped onto a different time slot) , M successive RLC/MAC blocks are usually transmitted in parallel. If we perform interleaving of a specific RS codeword only over RLC/MAC blocks on the same MDTCH, we achieve M times the throughput of the single slot case while yielding the same RLC-SDU error rate target.
  • channel code word length n stays the same, but the information word length k is dynamically adapted.
  • the actual choice of the coding structure such as the information word length k, or possibly a subset of possible k, and/or the channel word length n of the channel code has to be signalled (i.e. transmitted) to the receiving RLC entity (e.g. the UE) by • appropriate means, either in-band (i.e. k and the information data are transmitted in the same channel) or out- of-band (i.e. k and the information data are transmitted in different channels) .
  • the receiving RLC entity e.g. the UE
  • in-band i.e. k and the information data are transmitted in the same channel
  • out- of-band i.e. k and the information data are transmitted in different channels
  • the interleaver in the previous discussions is kept very general. Basically any kind of interleaving can be performed which distributes the symbols such that each RLC/MAC block only contains a single symbol (byte) of a RS code word. However, it is obviously beneficial to minimize the required memory in both the base station and the mobile terminal . In addition, it is also advantageous to minimize the delay which a single RLC-SDU segment experiences to minimize playback delay for real-time services 4 .
  • the best interleaver in this case is a convolutional interleaver, which spreads the symbols within a code word over n RLC/MAC blocks such that each code word and therefore each RLC-SDU experience a constant delay. In principle, the following algorithm is applied: 1.
  • the first symbol (byte) of the RS code word generated at time i is placed in RLC/MAC block i at position N. 2.
  • the second symbol (byte) of the RS code word generated at time i is placed in RLC/MAC block i+1 at position N-l . 3....
  • the respective interleaver simply consists of M parallel convolutional interleaver stages, as depicted in Figure 5. This corresponds to the previous proposals for MBMS over GERAN in that one MBMS service will use multiple MDTCHs in parallel.
  • n RS code word length (in symbols or bytes) p RLC/MAC block loss rate
  • k size of RLC-SDU segments corresponds to RS information word length (in symbol or bytes)
  • the throughput is defined as the maximum transmission data rate which is supported by a specific coding scheme in bit/second.
  • the throughput can be estimated as
  • Payload size and RLC/MAC block loss rates at C/I 7dB, different coding schemes with and without frequency hopping.
  • the presented results show the residual RLC-SDU error rate versus throughput for different parameter settings and coding schemes .
  • the equations according to the previous sections have been applied.
  • the parameter K the number of repetitions, is varied to trade off throughput versus error rate.
  • the proposed scheme with RS code and convolutional interleaver adds some constant delay.
  • the delay for the convolutional interleaver increases slower than for the repetition case.
  • the maximum delay D is about 3.2 seconds, whereas for the repetition the delay is about ⁇ seconds resulting in less required memory for the proposed scheme.
  • the delay for the RLC-SDU repetition obviously decreases by M.
  • the delay also decreases with increasing number of slots.
  • nT a constant delay term
  • Figure 8 shows the simulated performance results for the same set of parameters that have been used for the estimation depicted in Figure 6.
  • the repetition scheme stays the same, and the performance improvement when using RS coding with convolutional interleaving has been proven also by simulation.
  • Figure 10 shows that in case of multislot transmission, the achievable throughput of all strategies is simply M times the value of the single slot case, as predicted in the previous section.
  • 3GPP TR 25.992 Multimedia Broadcast Multicast Service (MBMS); UTRAN/GERAN Requirements"

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Communication Control (AREA)
  • Error Detection And Correction (AREA)

Abstract

L'invention concerne une méthode de transmission d'un message multimédia par une interface aérienne comprenant les étapes consistant à: effectuer une segmentation de commande de liaison radio, la segmentation de commande de liaison radio comprenant les étapes consistant à: diviser le message multimédia en segments, effectuer un codage Reed/Solomon des segments, et effectuer un entrelacement des segments codés.
PCT/EP2004/051831 2003-08-20 2004-08-18 Methode de transmission d'un message multimedia WO2005020607A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP03018927.8 2003-08-20
EP03018927 2003-08-20

Publications (2)

Publication Number Publication Date
WO2005020607A2 true WO2005020607A2 (fr) 2005-03-03
WO2005020607A3 WO2005020607A3 (fr) 2005-08-11

Family

ID=34203221

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2004/051831 WO2005020607A2 (fr) 2003-08-20 2004-08-18 Methode de transmission d'un message multimedia

Country Status (1)

Country Link
WO (1) WO2005020607A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4210228A4 (fr) * 2020-09-02 2024-02-28 Sony Group Corporation Dispositif de traitement d'informations, procédé de codage et procédé de décodage

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282504B (zh) * 2007-04-05 2011-05-11 国家广播电影电视总局广播科学研究院 一种通过cmmb紧急广播表传输紧急广播消息的方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1030484A2 (fr) * 1999-01-29 2000-08-23 Nortel Networks Corporation Qualité de service de la couche liaison de données pour le réseau UMTS
EP1198107A2 (fr) * 2000-10-07 2002-04-17 Lg Electronics Inc. Procédé pour la transmission de données de la couche RLC dans un système de radiocommunication

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1030484A2 (fr) * 1999-01-29 2000-08-23 Nortel Networks Corporation Qualité de service de la couche liaison de données pour le réseau UMTS
EP1198107A2 (fr) * 2000-10-07 2002-04-17 Lg Electronics Inc. Procédé pour la transmission de données de la couche RLC dans un système de radiocommunication

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Digital cellular telecommunications system (Phase 2+); Channel coding (3GPP TS 45.003 version 5.7.0 Release 5); ETSI TS 145 003" ETSI STANDARDS, EUROPEAN TELECOMMUNICATIONS STANDARDS INSTITUTE, SOPHIA-ANTIPO, FR, vol. 3-G1, no. V570, April 2003 (2003-04), XP014010663 ISSN: 0000-0001 *
"Universal Mobile Telecommunications System (UMTS); Multimedia Broadcast/Multicast Service (MBMS); Stage 1 (3GPP TS 22.146 version 5.2.0 Release 5); ETSI TS 122 146" ETSI STANDARDS, EUROPEAN TELECOMMUNICATIONS STANDARDS INSTITUTE, SOPHIA-ANTIPO, FR, vol. 3-SA1, no. V520, March 2002 (2002-03), XP014007342 ISSN: 0000-0001 *
3RD GENERATION PARTNERSHIP PROJECT ET AL: "3GPP TS 25.322 V4.7.0 ; Radio Link Control (RLC) protocol specification ; Release 4" 3GPP TS 25.322 V4.7.0, XX, XX, December 2002 (2002-12), pages 1-76, XP002294128 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4210228A4 (fr) * 2020-09-02 2024-02-28 Sony Group Corporation Dispositif de traitement d'informations, procédé de codage et procédé de décodage

Also Published As

Publication number Publication date
WO2005020607A3 (fr) 2005-08-11

Similar Documents

Publication Publication Date Title
JP4274942B2 (ja) 通信システムにおける復号複雑さを低減する方法及びシステム
CN1871804B (zh) 广播/多播内容的外部编码方法及其相关装置
US8171381B2 (en) Outer coding methods for broadcast/multicast content and related apparatus
US8694869B2 (en) Methods for forward error correction coding above a radio link control layer and related apparatus
US8804761B2 (en) Methods for seamless delivery of broadcast and multicast content across cell borders and/or between different transmission schemes and related apparatus
KR100877078B1 (ko) Ｍｂｍｓ 수신 시스템에 있어서의 에러 정정 방법 및 장치
JP5248561B2 (ja) 通信システム上の外部デコーダでコード結合するための方法およびシステム
Gasiba et al. System design and advanced receiver techniques for MBMS broadcast services
EP1521384A2 (fr) Procédé de transmission de messages multimédias
WO2005020607A2 (fr) Methode de transmission d'un message multimedia
Jenkac et al. Flexible outer Reed-Solomon coding on RLC layer for MBMS over GERAN
EP1624605A1 (fr) Procédé de réception avec couche perméable pour la transmission multidestinataire fiable dans un système sans fil
Gasiba et al. Enhanced system design for download and streaming services using Raptor codes
Provvedi et al. Provision of MBMS over the GERAN: technical solutions and performance
Gasiba et al. Communication Networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG 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 NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY 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: A2

Designated state(s): BW GH GM KE LS MW MZ NA 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 PL 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
122 Ep: pct application non-entry in european phase