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

Mapping method of physical accidental access channel

A technology of physical random access and mapping method, which is applied in the communication between multiple stations, radio/induction link selection arrangement, selection device and other directions, which can solve problems such as uneven distribution of PRACH time.

Inactive Publication Date: 2008-08-27
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 physical random access channel mapping method to solve the problem of uneven time distribution of PRACH processed 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
  • Mapping method of physical accidental access channel
  • Mapping method of physical accidental access channel
  • Mapping method of physical accidental access channel

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0192] Assume that the density of PRACH is D (D=0.5, 1, 2, 3, 5, 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 that can be accommodated in the time domain within a half frame is N RA HF (i).

[0193] ●PRACH number: When numbering, first increment the density index, and then increment the version number, that is

[0194] in r ∈ [0, R-1];

[0195] ●Time Domain Mapping

[0196] Radio Frame Mapping

[0197] When D=0.5 PRACH / 10ms

[0198] N ind RA (or r) even-numbered PRACHs are mapped to even-numbered radio frames, and odd-numbered PRACHs are mapped to odd-numbered radio frames;

[0199] When D>0.5 PRACH / 10ms

[0200] All PRACHs ...

Embodiment 2

[0226] Assume that the density of PRACH is D (D=0.5, 1, 2, 3, 5, 10 PRACH / 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 that can be accommodated in the time domain within a half frame is N RA HF (i).

[0227] ●PRACH number: When numbering, first increment the density index, and then increment the version number, that is

[0228] in r ∈ [0, R-1];

[0229] ●Time Domain Mapping

[0230] Radio Frame Mapping

[0231] When D=0.5 PRACH / 10ms

[0232] N ind RA (or r) even-numbered PRACHs are mapped to even-numbered radio frames, and odd-numbered PRACHs are mapped to odd-numbered radio frames;

[0233] When D>0.5 PRACH / 10ms

[0234] All PRACHs...

Embodiment 3

[0258] Assume that the density of PRACH is D (D=0.5, 1, 2, 3, 5, 10 PRACH / 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 that can be accommodated in the time domain within a half frame is N RA HF (i).

[0259] ●PRACH number: When numbering, first increment the version number, and then increment the density index, that is

[0260] N ind RA = dR + r , in r ∈ [0, R-1];

[0261] ●Time Domain Mapping

[0262] Radio Frame Mapping

[0263] When D=0.5 PRACH / 10ms

[0264] N ind RA (or r) even-numbered PRACHs are mapped to even-numbered radio fr...

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 mapping method for the physical random access channel. The mapping method includes the steps as follows: the density and the version number of the physical random access channel are obtained; the density index is constructed according to the density; the version number is obtained; the density index and the version number are used for constructing the serial number of the physical random access channel. The mapping method for the physical random access channel can make the PRACH needed to be processed by one base station be distributed evenly in time; meanwhile, the inner-cell interference of the second class PRACH is reduced to the maximum extent.

Description

technical field [0001] The present invention relates to the field of communications, in particular to a method for mapping physical random access channels. Background technique [0002] The frame structure of LTE system TDD (Time Division Duplex, time division duplex) mode is as follows figure 1 shown. 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 DwP...

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
IPC IPC(8): H04B7/26H04Q7/38
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