US8693354B2 - Method for generation of cyclic shift amount set and method for generation of random access preamble - Google Patents
Method for generation of cyclic shift amount set and method for generation of random access preamble Download PDFInfo
- Publication number
- US8693354B2 US8693354B2 US12/812,463 US81246308A US8693354B2 US 8693354 B2 US8693354 B2 US 8693354B2 US 81246308 A US81246308 A US 81246308A US 8693354 B2 US8693354 B2 US 8693354B2
- Authority
- US
- United States
- Prior art keywords
- ncs
- final
- npre
- tpre
- tds
- 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.)
- Active, expires
Links
- 238000000034 method Methods 0.000 title claims abstract description 82
- 125000004122 cyclic group Chemical group 0.000 title claims abstract description 48
- 238000012216 screening Methods 0.000 claims abstract description 46
- 230000003247 decreasing effect Effects 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/14—Generation of codes with a zero correlation zone
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/0055—ZCZ [zero correlation zone]
- H04J13/0059—CAZAC [constant-amplitude and zero auto-correlation]
- H04J13/0062—Zadoff-Chu
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/16—Code allocation
- H04J13/22—Allocation of codes with a zero correlation zone
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
Definitions
- the present invention relates to a method for generation of cyclic shift amount set and a method for generation of random access preamble of random access channel in wireless communication system.
- FIG. 1 is a frame structure of Time Division Duplex (TDD) mode in Long Term Evolution (LTE) system.
- TDD Time Division Duplex
- LTE Long Term Evolution
- a 10 ms radio frame is divided into two half-frames, and each half-frame is divided into 10 time slots (number from 0 to 9) with a length of 0.5 ms respectively, and two time slots constitute a subframe with a length of 1 ms, and each half-frame consists of five subframes (number from 0 to 4).
- subframe 0 is fixedly used for downlink
- subframe 1 is a special subframe containing 3 particular time slots, which are Downlink Pilot Time Slot (DwPTS), Guard Period (GP) and Uplink Pilot Time Slot (UpPTS) receptively.
- DwPTS Downlink Pilot Time Slot
- GP Guard Period
- UpPTS Uplink Pilot Time Slot
- Random access channel may be transmitted either in the UpPTS or in other uplink subframes, but the structures of this two random access channels are different.
- Random Access Channel uses cyclic shift sequences of Zadoff-Chu (ZC) sequence as preamble, and these cyclic shift sequences can also be called Zero Correlation Zone (ZCZ) sequences.
- ZC Zadoff-Chu
- ZCZ Zero Correlation Zone
- mobile phone first executes downlink synchronization after being turned on, and then begins to detect Broadcast Channel (BCH).
- BCH Broadcast Channel
- Base station informs the mobile phone via the BCH about the available index of the first ZC sequence and step size of cyclic shift (i.e. cyclic shift amount) of the RACH in the cell, and the mobile phone uses a certain mapping rule to calculate sequence numbers of corresponding ZC sequences according to the index, and then generates available ZCZ sequences according to cyclic shift step size and a certain cyclic shift restriction rule.
- the mobile phone If the amount of the ZCZ sequences is less than a threshold M, the mobile phone increases sequence index by degrees automatically, and uses the next ZC sequence to continue generating ZCZ sequences until the total amount of ZCZ sequences is greater than or equal to said threshold. In the end, the mobile phone randomly selects one sequence from all generated available ZCZ sequences as a random access preamble (hereinafter referred to as preamble for short) to send.
- preamble random access preamble
- cyclic shift amount affects system performances. If the cyclic shift amount is too great, the amount of the ZCZ sequences generated by each ZC sequence will become smaller, so that the reuse factor of ZC sequence decrease (reuse factor is defined as amount of cells using different ZC sequences), and the interference between cells increase; if the cyclic shift amount is too small, the supported covering range will become too small to satisfy the demond of networking. Furthermore, unreasonable design of the cyclic shift amount will also decrease the complete orthogonal probability of two preambles and increase the interference between users in cells.
- the technical problem the present invention aims to solve is to overcome the deficiency of existing technology, and the present invention provides a method for generation of suitable Ncs set under the condition of satisfying the maximal covering demand of the system, so as to decrease the interference between and in cells when random access preamble is generated by cyclic shift amount of random access channel contained in the set.
- the present invention provides a method for generation of cyclic shift amount set, and the method comprises the following steps:
- A determining an upper limit value Ncs_max of cyclic shift amount Ncs according to a maximum cell radius value which is required to be supported by a random access channel RACH, and selecting Ncs values which are less than or equal to the Ncs_max to be elements of an initial Ncs set;
- N the number of elements in the screening Ncs set, is greater than P, the number of maximum Ncs supported by the system, then deleting N-P elements from the set so as to generate a final Ncs set; else regarding the screening Ncs set as the final Ncs set;
- M is a preamble number required by each cell; Npre is the length of preamble sequence.
- the Ncs values which are greater than or equal to Ncs_min but also less than or equal to the Ncs_max may be regarded as elements of the initial Ncs set;
- Ncs_min ⁇ Tds ⁇ Npre Tpre ⁇ ; or Ncs_min is the maximum value of
- the element which has the minimum Ncs value may be reserved, the other elements may be deleted, and the screening Ncs set in which each element has a different Nr value may be generated.
- step C if the N is greater than the P, P ⁇ 1 Ncs values arranged from low to high in the screening Ncs set and the maximum Ncs value in the screening Ncs set may be regarded as elements of the final Ncs set, and the other N ⁇ P elements may be deleted.
- step A the following formula may be used to calculate the Ncs_max:
- Ncs_max ⁇ ( R ⁇ 6.7 + Tds ) ⁇ Npre Tpre ⁇ ; wherein, R is the maximum cell radius value which is required to be supported by the RACH, Tpre is the length of the preamble, and Tds is the length of multipath channel delay spread.
- the element which has the maximum Ncs value may be reserved, the other elements may be deleted, and the screening Ncs set in which each element has a different Nr value may be generated.
- step C if the N is greater than the P, then
- P ⁇ 1 Ncs values arranged from high to low in the screening Ncs set and the minimum Ncs value in the screening Ncs set may be regarded as elements of the final Ncs set, and the other N ⁇ P elements may be deleted; or
- P Ncs values arranged from high to low in the screening Ncs set may be regarded as elements of the final Ncs set, and the other N ⁇ P elements may be deleted;
- P Ncs values arranged from low to high in the screening Ncs set may be regarded as elements of the final Ncs set, and the other N ⁇ P elements may be deleted.
- the present invention also provides a method for generation of random access preamble, and the method comprises:
- N ZC is the length of the root Zadoff-Chu sequence; the cyclic shift amount set is ⁇ 2, 4, 6, 8, 10, 12, 15 ⁇ .
- predefined start point may be 0.
- the Ncs set generated by the method of present invention can satisfy the maximal covering demand of the system. Furthermore, under the condition of different covering demands, a suitable cyclic shift amount can be selected to make ZC sequence reuse factor reach the maximum and make two preambles reach the highest orthogonal probability, therefore the interference between and in cells is decreased.
- FIG. 1 is a diagram illustrating the frame structure of TDD mode in LTE system.
- FIG. 2 is a flowchart illustrating a method for generation of cyclic shift amount set of random access channel in wireless communication system in an embodiment of the present invention.
- FIG. 2 is a flowchart illustrating a method for generation of cyclic shift amount set of random access channel in wireless communication system in an embodiment of the present invention. As shown in FIG. 2 , the method comprises the following steps:
- 201 determine an upper limit value Ncs_max of Ncs in Ncs set according to a maximum cell radius value which is required to be supported by RACH;
- the Ncs_max can be calculated by the following formula:
- Ncs_max ⁇ ( R ⁇ 6.7 + Tds ) ⁇ Npre Tpre ⁇ ; ( Formula ⁇ ⁇ 1 )
- R is the maximum cell radius value which is required to be supported by the RACH, and the unit is km; Tpre is the length of preamble (or duration), and the unit is us; Npre is the length of preamble sequence; and Tds is the length of multipath channel delay spread; ⁇ • ⁇ denotes rounding down operation.
- the Ncs_min can be calculated by the following formula:
- Ncs_min ⁇ Tds ⁇ Npre Tpre ⁇ ( Formula ⁇ ⁇ 2 )
- design threshold Ncs_th according to requirement, regard the maximum value between the Ncs_min calculated by formula 2 and the Ncs_th as the final lower limit value Ncs_min of Ncs.
- M is the preamble number required by each cell; ⁇ • ⁇ denotes rounding up operation.
- the minimum Ncs value can also be reserved.
- each Ncs value has a corresponding Nr value NR_ 1 , then delete the minimum Q ⁇ 1 values in these Q Ncs values from the initial Ncs set; repeat above operation, so as to make Nr value corresponding to each Ncs value in the initial Ncs set is different.
- the final Ncs set can be composed of P ⁇ 1 Ncs values which are selected from N elements in the screening Ncs set from low to high and the maximum Ncs value in the screening Ncs set.
- the final Ncs set can also be composed of P ⁇ 1 Ncs values selected from high to low and the minimum Ncs value in the initial Ncs set; or the final Ncs set can be composed of maximum or minimum P Ncs values from the set.
- x u ⁇ ( n ) e - j ⁇ ⁇ ⁇ ⁇ u ⁇ ⁇ n ⁇ ( n + 1 ) N ZC , ⁇ 0 ⁇ n ⁇ N ZC - 1 ;
- Ncs is cyclic shift amount, which can also be called cyclic shift step size
- C v is cyclic shift generated according to cyclic shift step size
- N ZC is the length of ZC sequence.
- the above Ncs belongs to set ⁇ 2, 4, 6, 8, 10, 12, 15 ⁇ .
- some cyclic shift sequences can be limited to become random access preamble according to certain cyclic shift limit criterion, i.e. only part of cyclic shift sequences can be selected to be random access preamble.
- optional Ncs set is ⁇ 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 3, 4, 4, 5, 5, 6, 6, 7, 8, 8 ⁇
- the optional Ncs set after being screened is ⁇ 6, 8, 10, 12, 13, 15 ⁇ , because the number of elements in the set is greater than P, select ⁇ 6, 8, 10, 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 3, 4, 4, 5, 5, 6, 6, 7, 8, 8 ⁇
- the optional Ncs set after being screened is ⁇ 6, 8, 10, 12, 13, 15 ⁇ , because the number of elements in the set is greater than P, select ⁇ 6, 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 3, 4, 4, 5, 5, 6, 6, 7, 8, 8 ⁇
- the optional Ncs set after being screened is ⁇ 6, 8, 10, 12, 13, 15 ⁇ , because the number of elements in the set is greater than P, select ⁇ 6, 8, 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 1, 1, 1, 2, 2, 2, 2, 2, 2 ⁇
- the optional Ncs set after being screened is ⁇ 8, 15 ⁇ , because the number of elements in the set is equal to P, select ⁇ 8, 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 1, 1, 1, 2, 2, 2, 2, 2, 2 ⁇
- the optional Ncs set after being screened is ⁇ 8, 15 ⁇ , because the number of elements in the set is greater than P, select ⁇ 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 8 ⁇
- the optional Ncs set after being screened is ⁇ 2, 4, 6, 8, 10, 12, 13, 15 ⁇ , because the number of elements in the set is greater than P, select ⁇ 2, 4, 6, 8, 10, 12, 15 ⁇ as the final Ncs set.
- optional Ncs set is ⁇ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ⁇
- the corresponding Nr is ⁇ 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 8 ⁇
- the optional Ncs set after being screened is ⁇ 2, 4, 6, 8, 10, 12, 13, 15 ⁇ , because the number of elements in the set is equal to P, select ⁇ 2, 4, 6, 8, 10, 12, 13, 15 ⁇ as the final Ncs set.
- Ncs set generated by the method of the present invention can satisfy the maximal covering demand of the system. Meanwhile, under the condition of different covering demands, a suitable Ncs can be selected to make ZC sequence reuse factor reach the maximum and make generated preambles reach the highest orthogonal probability, therefore interference between and in cells is decreased.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
- Compositions Of Macromolecular Compounds (AREA)
- Injection Moulding Of Plastics Or The Like (AREA)
Abstract
Description
or Ncs_min is the maximum value of
and defined threshold Ncs_th.
wherein, R is the maximum cell radius value which is required to be supported by the RACH, Tpre is the length of the preamble, and Tds is the length of multipath channel delay spread.
NZC is the length of the root Zadoff-Chu sequence; the cyclic shift amount set is {2, 4, 6, 8, 10, 12, 15}.
Nr=┌M/└Npre/Ncs┘┐ (Formula 3)
wherein, Nr is the root sequence number corresponding to cyclic shift amount Ncs;
x u,v(n)=x u((n+C v)mod N ZC);
Claims (18)
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200810003371.X | 2008-01-17 | ||
CN200810003371 | 2008-01-17 | ||
CN200810003371.XA CN101217807B (en) | 2008-01-17 | 2008-01-17 | Generation method of cyclic shift amount aggregation of random accessed channel of wireless communication system |
PCT/CN2008/002136 WO2009094849A1 (en) | 2008-01-17 | 2008-12-30 | Cyclic shift duration set generation method and random access preamble generation method |
Publications (2)
Publication Number | Publication Date |
---|---|
US20110007825A1 US20110007825A1 (en) | 2011-01-13 |
US8693354B2 true US8693354B2 (en) | 2014-04-08 |
Family
ID=39624149
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/812,463 Active 2029-07-30 US8693354B2 (en) | 2008-01-17 | 2008-12-30 | Method for generation of cyclic shift amount set and method for generation of random access preamble |
Country Status (5)
Country | Link |
---|---|
US (1) | US8693354B2 (en) |
EP (2) | EP2197126B1 (en) |
CN (2) | CN101217807B (en) |
HK (1) | HK1136707A1 (en) |
WO (1) | WO2009094849A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180049237A1 (en) * | 2015-04-24 | 2018-02-15 | Huawei Technologies Co., Ltd. | Uplink random access method and related device |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
PL3032754T3 (en) | 2006-03-20 | 2020-11-16 | Optis Wireless Technology, Llc | Radio communication mobile station apparatus and radio communication method |
US8295266B2 (en) * | 2006-10-25 | 2012-10-23 | Lg Electronics Inc. | Method for adjusting RACH transmission against frequency offset |
CN101641925B (en) | 2007-01-05 | 2013-08-21 | Lg电子株式会社 | Method for setting cyclic shift considering frequency offset |
EP1944935B1 (en) | 2007-01-05 | 2012-05-23 | LG Electronics Inc. | Method for setting cyclic shift considering frequency offset |
CN101217807B (en) * | 2008-01-17 | 2011-12-07 | 中兴通讯股份有限公司 | Generation method of cyclic shift amount aggregation of random accessed channel of wireless communication system |
CN101345577B (en) | 2008-08-21 | 2014-03-12 | 中兴通讯股份有限公司 | Method for generating leader sequence and method for confirming cyclic shift |
CN101772220B (en) * | 2009-01-05 | 2012-11-14 | 电信科学技术研究院 | Method, system and device for allocating uplink reference signals |
US9788344B2 (en) * | 2014-04-18 | 2017-10-10 | Korea Advanced Institute Of Science And Technology | System and method for random access based on spatial group |
EP3305003B1 (en) * | 2015-05-27 | 2021-03-31 | Telefonaktiebolaget LM Ericsson (publ) | A random access preamble signal construction |
CN106714326B (en) * | 2015-07-20 | 2020-01-31 | 普天信息技术有限公司 | Prach root sequence planning method and device |
KR102309120B1 (en) * | 2017-05-11 | 2021-10-06 | 삼성전자 주식회사 | Method and apparatus for connection configuration between terminal and base station |
CN109392181B (en) * | 2017-08-11 | 2022-07-19 | 华为技术有限公司 | Method and apparatus for transmitting and receiving random access preamble |
WO2020191759A1 (en) * | 2019-03-28 | 2020-10-01 | Zte Corporation | Generating preambles for random access in wireless networks |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007126793A2 (en) | 2006-03-27 | 2007-11-08 | Texas Instruments Incorporated | Random access structure for wireless networks |
CN101094529A (en) | 2007-08-10 | 2007-12-26 | 中兴通讯股份有限公司 | Method and device for sorting ZC sequence of random access channel |
CN101094027A (en) | 2006-06-20 | 2007-12-26 | 上海无线通信研究中心 | Signature sequence of sending structure of implying user's control information, transmitting and receiving method |
CN101217807A (en) | 2008-01-17 | 2008-07-09 | 中兴通讯股份有限公司 | Generation method of cyclic shift amount aggregation of random accessed channel of wireless communication system |
US20090073944A1 (en) * | 2007-09-17 | 2009-03-19 | Jing Jiang | Restricted Cyclic Shift Configuration for Random Access Preambles in Wireless Networks |
US20100220664A1 (en) * | 2006-12-29 | 2010-09-02 | Kari Hooli | Apparatus, Methods, and Computer Program Products Providing Limited Use of Zadoff-Chu Sequences in Pilot or Preamble Signals |
US20100284350A1 (en) * | 2007-06-07 | 2010-11-11 | Nokia Corporation | Apparatus, method and computer program product providing flexible preamble sequence allocation |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20060044126A (en) * | 2004-11-11 | 2006-05-16 | 삼성전자주식회사 | Apparatus and method for cell searching and synchronization in ofdma system |
CN100524335C (en) * | 2006-09-22 | 2009-08-05 | 东南大学 | Multi-address switch-in anti-collision method implemented in circuit shift method |
-
2008
- 2008-01-17 CN CN200810003371.XA patent/CN101217807B/en active Active
- 2008-12-30 EP EP08871876.2A patent/EP2197126B1/en active Active
- 2008-12-30 WO PCT/CN2008/002136 patent/WO2009094849A1/en active Application Filing
- 2008-12-30 CN CN200880104135.5A patent/CN101809895B/en active Active
- 2008-12-30 US US12/812,463 patent/US8693354B2/en active Active
- 2008-12-30 EP EP18194667.4A patent/EP3435568A1/en active Pending
-
2010
- 2010-05-06 HK HK10104436.2A patent/HK1136707A1/en unknown
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007126793A2 (en) | 2006-03-27 | 2007-11-08 | Texas Instruments Incorporated | Random access structure for wireless networks |
CN101094027A (en) | 2006-06-20 | 2007-12-26 | 上海无线通信研究中心 | Signature sequence of sending structure of implying user's control information, transmitting and receiving method |
US20100220664A1 (en) * | 2006-12-29 | 2010-09-02 | Kari Hooli | Apparatus, Methods, and Computer Program Products Providing Limited Use of Zadoff-Chu Sequences in Pilot or Preamble Signals |
US20100284350A1 (en) * | 2007-06-07 | 2010-11-11 | Nokia Corporation | Apparatus, method and computer program product providing flexible preamble sequence allocation |
CN101094529A (en) | 2007-08-10 | 2007-12-26 | 中兴通讯股份有限公司 | Method and device for sorting ZC sequence of random access channel |
US20090073944A1 (en) * | 2007-09-17 | 2009-03-19 | Jing Jiang | Restricted Cyclic Shift Configuration for Random Access Preambles in Wireless Networks |
CN101217807A (en) | 2008-01-17 | 2008-07-09 | 中兴通讯股份有限公司 | Generation method of cyclic shift amount aggregation of random accessed channel of wireless communication system |
Non-Patent Citations (5)
Title |
---|
3GPP TSG RAN WG1 Meeting #49bis, R1-072863. |
3GPP TSG RAN WG1 Meeting #49bis, R1-072898. |
Cyclic Shift Configuration Set for Non-Synchronized RACH. |
English Translation of the Written Opinion of the International Search Authority in international application No. PCT/CN2008/002136, mailed Apr. 9, 2009. |
International Search Report in international application No. PCT/CN2008/002136, mailed Apr. 9, 2009. |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180049237A1 (en) * | 2015-04-24 | 2018-02-15 | Huawei Technologies Co., Ltd. | Uplink random access method and related device |
Also Published As
Publication number | Publication date |
---|---|
US20110007825A1 (en) | 2011-01-13 |
CN101809895B (en) | 2014-05-28 |
HK1136707A1 (en) | 2010-07-02 |
CN101217807A (en) | 2008-07-09 |
CN101217807B (en) | 2011-12-07 |
EP3435568A1 (en) | 2019-01-30 |
WO2009094849A1 (en) | 2009-08-06 |
EP2197126A4 (en) | 2014-10-22 |
CN101809895A (en) | 2010-08-18 |
EP2197126B1 (en) | 2018-10-31 |
EP2197126A1 (en) | 2010-06-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8693354B2 (en) | Method for generation of cyclic shift amount set and method for generation of random access preamble | |
US20210014879A1 (en) | Method and apparatus for performing uplink transmission in a wireless communication system | |
US11647541B2 (en) | Method and apparatus for performing random access | |
EP4113891B1 (en) | Device using channel multiplexing in wireless communication | |
US8477712B2 (en) | Method for mapping physical random access channels | |
CN105393618B (en) | Method for transmitting signals, device, communication system, terminal and base station | |
EP3404991B1 (en) | Random access method, communication node and non-transitory computer-readable medium | |
EP3537832B1 (en) | Method for performing initial access in wireless communication system, and user equipment therefor | |
US9118531B2 (en) | Method of generating random access preambles in wireless communication system | |
EP2341725B1 (en) | Method and base station for allocating dedicated random access resource | |
US10299292B2 (en) | Method and device for detecting RACH preamble collision caused by multi-path channel in wireless communication system | |
CN108633096B (en) | Method and device for reporting scheduling request in narrowband internet of things system | |
US8379662B2 (en) | Radio transmitting apparatus and radio transmitting method | |
US20140169150A1 (en) | Method for mapping physical hybrid automatic repeat request indicator channel | |
CN116437465A (en) | Method and device for reporting scheduling request in narrowband internet of things system | |
CN103716895A (en) | Resource determining method and device for physical random access channel | |
US8498226B2 (en) | Method for determining random access channel number and sending sounding reference signal | |
CN109155710A (en) | Use the ascending transmission method of unlicensed spectrum, distribution method, user equipment and base station | |
WO2018028489A1 (en) | Data transmission method and apparatus | |
CN107197422A (en) | The method and its equipment for the signal of direct communication between UE are detected in a wireless communication system | |
US10609734B2 (en) | Method and apparatus for detecting RACH preamble on basis of plurality of zero-correlation zones in wireless communication system | |
US10511423B2 (en) | Data transmission method, terminal device, and base station | |
KR20200065035A (en) | Signal transmission method and system | |
KR101387539B1 (en) | Method for mapping control channels | |
US20230345432A1 (en) | Methods and systems for coverage enhancement in wireless networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ZTE CORPORATION, CHINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HAO, PENG;YU, BIN;XIA, SHUQIANG;AND OTHERS;REEL/FRAME:024178/0607 Effective date: 20100322 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551) Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 8 |