US20050232203A1 - Data processing apparatus, and its processing method, program product and mobile telephone apparatus - Google Patents
Data processing apparatus, and its processing method, program product and mobile telephone apparatus Download PDFInfo
- Publication number
- US20050232203A1 US20050232203A1 US11/088,883 US8888305A US2005232203A1 US 20050232203 A1 US20050232203 A1 US 20050232203A1 US 8888305 A US8888305 A US 8888305A US 2005232203 A1 US2005232203 A1 US 2005232203A1
- Authority
- US
- United States
- Prior art keywords
- data processing
- data
- access
- address
- memory
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
Definitions
- the present invention relates to a data processing apparatus, its processing method, program product and mobile telephone apparatus.
- the present invention relates to a receiving side data processing apparatus in a HARQ (Hybrid Automatic Repeat Request) processing apparatus used in W-CDMA (Wideband-Code Division Multiple Access), its processing method, program product and mobile telephone apparatus.
- HARQ Hybrid Automatic Repeat Request
- W-CDMA Wideband-Code Division Multiple Access
- the international standard association 3GPP (3rd Generation Partnership Project) for the third generation mobile radio communication system attempts to add a new function called HSDPA (High Speed Downlink Packet Access) to the W-CDMA standards in order to implement faster radio communication.
- HSDPA High Speed Downlink Packet Access
- One kind of characteristic processing that makes fast communication according to the HSDPA possible is HARQ (see 3GPP TS25.212 V5.6.0 (2003.9) 4.2.7, 4.5.4).
- the HARQ is processing for conducting data retransmission efficiently when data cannot be received correctly at the receiving side.
- transmission data is divided into a plurality of groups.
- the groups are called processes.
- retransmission in the HARQ is managed every process. As a result, it becomes possible to transmit and receive data of other processes while data retransmission of a certain process is being conducted.
- FIG. 1 is a configuration diagram showing an example of a conventional transmitting side HARQ processing apparatus.
- FIG. 2 is a configuration diagram showing an example of a conventional receiving side HARQ processing apparatus.
- the conventional transmitting side HARQ processing apparatus 100 includes J (where J is a positive integer) rate matching units 101 .
- Data 102 including N (where N is a positive integer and N>J) processes is supplied to the conventional transmitting side HARQ processing apparatus 100 as its input data. Its output data is interleaved by an interleave unit 103 and then output as output data 104 including N processes.
- the rate matching unit 101 conducts processing every J processes simultaneously, and consequently outputs N process data.
- a conventional receiving side HARQ processing apparatus 110 includes J HARQ synthesis units 111 , a buffer 112 , and K (where K is a positive integer and K ⁇ N) rate matching units 113 .
- the output data 104 of the transmitting side HARQ processing apparatus 100 is supplied as an input.
- the input data 104 is deinterleaved in a deinterleave unit 114 , and input to the receiving side HARQ processing apparatus 110 .
- HARQ processing in the receiving side HARQ processing apparatus 110 includes elementary processing called HARQ synthesis in the HARQ synthesis unit 111 and rate dematching in the rate dematching unit 113 .
- the HARQ synthesis is processing of adding data of a process that could not be received correctly and the same data that is retransmitted. As a result, the possibility that data can be received correctly at the time of retransmission is increased.
- the rate dematching is inverse processing to processing of adjusting difference in rate between transmission data and a physical channel, which is called rate matching.
- the rate of the transmission data is higher than the rate of the physical channel, the rate of the transmission data is squared with the rate of the physical channel are by thinning (hereafter called “puncture”) some data in a transmission data train.
- the rate of the transmission data is squared with the rate of the physical channel by repeating (hereafter called “repeat”) some data in the transmission data train.
- dummy data are inserted in locations of data thinned on the transmitting side, or data repeated on the transmitting side are deleted.
- the buffer 112 When implementing such HARQ processing conducted on the receiving side as an apparatus, the buffer 112 becomes necessary to store data transmitted last time until the same data is retransmitted, besides the HARQ synthesis unit 111 and the rate matching unit 113 as shown in FIG. 2 .
- the buffer 112 When implementing the buffer 112 by using a single-port memory, schemes described below are generally considerable. However, those schemes have problems.
- JP-A Japanese Patent Publication
- JP-A Japanese Patent Publication
- a first cycle an address of each even-numbered value is supplied to a write port and an address of each odd-numbered value is supplied to a read port.
- a subsequent second cycle an address of each odd-numbered value is supplied to a write port and an address of each even-numbered value is supplied to a read port.
- Such a technique of switching the write port and the read port alternately in each cycle and conducting data writing and reading is disclosed.
- Scheme 1 It is a scheme of implementing the buffer 112 by using one physical memory (buffer 112 ). If, for example, there are four processes (process 1 , process 2 , process 3 and process 4 ), data of these processes are disposed on one physical memory (buffer 112 ).
- FIG. 3 is a diagram showing the scheme 1. If it is attempted to execute the rate dematching on data of the process 2 and the HARQ synthesis on data of the process 3 simultaneously as shown in FIG. 3 , accesses to the buffer 112 occur simultaneously and consequently access contention occurs. Therefore, the rate dematching and the HARQ synthesis cannot be executed simultaneously. The HARQ synthesis is executed after execution of the rate dematching is completed, or the rate dematching is executed after execution of the HARQ synthesis is completed. In this way, this scheme has a problem of lengthened execution time of the HARQ.
- FIG. 4 is a diagram showing a scheme 2.
- a buffer 112 is formed of a plurality of physical memories (RAMs 121 to 124 ), and physical memories and processes are assigned in one-to-one correspondence as shown in FIG. 4 .
- data of a process 1 is stored in the RAM 121
- data of a process 2 is stored in the RAM 122
- data of a process 3 is stored in the RAM 123
- data of a process 4 is stored in the RAM 124 .
- FIG. 5 is a diagram showing access contention in the scheme 2. As shown in FIG. 5 , there is a possibility of disposing data of two processes (the process 2 and the process 3 in an example shown in FIG. 5 ) on the same physical memory (RAM 122 ). In this case, access contention occurs and consequently the same problem as that in the scheme 1 occurs.
- JP-A-2000-173261 is intended for access control on one dual port memory (a memory having one input port and one output port)
- the present invention is intended for two or more single port memories (memories each having one port that serves as both input port and output port), and its control method is entirely different from the technique described in JP-A-2000-173261.
- An object of the present invention is to provide a data processing apparatus, and its processing method, program product and mobile telephone apparatus capable of preventing contention of memory access between the HARQ synthesis and rate dematching in the HARQ processing using two or more single-port memories.
- a data processing apparatus which executes a plurality of data processing simultaneously, the data processing apparatus including a plurality of data processing means provided so as to be associated with respective data processing, as many single-port memories as the number of data processing, and control means for controlling the single-port memories, wherein the control means exercise control so as to cause access to the single-port memories conducted by respective data processing means to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing of any data processing means and access contention occurs between the data processing means involving the change and another data processing means, access of one data processing means is given priority over access of the other data processing means.
- a data processing method is a data processing method of executing a plurality of data processing simultaneously, the data processing method including a plurality of data processing steps of conducting respective data processing, and a control step of controlling as many single-port memories as the number of the data processing, wherein at the control step, control is exercised so as to cause access to the single-port memories conducted at respective data processing steps to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing at any data processing step and access contention occurs between the data processing step involving the change and another data processing step, access at one data processing step is given priority at the control step over access at the other data processing step.
- a data processing program product is a data processing program product which causes a computer to execute a plurality of data processing simultaneously, the data processing program product including a plurality of data processing steps of conducting respective data processing, and a control step of controlling as many single-port memories as the number of the data processing, wherein at the control step, control is exercised so as to cause access to the single-port memories conducted at respective data processing steps to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing at any data processing step and access contention occurs between the data processing step involving the change and another data processing step, access at one data processing step is given priority at the control step over access at the other data processing step.
- the buffer includes a plurality of physical memories, for example, two physical memories. One of the memories is used as a memory for even address, whereas the other of the memories is used as a memory for odd address.
- the following control is conducted.
- Access control is conducted so as to make the rate dematching access the odd address memory when the HARQ synthesis accesses the even address memory.
- Access control is conducted so as to make the rate dematching access the even address memory when the HARQ synthesis accesses the odd address memory.
- control means exercise control so as to cause access to the single-port memories conducted by respective data processing means to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing of any data processing means and access contention occurs between the data processing means involving the change and another data processing means, access of one data processing means is given priority over access of the other data processing means. As a result, it becomes possible to prevent memory access contention.
- memory access contention does not occur between the HARQ synthesis and rate dematching. Therefore, these processing can be executed simultaneously. As a result, the processing time of the HARQ can be shortened. This effect can be obtained even when memory assignment of processes is changed according to a dynamic change in data sizes of processes and the number of processes.
- FIG. 1 is a configuration diagram showing an example of a conventional transmitting side HARQ processing apparatus
- FIG. 2 is a configuration diagram showing an example of a conventional receiving side HARQ processing apparatus
- FIG. 3 is a diagram showing a scheme 1 ;
- FIG. 4 is a diagram showing a scheme 2 ;
- FIG. 5 is a diagram showing access contention in a scheme 2 ;
- FIG. 6 is a configuration diagram showing a first embodiment of a data processing apparatus according to the present invention.
- FIG. 7 is a configuration diagram showing an example of a buffer 2 according to the present invention.
- FIG. 8 is a schematic diagram showing operation (first cycle) of the first embodiment
- FIG. 9 is a schematic diagram showing operation (second cycle) of the first embodiment
- FIG. 10 is a schematic diagram showing operation (third cycle) of the first embodiment
- FIG. 11 is a schematic diagram showing operation (fourth cycle) of the first embodiment
- FIG. 12 is a schematic diagram showing operation (fifth cycle) of the first embodiment
- FIG. 13 is a schematic diagram showing operation (sixth cycle) of the first embodiment
- FIG. 14 is a schematic diagram showing operation (third cycle) of the first embodiment
- FIG. 15 is a schematic diagram showing operation (fourth cycle) of the first embodiment
- FIG. 16 is a schematic diagram showing operation (fifth cycle) of the first embodiment
- FIG. 17 is a schematic diagram showing operation (sixth cycle) of the first embodiment
- FIG. 18 is a configuration diagram showing a third embodiment of a data processing apparatus.
- FIG. 19 is a schematic diagram showing an address assignment example of processes to memories.
- FIG. 6 is a configuration diagram showing a first embodiment of a data processing apparatus.
- the data processing apparatus includes a HARQ synthesis unit 1 , a buffer 2 , a rate dematching unit 3 , a head address generation unit 4 , and a memory 5 .
- the HARQ synthesis unit 1 is a processing block that conducts HARQ synthesis. Output data 11 of deinterleave processing which is a previous process of the HARQ processing is supplied to the HARQ synthesis unit 1 as its input. The HARQ synthesis unit 1 outputs data 12 obtained after the HARQ synthesis.
- the buffer 2 is a memory that retains the output data 12 of the HARQ synthesis unit 1 and supplies input data 13 of the rate dematching unit 3 .
- the output date 12 of HARQ synthesis unit 1 is supplied to buffer 2 as its input.
- the buffer 2 outputs the input data 13 to the rate dematching unit 3 .
- the rate dematching unit 3 is a processing block that conducts the rate dematching.
- the rate dematching unit 3 is supplied with the output data 13 of the buffer 2 as its input, and outputs data 14 obtained after the rate dematching.
- the rate dematching unit 3 turns on a puncture/repeat indication signal 15 .
- the rate dematching unit 3 turns off the puncture/repeat indication signal 15 .
- the head address generation unit 4 sets a storage address of head data of each process in the buffer 2 by using a head address signal 16 .
- an operation status signal 17 which indicates that the HARQ synthesis unit 1 is in operation is output from the HARQ synthesis unit 1 to the buffer 2 .
- An operation status signal 18 which indicates that the rate dematching unit 3 is in operation is output from the rate dematching unit 3 to the buffer 2 .
- a data readout signal 19 is output from the memory 5 to the buffer 2 .
- a program for a data processing method is stored in the memory 5 .
- FIG. 7 is a configuration diagram showing an example of the buffer 2 .
- the buffer 2 includes an even address memory 21 , an odd address memory 22 , an address generation unit 23 , and switches 24 to 27 .
- the puncture/repeat indication signal 15 the head address signal 16 , the operation status signals 17 and 18 , and the data readout signal 19 are input to the address generation unit 23 .
- data of four processes are written into each of the memories 21 and 22 in the buffer 2 of the present embodiment.
- the even address memory 21 is a memory that retains even-numbered data in each process.
- the even address memory 21 is supplied with the data 12 obtained after the synthesis conducted by the HARQ synthesis unit 1 , as its input.
- the even address memory 21 outputs the input data 13 of the rate dematching unit 3 .
- the odd address memory 22 is a memory that retains odd-numbered data in each process.
- the odd address memory 22 is supplied with the data 12 obtained after the synthesis conducted by the HARQ synthesis unit 1 , as its input.
- the odd address memory 22 outputs the input data 13 of the rate dematching unit 3 .
- the address generation unit 23 is a processing block that generates an address 31 of the even address memory 21 , an address 32 of the odd address memory 22 , and selection signals 33 to 36 for the switches 24 to 27 .
- the processing in the address generation unit 23 is executed in accordance with a program read out from the memory 5 by the address generation unit.
- the address generation unit 23 exercises control so as to delay one of the accesses by one cycle. If the operation status signals 17 and 18 that indicate that the HARQ synthesis unit 1 and the rate dematching unit 3 are in operation are turned on, the address generation unit 23 starts generation of the addresses 31 and 32 . Furthermore, the puncture/repeat indication signal 15 which indicates data punctured or repeated on the transmitting side is input from the rate dematching unit 3 .
- the switch 24 is a switch that distributes the output data 12 of the HARQ synthesis unit 1 to either the even address memory 21 or the odd address memory 22 on the basis of the selection signal 33 .
- “R” indicates connection to the even address memory 21
- “L” indicates connection to the odd address memory 22 .
- the switch 25 is a switch that connects the even address memory 21 to either the switch 24 or the switch 26 on the basis of the selection signal 34 .
- “R” indicates connection to the switch 26
- “L” indicates connection to the switch 24 .
- the switch 26 is a switch that outputs output data of either the even address memory 21 or the odd address memory 22 as the buffer output 13 on the basis of the selection signal 35 .
- “R” indicates connection to the odd address memory 22
- “L” indicates connection to the even address memory 21 .
- the switch 27 is a switch that connects the odd address memory 22 to either the switch 24 or the switch 26 on the basis of the selection signal 36 .
- “R” indicates connection to the switch 26
- “L” indicates connection to the switch 24 .
- FIGS. 8 to 13 are schematic diagrams showing operation (first to sixth cycles) of the first embodiment.
- the case where the HARQ synthesis is executed on the data of the process 3 at the same time that the rate dematching is executed on the data of the process 2 will be described as an example.
- address values in the ensuing description are nothing but examples.
- Storage address of head data of each process generated by the head address generation unit 4 is set in the address generation unit 23 in the buffer 2 on the basis of the head address signal 16 (in the ensuing example, the head data storage address of the process 2 is #0108 and the head data storage address of the process 3 is #0164).
- the set value is used as the initial value of the address.
- the HARQ synthesis unit 1 and the rate dematching unit 3 turn on the operation status signals 17 and 18 at the same time that processing is started. These operation status signals 17 and 18 are always kept in the on-state over the processing interval.
- Data of the process 2 is read out from the address 31 (address value #0108) in the even address memory 21 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts rate dematching on the data 13 .
- the address generation unit 23 generates the selection signals 34 and 35 so as to connect the switches 25 and 26 respectively to R and L.
- Data of the process 2 is read out from the address 32 (address value #0109) of the odd address memory 22 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts rate dematching on the data 13 .
- the HARQ synthesis is executed in the HARQ synthesis unit 1 , and the HARQ synthesis output data 12 is written into the address 31 (address value #0164) in the even address memory 21 as data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to R, L, R and R.
- Data of the process 2 is read out from the address 31 (address value #010A) in the even address memory 21 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts rate dematching on the data 13 .
- the HARQ synthesis is executed in the HARQ synthesis unit 1 , and the HARQ synthesis output data 12 is written into the address 32 (address value #0165) in the odd address memory 22 as data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to L, R, L and L.
- the data of the process 2 is punctured on the transmitting side, and the rate dematching unit 3 inserts dummy data. Therefore, data of the process 2 in the address #010A is read out again at the next fourth cycle. Whether data has been punctured is indicated by the indication signal 15 .
- the fourth cycle will now be described with reference to FIG. 11 .
- data of the process 2 is read out from the address value #010A in the even address memory 21 , it is attempted to write the HARQ synthesis output data 12 into an address value #0166 in the even address memory 21 as data of the process 3 .
- access contention to the even address memory 21 occurs.
- reading data of the process 2 i.e., memory access to the address value #010A
- writing data of the process 3 i.e., memory access to the address value #0166
- the address generation unit 23 sets the address value #010A in the address 31 , and generates the selection signals 34 and 35 so as to connect the switches 25 and 26 respectively to R and L.
- Data of the process 2 is read out from the address 32 (address value #010B) in the odd address memory 22 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts the rate dematching on the data 13 .
- the HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQ synthesis output data 12 into the address 31 (the address value #0166) in the even address memory 21 as the data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to R, L, R and R.
- Data of the process 2 is read out from the address 31 (address value #010C) in the even address memory 21 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts the rate dematching on the data 13 .
- the HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQ synthesis output data 12 into the address 32 (the address value #0167) in the odd address memory 22 as the data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to L, R, L and L.
- the seventh cycle and subsequent cycles also operate in the same way. Thereafter, the HARQ synthesis unit 1 and the rate dematching unit 3 turn off the operation status signals 17 and 18 when the processing is finished. As a result, the apparatus of the first embodiment stops the operation.
- the first embodiment it is possible to prevent contention between the rate dematching unit 3 and the HARQ synthesis unit 1 caused when the rate dematching unit 3 inserts dummy data, as heretofore described. As a result, it becomes possible to execute these processing simultaneously.
- a second embodiment is similar in configuration to the first embodiment (see FIGS. 6 and 7 ), but different in operation.
- the data of the process 2 is repeated on the transmitting side, and the rate dematching unit 3 deletes the repeated data.
- the rate dematching unit 3 deletes the repeated data.
- data of the process 2 in the address #010C is read out again in the next fourth cycle (i.e., reading data in the address #010B is not conducted).
- whether repeating is conducted is specified by the indication signal 15 .
- FIGS. 14 to 17 are schematic diagrams showing operation (third to sixth cycles) of the second embodiment.
- Data of the process 2 is read out from the address 31 (address value #010A) in the even address memory 21 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts rate dematching on the data 13 .
- the HARQ synthesis is executed in the HARQ synthesis unit 1 , and the HARQ synthesis output data 12 is written into the address 32 (address value #0165) in the odd address memory 22 as data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to L, R, L and L.
- data of the process 2 is repeated on the transmitting side, and the rate dematching unit 3 deletes the repeated data.
- the rate dematching unit 3 deletes the repeated data.
- the fourth cycle will now be described with reference to FIG. 15 .
- data of the process 2 is read out from the address value #010C in the even address memory 21 , it is attempted to write the HARQ synthesis output data 12 into an address value #0166 in the even address memory 21 as data of the process 3 .
- access contention to the even address memory 21 occurs.
- reading data of the process 2 i.e., memory access to the address value #010C
- writing data of the process 3 i.e., memory access to the address value #0166
- the address generation unit 23 sets the address value #010C in the address 31 , and generates the selection signals 34 and 35 so as to connect the switches 25 and 26 respectively to R and L.
- Data of the process 2 is read out from the address 32 (address value #010D) in the odd address memory 22 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts the rate dematching on the data 13 .
- the HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQ synthesis output data 12 into the address 31 (the address value #0166) in the even address memory 21 as the data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to R, L, R and R.
- Data of the process 2 is read out from the address 31 (address value #010E) in the even address memory 21 , and output as the output data 13 of the buffer 2 .
- the rate dematching unit 3 conducts the rate dematching on the data 13 .
- the HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQ synthesis output data 12 into the address 32 (the address value #0167) in the odd address memory 22 as the data of the process 3 .
- the address generation unit 23 generates the selection signals 33 to 36 so as to connect the switches 24 to 27 respectively to L, R, L and L.
- the seventh cycle and subsequent cycles also operate in the same way. Thereafter, the HARQ synthesis unit 1 and the rate dematching unit 3 turn off the operation status signals 17 and 18 when the processing is finished. As a result, the apparatus of the second embodiment stops the operation.
- the second embodiment it is possible to prevent contention between the rate dematching unit 3 and the HARQ synthesis unit 1 caused when the rate dematching unit 3 deletes repeated data, as heretofore described. As a result, it becomes possible to execute these processing simultaneously.
- the first and second embodiments which make simultaneous execution of two processes possible are expanded to make simultaneous execution of N processes.
- the HARQ synthesis is conducted on J (where J is a positive integer) processes and the rate dematching is conducted on K (where K is a positive integer) processes.
- the apparatus in the present embodiment includes J HARQ synthesis units, K rate dematching units, and a buffer including N physical memories.
- FIG. 18 is a configuration diagram of the third embodiment of the data processing apparatus.
- the data processing apparatus includes HARQ synthesis units 41 ( 41 - 1 to 41 -J), a buffer 42 , rate dematching units 43 ( 43 - 1 to 43 -K), a head address generation unit 44 , and a memory 45 .
- the buffer 42 includes N memories 42 ( 42 - 1 to 42 -N).
- N processes are processed simultaneously.
- processes 1 to J are processed simultaneously in the HARQ synthesis unit 41 .
- processes (J+ 1 ) to (J+K) are processed in the rate dematching unit 43 .
- the buffer 42 (specifically, an address generation unit which is not illustrated and which is included in the buffer 42 ) reads out a program from the memory 45 and conducts data processing.
- Data storage areas respectively for processes 1 to (J+K) are provided in each of the memories 42 .
- Each process can access an arbitrary memory 42 .
- FIG. 19 is a schematic diagram showing an address assignment example of processes to memories.
- data of the process 1 is assigned an address #0201 in the memory 42 - 1 as its start address, then assigned addresses in the memories 42 - 2 to 42 - 5 , and then assigned an address in the memory 42 - 1 . Thereafter, the assignment is repeated.
- Data of the process 2 is assigned an address #0301 in the memory 42 - 2 as its start address, then assigned addresses in the memories 42 - 3 to 42 - 5 , and then assigned an address in the memory 42 - 1 . Thereafter, the assignment is repeated.
- Data of the process 3 is assigned an address #0401 in the memory 42 - 3 as its start address, then assigned addresses in the memories 42 - 4 to 42 - 5 , and then assigned an address in the memory 42 - 1 . Thereafter, the assignment is repeated.
- Data of the process 4 is assigned an address #0501 in the memory 42 - 4 as its start address, then assigned an address in the memory 42 - 5 , and then assigned an address in the memory 42 - 1 . Thereafter, the assignment is repeated.
- Data of the process 5 is assigned an address #0601 in the memory 42 - 5 as its start address, and then assigned an address in the memory 42 - 1 . Thereafter, the assignment is repeated.
- the memory access (#0201) in the memory 42 - 1 conducted by the process 1 the memory access (#0301) in the memory 42 - 2 conducted by the process 2 , the memory access (#0401) in the memory 42 - 3 conducted by the process 3 , the memory access (#0501) in the memory 42 - 4 conducted by the process 4 , and the memory access (#0601) in the memory 42 - 5 conducted by the process 5 are processed simultaneously.
- the memory access (#0202) in the memory 42 - 2 conducted by the process 1 the memory access (#0302) in the memory 42 - 3 conducted by the process 2 , the memory access (#0402) in the memory 42 - 4 conducted by the process 3 , the memory access (#0502) in the memory 42 - 5 conducted by the process 4 , and the memory access (#0602) in the memory 42 - 1 conducted by the process 5 are processed simultaneously.
- the third embodiment it becomes possible to prevent contention between the rate dematching unit 3 and the HARQ synthesis unit 1 even if three or more processes are executed simultaneously, as heretofore described.
- a fourth embodiment relates to a program of a data processing method.
- the data processing apparatus includes the memory 5 or 45 .
- the program of the data processing method is stored in the memory 5 or 45 .
- the program of the data processing method is a program of the memory access method (the first and second embodiments) shown for respective cycles in FIGS. 8 to 17 .
- This program further includes a memory access method for the case where N processes are executed simultaneously described with reference to the third embodiment.
- the address generation unit 23 in the buffer 2 and the address generation unit which is included in the buffer 42 and which is not illustrated read the program of the data processing method respectively from the memory 5 and memory 45 , and execute the data processing in accordance with the program. Since contents of the data processing have already been described, description thereof will be omitted.
- the fourth embodiment it is possible to prevent contention between the rate dematching unit 3 and the HARQ synthesis unit 1 as heretofore described. As a result, it becomes possible to execute a plurality of processes simultaneously.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Memory System (AREA)
- Communication Control (AREA)
- Complex Calculations (AREA)
- Multi Processors (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- The present invention relates to a data processing apparatus, its processing method, program product and mobile telephone apparatus. In particular, the present invention relates to a receiving side data processing apparatus in a HARQ (Hybrid Automatic Repeat Request) processing apparatus used in W-CDMA (Wideband-Code Division Multiple Access), its processing method, program product and mobile telephone apparatus.
- The international standard association 3GPP (3rd Generation Partnership Project) for the third generation mobile radio communication system attempts to add a new function called HSDPA (High Speed Downlink Packet Access) to the W-CDMA standards in order to implement faster radio communication. One kind of characteristic processing that makes fast communication according to the HSDPA possible is HARQ (see 3GPP TS25.212 V5.6.0 (2003.9) 4.2.7, 4.5.4).
- The HARQ is processing for conducting data retransmission efficiently when data cannot be received correctly at the receiving side. In the HARQ processing at the transmitting side, transmission data is divided into a plurality of groups. In the 3GPP, the groups are called processes. And retransmission in the HARQ is managed every process. As a result, it becomes possible to transmit and receive data of other processes while data retransmission of a certain process is being conducted.
-
FIG. 1 is a configuration diagram showing an example of a conventional transmitting side HARQ processing apparatus.FIG. 2 is a configuration diagram showing an example of a conventional receiving side HARQ processing apparatus. - With reference to
FIG. 1 , the conventional transmitting sideHARQ processing apparatus 100 includes J (where J is a positive integer)rate matching units 101.Data 102 including N (where N is a positive integer and N>J) processes is supplied to the conventional transmitting sideHARQ processing apparatus 100 as its input data. Its output data is interleaved by aninterleave unit 103 and then output asoutput data 104 including N processes. The rate matchingunit 101 conducts processing every J processes simultaneously, and consequently outputs N process data. - With reference to
FIG. 2 , a conventional receiving sideHARQ processing apparatus 110 includes JHARQ synthesis units 111, abuffer 112, and K (where K is a positive integer and K<N)rate matching units 113. Theoutput data 104 of the transmitting sideHARQ processing apparatus 100 is supplied as an input. Theinput data 104 is deinterleaved in adeinterleave unit 114, and input to the receiving sideHARQ processing apparatus 110. - HARQ processing in the receiving side
HARQ processing apparatus 110 includes elementary processing called HARQ synthesis in theHARQ synthesis unit 111 and rate dematching in therate dematching unit 113. - The HARQ synthesis is processing of adding data of a process that could not be received correctly and the same data that is retransmitted. As a result, the possibility that data can be received correctly at the time of retransmission is increased. The rate dematching is inverse processing to processing of adjusting difference in rate between transmission data and a physical channel, which is called rate matching.
- If in the rate matching conducted in the transmitting side
HARQ processing apparatus 100 the rate of the transmission data is higher than the rate of the physical channel, the rate of the transmission data is squared with the rate of the physical channel are by thinning (hereafter called “puncture”) some data in a transmission data train. - Conversely, if the rate of the transmission data is lower than the rate of the physical channel, the rate of the transmission data is squared with the rate of the physical channel by repeating (hereafter called “repeat”) some data in the transmission data train.
- On the other hand, in the rate dematching, dummy data are inserted in locations of data thinned on the transmitting side, or data repeated on the transmitting side are deleted.
- When implementing such HARQ processing conducted on the receiving side as an apparatus, the
buffer 112 becomes necessary to store data transmitted last time until the same data is retransmitted, besides theHARQ synthesis unit 111 and the rate matchingunit 113 as shown inFIG. 2 . When implementing thebuffer 112 by using a single-port memory, schemes described below are generally considerable. However, those schemes have problems. - Furthermore, an example of such techniques is disclosed in Japanese Patent Publication (JP-A) No. 2000-173261 (
claim 1,paragraph 0005, and FIG. 1). During a first cycle, an address of each even-numbered value is supplied to a write port and an address of each odd-numbered value is supplied to a read port. During a subsequent second cycle, an address of each odd-numbered value is supplied to a write port and an address of each even-numbered value is supplied to a read port. Such a technique of switching the write port and the read port alternately in each cycle and conducting data writing and reading is disclosed. - Scheme 1: It is a scheme of implementing the
buffer 112 by using one physical memory (buffer 112). If, for example, there are four processes (process 1,process 2,process 3 and process 4), data of these processes are disposed on one physical memory (buffer 112).FIG. 3 is a diagram showing thescheme 1. If it is attempted to execute the rate dematching on data of theprocess 2 and the HARQ synthesis on data of theprocess 3 simultaneously as shown inFIG. 3 , accesses to thebuffer 112 occur simultaneously and consequently access contention occurs. Therefore, the rate dematching and the HARQ synthesis cannot be executed simultaneously. The HARQ synthesis is executed after execution of the rate dematching is completed, or the rate dematching is executed after execution of the HARQ synthesis is completed. In this way, this scheme has a problem of lengthened execution time of the HARQ. - Scheme 2:
FIG. 4 is a diagram showing ascheme 2. In thescheme 2, abuffer 112 is formed of a plurality of physical memories (RAMs 121 to 124), and physical memories and processes are assigned in one-to-one correspondence as shown inFIG. 4 . In the example shown inFIG. 4 , data of aprocess 1 is stored in the RAM 121, and data of aprocess 2 is stored in the RAM 122. Data of aprocess 3 is stored in the RAM 123, and data of aprocess 4 is stored in the RAM 124. - In this case, in the rate dematching conducted on the data of the
process 2 and the HARQ synthesis conducted on the data of theprocess 3, accesses to thebuffer 112 become accesses to different physical memories. In other words, the RAM 122 is accessed in the processing of the rate dematching and the RAM 123 is accessed in the processing of the HARQ synthesis. Therefore, simultaneous execution of the rate dematching and the HARQ synthesis becomes possible. - By the way, the data sizes of respective processes and the number of processes change dynamically during communication, according to the HSDPA standards. Therefore, it is necessary to dynamically change memory assignment of respective processes.
FIG. 5 is a diagram showing access contention in thescheme 2. As shown inFIG. 5 , there is a possibility of disposing data of two processes (theprocess 2 and theprocess 3 in an example shown inFIG. 5 ) on the same physical memory (RAM 122). In this case, access contention occurs and consequently the same problem as that in thescheme 1 occurs. - The above-described schemes of two kinds cannot eliminate the problem that the HARQ synthesis and the rate dematching cannot be executed simultaneously and consequently the execution time of the whole HARQ is long.
- On the other hand, while the technique described in JP-A-2000-173261 is intended for access control on one dual port memory (a memory having one input port and one output port), the present invention is intended for two or more single port memories (memories each having one port that serves as both input port and output port), and its control method is entirely different from the technique described in JP-A-2000-173261.
- An object of the present invention is to provide a data processing apparatus, and its processing method, program product and mobile telephone apparatus capable of preventing contention of memory access between the HARQ synthesis and rate dematching in the HARQ processing using two or more single-port memories.
- In order to achieve the object, a data processing apparatus according to the present invention is a data processing apparatus which executes a plurality of data processing simultaneously, the data processing apparatus including a plurality of data processing means provided so as to be associated with respective data processing, as many single-port memories as the number of data processing, and control means for controlling the single-port memories, wherein the control means exercise control so as to cause access to the single-port memories conducted by respective data processing means to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing of any data processing means and access contention occurs between the data processing means involving the change and another data processing means, access of one data processing means is given priority over access of the other data processing means.
- A data processing method according to the present invention is a data processing method of executing a plurality of data processing simultaneously, the data processing method including a plurality of data processing steps of conducting respective data processing, and a control step of controlling as many single-port memories as the number of the data processing, wherein at the control step, control is exercised so as to cause access to the single-port memories conducted at respective data processing steps to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing at any data processing step and access contention occurs between the data processing step involving the change and another data processing step, access at one data processing step is given priority at the control step over access at the other data processing step.
- A data processing program product according to the present invention is a data processing program product which causes a computer to execute a plurality of data processing simultaneously, the data processing program product including a plurality of data processing steps of conducting respective data processing, and a control step of controlling as many single-port memories as the number of the data processing, wherein at the control step, control is exercised so as to cause access to the single-port memories conducted at respective data processing steps to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing at any data processing step and access contention occurs between the data processing step involving the change and another data processing step, access at one data processing step is given priority at the control step over access at the other data processing step.
- According to the present invention, the buffer includes a plurality of physical memories, for example, two physical memories. One of the memories is used as a memory for even address, whereas the other of the memories is used as a memory for odd address. As regards access to the buffer due to the HARQ synthesis and rate dematching, the following control is conducted.
- (1) Access control is conducted so as to make the rate dematching access the odd address memory when the HARQ synthesis accesses the even address memory.
- (2) Access control is conducted so as to make the rate dematching access the even address memory when the HARQ synthesis accesses the odd address memory.
- (3) If a situation that the HARQ synthesis and the rate dematching access simultaneously access the even address memory or the odd address memory occurs, access of either HARQ synthesis or rate dematching is delayed by one cycle. Memory access caused by the HARQ synthesis and rate dematching in the next cycle is restored to the state of (1) or (2).
- According to the present invention, the control means exercise control so as to cause access to the single-port memories conducted by respective data processing means to be conducted with respect to different single-port memories in accordance with a predetermined sequence, and if a change occurs in the sequence of access in processing of any data processing means and access contention occurs between the data processing means involving the change and another data processing means, access of one data processing means is given priority over access of the other data processing means. As a result, it becomes possible to prevent memory access contention.
- Specifically, according to the present invention, memory access contention does not occur between the HARQ synthesis and rate dematching. Therefore, these processing can be executed simultaneously. As a result, the processing time of the HARQ can be shortened. This effect can be obtained even when memory assignment of processes is changed according to a dynamic change in data sizes of processes and the number of processes.
-
FIG. 1 is a configuration diagram showing an example of a conventional transmitting side HARQ processing apparatus; -
FIG. 2 is a configuration diagram showing an example of a conventional receiving side HARQ processing apparatus; -
FIG. 3 is a diagram showing ascheme 1; -
FIG. 4 is a diagram showing ascheme 2; -
FIG. 5 is a diagram showing access contention in ascheme 2; -
FIG. 6 is a configuration diagram showing a first embodiment of a data processing apparatus according to the present invention; -
FIG. 7 is a configuration diagram showing an example of abuffer 2 according to the present invention; -
FIG. 8 is a schematic diagram showing operation (first cycle) of the first embodiment; -
FIG. 9 is a schematic diagram showing operation (second cycle) of the first embodiment; -
FIG. 10 is a schematic diagram showing operation (third cycle) of the first embodiment; -
FIG. 11 is a schematic diagram showing operation (fourth cycle) of the first embodiment; -
FIG. 12 is a schematic diagram showing operation (fifth cycle) of the first embodiment; -
FIG. 13 is a schematic diagram showing operation (sixth cycle) of the first embodiment; -
FIG. 14 is a schematic diagram showing operation (third cycle) of the first embodiment; -
FIG. 15 is a schematic diagram showing operation (fourth cycle) of the first embodiment; -
FIG. 16 is a schematic diagram showing operation (fifth cycle) of the first embodiment; -
FIG. 17 is a schematic diagram showing operation (sixth cycle) of the first embodiment; -
FIG. 18 is a configuration diagram showing a third embodiment of a data processing apparatus; and -
FIG. 19 is a schematic diagram showing an address assignment example of processes to memories. - Hereafter, embodiments of the present invention will be described with reference to accompanying drawings.
-
FIG. 6 is a configuration diagram showing a first embodiment of a data processing apparatus. With reference toFIG. 6 , the data processing apparatus includes aHARQ synthesis unit 1, abuffer 2, arate dematching unit 3, a headaddress generation unit 4, and amemory 5. - The
HARQ synthesis unit 1 is a processing block that conducts HARQ synthesis.Output data 11 of deinterleave processing which is a previous process of the HARQ processing is supplied to theHARQ synthesis unit 1 as its input. TheHARQ synthesis unit 1outputs data 12 obtained after the HARQ synthesis. - The
buffer 2 is a memory that retains theoutput data 12 of theHARQ synthesis unit 1 and supplies inputdata 13 of therate dematching unit 3. Theoutput date 12 ofHARQ synthesis unit 1 is supplied to buffer 2 as its input. Thebuffer 2 outputs theinput data 13 to therate dematching unit 3. - The
rate dematching unit 3 is a processing block that conducts the rate dematching. Therate dematching unit 3 is supplied with theoutput data 13 of thebuffer 2 as its input, andoutputs data 14 obtained after the rate dematching. When conducting processing on data in a location where puncturing or repeating was conducted on the transmitting side, therate dematching unit 3 turns on a puncture/repeat indication signal 15. When conducting processing on other data, therate dematching unit 3 turns off the puncture/repeat indication signal 15. - The head
address generation unit 4 sets a storage address of head data of each process in thebuffer 2 by using ahead address signal 16. - By the way, an
operation status signal 17 which indicates that theHARQ synthesis unit 1 is in operation is output from theHARQ synthesis unit 1 to thebuffer 2. Anoperation status signal 18 which indicates that therate dematching unit 3 is in operation is output from therate dematching unit 3 to thebuffer 2. Adata readout signal 19 is output from thememory 5 to thebuffer 2. - A program for a data processing method is stored in the
memory 5. -
FIG. 7 is a configuration diagram showing an example of thebuffer 2. With reference toFIG. 7 , thebuffer 2 includes aneven address memory 21, anodd address memory 22, anaddress generation unit 23, and switches 24 to 27. - By the way, the puncture/
repeat indication signal 15, thehead address signal 16, the operation status signals 17 and 18, and thedata readout signal 19 are input to theaddress generation unit 23. - As an example, data of four processes (
processes 1 to 4) are written into each of thememories buffer 2 of the present embodiment. - The
even address memory 21 is a memory that retains even-numbered data in each process. Theeven address memory 21 is supplied with thedata 12 obtained after the synthesis conducted by theHARQ synthesis unit 1, as its input. Theeven address memory 21 outputs theinput data 13 of therate dematching unit 3. - The
odd address memory 22 is a memory that retains odd-numbered data in each process. Theodd address memory 22 is supplied with thedata 12 obtained after the synthesis conducted by theHARQ synthesis unit 1, as its input. Theodd address memory 22 outputs theinput data 13 of therate dematching unit 3. - The
address generation unit 23 is a processing block that generates anaddress 31 of theeven address memory 21, anaddress 32 of theodd address memory 22, and selection signals 33 to 36 for theswitches 24 to 27. The processing in theaddress generation unit 23 is executed in accordance with a program read out from thememory 5 by the address generation unit. - If two accesses contend in either the
even address memory 21 or theodd address memory 22, theaddress generation unit 23 exercises control so as to delay one of the accesses by one cycle. If the operation status signals 17 and 18 that indicate that theHARQ synthesis unit 1 and therate dematching unit 3 are in operation are turned on, theaddress generation unit 23 starts generation of theaddresses repeat indication signal 15 which indicates data punctured or repeated on the transmitting side is input from therate dematching unit 3. - The
switch 24 is a switch that distributes theoutput data 12 of theHARQ synthesis unit 1 to either theeven address memory 21 or theodd address memory 22 on the basis of theselection signal 33. In the example shown inFIG. 7 , “R” indicates connection to theeven address memory 21, and “L” indicates connection to theodd address memory 22. - The
switch 25 is a switch that connects theeven address memory 21 to either theswitch 24 or theswitch 26 on the basis of theselection signal 34. In the example shown inFIG. 7 , “R” indicates connection to theswitch 26, and “L” indicates connection to theswitch 24. - The
switch 26 is a switch that outputs output data of either theeven address memory 21 or theodd address memory 22 as thebuffer output 13 on the basis of theselection signal 35. In the example shown inFIG. 7 , “R” indicates connection to theodd address memory 22, and “L” indicates connection to theeven address memory 21. - The
switch 27 is a switch that connects theodd address memory 22 to either theswitch 24 or theswitch 26 on the basis of theselection signal 36. In the example shown inFIG. 7 , “R” indicates connection to theswitch 26, and “L” indicates connection to theswitch 24. - Operation of the first embodiment according to the present invention will now be described. FIGS. 8 to 13 are schematic diagrams showing operation (first to sixth cycles) of the first embodiment. Here, the case where the HARQ synthesis is executed on the data of the
process 3 at the same time that the rate dematching is executed on the data of theprocess 2 will be described as an example. By the way, address values in the ensuing description are nothing but examples. - First, initialization will now be described. Storage address of head data of each process generated by the head
address generation unit 4 is set in theaddress generation unit 23 in thebuffer 2 on the basis of the head address signal 16 (in the ensuing example, the head data storage address of theprocess 2 is #0108 and the head data storage address of theprocess 3 is #0164). The set value is used as the initial value of the address. Thereafter, theHARQ synthesis unit 1 and therate dematching unit 3 turn on the operation status signals 17 and 18 at the same time that processing is started. These operation status signals 17 and 18 are always kept in the on-state over the processing interval. - The first cycle will now be described with reference to
FIG. 8 . Data of theprocess 2 is read out from the address 31 (address value #0108) in theeven address memory 21, and output as theoutput data 13 of thebuffer 2. Therate dematching unit 3 conducts rate dematching on thedata 13. At this time, theaddress generation unit 23 generates the selection signals 34 and 35 so as to connect theswitches - The second cycle will now be described with reference to
FIG. 9 . Data of theprocess 2 is read out from the address 32 (address value #0109) of theodd address memory 22, and output as theoutput data 13 of thebuffer 2. And therate dematching unit 3 conducts rate dematching on thedata 13. - At the same time, the HARQ synthesis is executed in the
HARQ synthesis unit 1, and the HARQsynthesis output data 12 is written into the address 31 (address value #0164) in theeven address memory 21 as data of theprocess 3. At this time, theaddress generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to R, L, R and R. - The third cycle will now be described with reference to
FIG. 10 . Data of theprocess 2 is read out from the address 31 (address value # 010A) in theeven address memory 21, and output as theoutput data 13 of thebuffer 2. Therate dematching unit 3 conducts rate dematching on thedata 13. - At the same time, the HARQ synthesis is executed in the
HARQ synthesis unit 1, and the HARQsynthesis output data 12 is written into the address 32 (address value #0165) in theodd address memory 22 as data of theprocess 3. At this time, theaddress generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to L, R, L and L. - In the present embodiment, the data of the
process 2 is punctured on the transmitting side, and therate dematching unit 3 inserts dummy data. Therefore, data of theprocess 2 in theaddress # 010A is read out again at the next fourth cycle. Whether data has been punctured is indicated by theindication signal 15. - The fourth cycle will now be described with reference to
FIG. 11 . At the same time that data of theprocess 2 is read out from theaddress value # 010A in theeven address memory 21, it is attempted to write the HARQsynthesis output data 12 into anaddress value # 0166 in theeven address memory 21 as data of theprocess 3. As a result, access contention to theeven address memory 21 occurs. - In the present example, reading data of the process 2 (i.e., memory access to the
address value # 010A) is permitted, and writing data of the process 3 (i.e., memory access to the address value #0166) is delayed by one cycle. - At this time, the
address generation unit 23 sets theaddress value # 010A in theaddress 31, and generates the selection signals 34 and 35 so as to connect theswitches - The fifth cycle will now be described with reference to
FIG. 12 . Data of theprocess 2 is read out from the address 32 (address value # 010B) in theodd address memory 22, and output as theoutput data 13 of thebuffer 2. And therate dematching unit 3 conducts the rate dematching on thedata 13. - At the same time, the
HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQsynthesis output data 12 into the address 31 (the address value #0166) in theeven address memory 21 as the data of theprocess 3. - At this time, the
address generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to R, L, R and R. - The sixth cycle will now be described with reference to
FIG. 13 . Data of theprocess 2 is read out from the address 31 (address value # 010C) in theeven address memory 21, and output as theoutput data 13 of thebuffer 2. And therate dematching unit 3 conducts the rate dematching on thedata 13. - At the same time, the
HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQsynthesis output data 12 into the address 32 (the address value #0167) in theodd address memory 22 as the data of theprocess 3. - At this time, the
address generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to L, R, L and L. - Hereafter, the seventh cycle and subsequent cycles also operate in the same way. Thereafter, the
HARQ synthesis unit 1 and therate dematching unit 3 turn off the operation status signals 17 and 18 when the processing is finished. As a result, the apparatus of the first embodiment stops the operation. - In the above-described embodiment, only the rate dematching is executed in the first cycle and the HARQ synthesis is also executed in the second cycle and subsequent cycles. The reverse is also possible. In other words, only the HARQ synthesis is executed in the first cycle, and the rate dematching is also executed in the second cycle and subsequent cycles. In the case where contention in accesses to the same memory has occurred as in the fourth cycle, memory access caused by rate dematching is permitted preferentially in the above-described embodiment. However, the reverse is also possible. In other words, in the case where access contention to the same memory has occurred, it is also possible to preferentially permit the memory access caused by the HARQ synthesis.
- According to the first embodiment, it is possible to prevent contention between the
rate dematching unit 3 and theHARQ synthesis unit 1 caused when therate dematching unit 3 inserts dummy data, as heretofore described. As a result, it becomes possible to execute these processing simultaneously. - A second embodiment is similar in configuration to the first embodiment (see
FIGS. 6 and 7 ), but different in operation. In the present embodiment, the data of theprocess 2 is repeated on the transmitting side, and therate dematching unit 3 deletes the repeated data. In the wake of theaddress # 010A, therefore, data of theprocess 2 in theaddress # 010C is read out again in the next fourth cycle (i.e., reading data in theaddress # 010B is not conducted). By the way, whether repeating is conducted is specified by theindication signal 15. - Operation of the initialization, and the first and second cycles are similar to those of the first embodiment. Therefore, its description will be omitted, and a third cycle and subsequent cycles will now be described.
- FIGS. 14 to 17 are schematic diagrams showing operation (third to sixth cycles) of the second embodiment.
- First, the third cycle will now be described with reference to
FIG. 14 . Data of theprocess 2 is read out from the address 31 (address value # 010A) in theeven address memory 21, and output as theoutput data 13 of thebuffer 2. Therate dematching unit 3 conducts rate dematching on thedata 13. - At the same time, the HARQ synthesis is executed in the
HARQ synthesis unit 1, and the HARQsynthesis output data 12 is written into the address 32 (address value #0165) in theodd address memory 22 as data of theprocess 3. At this time, theaddress generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to L, R, L and L. - In the present embodiment, data of the
process 2 is repeated on the transmitting side, and therate dematching unit 3 deletes the repeated data. In the wake of readout of data of theprocess 2 in theaddress # 010A, therefore, data of theprocess 2 in theaddress # 010C is read out in the next fourth cycle. - The fourth cycle will now be described with reference to
FIG. 15 . At the same time that data of theprocess 2 is read out from theaddress value # 010C in theeven address memory 21, it is attempted to write the HARQsynthesis output data 12 into anaddress value # 0166 in theeven address memory 21 as data of theprocess 3. As a result, access contention to theeven address memory 21 occurs. - In the present example, reading data of the process 2 (i.e., memory access to the
address value # 010C) is permitted, and writing data of the process 3 (i.e., memory access to the address value #0166) is delayed by one cycle. - At this time, the
address generation unit 23 sets theaddress value # 010C in theaddress 31, and generates the selection signals 34 and 35 so as to connect theswitches - The fifth cycle will now be described with reference to
FIG. 16 . Data of theprocess 2 is read out from the address 32 (address value # 010D) in theodd address memory 22, and output as theoutput data 13 of thebuffer 2. And therate dematching unit 3 conducts the rate dematching on thedata 13. - At the same time, the
HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQsynthesis output data 12 into the address 31 (the address value #0166) in theeven address memory 21 as the data of theprocess 3. - At this time, the
address generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to R, L, R and R. - The sixth cycle will now be described with reference to
FIG. 17 . Data of theprocess 2 is read out from the address 31 (address value # 010E) in theeven address memory 21, and output as theoutput data 13 of thebuffer 2. And therate dematching unit 3 conducts the rate dematching on thedata 13. - At the same time, the
HARQ synthesis unit 1 executes the HARQ synthesis, and writes the HARQsynthesis output data 12 into the address 32 (the address value #0167) in theodd address memory 22 as the data of theprocess 3. - At this time, the
address generation unit 23 generates the selection signals 33 to 36 so as to connect theswitches 24 to 27 respectively to L, R, L and L. - Hereafter, the seventh cycle and subsequent cycles also operate in the same way. Thereafter, the
HARQ synthesis unit 1 and therate dematching unit 3 turn off the operation status signals 17 and 18 when the processing is finished. As a result, the apparatus of the second embodiment stops the operation. - According to the second embodiment, it is possible to prevent contention between the
rate dematching unit 3 and theHARQ synthesis unit 1 caused when therate dematching unit 3 deletes repeated data, as heretofore described. As a result, it becomes possible to execute these processing simultaneously. - In a third embodiment, the first and second embodiments which make simultaneous execution of two processes possible are expanded to make simultaneous execution of N processes. By the way, the HARQ synthesis is conducted on J (where J is a positive integer) processes and the rate dematching is conducted on K (where K is a positive integer) processes. At this time, the apparatus in the present embodiment includes J HARQ synthesis units, K rate dematching units, and a buffer including N physical memories. Here, there is a relation N=J+K.
-
FIG. 18 is a configuration diagram of the third embodiment of the data processing apparatus. With reference toFIG. 18 , the data processing apparatus includes HARQ synthesis units 41 (41-1 to 41-J), abuffer 42, rate dematching units 43 (43-1 to 43-K), a headaddress generation unit 44, and amemory 45. Thebuffer 42 includes N memories 42 (42-1 to 42-N). - In the present embodiment, N processes are processed simultaneously. In other words, processes 1 to J are processed simultaneously in the
HARQ synthesis unit 41. In parallel therewith, processes (J+1) to (J+K) are processed in therate dematching unit 43. - In the same way as the first and second embodiments, the buffer 42 (specifically, an address generation unit which is not illustrated and which is included in the buffer 42) reads out a program from the
memory 45 and conducts data processing. - Data storage areas respectively for
processes 1 to (J+K) are provided in each of thememories 42. Each process can access anarbitrary memory 42. - As an example, operation of the present embodiment will now be described as to the case where the HARQ synthesis for the
processes 1 to 3 and the rate dematching for theprocesses -
FIG. 19 is a schematic diagram showing an address assignment example of processes to memories. With reference toFIG. 19 , data of theprocess 1 is assigned anaddress # 0201 in the memory 42-1 as its start address, then assigned addresses in the memories 42-2 to 42-5, and then assigned an address in the memory 42-1. Thereafter, the assignment is repeated. - Data of the
process 2 is assigned anaddress # 0301 in the memory 42-2 as its start address, then assigned addresses in the memories 42-3 to 42-5, and then assigned an address in the memory 42-1. Thereafter, the assignment is repeated. - Data of the
process 3 is assigned anaddress # 0401 in the memory 42-3 as its start address, then assigned addresses in the memories 42-4 to 42-5, and then assigned an address in the memory 42-1. Thereafter, the assignment is repeated. - Data of the
process 4 is assigned anaddress # 0501 in the memory 42-4 as its start address, then assigned an address in the memory 42-5, and then assigned an address in the memory 42-1. Thereafter, the assignment is repeated. - Data of the
process 5 is assigned anaddress # 0601 in the memory 42-5 as its start address, and then assigned an address in the memory 42-1. Thereafter, the assignment is repeated. - In the first cycle, the memory access (#0201) in the memory 42-1 conducted by the
process 1, the memory access (#0301) in the memory 42-2 conducted by theprocess 2, the memory access (#0401) in the memory 42-3 conducted by theprocess 3, the memory access (#0501) in the memory 42-4 conducted by theprocess 4, and the memory access (#0601) in the memory 42-5 conducted by theprocess 5 are processed simultaneously. - Subsequently, in the second cycle, the memory access (#0202) in the memory 42-2 conducted by the
process 1, the memory access (#0302) in the memory 42-3 conducted by theprocess 2, the memory access (#0402) in the memory 42-4 conducted by theprocess 3, the memory access (#0502) in the memory 42-5 conducted by theprocess 4, and the memory access (#0602) in the memory 42-1 conducted by theprocess 5 are processed simultaneously. - In the third cycle and subsequent cycles as well, memory access conducted by each process is successively changed over to an adjacent memory. As a result, access contention does not occur.
- However, if, for example, puncturing is caused by the process 4 (rate dematching processing) in the second cycle and consequently processing (dummy data insertion) of repeating, in the third cycle, readout from the
address # 0502 in the memory 42-5 conducted by theprocess 4 in the second cycle is conducted, it contends in the third cycle with writing into theaddress # 0403 in the memory 42-5 conducted by the process 3 (HARQ processing). - In this case, therefore, readout of the
address # 0502 in the memory 42-5 to be conducted by theprocess 4 is permitted, and writing to be conducted by theprocess 3 is delayed by one cycle. On the other hand, it is also possible to permit data writing to be conducted by theprocess 3 and delay data reading to be conducted by theprocess 4 by one cycle. - As another example, if repeating is caused in the second cycle by the process 4 (rate dematching processing) and consequently in the third cycle readout from the addresses #0503 and #0504 in the memory 42-1 is skipped and readout of the address #505 in the memory 42-3 is conducted, it contends in the third cycle with writing into the address #203 in the memory conducted by the process 1 (HARQ processing).
- In this case, therefore, readout of the
address # 0505 in the memory 42-3 to be conducted by theprocess 4 is permitted and data writing to be conducted by theprocess 1 is delayed by one cycle. On the other hand, it is also possible to permit data writing to be conducted by theprocess 1 and delay data reading to be conducted by theprocess 4 by one cycle. - According to the third embodiment, it becomes possible to prevent contention between the
rate dematching unit 3 and theHARQ synthesis unit 1 even if three or more processes are executed simultaneously, as heretofore described. - A fourth embodiment relates to a program of a data processing method. With reference to
FIGS. 6 and 18 , the data processing apparatus includes thememory memory - The program of the data processing method is a program of the memory access method (the first and second embodiments) shown for respective cycles in FIGS. 8 to 17. This program further includes a memory access method for the case where N processes are executed simultaneously described with reference to the third embodiment.
- The
address generation unit 23 in thebuffer 2 and the address generation unit which is included in thebuffer 42 and which is not illustrated read the program of the data processing method respectively from thememory 5 andmemory 45, and execute the data processing in accordance with the program. Since contents of the data processing have already been described, description thereof will be omitted. - According to the fourth embodiment, it is possible to prevent contention between the
rate dematching unit 3 and theHARQ synthesis unit 1 as heretofore described. As a result, it becomes possible to execute a plurality of processes simultaneously. - Application of the present invention to a mobile telephone apparatus that adopts HSDPA which is one prescription of the W-CDMA scheme is expected. Furthermore, application of the present invention to other wireless communication schemes having rate dematching processing such as a wireless LAN (Local Area Network) is also possible.
Claims (14)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004101823A JP4765260B2 (en) | 2004-03-31 | 2004-03-31 | Data processing device, processing method thereof, program, and mobile phone device |
JP2004-101823 | 2004-03-31 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20050232203A1 true US20050232203A1 (en) | 2005-10-20 |
US7366968B2 US7366968B2 (en) | 2008-04-29 |
Family
ID=34880007
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/088,883 Expired - Fee Related US7366968B2 (en) | 2004-03-31 | 2005-03-25 | Data processing apparatus, and its processing method, program product and mobile telephone apparatus |
Country Status (4)
Country | Link |
---|---|
US (1) | US7366968B2 (en) |
EP (1) | EP1583273A3 (en) |
JP (1) | JP4765260B2 (en) |
CN (1) | CN100520733C (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104753653A (en) * | 2013-12-31 | 2015-07-01 | 中兴通讯股份有限公司 | Rate de-matching method, device and reception-side equipment |
US20170237528A1 (en) * | 2016-02-16 | 2017-08-17 | Samsung Electronics Co., Ltd. | Method and apparatus for hybrid automatic repeat requests (harq) processing for retransmissions with unknown data length |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9160496B2 (en) * | 2007-06-29 | 2015-10-13 | Qualcomm Incorporated | Methods and apparatus for H-ARQ process memory management |
CN102414991B (en) * | 2009-04-24 | 2014-11-05 | 诺基亚公司 | Data rearrangement for decoder |
CN103065670A (en) * | 2011-10-24 | 2013-04-24 | 迈实电子(上海)有限公司 | Dual-port memorizer and manufacturing method thereof |
CN103166747B (en) * | 2011-12-14 | 2017-12-29 | 中兴通讯股份有限公司 | The method and device that a kind of HARQ merges |
CN112835842B (en) * | 2021-03-05 | 2024-04-30 | 深圳市汇顶科技股份有限公司 | Terminal sequence processing method, circuit, chip and electronic terminal |
Citations (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6381669B1 (en) * | 1999-12-27 | 2002-04-30 | Gregory V. Chudnovsky | Multi-bank, fault-tolerant, high-performance memory addressing system and method |
US6392572B1 (en) * | 2001-05-11 | 2002-05-21 | Qualcomm Incorporated | Buffer architecture for a turbo decoder |
US6434203B1 (en) * | 1999-02-26 | 2002-08-13 | Qualcomm, Incorporated | Memory architecture for map decoder |
US20020119803A1 (en) * | 2000-12-29 | 2002-08-29 | Bitterlich Stefan Johannes | Channel codec processor configurable for multiple wireless communications standards |
US20030138059A1 (en) * | 2002-01-17 | 2003-07-24 | Xu Chang Qing | Communication Systems with hybrid automatic repeat requests (HARQ) and rate matching |
US6603412B2 (en) * | 2001-06-08 | 2003-08-05 | Texas Instruments Incorporated | Interleaved coder and method |
US20030167460A1 (en) * | 2002-02-26 | 2003-09-04 | Desai Vipul Anil | Processor instruction set simulation power estimation method |
US6678843B2 (en) * | 1999-02-18 | 2004-01-13 | Interuniversitair Microelektronics Centrum (Imec) | Method and apparatus for interleaving, deinterleaving and combined interleaving-deinterleaving |
US6700867B2 (en) * | 2001-12-20 | 2004-03-02 | Motorola, Inc. | Method and system for reduced memory hybrid automatic repeat request |
US6757756B1 (en) * | 1998-12-30 | 2004-06-29 | Nortel Networks Limited | Method and apparatus for exchanging data between transactional and non-transactional input/output systems in a multi-processing, shared memory environment |
US6775800B2 (en) * | 2000-01-03 | 2004-08-10 | Icoding Technology, Inc. | System and method for high speed processing of turbo codes |
US20050044327A1 (en) * | 2003-08-19 | 2005-02-24 | Quicksilver Technology, Inc. | Asynchronous, independent and multiple process shared memory system in an adaptive computing architecture |
US20050166129A1 (en) * | 2003-03-20 | 2005-07-28 | Tetsuya Yano | Error control apparatus |
US6988154B2 (en) * | 2000-03-10 | 2006-01-17 | Arc International | Memory interface and method of interfacing between functional entities |
US7035355B2 (en) * | 2001-09-17 | 2006-04-25 | Digeo, Inc. | Apparatus and method for decode arbitration in a multi-stream multimedia system |
US20060092973A1 (en) * | 2002-08-13 | 2006-05-04 | Dragan Petrovic | Method of process configuration for multiple harq processes |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4669056A (en) * | 1984-07-31 | 1987-05-26 | International Business Machines Corporation | Data processing system with a plurality of processors accessing a common bus to interleaved storage |
JPH064401A (en) * | 1992-06-19 | 1994-01-14 | Fujitsu Ltd | Memory access circuit |
JPH07271654A (en) * | 1994-04-01 | 1995-10-20 | Tokyo Electron Ltd | Controller |
JPH0981449A (en) * | 1995-09-13 | 1997-03-28 | Fujitsu Ltd | Pseudo dual port memory |
KR0150072B1 (en) * | 1995-11-30 | 1998-10-15 | 양승택 | Device for controlling memory data path in parallel processing computer system |
US5832291A (en) * | 1995-12-15 | 1998-11-03 | Raytheon Company | Data processor with dynamic and selectable interconnections between processor array, external memory and I/O ports |
US6212607B1 (en) * | 1997-01-17 | 2001-04-03 | Integrated Device Technology, Inc. | Multi-ported memory architecture using single-ported RAM |
JPH10307787A (en) * | 1997-05-09 | 1998-11-17 | Nec Corp | Buffer memory device |
JPH10333972A (en) * | 1997-05-29 | 1998-12-18 | Oki Electric Ind Co Ltd | Data receiver |
DE69836786T2 (en) * | 1997-10-03 | 2007-04-26 | Matsushita Electric Industrial Co., Ltd., Kadoma | Memory interface device and memory address generation device |
CA2287034A1 (en) | 1998-12-03 | 2000-06-03 | Lucent Technologies, Inc. | A memory operated in a modified ping-pong mode |
JP3387079B2 (en) * | 1999-03-01 | 2003-03-17 | 日本電気株式会社 | Correlation value detecting device, spectrum despreading device having the same, receiving terminal and transmitting / receiving terminal, and correlation value detecting method |
WO2001091355A1 (en) * | 2000-05-22 | 2001-11-29 | Samsung Electronics Co., Ltd | Data transmission apparatus and method for an harq data communication system |
US7251285B2 (en) * | 2000-07-11 | 2007-07-31 | Lg Electronics Inc. | Method and apparatus for transmitting and receiving using turbo code |
JP4278317B2 (en) * | 2001-07-05 | 2009-06-10 | 富士通マイクロエレクトロニクス株式会社 | Arithmetic device and receiving device |
WO2003019875A1 (en) * | 2001-08-22 | 2003-03-06 | Siemens Aktiengesellschaft | Transmission of data packets in a radiocommunication system using a common hybrid automatic repeat request (harq) process |
JP3870756B2 (en) | 2001-11-05 | 2007-01-24 | 株式会社デンソー | Microcomputer system |
DE60217098T2 (en) * | 2002-08-13 | 2007-05-03 | Matsushita Electric Industrial Co., Ltd., Kadoma | Hybrid automatic repeat request protocol |
GB2396031B (en) * | 2002-12-05 | 2005-10-26 | Imagination Tech Ltd | A SIMD processor with multi-port memory unit |
-
2004
- 2004-03-31 JP JP2004101823A patent/JP4765260B2/en not_active Expired - Fee Related
-
2005
- 2005-03-25 US US11/088,883 patent/US7366968B2/en not_active Expired - Fee Related
- 2005-03-31 EP EP20050090081 patent/EP1583273A3/en not_active Withdrawn
- 2005-03-31 CN CNB2005100562029A patent/CN100520733C/en not_active Expired - Fee Related
Patent Citations (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6757756B1 (en) * | 1998-12-30 | 2004-06-29 | Nortel Networks Limited | Method and apparatus for exchanging data between transactional and non-transactional input/output systems in a multi-processing, shared memory environment |
US6678843B2 (en) * | 1999-02-18 | 2004-01-13 | Interuniversitair Microelektronics Centrum (Imec) | Method and apparatus for interleaving, deinterleaving and combined interleaving-deinterleaving |
US6434203B1 (en) * | 1999-02-26 | 2002-08-13 | Qualcomm, Incorporated | Memory architecture for map decoder |
US6381669B1 (en) * | 1999-12-27 | 2002-04-30 | Gregory V. Chudnovsky | Multi-bank, fault-tolerant, high-performance memory addressing system and method |
US6775800B2 (en) * | 2000-01-03 | 2004-08-10 | Icoding Technology, Inc. | System and method for high speed processing of turbo codes |
US6988154B2 (en) * | 2000-03-10 | 2006-01-17 | Arc International | Memory interface and method of interfacing between functional entities |
US20020119803A1 (en) * | 2000-12-29 | 2002-08-29 | Bitterlich Stefan Johannes | Channel codec processor configurable for multiple wireless communications standards |
US6392572B1 (en) * | 2001-05-11 | 2002-05-21 | Qualcomm Incorporated | Buffer architecture for a turbo decoder |
US6603412B2 (en) * | 2001-06-08 | 2003-08-05 | Texas Instruments Incorporated | Interleaved coder and method |
US7035355B2 (en) * | 2001-09-17 | 2006-04-25 | Digeo, Inc. | Apparatus and method for decode arbitration in a multi-stream multimedia system |
US6700867B2 (en) * | 2001-12-20 | 2004-03-02 | Motorola, Inc. | Method and system for reduced memory hybrid automatic repeat request |
US20030138059A1 (en) * | 2002-01-17 | 2003-07-24 | Xu Chang Qing | Communication Systems with hybrid automatic repeat requests (HARQ) and rate matching |
US20030167460A1 (en) * | 2002-02-26 | 2003-09-04 | Desai Vipul Anil | Processor instruction set simulation power estimation method |
US20060092973A1 (en) * | 2002-08-13 | 2006-05-04 | Dragan Petrovic | Method of process configuration for multiple harq processes |
US20050166129A1 (en) * | 2003-03-20 | 2005-07-28 | Tetsuya Yano | Error control apparatus |
US20050044327A1 (en) * | 2003-08-19 | 2005-02-24 | Quicksilver Technology, Inc. | Asynchronous, independent and multiple process shared memory system in an adaptive computing architecture |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104753653A (en) * | 2013-12-31 | 2015-07-01 | 中兴通讯股份有限公司 | Rate de-matching method, device and reception-side equipment |
US20170237528A1 (en) * | 2016-02-16 | 2017-08-17 | Samsung Electronics Co., Ltd. | Method and apparatus for hybrid automatic repeat requests (harq) processing for retransmissions with unknown data length |
US9960885B2 (en) * | 2016-02-16 | 2018-05-01 | Samsung Electronics Co., Ltd | Method and apparatus for hybrid automatic repeat requests (HARQ) processing for retransmissions with unknown data length |
Also Published As
Publication number | Publication date |
---|---|
JP2005285037A (en) | 2005-10-13 |
EP1583273A2 (en) | 2005-10-05 |
CN100520733C (en) | 2009-07-29 |
JP4765260B2 (en) | 2011-09-07 |
US7366968B2 (en) | 2008-04-29 |
CN1677368A (en) | 2005-10-05 |
EP1583273A3 (en) | 2011-01-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7366968B2 (en) | Data processing apparatus, and its processing method, program product and mobile telephone apparatus | |
US7391727B2 (en) | De-rate matching method and apparatus in a high speed downlink packet access system | |
US8583976B2 (en) | Hierarchy management method and system for HARQ memory | |
US8488662B2 (en) | Receiver bit rate processing | |
CN108234088B (en) | Modem chip and method of operating the same | |
US7340669B2 (en) | Memory efficient streamlined transmitter with a multiple instance hybrid ARQ | |
US11323209B2 (en) | Modem chips and receivers for performing hybrid automatic repeat request processing | |
US10530538B2 (en) | Hybrid automatic repeat request method and system | |
US20060101319A1 (en) | Input buffer device for de-rate matching in high speed turbo decoding block and method thereof | |
WO2006010328A1 (en) | Interleaving and deinterleaving method for preventing periodic position interference | |
CN101217305B (en) | A processing method and device of data in special physical data channel | |
TWI520521B (en) | Method and device for storing harq transmission block | |
WO2012149741A1 (en) | De-interleaving method and device for rate de-matching | |
CN101471744B (en) | Method, device and system for implementing HSPA channel encoding and decoding | |
CN102118220B (en) | Method and device for decoding rate matching | |
CN101894075A (en) | Method and device for processing HARQ (Hybrid Automatic Repeat Request) memory | |
JP2000078118A (en) | Automatic resending request data transmitting method | |
CN106411479B (en) | Data receiver and its data transmission method based on HARQ technology | |
US8510609B2 (en) | Apparatus and method for rate dematching in a communication system | |
US20140078883A1 (en) | Methods for retransmitting reverse link data and apparatuses using the same | |
WO2011091672A1 (en) | Method and system for implementing rate matching | |
CN102065484B (en) | Data storage method and device for combining hybrid automatic retransmission requests | |
CN111130718A (en) | Communication method and system based on DL-SCH channel | |
CN114942900A (en) | Double-buffer data serial sending method for embedded system | |
KR100937535B1 (en) | Apparatus and method thereof for transmitting data |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: NEC CORPORATION, JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ISHII, DAIJI;REEL/FRAME:016420/0066 Effective date: 20050322 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: LENOVO INNOVATIONS LIMITED (HONG KONG), HONG KONG Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NEC CORPORATION;REEL/FRAME:033720/0767 Effective date: 20140618 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20160429 |