CN101064582A - Method for realizing multiplexing on code channel of multi-user data - Google Patents
Method for realizing multiplexing on code channel of multi-user data Download PDFInfo
- Publication number
- CN101064582A CN101064582A CNA2006100791056A CN200610079105A CN101064582A CN 101064582 A CN101064582 A CN 101064582A CN A2006100791056 A CNA2006100791056 A CN A2006100791056A CN 200610079105 A CN200610079105 A CN 200610079105A CN 101064582 A CN101064582 A CN 101064582A
- Authority
- CN
- China
- Prior art keywords
- orthogonal code
- code
- multiplexing
- single bit
- information
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 claims description 27
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 claims description 27
- 238000001228 spectrum Methods 0.000 claims description 9
- 238000011144 upstream manufacturing Methods 0.000 claims description 5
- 239000002699 waste material Substances 0.000 abstract description 2
- 239000011159 matrix material Substances 0.000 description 32
- 230000005540 biological transmission Effects 0.000 description 6
- 238000012217 deletion Methods 0.000 description 5
- 230000037430 deletion Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 108010003272 Hyaluronate lyase Proteins 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000011664 signaling Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multiplexing method of multiple users data in code channel, the method includes: A. setting a group of orthogonal code, the number of the orthogonal code is not less than number of user terminal UE, and every UE is corresponding with a orthogonal code; B. using orthogonal code corresponding with every UE to expand the single bit information which is to be sent of every UE, the expended single bit information is modulated; C. all the single bit information which is expanded is added to accomplish the multiplexing. The method increases the agility of UE and base station, and reduces the waste of resource.
Description
Technical field
The present invention relates to technical field of data transmission, be meant a kind of multi-user data multiplexing method on code channel that realizes especially.
Background technology
High speed uplink packet inserts (High Speed Uplink Packet Access, HSUPA) be the technology of being developed for transmitting high speed upstream data in the 3-G (Generation Three mobile communication system), the complete desired multimedia of IMT2000, video flowing and other Internet Protocol (IP) business can be provided.One of key technology of HSUPA is to mix automatic repeat requests (HARQ) technology, this Technology Need is made a start and is waited for from receiving end and send the feedback message (ACK/NACK) of returning sending a data grouping back, then, make a start and determine whether that according to feedback message needs carry out the repeating transmission of data block.In a HSUPA transmission intercal, may have a plurality of user terminals (UE) and send upstream data to base station (NodeB), therefore, in a transmission intercal, NodeB need send feedback message (ACK/NACK) to a plurality of UE.But, each ACK/NACK message only takies 1 bit, the maximum of spreading factor is 16 in time division duplex (TDD) system, suppose to adopt the QPSK modulation system, the bit number of a code channel of wideband time division duplexing (WTDD) system is that the bit number of 244-276, a code channel of arrowband time division duplex (NTDD) system is 88.If with ACK/NACK message of a code channel transmission will be a kind of great wasting of resources, consider in a period of time, to have the ACK/NACK message of a plurality of UE to need to transmit simultaneously, so need in a code channel, transmit the ACK/NACK message of a plurality of UE simultaneously.
The method of the ACK/NACK message reuse of existing a plurality of UE is in data multiplex to a code channel of mode with a plurality of UE that adopts code division multiplexing in the WTDD system.
Fig. 1 is the method specific implementation schematic diagram of a plurality of ACK/NACK message reuses at UE in the WTDD system.The WTDD system adopts the orthogonal code of 240 bits, in order to reduce the memory space of UE, adopt the adhesion of two classes be orthogonal the sign indicating number mode.
As shown in Figure 1, at transmitting terminal, each the ACK/NACK message that is re-used forms the orthogonal code that length is 240 bits through spread spectrum respectively, carry out bit filling, bit scramble, QPSK modulation, power adjustment then, the corresponding bit position addition of the ACK/NACK message that all are multiplexing is launched through spread spectrum at last.
After receiving terminal is received this message, again this message of receiving is carried out contrary the processing.That is: to receiving that this message is carried out despreading, demodulation, removed bit scramble, the bit deletion, utilize the characteristic of orthogonal code can obtain NodeB at last and receive the ACK/NACK message that UE transmitted.
Concrete, referring to shown in Figure 2, the WTDD system adopts the Hadamard matrix on one-level 20 rank and secondary 12 rank to generate 240 long orthogonal codes, and the Hadamard matrix on 20 rank and 12 rank is seen shown in Figure 3.
In order not increase extra signaling, the orthogonal code of loading ACK/NACK message is determined by the physical resource that generates this ACK/NACK message, is seen formula (1).
Wherein, the numbering of r orthogonal code, t0 is by the shared start timeslot number of physical resource that generates this ACK/NACK message, and q0 is the sign indicating number Taoist monastic name of this physical resource, and Q0 is the spreading factor of this physical resource.
I, j are respectively the row number of the firsts and seconds Hadamard that adopted, i.e. C1, i and C2, j.
In sum, the method that realizes the ACK/NACK message reuse of a plurality of UE in the prior art adopts spread spectrum twice, can only be used for the WTDD system, and the bit number that the WTDD system is used for loading ACK/code channel of NACK message is 244-276, and this method has only been utilized 240 bits wherein, residue 4-36 bit, so this scheme is not effectively utilized code channel resource, causes the wasting of resources, resource utilization is low.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of user data multiplexing method on code channel that realizes, can improve the utilance of resource.
In order to achieve the above object, the invention provides a kind of user data multiplexing method on code channel that realizes, this method comprises:
A., one group of orthogonal code is set, and the number of orthogonal code is not less than simultaneously multiplexing user terminal UE number, and the corresponding orthogonal code of each UE;
B. utilize corresponding orthogonal code respectively the single bit of information to be sent at each UE to be expanded, the single bit of information to be sent after will expanding is again modulated;
C. will superpose through all single bit of information after expansion and the modulation treatment, finish multiplexing.
One group of orthogonal code can be generated by orthogonal code short more than described in the steps A.
One group of orthogonal code can be to adopt the form of tensor product to utilize the orthogonal code of a plurality of weak points to generate described in the steps A.
In steps A,, can delete the orthogonal code of unnecessary number when the number of orthogonal code during greater than the multiplexing UE number of maximum.
The orthogonal code of described unnecessary number can be to select from this group orthogonal code according to the autocorrelation of orthogonal code and cross correlation.
This method can further include:
D. the single bit of information after multiplexing is sent to receiving terminal through after the band spectrum modulation processing of channel code.
Described single bit of information can be an ACK/NACK message of confirming being used to of sending at each UE whether UE upstream data bag correctly receives.
Method of the present invention utilizes the orthogonal code set in advance that the bit message of UE is expanded, and then after the bit message after will expanding modulates, carries out multiplexing again.This method is applicable to WTDD and NTDD system.This method can directly utilize the long code of preliminary election setting as spreading code, has increased the realization flexibility of UE and base station, reduces the waste of resource, has improved the utilance of resource.And long code not only can be the long code of storing in advance, also can be the long code of utilizing short code to constitute, and the short code of generation long code can also be made of, and can further reduce the demand of memory space like this shorter sign indicating number.
Description of drawings
Fig. 1 is the concrete realization schematic diagram of ACK/NACK message reuse of a plurality of UE in the existing WTDD system;
Fig. 2 is that two classes connect orthogonal code generation schematic diagram;
Fig. 3 is for realizing the schematic flow sheet of the inventive method;
Fig. 4 is a TDD system multiplexing process schematic diagram of the present invention;
Fig. 5 is TD-SCDMA ACK/NACK message reuse figure of the present invention;
Fig. 6 comprises 6a and 6b two parts, and wherein 6a is a matrix A, and 6b is a matrix B;
Fig. 7 comprises 7a, 7b, 7c, 7d and 7e five parts, and wherein, 7a is a matrix A, and 7b is a Matrix C, and 7c is a matrix D, and 7d is matrix E, and 7e is a matrix F.
Fig. 8 comprises 8a, 8b, 8c, 8d and 8e five parts, and wherein, 8a is a matrix A, and 8b is a Matrix C, and 8c is a matrix D, and 8d is matrix E, and 8e is a matrix F.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
In order to improve resource utilization, method of the present invention need be provided with one group of orthogonal code, and each orthogonal code is corresponding with a UE, the number of orthogonal code otherwise less than simultaneously multiplexing UE number; Utilize corresponding orthogonal code to expand then, will expand back single bit of information to be sent again and modulate, will superpose through all single bit of information after expansion and the modulation then, finish multiplexing at the single bit of information to be sent of each UE.Here, needing the bit message of multiplexing UE can be the ACK/NACK message of being used to of sending at each UE confirming whether UE upstream data bag correctly receives.
Referring to shown in Figure 3, realize that method of the present invention may further comprise the steps:
Step 301: one group of orthogonal code is set, and the number of orthogonal code is not less than simultaneously multiplexing UE number, and the corresponding orthogonal code of each UE.
Step 302: utilize corresponding orthogonal code respectively the single bit of information to be sent at each UE to be expanded, the single bit of information to be sent after will expanding is again modulated.
The step of expansion can realize like this:
Suppose with the corresponding orthogonal code of UEk be Lk, the UEk bit 1 that need send expands to L so
k, bit 0 expands to
Be L
kNegate, with L
kIn 0 usefulness 1 replace, 0 replacement of 1 usefulness, can obtain
Step 303: will superpose through all single bit of information after expansion and the modulation treatment, finish multiplexing.
Further, the single bit of information after multiplexing also can send to receiving terminal again through the processing procedures such as band spectrum modulation of channel code.
In above-mentioned steps 301, can adopt following method to make up orthogonal code:
(1) determine the length of sign indicating number, the length of sign indicating number is that the length of even number and sign indicating number is greater than or equals maximum multiplexing UE number.
(2) when the free memory of UE relatively hour, available a plurality of short orthogonal codes constitute long sign indicating numbers.
Here, adopt the form of tensor product to utilize a plurality of short orthogonal codes to constitute long sign indicating number.That is: L=L
1 L
2 L
n, L
1, L
2L
nBe the short code that constitutes the L sign indicating number, the length of L is the long-pending of all short code length that constitute L.And the short code of L can be any orthogonal code, can adopt Hadamard or Williamson-Hadamard usually.
(3) in order to reduce peak-to-average force ratio (PAR), can overturn to short code, that is: each bit to short code overturns.
(4) the orthogonal code number can be identical with code length.Like this,,, only choose wherein sign indicating number preferably in order to improve system effectiveness when the length of orthogonal code during greater than the multiplexing UE number of maximum, or the wherein relatively poor sign indicating number of deletion, as: can delete by the sign indicating number that autocorrelation and cross correlation in all orthogonal codes is relatively poor.
And, can correctly parse message in order to guarantee receiving terminal, receiving terminal is the same with transmitting terminal, all needs to obtain the orthogonal code of this UE correspondence.Preferable a kind of mode is: determine corresponding relation between UE and the orthogonal code by generating at the physical resource of the ACK/NACK message of this UE, this method does not need to increase extra signaling.
Wherein, the numbering of r orthogonal code, t0 is by the shared start timeslot number of physical resource that generates this ACK/NACK message, and q0 is the sign indicating number Taoist monastic name of this physical resource, and Q0 is the spreading factor of this physical resource.
Referring to shown in Figure 4, there be N to carry out multiplexing at the single-bit messages of UE, be respectively UE1, UE2, UE3 ... UEN, this N the single-bit messages at UE expanded through its corresponding orthogonal code respectively, processing such as modulate then, it is multiplexing that N after will modulating then carries out at the single-bit messages of UE, carry out spread processing again after, send.
Be example with the NTDD system below, multiplex process of the present invention is described.
T in the NTDD system
0Value from 1 to 5, the span of r is [0,79], and needs multiplexing UE number less than 80 simultaneously, so only need 80 orthogonal codes, just can set up the corresponding relation between UE and the orthogonal code.That is it is corresponding with an orthogonal code that, each UE has a unique r value.
The TD-SCDMA system is a typical NTDD system.In the TD-SCDMA system, need be 16 with ACK/NACK message reuse to a spreading factor of a plurality of UE, modulation system is in the code channel of QPSK, this code channel can carry 88 bits.
Fig. 5 is TD-SCDMA ACK/NACK message reuse figure.Referring to shown in Figure 5, N the ACK/NACK message at UE is arranged, this N ACK/NACK message is expanded through its corresponding orthogonal code respectively, and then carry out bit and fill the message of exporting 88 bits, then the message of this 88 bit is carried out multiply by the specific gain of user after bit scramble, the QPSK modulation, again all message are carried out carrying out spread spectrum after multiplexing, will send through the message behind the spread spectrum again.
In the present embodiment, the method that makes up orthogonal code is: A B, wherein, A and B are the matrixes that is made of orthogonal code but do not require A or B is a unit matrix that represents tensor product.
In the present embodiment, the specific implementation that makes up 80 orthogonal codes can have two kinds.
First kind of method that makes up orthogonal code is: [20,20] [4,4]
Wherein, the matrix of the capable y row of [x, y] expression x.The characteristics of this scheme are that required memory space is less.
A is 20 rank Williamson-Hadamard matrixes, as Fig. 6 a.Wherein, r is the numbering of orthogonal code, and span is [0,79].
j＝r mod 4
At first from matrix B, find out 4 capable bits of j, according to capable 20 bits of square A i 4 bits of B matrix are carried out repetition (bit 1) or inversion operation (bit 0) then, can obtain 80 orthogonal code.
R=10 for example, i=2, j=2.
20 bits of A matrix are: [0,010,000,100 0111010101]
4 bits of B matrix are: [1100]
The pairing orthogonal code of r=10 is: [00,000,000,110,000,000,000,000,000,001,100,000,000,000,000,110,011,001,100 000011000000110000111100]
When realizing, can only store A and the B matrix just can generate corresponding orthogonal code, required memory space is the 20*20+4*4 bit.
If the memory space of the transmission of data or receiving terminal is very big, and can directly store 80 * 80 matrix, can directly find corresponding spreading code according to the r value like this in order to reduce amount of calculation.
As shown in Figure 8,20 rank Williamson-Hadamard are made of 45 rank submatrixs.
If only store submatrix, memory space can further reduce, and required memory space is the 5*5*3+4*4*3+4*4 bit.
Second kind of scheme: [40,44] [2,2].Second kind of scheme made full use of idle bit with respect to first kind of scheme, brought bigger quadrature " spread spectrum " gain, required memory space 40*44 bit.
Referring to shown in Figure 8,8a is a matrix A, and 8b is a Matrix C, and 8c is a matrix D, and 8d is matrix E, and 8e is a matrix F.Matrix A is 44 rank Williamson-Hadamard matrixes, and 44 rank Williamson-Hadamard matrixes also are made of the submatrix on 4 11 rank, i.e. Matrix C, D, E, F.
44 rank Williamson-Hadamard matrixes have been deleted the 5th, 16,29 and 40 row, and it is equal to reduce the peak that the 6th and the 7th row is reversed.If only store submatrix, memory space can further reduce, and required memory space is the 11*11*4+4*4*3+2*2 bit.
When code length during greater than the orthogonal code number, sign indicating number deletion that can autocorrelation and cross correlation in all orthogonal codes is relatively poor.
For example: table 1 is that a plurality of sequences are to the cross correlation value under Doppler frequency-shift.
| Sequence is to sequence (be row matrix number) | Cross correlation value |
| (5，30) | 0.94189 |
| (15，40) | 0.94189 |
| (4，29) | 0.92608 |
| (16，41) | 0.92608 |
| (3，33) | 0.87911 |
| (12，42) | 0.87911 |
| (2，32) | 0.87902 |
| (13，43) | 0.87902 |
| (1，31) | 0.87895 |
| (7，35) | 0.84752 |
| (10，38) | 0.84752 |
| (8，36) | 0.83199 |
| (9，37) | 0.83199 |
Table 1
It is right to find out the sequence that cross-correlation is bigger under the Doppler frequency-shift from table 1, reduces successively as (5,30), (15,40), (4,29), (16,41) cross correlation value.Therefore, in these four sequences of every deletion just can make maximum cross correlation reduce.When the sequence of decision deletion, relatively the cross-correlation of each sequence and all the other sequences with, remove bigger one.Table 2 be each sequence and all the other sequences cross-correlation and.
| Sequence number | Cross-correlation and |
| 5 | 10.9548 |
| 30 | 10.7244 |
| 15 | 10.7244 |
| 40 | 10.9548 |
| 4 | 10.6222 |
| 29 | 11.3172 |
| 16 | 11.3172 |
| 41 | 10.6222 |
Table 2
Can adopt following mode to generate for r orthogonal code:
If j=0,44 bits capable according to matrix A i carry out repetition or inversion operation to 2 bits 11, can obtain 88 orthogonal code.
If j=1,44 bits capable according to matrix A i carry out repetition or inversion operation to 2 bits 10, can obtain 88 orthogonal code.
Claims (7)
1, a kind of multi-user data multiplexing method on code channel that realizes is characterized in that this method may further comprise the steps:
A., one group of orthogonal code is set, and the number of orthogonal code is not less than simultaneously multiplexing user terminal UE number, and the corresponding orthogonal code of each UE;
B. utilize corresponding orthogonal code respectively the single bit of information to be sent at each UE to be expanded, the single bit of information to be sent after will expanding is again modulated;
C. will superpose through all single bit of information after expansion and the modulation treatment, finish multiplexing.
2, method according to claim 1 is characterized in that, one group of orthogonal code is generated by orthogonal code short more than described in the steps A.
3, method according to claim 2 is characterized in that, one group of orthogonal code is to adopt the form of tensor product to utilize the orthogonal code of a plurality of weak points to generate described in the steps A.
4, method according to claim 1 is characterized in that, in steps A, when the number of orthogonal code during greater than the multiplexing UE number of maximum, deletes the orthogonal code of unnecessary number.
5, method according to claim 4 is characterized in that, the orthogonal code of described unnecessary number is to select from this group orthogonal code according to the autocorrelation of orthogonal code and cross correlation.
6, method according to claim 1 is characterized in that, this method further comprises:
D. the single bit of information after multiplexing is sent to receiving terminal through after the band spectrum modulation processing of channel code.
7, method according to claim 1 is characterized in that, described single bit of information is confirmed the ACK/NACK message whether UE upstream data bag correctly receives for being used to of sending at each UE.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100791056A CN101064582B (en) | 2006-04-29 | 2006-04-29 | Method for realizing multiplexing on code channel of multi-user data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100791056A CN101064582B (en) | 2006-04-29 | 2006-04-29 | Method for realizing multiplexing on code channel of multi-user data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101064582A true CN101064582A (en) | 2007-10-31 |
| CN101064582B CN101064582B (en) | 2010-11-03 |
Family
ID=38965340
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100791056A Active CN101064582B (en) | 2006-04-29 | 2006-04-29 | Method for realizing multiplexing on code channel of multi-user data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101064582B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238740A (en) * | 2010-04-27 | 2011-11-09 | 鼎桥通信技术有限公司 | Method for feeding back acknowledge/negative acknowledge (ACK/NACK) information of enhanced dedicated channel (E-DCH) data block |
| CN103457713A (en) * | 2008-01-28 | 2013-12-18 | Lg电子株式会社 | Method for allocating physical hybrid automatic repeat request indicator channel |
| WO2014135122A1 (en) * | 2013-03-08 | 2014-09-12 | Huawei Technologies Co., Ltd. | System and method for reduced signaling transmissions in a communications system |
| CN107566080A (en) * | 2016-06-30 | 2018-01-09 | 普天信息技术有限公司 | A kind of ascending control channel sending method |
-
2006
- 2006-04-29 CN CN2006100791056A patent/CN101064582B/en active Active
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103457713A (en) * | 2008-01-28 | 2013-12-18 | Lg电子株式会社 | Method for allocating physical hybrid automatic repeat request indicator channel |
| US9276727B2 (en) | 2008-01-28 | 2016-03-01 | Lg Electronics Inc. | Method for allocating physical hybrid automatic repeat request indicator channel |
| CN103457713B (en) * | 2008-01-28 | 2016-09-21 | Lg电子株式会社 | For the method distributing physical mixed automatic repeat request indicator channel |
| US9571254B2 (en) | 2008-01-28 | 2017-02-14 | Lg Electronics Inc. | Method for allocating physical hybrid automatic repeat request indicator channel |
| US9831997B2 (en) | 2008-01-28 | 2017-11-28 | Lg Electronics Inc. | Method for allocating physical hybrid automatic repeat request indicator channel |
| CN102238740A (en) * | 2010-04-27 | 2011-11-09 | 鼎桥通信技术有限公司 | Method for feeding back acknowledge/negative acknowledge (ACK/NACK) information of enhanced dedicated channel (E-DCH) data block |
| WO2014135122A1 (en) * | 2013-03-08 | 2014-09-12 | Huawei Technologies Co., Ltd. | System and method for reduced signaling transmissions in a communications system |
| CN105359565A (en) * | 2013-03-08 | 2016-02-24 | 华为技术有限公司 | System and method for reduced signaling transmissions in a communications system |
| CN105359565B (en) * | 2013-03-08 | 2019-06-11 | 华为技术有限公司 | The system and method for signalling in a kind of reduction communication system |
| US10568121B2 (en) | 2013-03-08 | 2020-02-18 | Huawei Technologies Co., Ltd. | System and method for reduced signaling transmissions in a communications system |
| CN107566080A (en) * | 2016-06-30 | 2018-01-09 | 普天信息技术有限公司 | A kind of ascending control channel sending method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101064582B (en) | 2010-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10225060B2 (en) | Apparatus and method for allocating code resources to uplink ACK/NACK channels in a cellular wireless communication system | |
| CN1243426C (en) | Channel assigning device and method in CDMA communication system | |
| CN101502034B (en) | For the dynamic frequency allocation of control information and the method and apparatus of modulation scheme | |
| RU2521463C2 (en) | Distribution in control channel in wireless communication network | |
| CN1156104C (en) | Method for processing data to be transmitted over common channel | |
| EP2070217B1 (en) | Apparatus, method and computer program product providing mulitplexing for data-non-associated control channel | |
| CN102870358B (en) | Mobile terminal apparatus and wireless communications method | |
| JP5301323B2 (en) | Mobile terminal device and wireless communication method | |
| WO2013120456A1 (en) | Method, base station and user equipment for random access | |
| WO2018171023A1 (en) | Resource scheduling method, terminal device, and network device | |
| CN1486546A (en) | Method and apparatus for multiplexing high-speed packet data transmission with voice/data transmission | |
| CN101227233A (en) | Method and apparatus for sending physics uplink control signal in TDD system | |
| CN1992579A (en) | Apparatus and method for communicating high speed shared control channel in wideband wireless communication system | |
| CN1440625A (en) | Method and apparatus for beam switching in wireless communication system | |
| WO2009129681A1 (en) | Method for interference randomization of physical uplink control channel | |
| CN1341305A (en) | Apparatus and method for transmitting and receiving data in CDMA communication system | |
| JP5559374B2 (en) | Method for transmitting control information on the forward link of a wireless network | |
| CN101350702B (en) | Method and device for implementing mixed automatic re-transmission indicating channel for enhancing private channel | |
| CN101032114A (en) | Mobile wireless communication apparatus, wireless communication apparatus and communication processing method | |
| KR20100031677A (en) | Wireless communication apparatus and response signal spreading method | |
| CN101064582A (en) | Method for realizing multiplexing on code channel of multi-user data | |
| CN1398496A (en) | Radio base station appts. and communication terminal appts. | |
| US8576787B2 (en) | Scheduling request transmission supporting high doppler | |
| CN101237297A (en) | A method, device and system for transmitting control information of enhanced uplink dedicated channel | |
| CN102084610A (en) | Method and apparatus for transmitting sequence in wireless communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD. Effective date: 20110401 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 29, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100191 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20110401 Address after: 100191 Haidian District, Xueyuan Road, No. 40, Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 Haidian District, Xueyuan Road, No. 29, Patentee before: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210601 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |