EP1782557A1 - Mise en oeuvre de codage et de multiplexage de liaison montante - Google Patents

Mise en oeuvre de codage et de multiplexage de liaison montante

Info

Publication number
EP1782557A1
EP1782557A1 EP04769174A EP04769174A EP1782557A1 EP 1782557 A1 EP1782557 A1 EP 1782557A1 EP 04769174 A EP04769174 A EP 04769174A EP 04769174 A EP04769174 A EP 04769174A EP 1782557 A1 EP1782557 A1 EP 1782557A1
Authority
EP
European Patent Office
Prior art keywords
data
coding
signal
multiplexing
block
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.)
Withdrawn
Application number
EP04769174A
Other languages
German (de)
English (en)
Inventor
Ari Hatula
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.)
Nokia Solutions and Networks Oy
Original Assignee
Nokia Oyj
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 Nokia Oyj filed Critical Nokia Oyj
Publication of EP1782557A1 publication Critical patent/EP1782557A1/fr
Withdrawn legal-status Critical Current

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/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/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/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
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system

Definitions

  • This invention generally relates to audio and data coding and more specifically to uplink encoding (coding and multiplexing) of data from multiple transport channels without intermediate memories.
  • the object of the present invention is to provide a methodology for uplink encoding (coding and multiplexing) of data from multiple transport channels without intermediate memories using "on the fly” method.
  • a method for uplink coding and multiplexing of data from N transport channels comprises the steps of: coding the data from a transport channel out of N transport channels, wherein N is an integer of at least a value of one; interleaving the coded data; performing rate matching of the interleaved data; and further interleaving and multiplexing the rate matched data with further rate matched data from further transport channels out of the N transport channels, thus providing the uplink coding and multiplexing of the data from the N transport channels, wherein no intermediate memories are used for the uplink coding and multiplexing.
  • the method may comprise the step of: choosing a type of channel coding to be used for coding the data from the N transport channels optionally based on a spectral content of the data; wherein the step of coding is performed using the chosen type of channel coding.
  • the type of the channel may have a convolutional coding algorithm or a turbo coding algorithm.
  • the coding may be provided by a T-coder block if the turbo coding algorithm is chosen or may be provided by a C-coder block if the convolutional coding algorithm is chosen, thus providing a T-coded signal or a C-coded signal, respectively.
  • the coding and interleaving may be provided by a T-coder and interleaver block if the turbo coding algorithm is chosen or may be provided by a C-coder interleaver block if the convolutional coding algorithm is chosen, thus providing a T-coded and interleaved signal or a C-coded and interleaved signal, respectively.
  • the coding may be provided by a coder block, thus providing a coded signal.
  • the interleaving of the coded data may be performed by an interleaver block using the coded signal.
  • the coded signal may be provided by the coder block to the interleaver block only after the interleaver block provides a data request signal to the coder block and the coder block provides a data ready signal to the interleaver block, thus eliminating a need for the intermediate memory.
  • the interleaver block may provide a rate matched signal containing the interleaved and coded data after optionally modifying it by performing a radio frame equalization (RFE), a radio frame segmentation (RFS) and a rate matching (RM).
  • RFE radio frame equalization
  • RFS radio frame segmentation
  • RM rate matching
  • the rate matched signal may be provided by the interleaver block to a further interleaver block for performing the further interleaving and multiplexing only after the interleaver block provides a rate matching ready signal to the further interleaver block, thus eliminating a further need for the intermediate memory.
  • the coding and interleaving may be provided by a coder and interleaver block, thus providing a coded and interleaved signal. Further, after completing the interleaving of the coded data, the coder and interleaver block may provide to a rate matching block the coded and interleaved signal containing the interleaved and coded data optionally modified by performing a radio frame equalization (RFE) and a radio frame segmentation (RFS).
  • RFE radio frame equalization
  • RFS radio frame segmentation
  • the coded and interleaved signal may be provided by the coder and interleaver block to the rate matching block only after the rate matching block provides a data request signal to the coder and interleaver block and the coder and interleaver block may provide a data ready signal to the rate matching block, thus eliminating a need for the intermediate memory.
  • the rate matched signal may be provided by the rate matching block in response to the coded and interleaved signal to a further interleaver block for performing the further interleaving and multiplexing only after the rate matching block provides a rate matching ready signal to the further interleaver block, thus eliminating a further need for the intermediate memory.
  • the further interleaving and multiplexing may be performed by a further interleaver block by writing the rate matched data indicated by a rate matched signal directly to a further memory, thus eliminating a need for the intermediate memory, wherein optionally the further memory may be a further random access memory.
  • the further interleaver block may provide a transport channel multiplexing complete signal indicating that the further interleaving and multiplexing is completed for the data from the transport channel.
  • further data from a further transport channel out of the N transport channels may be provided to a coder block or to a coder and interleaver block by a memory for further multiplexing with the data from the transport channel, wherein optionally the memory may be a random access memory.
  • the data from any transport channel of the N transport may be provided for the coding by a memory, wherein optionally the memory may be a random access memory.
  • a computer program product comprising a computer program code characterized in that it includes instructions for an uplink coding and multiplexing of data from N transport channels, comprises the steps of: coding the data from a transport channel out of N transport channels, wherein N is an integer of at least a value of one; interleaving the coded data; performing rate matching of the interleaved data; and further interleaving and multiplexing the rate matched data with further rate matched data from further transport channels out of the N transport channels, thus providing the uplink coding and multiplexing of the data from the N transport channels, wherein no intermediate memories are used for the uplink coding and multiplexing.
  • an electronic device capable of uplink coding and multiplexing of data from N transport channels comprises: means for coding the data from a transport channel out of the N transport channels, wherein N is an integer of at least a value of one; means for interleaving the coded data; means for rate matching of the interleaved data; a further interleaver block, for further interleaving and multiplexing the rate matched data with further rate matched data from further transport channels of the N transport channels; and a further memory, for direct writing the further interleaved and multiplexed data, thus providing the uplink coding and multiplexing of the data from the N transport channels, wherein no intermediate memories are used for the uplink coding and multiplexing and wherein optionally the further memory is a further random access memory.
  • the electronic device may further comprise a memory, for providing the data from any transport channel of the multiple transport channels for the coding by the coding means, wherein optionally the memory may be a random access memory.
  • the electronic device may further comprises a processor, for setting controls of the means for the coding, of the means for the interleaving, of the means for the rate matching and of the further interleaver block.
  • a type of channel coding to be used for coding the data from the N transport channels may be chosen and may be optionally based on a spectral content of the data.
  • the type of the channel coding may have a convolutional coding algorithm or a turbo coding algorithm.
  • the means for coding may be a T-coder block if the turbo coding algorithm is chosen or a C-coder block if the convolutional coding algorithm is chosen, for providing a T-coded signal or a C- coded signal, respectively.
  • the means for the coding and means for the interleaving may be combined in a T-coder and interleaver block if the turbo coding algorithm is chosen or may be combined in a C-coder and interleaver block if the convolutional coding algorithm is chosen, for providing a T-coded and interleaved signal or a C-coded and interleaved signal, respectively.
  • the means for coding may be a coder block, for providing a coded signal.
  • the interleaving of the coded data may be performed by an interleaver block using the coded signal.
  • the coded signal may be provided by the coder block to the interleaver block only after the interleaver block provides a data request signal to the coder block and the coder block may provide a data ready signal to the interleaver block, thus eliminating a need for the intermediate memory. Still further, after completing the interleaving of the coded data, the interleaver block may provide a rate matched signal containing the interleaved and coded data after optionally modifying it by performing a radio frame equalization (RFE), a radio frame segmentation (RFS) and a rate matching (RM).
  • RFE radio frame equalization
  • RFS radio frame segmentation
  • RM rate matching
  • the rate matched signal may be provided by the interleaver block to the further interleaver block for performing the further interleaving and multiplexing only after the interleaver block provides a rate matching ready signal to the further interleaver block, thus eliminating a further need for the intermediate memory.
  • the means for coding and means for interleaving may be combined in a coder and interleaver block, for providing a coded and interleaved signal.
  • the coder and interleaver block After completing the interleaving of the coded data, the coder and interleaver block provides the coded and interleaved signal containing the interleaved and coded data optionally modified by performing a radio frame equalization (RFE) and a radio frame segmentation (RPS). Still further, the coded and interleaved signal may be provided by the coder and interleaver block to the rate matching block only after the rate matching block provides a data request signal to the coder and interleaver block and the coder and interleaver block provides a data ready signal to the rate matching block, thus eliminating a need for the intermediate memory.
  • RFE radio frame equalization
  • RPS radio frame segmentation
  • the means for the rate matching may be a rate matching block, responsive to the coded and interleaved signal, for providing a rate matched signal to a further interleaver block for performing the further interleaving and the multiplexing only after the rate matching block provides a rate matching ready signal to the further interleaver block, thus eliminating a further need for the intermediate memory.
  • the further interleaving and multiplexing may be performed by the further interleaver block by writing the rate matched data indicated by a rate matched signal directly to the further memory, thus eliminating a need for the intermediate memory, wherein optionally the further memory is a further random access memory. Further, after finishing the further interleaving and multiplexing of the rate matched signal representing the data from the transport channel out of the N transport channels, the further interleaver block may provide a transport channel multiplexing complete signal.
  • further data from another transport channel out of the N transport channels may be provided to the means for coding by a memory for further multiplexing with the data from the transport channel, wherein optionally the memory may be a random access memory.
  • the electronic device may be an electronic communication device, a mobile terminal, a mobile communication device or a mobile phone.
  • an integrated circuit may be used for incorporating the means for coding, the means for interleaving, the means for rate matching, the further interleaver block and a further memory.
  • an integrated circuit capable of uplink coding and multiplexing of data from N transport channels comprises: means for coding the data from a transport channel out of the N transport channels, wherein N is an integer of at least a value of one; means for interleaving the coded data; means for rate matching of the interleaved data; a further interleaver block, for further interleaving and multiplexing the rate matched data with further rate matched data from further transport channels of the N transport channels; and a further memory, for direct writing the further interleaved and multiplexed data, thus providing the uplink coding and multiplexing of the data from the N transport channels, wherein no intermediate memories are used for the uplink coding and multiplexing and wherein optionally the further memory is a further random access memory.
  • the integrated circuit may further comprise a memory, for providing the data from any transport channel of the N transport channels for the coding by the coding means, wherein optionally the memory is a random access memory.
  • the integrated circuit may further comprises a processor, for setting controls of the means for coding, of the means for the interleaving, of the means for the rate matching and of the further interleaver block.
  • Figure 1 shows a standard to be complied with by the present invention for transport channel multiplexing structure for uplink, according to 3GPP TS 25.212 V6.2.0 (2004-03);
  • Figure 2 shows a block diagram of an encoding architecture for uplink coding and multiplexing of data from multiple transport channels, according to the present invention
  • Figure 3 shows a block diagram of an alternative implementation of encoding for uplink coding and multiplexing of Figure 2, according to the present invention
  • Figure 4 shows a block diagram of an alternative implementation of an encoding architecture for a fast processing path of uplink coding and multiplexing of Figure 2, according to the present invention
  • Figure 5 shows a block diagram of an alternative implementation of encoding for uplink coding and multiplexing of Figure 4, according to the present invention
  • Figure 6 shows a flow chart for uplink coding and multiplexing shown in Figures
  • Figure 7 shows a flow chart for uplink coding and multiplexing shown in Figure 5, according to the present invention.
  • the present invention provides a new methodology for uplink encoding (coding and multiplexing) of data from multiple transport channels without intermediate memories using "on the fly” method.
  • the invention presents a new encoding architecture for implementing a "transport channel multiplexing structure for uplink" shown in Figure 1 per 3GPP TS 25.212 V6.2.0 (2004-06).
  • the present invention decreases the memories by simultaneousLY running encoding steps of channel coding, first interleaving, rate matching, second interleaving and multiplexing. This is accomplished by a "handshaking" between the appropriate blocks as discussed in detail below.
  • the present invention makes the implementation of uplink encoding easier by decreases the memories to be used in the implementation of the algorithm.
  • FIG. 2 shows one example among others of a block diagram of an encoding architecture for uplink coding and multiplexing of data from multiple transport channels, according to the present invention.
  • N is an integer of at least a value of one
  • This data from the N transport channels contains CRC (cyclic redundancy check) attachment, TrBr concatenation/code block segmentation as required by the 3GPP standard shown in Figure.
  • the memory 12 can be a random access memory.
  • the encoding (coding and multiplexing) process is started and controlled (e.g., indicating when the next transport channel is started, controlling the rate matching parameter calculation, etc.) by providing a transport channel control signals lib, lie and Hd to the blocks 14, 16 and 18 (their performance is described below) by the processor 15.
  • a coder block 14 In response to the signal Hd a coder block 14 reads the data from the memory 12 (a signal 24) for one transport channel out of said N transport channels. After coding (details on coding are provided below) by the coder block 14, the coded data from said one transport channel (a coded signal 26) is provided to an interleaver block 16.
  • an additional memory block buffer
  • a "handshaking" procedure between the blocks 14 and 16 is used, allowing to perform the interleaving procedure "on the fly".
  • the coded signal 26 is provided by said coder block 14 to said interleaver block 16 only after said interleaver block 16 provides a data request signal (e.g., setting "DataRequest” signal to “high”) to said coder block 14 and said coder block 14 provides a data ready signal (e.g., setting "DataReady” signal to “high”) to said interleaver block 16.
  • a data request signal e.g., setting "DataRequest” signal to "high
  • data ready signal e.g., setting "DataReady” signal to "high
  • the interleaver block 16 After completing the interleaving of said coded data, the interleaver block 16 also performs a radio frame equalization (RFE), a radio frame segmentation (RFS) and a rate matching (RM) as required by the 3GPP standard shown in Figure 1.
  • RFE radio frame equalization
  • RFS radio frame segmentation
  • RM rate matching
  • the rate matched signal 28 is provided to the further interleaver block 18 only after said interleaver block 16 provides a rate matching ready signal (e.g., setting "RateMatchingRdy” signal to "high") to said further interleaver block 18, thus eliminating a further need for said intermediate memory.
  • the further interleaving and multiplexing is performed by the further interleaver block 18 by writing (as an interleaved signal 30 in Figure 2) said rate matched data contained in the rate matched signal 28 directly to a further memory 20.
  • the further memory 20 can be, e.g., a further random access memory.
  • the further interleaver block 18 After finishing the further interleaving and multiplexing of said data from said one transport channel out of the N transport channels, the further interleaver block 18 provides to the processor 15 a transport channel multiplexing complete signal 19 indicating that said further interleaving and multiplexing is completed for said data from said one transport channel, hi response to said transport channel multiplexing complete signal 19, the processor signals (by sending the transport channel control signals lib, lie and Hd mentioned above) to the blocks 14, 16 and 18 to provide further data from a further transport channel out of said N transport channels to a coder block 14.
  • the procedure described above is repeated until all the data from all said N transport channels is multiplexed in the further memory 12.
  • the coded and multiplexed data from said N transport channels stored in the further memory 20 (acting as a buffer) is provided as an input transport signal (signal 32) to a transmitter 22 for sending to a network (signal 34).
  • the processor 15 sets the controls of all blocks (the blocks 14, 16 and 18) of a • fast processing path 10.
  • the transmitter 22 reads the interleaved data (signal 32) via an interface buffer (e.g., the further memory 20) for further processing.
  • an electronic device capable of uplink coding and multiplexing of data from N transport channels described above and shown in Figure 2 can be an electronic communication device, a mobile terminal, a mobile communication device or a mobile phone.
  • the new encoding architecture described in this invention creates opportunities for designing application specific integrated circuits (ASICs) to implement the 3GPP standards, quoted above, in terms of reducing complexity and chip area, power consumption and a number of interrupt commands for processing, which consequently decreases digital signal processing (DSP) requirements and the chip area.
  • ASICs application specific integrated circuits
  • Such integrated circuit can contain all or selected components (blocks) shown in Figure 2, as well as in Figures 3, 4 and 5 discussed below.
  • Figure 3 shows another example among others of an alternative implementation of the fast processing path 10 of encoding for the uplink coding and multiplexing of Figure 2, according to the present invention.
  • a type of channel coding to be used for coding the data from said N transport channels can be chosen, e.g., based on a spectral content of said data.
  • the type of the channel coding can have a convolutional coding algorithm or a turbo coding algorithm.
  • the coding can be provided by a T- coder block 14a if said turbo coding algorithm is chosen or it can be provided by a C- coder block 14b if said convolutional coding algorithm is chosen, thus providing a T- coded signal 26a or a C-coded signal 26b, respectively.
  • Each of the signals 26a or 26b is equivalent to the coded signal 26 of Figure 2.
  • the rest of the processing is the same as described in regard to Figure 2.
  • Figure 4 shows yet another example among others of an alternative implementation of the fast processing path 10 of encoding for the uplink coding and multiplexing of Figure 2, according to the present invention.
  • the difference of Figure 4 from Figure 2 is that the coding and interleaving
  • a coder and interleaver block 21 (e.g., a virtual interleaving) are provided by a coder and interleaver block 21 (instead of using two separate blocks 14 and 16 in Figure 2), thus providing a coded and interleaved signal 27 to a rate matching block 17.
  • the coder and interleaver block 21 also typically performs a radio frame equalization (RFE) and a radio frame segmentation (RFS) as required by the 3GPP standard shown in Figure 1.
  • RFE radio frame equalization
  • RFS radio frame segmentation
  • an additional memory block (buffer) would be normally required to facilitate a rate matching operation of the rate matching block 17. According to the present invention that is not necessary (similarly to the procedure described in regard to Figure 2).
  • the coded and interleaved signal 27 is provided by said coder and interleaver block 21 to said rate matching block 17 only after said rate matching block 17 provides a data request signal (e.g., setting "DataRequest” signal to "high") to said coder and interleaver block 21 and said coder and interleaver block 21 provides a data ready signal (e.g., setting "DataReady” signal to "high") to said rate matching block 17.
  • a data request signal e.g., setting "DataRequest” signal to "high
  • data ready signal e.g., setting "DataReady” signal to "high
  • a rate matched signal 28 of Figure 4 containing said interleaved and coded data is provided by the rate matching block 17 to a further interleaver block 18 for performing said further interleaving and multiplexing.
  • the rate matched signal 28 is provided to a further interleaver block 18 only after said rate matching block 17 provides a rate matching ready signal (e.g., setting "RateMatchingRdy” signal to "high") to said a further interleaver block 18, thus eliminating a further need for said intermediate memory.
  • the rest of the processing is the same as described in regard to Figure 2.
  • Figure 5 shows a further example among others of an alternative implementation of the fast processing path 10 of encoding for the uplink coding and multiplexing of Figure 4, according to the present invention.
  • a type of channel coding to be used for coding the data from said N transport channels can be chosen, e.g., based on the spectral content of said data.
  • the type of the channel coding, according to the present invention can have the convolutional coding algorithm or the turbo coding algorithm.
  • the coding can be provided by a T-coder and interleaver block 21a if said turbo coding algorithm is chosen or can be provided by a C- coder and interleaver block 21b if said convolutional coding algorithm is chosen, thus providing a T-coded and interleaved signal 27a or a C-coded interleaved signal 27b, respectively.
  • Each of the signals 27a or 27b is equivalent to the coded and interleaved signal 27 of Figure 4.
  • the rest of the processing is the same as described in regard to Figures 4 and 2.
  • Figure 6 shows a flow chart for the uplink coding and multiplexing shown in Figures 3 and 2, according to the present invention
  • a first step 40 the user data (from the N transport channels) is collected in the memory 12 (acting as a buffer).
  • the type of coding (convolution or turbo) is chosen based on the user data for the particular one transport channel
  • hi a next step 44 the user data for the particular one transport channel is provided to the C-coder block 14b if the convolution code is chosen or to the T-coder block 14a if the turbo coder is chosen
  • hi a next step 46 the C- coder 24b or the T-coder block 24a encodes the user data for the one particular transport channel, providing the C-coded or T-coded signal 26b or 26a, respectively, to the interleaver block 16.
  • the interleaver block 16 interleaves the C-coded or T-coded signal and subsequently performs the RFE, the RFS and the rate matching, providing the rate matched signal 28 (which corresponds to the data from the processed transport channel) to the further interleaver block 18 using the "handshaking" procedure described above.
  • the further interleaver block 18 interleaves and multiplexes the rate matched signal 28 by the direct writing (the signal 30) it to the further memory 20 again using "handshaking" procedure described above
  • hi a next step 54 it is determined whether further data from another transport channel out of said N transport channels needs to be encoded (coded and multiplexed).
  • step 56 the coded and multiplexed data from N transport channels stored in further memory 20 (acting as a buffer) is provided to the transmitter 22 for sending to the network (signal 34).
  • Figure 7 shows a flow chart for the uplink coding and multiplexing shown in
  • FIG 5 according to the present invention.
  • the flow chart of Figure 7 represents only one possible scenario among many others. The procedure is similar to the one described in Figure 6 but with steps 44, 46 and 48 substituted by step 44a, 46a, 48a and 50 which are described below.
  • a step 44a (following the step 42 described above in regard to Figure 6), the user data for the particular one transport channel is provided to the C-coder and interleaver block 21b if the convolution code is chosen or to the T-coder and interleaver block 21a if the turbo coder is chosen, hi a next step 46a, the C-coder and interleaver block 21b or the T-coder and interleaver block 21a codes the user data for the one particular transport channel, hi a next step 48a, the C- coder and interleaver block 21b or the T-coder and interleaver block 21a interleaves (using virtual interleaving) the C-coded or T-coded data and subsequently performs the RFE and the RFS providing the T- or C- coded and interleaved signal 27a or 27b to the rate matching block 17.
  • the rate matching block 17 performs rate matching thus providing the rate matched signal 28 to the

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

La présente invention a trait à un procédé pour une nouvelle méthodologie pour le codage (codage et multiplexage) de données en provenance d'une pluralité de voies de transport sans mémoires intermédiaires utilisant la méthode à la volée. L'invention a trait à une nouvelle architecture de codage pour la mise en oeuvre de structure de multiplexage de voies de transport pour la liaison montante en conformité avec la 3GPP TS 25.212 V6.2.0 (2004-06). La présente invention réduit les mémoires par l'exécution simultanée d'étapes de codage de voies (14), de premier entrelacement (16), appariement de débit (28), de deuxième entrelacement et multiplexage (18). Cette réduction de mémoires est réalisée par un protocole de transfert entre les blocs appropriés. L'invention crée des opportunités pour la conception de circuits intégrés à application spécifique (ASICs) pour la mise en oeuvre des normes susmentionnées en termes de réduction de complexité, de surface occupée, de consommation d'énergie et d'un certain nombre de commande d'interruptions pour le traitement, qui réduit par conséquent les besoins en traitement numérique des signaux.
EP04769174A 2004-08-25 2004-08-25 Mise en oeuvre de codage et de multiplexage de liaison montante Withdrawn EP1782557A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2004/002748 WO2006021828A1 (fr) 2004-08-25 2004-08-25 Mise en oeuvre de codage et de multiplexage de liaison montante

Publications (1)

Publication Number Publication Date
EP1782557A1 true EP1782557A1 (fr) 2007-05-09

Family

ID=35967188

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04769174A Withdrawn EP1782557A1 (fr) 2004-08-25 2004-08-25 Mise en oeuvre de codage et de multiplexage de liaison montante

Country Status (3)

Country Link
EP (1) EP1782557A1 (fr)
CN (1) CN101027860A (fr)
WO (1) WO2006021828A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8699316B2 (en) 2007-03-21 2014-04-15 Marvell World Trade Ltd. USF coding
CN101841390B (zh) * 2010-03-01 2014-03-05 联芯科技有限公司 传输信道编码及复用方法和比特级处理器
CN101807974B (zh) 2010-04-07 2015-05-20 中兴通讯股份有限公司 一种在物理上行共享信道传输上行控制信令的系统及方法
CN102594485B (zh) * 2011-01-07 2015-08-12 中兴通讯股份有限公司 一种传输信道的传输级处理方法、装置及设备
CN102594371B (zh) * 2011-01-18 2015-09-02 中兴通讯股份有限公司 一种Turbo编码交织处理的方法及装置
CN103378940B (zh) * 2012-04-17 2018-01-16 马维尔国际有限公司 用于td‑scdma系统的上行信道编码方法及装置
CN107078945B (zh) * 2014-09-30 2021-02-23 上海诺基亚贝尔股份有限公司 用于多入口与多出口之间的交叉并行数据的方法和装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2266283C (fr) * 1999-03-19 2006-07-11 Wen Tong Entrelaceur de donnees et methode d'entrelacement de donnees
FR2792788B1 (fr) * 1999-04-21 2001-07-13 Mitsubishi Electric France PROCEDE D'EQUILIBRAGE DU RAPPORT Eb/I DANS UN SYSTEME cdma A MULTIPLEXAGE DE SERVICE ET SYSTEME DE TELECOMMUNICATION L'UTILISANT

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2006021828A1 *

Also Published As

Publication number Publication date
CN101027860A (zh) 2007-08-29
WO2006021828A1 (fr) 2006-03-02

Similar Documents

Publication Publication Date Title
TWI383682B (zh) 用以有效地編碼及解碼視訊資料之方法、裝置及系統
US7631248B2 (en) Cycle-stealing decoding apparatus, systems, and methods
RU2328834C2 (ru) Системы и способы мультиплексирования данных управления для множества каналов передачи данных в одном канале управления
JP2003528477A (ja) マップデコーダ用の区分されたデインターリーバメモリ
JP2007006382A (ja) 受信装置および反復復号方法
KR20060097729A (ko) 제어 정보를 물리 데이터 채널상에 다중화하는 시스템 및방법
EP1782557A1 (fr) Mise en oeuvre de codage et de multiplexage de liaison montante
US5566183A (en) System and method for deinterleaving digital data
WO2019149180A1 (fr) Procédé d'entrelacement, et dispositif d'entrelacement
US20080109229A1 (en) Sound data processing apparatus
KR20150026405A (ko) 음성 패킷 송수신 방법 및 이를 구현하는 전자 장치
EP1345333B1 (fr) Procédé et dispositif de protection contre les erreurs
DE69728412T2 (de) Systeme und verfahren zur übertragung gewünschter audiodaten über ein übertragungsmedium
JP2003532327A (ja) 多重化−インターリービング及びデマルチプレックス−デインターリービング
US20070201584A1 (en) Apparatus for decoding convolutional codes and associated method
US20080025415A1 (en) Uplink Coding And Multiplexing Instrumentation
EP2450882A1 (fr) Procédé, dispositif et système de codage et de décodage audio par descriptions multiples
WO2002062001A1 (fr) Procede de communication a correction d'erreurs et appareil de communication dans lequel ce procede de communication est mis en oeuvr e
JP3566651B2 (ja) 信号の符号化
KR20070041617A (ko) 업링크 부호화 및 다중화 구현
JP2000004171A (ja) 移動体通信方法
US7269149B2 (en) Interleaving for mobile communications
JP2002078024A (ja) データ送信装置とデータ受信装置及びデータ送信方法とデータ受信方法
JP2002208910A (ja) 携帯端末装置、及び、データ送信方法
JP5088110B2 (ja) 受信回路

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20070228

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS OY

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20090401