Random access preamble structure in extended cells environment

US9450796B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9450796-B2
Application numberUS-52312508-A
CountryUS
Kind codeB2
Filing dateJan 4, 2008
Priority dateJan 4, 2007
Publication dateSep 20, 2016
Grant dateSep 20, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

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.

First claim

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.

Assignees

Inventors

Classifications

  • 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

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9450796B2 cover?
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…
Who is the assignee on this patent?
Lee Moon-Sik, Jwa Hye-Kyung, Yi Hyoseok, and 4 more
What technology area does this patent fall under?
Primary CPC classification H04L27/2607. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Sep 20 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).