Base station supporting dynamic spectrum sharing between heterogeneous networks and wireless communication system including the same
US-2024373244-A1 · Nov 7, 2024 · US
US9450796B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9450796-B2 |
| Application number | US-52312508-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 4, 2008 |
| Priority date | Jan 4, 2007 |
| Publication date | Sep 20, 2016 |
| Grant date | Sep 20, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Provided is a method of forming a random access preamble structure for an extended cell radius in a cellular system, the method including: generating a cyclic prefix (CP), which is the sum of a maximum delay spread and the maximum round trip delay according to the extended cell; generating a preamble sequence part. The method is used to form a preamble structure for an extended cell radius from among random access preamble structures transmitted when initial synchronization is achieved, when synchronization is lost, or when a handover is performed, during a random access process of the cellular system.
Opening claim text (preview).
The invention claimed is: 1. A method of forming a random access preamble in a cellular system, the method comprising: receiving preamble generation information from a base station; determining a cyclic prefix among a plurality of cyclic prefixes having different lengths based on the preamble generation information, wherein a length of the cyclic prefix is given as a product of a second predetermined length and a second integer, and the second integer is determined by the preamble generation information, wherein the cyclic prefix has a length that ranges from about 202 μs to about 684 μs; determining a preamble sequence part among a plurality of preamble sequence parts having different lengths based on the preamble generation information, wherein a length of the preamble sequence part is given as a product of a first predetermined length and a first integer, wherein the first integer is determined by the preamble generation information, and wherein the preamble sequence part has a length that is selected from among 24576×Ts, 2×24576×Ts, and 3×24576×Ts, and Ts is a sampling time; and generating a random access preamble by combining the determined cyclic prefix and the determined preamble sequence part. 2. The method of claim 1 , wherein the length of the cyclic prefix is determined by a sum of a maximum delay spread and a maximum round trip delay. 3. A method of forming a random access preamble in a cellular system, the method comprising: receiving preamble generation information from a base station; generating a cyclic prefix based on the preamble generation information, wherein a length of the cyclic prefix is given as a product of a second predetermined length and a second integer, and the second integer is determined by the preamble generation information, wherein the cyclic prefix has a length that ranges from about 202 μs to about 684 μs; generating a preamble sequence part having a length that is given as a product of a first predetermined length and a first integer, wherein the first integer is determined by the preamble generation information, and wherein the preamble sequence part has a length that is selected from among 24576×Ts, 2×24576×Ts, and 3×24576×Ts, and Ts is a sampling time; and generating a random access preamble by combining the determined cyclic prefix and the determined preamble sequence part. 4. The method of claim 3 , wherein the preamble generation information determines a cyclic prefix among a plurality of cyclic prefixes having different lengths and a preamble sequence part among a plurality of preamble sequence parts having different lengths. 5. The method of claim 3 , wherein the length of the cyclic prefix is determined by a sum of a maximum delay spread and a maximum round trip delay. 6. An apparatus for generating a random access preamble, the apparatus comprising: a cyclic prefix generator configured to determine a cyclic prefix among a plurality of cyclic prefixes having different lengths based on preamble generation information, wherein a length of the cyclic prefix is given as a product of a second predetermined length and a second integer, and the second integer is determined by the preamble generation information, wherein the cyclic prefix has a length that ranges from about 202 μs to about 684 μs; a preamble sequence part generator configured to determine a preamble sequence part among a plurality of preamble sequence parts having different lengths based on the preamble generation information, wherein a length of the preamble sequence part is given as a product of a first predetermined length and a first integer, wherein the first integer is determined by the preamble generation information, and wherein the preamble sequence part has a length that is selected from among 24576×Ts, 2×24576×Ts, and 3×24576×Ts, and Ts is a sampling time; and a random access preamble generator configured to generate a random access preamble by combining the determined cyclic prefix and the determined preamble sequence part, wherein the preamble generation information is provided by a base station. 7. The apparatus of claim 6 , wherein the length of the cyclic prefix is determined by a sum of a maximum delay spread and a maximum round trip delay. 8. An apparatus for generating a random access preamble, the apparatus comprising: a cyclic prefix generator configured to generate a cyclic prefix based on preamble generation information, wherein a length of the cyclic prefix is given as a product of a second predetermined length and a second integer, and the second integer is determined by the preamble generation information, wherein the cyclic prefix has a length that ranges from about 202 μs to about 684 μs; a preamble sequence part generator configured to generate a preamble sequence part having a length that is given as a product of a first predetermined length and a first integer, wherein the first integer is determined by the preamble generation information, and wherein the preamble sequence part has a length that is selected from among 24576×Ts, 2×24576×Ts, and 3×24576×Ts, and Ts is a sampling time; and a random access preamble generator configured to generate a random access preamble by combining the determined cyclic prefix and the determined preamble sequence part, wherein the preamble generation information is provided by a base station. 9. The apparatus of claim 8 , wherein the preamble generation information determines a cyclic prefix among a plurality of cyclic prefixes having different lengths and a preamble sequence part among a plurality of preamble sequence parts having different lengths. 10. The apparatus of claim 8 , wherein the length of the cyclic prefix is determined by a sum of a maximum delay spread and a maximum round trip delay.
Cyclic extensions · CPC title
Random access procedures, e.g. with 4-step access · CPC title
in the downlink, i.e. towards the terminal · CPC title
in the physical layer [OSI layer 1] · CPC title
in the uplink, i.e. towards network · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.