Check patentability & draft patents in minutes with Patsnap Eureka AI!

Method for mapping physical stochastic access channel

A physical random access and channel technology, applied in the field of communication, can solve the problem of uneven time distribution of PRACH

Inactive Publication Date: 2013-12-11
ZTE CORP
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] The present invention aims to provide a method for mapping physical random access channels to solve the problem of uneven time distribution of PRACH processing by the same base station in the prior art

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for mapping physical stochastic access channel
  • Method for mapping physical stochastic access channel
  • Method for mapping physical stochastic access channel

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0287] Suppose the density of PRACH is D (D can take 0.5, 1, 2, 3, 4, 5, 6 or 10PRACH / 10ms); the number of versions is R; the number is The index of the PRACH available in a certain cell in a random access period is d (which may be called the PRACH index or density index in the cell, ); the version number is r(r∈[0, R-1]); the number of transition points from downlink to uplink in a 10ms wireless frame is N SP ; The number of PRACHs in a certain format accommodated in the time domain within a half frame is

[0288] ●PRACH number: When numbering, first increment the density index, and then increment the version number, that is in r=0,1,...,R-1;

[0289] ●Time Domain Mapping

[0290] Radio Frame Mapping

[0291] When D=0.5PRACH / 10ms

[0292] (or r) even-numbered PRACHs are mapped to even-numbered radio frames, and odd-numbered PRACHs are mapped to odd-numbered radio frames;

[0293] When D>0.5PRACH / 10ms

[0294] All PRACHs are mapped to each radio frame. ...

Embodiment 2

[0335] Suppose the density of PRACH is D (D can take 0.5, 1, 2, 3, 4, 5, 6 or 10PRACH / 10ms); the number of versions is R; the number is The index of the PRACH available in a certain cell in a random access period is d (which may be called the PRACH index or density index in the cell, ); the version number is r(r∈[0, R-1]); the number of transition points from downlink to uplink in a 10ms wireless frame is N SP ; The number of PRACHs in a certain format accommodated in the time domain within a half frame is

[0336] ●PRACH number: When numbering, first increment the density index, and then increment the version number, that is in r=0, 1, . . . , R-1.

[0337] ●Time Domain Mapping

[0338] Radio Frame Mapping

[0339] When D=0.5PRACH / 10ms

[0340] (or r) even-numbered PRACHs are mapped to even-numbered radio frames, and odd-numbered PRACHs are mapped to odd-numbered radio frames;

[0341] When D>0.5PRACH / 10ms

[0342] All PRACHs are mapped to each radio fr...

Embodiment 3

[0393] Suppose the density of PRACH is D (D can take 0.5, 1, 2, 3, 4, 5, 6 or 10PRACH / 10ms); the number of versions is R; the number is The index of the PRACH available in a certain cell in a random access period is d (which may be called the PRACH index or density index in the cell, ); the version number is r(r∈[0, R-1]); the number of transition points from downlink to uplink in a 10ms wireless frame is N SP ; The number of PRACHs in a certain format accommodated in the time domain within a half frame is

[0394] PRACH number: When numbering, first increment the density index, and then increment the version number, that is in r=0, 1, . . . , R-1.

[0395] ●Time Domain Mapping

[0396] Radio Frame Mapping

[0397] When D=0.5PRACH / 10ms

[0398] (or r) even-numbered PRACHs are mapped to even-numbered radio frames, and odd-numbered PRACHs are mapped to odd-numbered radio frames;

[0399] When D>0.5PRACH / 10ms

[0400] All PRACHs are mapped to each radio fra...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a method for mapping a physical random access channel, which includes the following steps: obtaining the intensity and the amount of versions of the physical random access channel; constructing density indexes according to the density and constructing version numbers according to the amount of the versions; constructing the numbers of the physical random access channel by the density indexes and the version numbers, and increasing the density indexes and the version numbers sequentially; mapping all the physical random access channels into a time domain and / or a frequency domain sequentially according to the numbers. The method can ensure the time that PRACH needs to be processed by the same base station to be distributed uniformly and can maximally reduce the interference of the second class of PRACH among districts.

Description

technical field [0001] The present invention relates to the communication field, in particular to a method for mapping physical random access channels. Background technique [0002] The frame structure of the TDD (Time Division Duplex, Time Division Duplex) mode of the LTE system is shown in FIG. 1 . In this frame structure, a 10ms (307200Ts, 1ms=30720Ts) wireless frame is divided into two half-frames, each half-frame is 5ms long (153600Ts), including 8 common time slots with a length of 0.5ms, and three A special time slot, namely DwPTS (Downlink Pilot Time Slot, downlink pilot time slot), GP (Guard Period, guard interval) and UpPTS (Uplink Pilot Time Slot, uplink pilot time slot), and these three special time slots The sum of the lengths is 1ms (30720Ts). Subframe 1 always consists of three special time slots; when there are 2 downlink-to-uplink transition points within 10ms, subframe 6 consists of three special time slots; in other cases, subframe 6 only contains DwPTS ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04B7/26H04W28/00
Inventor 郝鹏喻斌夏树强梁春丽戴博
Owner ZTE CORP
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com