USRE50185EActiveUtility

Allocation of preamble sequences

Assignee: NOKIA SOLUTIONS & NETWORKS OYPriority: Sep 2, 2007Filed: Jun 5, 2008Granted: Oct 22, 2024
Est. expirySep 2, 2027(~1.1 yrs left)· nominal 20-yr term from priority
H04L 5/0037H04J 13/0062H04J 13/14H04L 5/0053
53
PatentIndex Score
0
Cited by
134
References
155
Claims

Abstract

A set of specific sequences including a set of root sequences and cyclic shifts thereof is searched, wherein it is started from a root sequence index indicating a root sequence of ordered root sequences, available cyclic shifts of the root sequence are included, and it is continued with a next root sequence if necessary for filling the set, interpreting the ordered root sequences in a cyclic manner.

Claims

exact text as granted — not AI-modified
The invention claimed is: 
     
       1. A device comprising:
 a receiver configured to receive information regarding one or more of a root sequence index or a cyclic shift increment; and  
 a searching unit configured to search a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching unit is configured to start from a the root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, include available cyclic shifts of the root sequence, and continue with a next root sequence if necessary for filling the set, interpreting wherein the searching unit is configured to interpret the ordered root sequences in a cyclic manner, 
 wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
 
 
     
     
       2. The device of  claim 1 , wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with cubic metric of each of the sequences and a size of a high mobility cell each of the sequences supports. 
     
     
       3. The device of  claim 2 , wherein the ordered root sequences are obtained by dividing the sequences of predetermined length and number into a first set comprising first sequences and a second set comprising second sequences in accordance with a cubic metric of each of the sequences below or above a predetermined threshold, and ordering the first sequences in accordance with a supported size of a high mobility cell supported by each of the first sequences and complementarily ordering the second sequences in accordance with the supported size of the high mobility cell supported by each of the second sequences. 
     
     
       4. The device of  claim 3 , wherein the cubic metric of each of the first sequences is below the predetermined threshold and the cubic metric of each of the second sequences is above the predetermined threshold, and the first sequences are ordered in accordance with the supported size of the high mobility cell decreasing and the second sequences are ordered in accordance with the supported size of the high mobility cell increasing or vice versa. 
     
     
       5. A method comprising:
 receiving information regarding one or more of a root sequence index or a cyclic shift increment; and  
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set,; and  
 
 interpreting the ordered root sequences in a cyclic manner., wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
 
 
     
     
       6. The method of  claim 5 , wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with cubic metric of each of the sequences and a size of a high mobility cell each of the sequences supports. 
     
     
       7. The method of  claim 6 , wherein the ordered root sequences are obtained by dividing the sequences of predetermined length and number into a first set comprising first sequences and a second set comprising second sequences in accordance with a cubic metric of each of the sequences below or above a predetermined threshold, and ordering the first sequences in accordance with a supported size of a high mobility cell supported by each of the first sequences and complementarily ordering the second sequences in accordance with the supported size of the high mobility cell supported by each of the second sequences. 
     
     
       8. The method of  claim 7 , wherein the cubic metric of each of the first sequences is below the predetermined threshold and the cubic metric of each of the second sequences is above the predetermined threshold, and the first sequences are ordered in accordance with the supported size of the high mobility cell decreasing and the second sequences are ordered in accordance with the supported size of the high mobility cell increasing or vice versa. 
     
     
       9. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing the steps method of  claim 5  when the program is run on the processing device. 
     
     
       10. The computer program product according to  claim 9 , wherein the program is directly loadable into an internal memory the non-transitory computer-readable storage medium of the processing device. 
     
     
       11. The device of  claim 1 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       12. The device of  claim 1 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       13. The device of  claim 1 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       14. The device of  claim 1 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       15. The device of  claim 1 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       16. The device of  claim 1 , wherein the receiver is further configured to receive a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence. 
     
     
       17. The device of  claim 1 , further comprising:
 a transmitter configured to use a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       18. The device of  claim 17 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       19. The device of  claim 1 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       20. The device of  claim 1 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       21. The method of  claim 5 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       22. The method of  claim 5 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       23. The method of  claim 5 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       24. The method of  claim 5 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       25. The method of  claim 5 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       26. The method of  claim 5 , further comprising:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       27. The method of  claim 5 , further comprising:
 using a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       28. The method of  claim 27 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       29. The method of  claim 5 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       30. The method of  claim 5 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       31. A device comprising:
 a transmitter configured to transmit information regarding one or more of a root sequence index or a cyclic shift increment; and   a searching unit configured to search a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching unit is configured to start from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, include available cyclic shifts of the root sequence, and continue with a next root sequence if necessary for filling the set, wherein the searching unit is configured to interpret the ordered root sequences in a cyclic manner,   wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
   
     
     
       32. The device of  claim 31 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       33. The device of  claim 31 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       34. The device of  claim 31 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       35. The device of  claim 31 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       36. The device of  claim 31 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       37. The device of  claim 31 , further comprising:
 a receiver configured to receive a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       38. The device of  claim 37 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       39. The device of  claim 31 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       40. The device of  claim 31 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       41. A method comprising:
 transmitting information regarding one or more of a root sequence index or a cyclic shift increment; and   searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner, wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
   
     
     
       42. The method of  claim 41 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       43. The method of  claim 41 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       44. The method of  claim 41 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       45. The method of  claim 41 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       46. The method of  claim 41 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       47. The method of  claim 41 , further comprising:
 receiving a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       48. The method of  claim 47 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       49. The method of  claim 41 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       50. The method of  claim 41 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       51. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing the method of  claim 41  when the program is run on the processing device. 
     
     
       52. The computer program product according to  claim 51 , wherein the program is directly loadable into the non-transitory computer-readable storage medium of the processing device. 
     
     
       53. A device comprising:
 a processor; and   a computer-readable storage medium storing instructions thereon that, when executed by the processor, cause the device to perform at least:
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein said searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence, and 
 continuing with a next root sequence if necessary for filling the set; and 
 
 interpreting the ordered root sequences in a cyclic manner; 
 wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, 
 
   
       wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
     
     
       54. The device of  claim 53 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       55. The device of  claim 53 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       56. The device of  claim 53 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       57. The device of  claim 53 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       58. The device of  claim 53 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       59. The device of  claim 53 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       60. The device of  claim 53 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 using a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       61. The device of  claim 60 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       62. The device of  claim 53 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 transmitting a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       63. The device of  claim 53 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 receiving a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       64. The device of  claim 63 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       65. The device of  claim 53 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       66. The device of  claim 53 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       67. A method comprising:
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein said searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence, and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner;   wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein sequences of adjacent subsets of the two or more subsets in the first set are ordered with alternating decreasing and increasing cubic metric values, and wherein sequences of adjacent subsets of the two or more subsets in the second set are ordered with alternating decreasing and increasing cubic metric values. 
   
     
     
       68. The method of  claim 67 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       69. The method of  claim 67 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       70. The method of  claim 67 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       71. The method of  claim 67 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       72. The method of  claim 67 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       73. The method of  claim 67 , further comprising:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       74. The method of  claim 67 , further comprising:
 using a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       75. The method of  claim 74 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       76. The method of  claim 67 , further comprising:
 transmitting a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       77. The method of  claim 67 , further comprising:
 receiving a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       78. The method of  claim 77 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       79. The method of  claim 67 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       80. The method of  claim 67 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       81. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing the method of  claim 67  when the program is run on the processing device. 
     
     
       82. The computer program product according to  claim 81 , wherein the program is directly loadable into the non-transitory computer-readable storage medium of the processing device. 
     
     
       83. A device comprising:
 a receiver configured to receive information regarding one or more of a root sequence index or a cyclic shift increment; and   a searching unit configured to search a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching unit is configured to start from the root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, include available cyclic shifts of the root sequence, and continue with a next root sequence if necessary for filling the set, wherein the searching unit is configured to interpret the ordered root sequences in a cyclic manner,   wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets of the first set, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets of the second set. 
   
     
     
       84. The device of  claim 83 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       85. The device of  claim 83 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       86. The device of  claim 83 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       87. The device of  claim 83 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       88. The device of  claim 83 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       89. The device of  claim 83 , wherein the receiver is further configured to receive a mobility parameter indicating whether the ordering uses a sequence restriction scheme, and wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence. 
     
     
       90. The device of  claim 83 , further comprising:
 a transmitter configured to use a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       91. The device of  claim 90 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       92. The device of  claim 83 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       93. The device of  claim 83 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       94. A method comprising:
 receiving information regarding one or more of a root sequence index or a cyclic shift increment; and   searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner, wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets of the first set, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets of the second set. 
   
     
     
       95. The method of  claim 94 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       96. The method of  claim 94 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       97. The method of  claim 94 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       98. The method of  claim 94 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       99. The method of  claim 94 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       100. The method of  claim 94 , further comprising:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       101. The method of  claim 94 , further comprising:
 using a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       102. The method of  claim 101 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       103. The method of  claim 94 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       104. The method of  claim 94 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       105. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing the method of  claim 94  when the program is run on the processing device. 
     
     
       106. The computer program product according to  claim 105 , wherein the program is directly loadable into the non-transitory computer-readable storage medium of the processing device. 
     
     
       107. A device comprising:
 a transmitter configured to transmit information regarding one or more of a root sequence index or a cyclic shift increment; and   a searching unit configured to search a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching unit is configured to start from the root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, include available cyclic shifts of the root sequence, and continue with a next root sequence if necessary for filling the set, wherein the searching unit is configured to interpret the ordered root sequences in a cyclic manner,   wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets of the first set, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets of the second set. 
   
     
     
       108. The device of  claim 107 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       109. The device of  claim 107 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       110. The device of  claim 107 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       111. The device of  claim 107 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       112. The device of  claim 107 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       113. The device of  claim 107 , further comprising:
 a receiver configured to receive a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       114. The device of  claim 113 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       115. The device of  claim 107 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       116. The device of  claim 107 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       117. A method comprising:
 transmitting information regarding one or more of a root sequence index or a cyclic shift increment; and   searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner, wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets of the first set, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets of the second set. 
   
     
     
       118. The method of  claim 117 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       119. The method of  claim 117 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       120. The method of  claim 117 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       121. The method of  claim 117 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       122. The method of  claim 117 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       123. The method of  claim 117 , further comprising:
 receiving a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       124. The method of  claim 123 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       125. The method of  claim 117 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       126. The method of  claim 117 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       127. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing the method of  claim 117  when the program is run on the processing device. 
     
     
       128. The computer program product according to  claim 127 , wherein the program is directly loadable into the non-transitory computer-readable storage medium of the processing device. 
     
     
       129. A device comprising:
 a processor; and   a computer-readable storage medium storing instructions thereon that, when executed by the processor, cause the device to perform at least:
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein said searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence, and 
 continuing with a next root sequence if necessary for filling the set; and 
 
 interpreting the ordered root sequences in a cyclic manner; 
 wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, 
 
   
       wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets of the first set, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets of the second set. 
     
     
       130. The device of  claim 129 , wherein, by interpretation of the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       131. The device of  claim 129 , wherein the first root sequence of the ordered root sequences is 1 and the last root sequence of the ordered root sequences is 838. 
     
     
       132. The device of  claim 129 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       133. The device of  claim 129 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       134. The device of  claim 129 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       135. The device of  claim 129 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       136. The device of  claim 129 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 using a sequence in the set of specific sequences for transmission of a preamble in a mobile communication system.   
     
     
       137. The device of  claim 136 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       138. The device of  claim 129 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 transmitting a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       139. The device of  claim 129 , wherein the instructions stored on the computer-readable storage medium, when executed by the processor, further cause the device to perform at least:
 receiving a preamble in a mobile communication system, wherein the preamble is based on a sequence in the set of specific sequences.   
     
     
       140. The device of  claim 139 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       141. The device of  claim 129 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       142. The device of  claim 129 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset. 
     
     
       143. A computer program product comprising a non-transitory computer-readable storage medium including a program for a processing device, comprising software code portions for performing:
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner, wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets. 
   
     
     
       144. A method comprising:
 searching a set of specific sequences, comprising a set of root sequences and cyclic shifts thereof, wherein the searching comprises:
 starting from a root sequence index indicating a root sequence of ordered root sequences between a first root sequence of the ordered root sequences and a last root sequence of the ordered root sequences, 
 including available cyclic shifts of the root sequence; and 
 continuing with a next root sequence if necessary for filling the set; and 
   interpreting the ordered root sequences in a cyclic manner, wherein the ordered root sequences are obtained by ordering sequences of a predetermined length and number in accordance with a cubic metric of each of the sequences and a size of a high mobility cell that each of the sequences supports, wherein the ordering comprises:
 dividing the sequences into a first set for which the cubic metric is below a predetermined threshold and a second set for which the cubic metric is above the predetermined threshold, 
 forming two or more subsets of the sequences in the first set and two or more subsets of the sequences in the second set according to the supported cell sizes, wherein the subsets are arranged such that supported cell sizes of the sequences either increase between subsets of the first set and decrease between subsets of the second set or decrease between subsets of the first set and increase between subsets of the second set, and 
 ordering the sequences in each subset according to the cubic metric, wherein each subset has a direction of ordering that reflects either an increasing cubic metric direction or a decreasing cubic metric direction, wherein a subset of the two or more subsets of the first set has a direction of ordering that is opposite that of adjacent subsets, and wherein a subset of the two or more subsets of the second set has a direction of ordering that is opposite that of adjacent subsets. 
   
     
     
       145. The method of  claim 144 , wherein, by interpreting the ordered root sequences in a cyclic manner, the first sequence of the ordered root sequences is considered to be consecutive to the last sequence of the ordered root sequences. 
     
     
       146. The method of  claim 144 , wherein the first root sequence of the set of root sequences is 1 and the last root sequence of the set of root sequences is 838. 
     
     
       147. The method of  claim 144 , wherein the root sequences are Zadoff-Chu sequences. 
     
     
       148. The method of  claim 144 , wherein the subsets are formed according to maximum supported cyclic shift increments of the sequences quantized to a predetermined set of values. 
     
     
       149. The method of  claim 144 , wherein the predetermined threshold is the cubic metric of Quadrature Phase Shift Keying modulation. 
     
     
       150. The method of  claim 144 , further comprising:
 receiving a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       151. The method of  claim 144 , further comprising:
 using a sequence in the set of specific sequences for transmission of a preamble in a random access procedure of a mobile communication system.   
     
     
       152. The method of  claim 151 , wherein the mobile communication system is an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network. 
     
     
       153. The method of  claim 144 , further comprising:
 transmitting a mobility parameter indicating whether the ordering uses a sequence restriction scheme, wherein one or more restrictions of the sequence restriction scheme define the maximum supportable size of a high mobility cell for each root sequence.   
     
     
       154. The method of  claim 144 , wherein a supported size of a high mobility cell supported by the first sequence of the ordered root sequences and a supported size of a high mobility cell supported by the last sequence of the ordered root sequences are similar such that, in an instance in which the next root sequence includes the first sequence of the ordered root sequences, the consecutive root sequences support a same size of a high mobility cell. 
     
     
       155. The method of  claim 144 , wherein a cubic metric of a last sequence of the ordered sequences in the first set has a cubic metric value which is highest in its subset, and a cubic metric of a first sequence of the ordered sequences in the second set has a cubic metric value which is lowest in its subset.

Join the waitlist — get patent alerts

Track USRE50185E — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.