Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W72/00—Local resource management
  • H04W72/04—Wireless resource allocation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L27/00—Modulated-carrier systems
  • H04L27/26—Systems using multi-frequency codes
  • H04L27/2601—Multicarrier modulation systems
  • H04L27/2602—Signal structure
  • H04L27/261—Details of reference signals
  • H04L27/2613—Structure of the reference signals
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L27/00—Modulated-carrier systems
  • H04L27/26—Systems using multi-frequency codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W72/00—Local resource management
  • H04W72/50—Allocation or scheduling criteria for wireless resources
  • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W92/00—Interfaces specially adapted for wireless communication networks
  • H04W92/04—Interfaces between hierarchically different network devices
  • H04W92/10—Interfaces between hierarchically different network devices between terminal device and access point, i.e. wireless air interface
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L25/00—Baseband systems
  • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
  • H04L25/0202—Channel estimation
  • H04L25/022—Channel estimation of frequency response

Definitions

• the random access channel is intended to encompass a wider range of functionalities than in previous or current cellular networks, thus increasing its expected load.
• the random access signal through which the UE initiates the random access procedure, must reliably accommodate variable cell sizes, and provide the Node B with sufficient information to effectively prioritize resource requests. Also, because of its potentially non-synchronized nature, the random access signal must be designed to minimize interference with other UL orthogonal transmissions. Thus, a more efficient random access method is needed.
• an apparatus for transmitting a random access signal comprising a CAZAC root sequence selector coupled to a CAZAC root sequence generator, wherein the CAZAC root sequence generator generates at least one CAZAC root sequences, and wherein the CAZAC root sequence selector autonomously selects a preamble root sequence from the at least one CAZAC root sequences.
• Another illustrative embodiment may be a method of accessing a wireless network comprising transmitting a signal; said signal comprising a CAZAC sequence autonomously selected from a plurality of CAZAC sequences.
• Yet another illustrative embodiment of the present disclosure may be a method for allocating up-link resources comprising: receiving a signal comprising at least one of CAZAC sequence selected from a plural of CAZAC sequences and a wide-band pilot signal, analyzing said signal to estimate the frequency response of the up-link transmission channel, and allocating up-link resources based on said frequency response estimation.
• FIG. 1 shows an illustrative telecommunications network.
• FIG. 2 shows an illustrative up-link time/frequency allocation.
• FIG. 3 shows illustrative 1 and 2 sub-frame random access signals.
• FIG .4 shows a first illustrative embodiment of a random access signal transmitter.
• FIG. 5 shows a second illustrative embodiment of a random access signal transmitter.
• FIG. 6 shows a third illustrative embodiment of a random access signal transmitter.
• FIG. 7 shows an illustrative non-synchronous random access signal receiver.
• FIG. 8 shows a flow diagram of an illustrative random access preamble signal length adjustment and transmission method.
• FIG. 9 shows a flow diagram of an illustrative alternative random access preamble signal length adjustment and transmission method.
• FIG. 10 shows an illustrative conventional random access procedure signal flow diagram.
• FIG. 11 shows an alternative illustrative conventional random access procedure signal flow diagram.
• FIG. 12 shows an illustrative hybrid random access procedure signal flow diagram.
• FIG. 13 shows a flow diagram of an illustrative random access collision handling method.
• FIG. 14 illustrates the orthogonality principle employed in Orthogonal Frequency Division Multiplexed systems.
• FIG. 15 shows the misalignment between random access preamble signal and scheduled data OFDM symbols.
• FIG. 16 shows alternative illustrative 1 and 2 sub-frame random access signals.
• the drawings show illustrative embodiments that will be described in detail. However, the description and accompanying drawings are not intended to limit the claimed present disclosure to the illustrative embodiments, but to the contrary, the intention is to disclose and protect all modifications, equivalents, and alternatives falling within the spirit and scope of the appended claims.
• the disclosed apparatus and methods include: Apparatus for transmitting and receiving random access signals.
• a method of optimizing the number of recognizable random access attempts for a given time frequency radio resource A method of minimizing interference between random and scheduled accesses;
• Embodiments of the present disclosure are directed, in general, to wireless communication systems, and can be applied to generate random access transmissions.
• Random access transmission denotes a transmission by the mobile terminal, of at least one signal, from a plurality of pre-defined signals. The plurality of pre-defined signals is specified by the random access structure.
• Mobile terminal may also be referred to as the User Equipment ("UE"), and in general, may be a fixed or portable wireless device, a cellular phone, a personal digital assistant, a wireless modem card, and so on.
• Random access transmissions may also be referred to as ranging transmissions, or other analogous terms.
• User Equipment may be either up-link ("UL") synchronized or UL non-synchronized.
• UL up-link
• the UE can perform a non-synchronized random access to request allocation of up-link resources.
• a UE can perform non-synchronized random access to register itself at the access point, or for numerous other reasons. Possible uses of random access transmission are many, and do not restrict the scope of the present disclosure.
• the non-synchronized random access allows the access point ("Node B") to estimate, and if necessary, to adjust the UE's transmission timing, as well as to allocate resources for the UE's subsequent up-link transmission.
• a Node B is generally a fixed station and may be called a base transceiver system (BTS), an access point, a base station, or various other names.
• BTS base transceiver system
• FIG. 1 shows an exemplary wireless telecommunications network 100.
• the illustrative telecommunications network includes base stations 101, 102, and 103, though in operation, a telecommunications network necessarily includes many more base stations. Each of base stations
• each base station's coverage area is further divided into cells. In the illustrated network, each base station's coverage area is divided into three cells.
• Handset or other UE 109 is shown in Cell A 108, which is within coverage area 104 of base station 101. Base station 101 is transmitting to and receiving transmissions from UE 109. As UE 109 moves out of Cell A 108, and into. Cell B 107, UE 109 may be handed over to base station 102. Because UE 109 is synchronized with base station 101, UE 109 can employ non-synchronized random access to initiate handover to base station 102.
• Non-synchronized UE 109 also employs non-synchronous random access to request allocation of up-link 111 time or frequency or code resources. If UE 109 has data ready for transmission, for example, traffic data, measurements report, tracking area update, etc., UE 109 can transmit a random access signal on up-link 111. The random access signal notifies base station 101 that UE 109 requires up-link resources to transmit the UE's data. Base station 101 responds by transmitting to UE 109, via down-link 110, a message containing the parameters of the resources allocated for UE 109 uprlink transmission along with a possible timing error correction. After receiving the resource allocation and a possible timing advance message transmitted on down-link 110 by base station 101 , UE 109 (possibly) adjusts its transmit timing and transmits the data on uplink 111 employing the allotted resources during the prescribed time interval.
• FIG. 2 illustrates an exemplary up-link transmission frame 202, and the allocation of the frame to scheduled and random access channels.
• the illustrative up-link transmission frame 202 comprises a plurality of transmission sub-frames.
• Sub-frames 203 are reserved for scheduled UE up-link transmissions.
• Interspersed among scheduled sub-frames 203, are time and frequency resources allocated to random access channels 201.
• a single sub-frame supports two random access channels. Note that the illustrated number and spacing of random access channels is purely a matter of convenience; a particular transmission frame implementation may allocate more or less resource to random access channels. Including multiple random access channels allows multiple UEs to simultaneously transmit a random access burst without collision.
• FIG. 3 illustrates one embodiment of a random access signal.
• Random access signal 301 occupies a single sub-frame 308, while random access signal 31 1 occupies two sub-frames.
• duration 302 is included prior to transmission of random access preamble signal 304 to prevent interference between random access preamble signal 304 and any transmission on the random access preamble signal frequency bands during the previous sub-frame.
• the duration 302 may or may not be realized as a cyclic prefix ("CP") attached at the preamble start to allow simplified frequency-domain receiver implementation.
• Random access preamble signal 304 follows duration 302. Random access preamble signal 304 is designed to maximize the probability of preamble detection by the Node B and to minimize the probability of false preamble detections by the Node B, while maximizing the total number of resource opportunities.
• Embodiments of the present disclosure utilize constant amplitude zero autocorrelation (“CAZAC”) sequences to generate the random access preamble signal.
• CAZAC sequences are complex— valued sequences with following two properties: 1 ) constant amplitude (CA), and 2) zero cyclic autocorrelation (ZAC).
• Well - known examples of CAZAC sequences include (but are not limited to): Chu Sequences, Frank-Zadoff Sequences, Zadoff — Chu (ZC) Sequences, and Generalized Chirp-Like (GCL) Sequences.
• M (k) expO2 ⁇ (WN) [k(k + 1 )/2 + qk]] for N odd
• M (k) expO2 ⁇ (WN) [k(k + 1 )/2 +
• a UE constructs random access preamble signal (304 or 314), by selecting a CAZAC sequence, possibly applying a combination of the described modifications to the selected CAZAC sequence, modulating the modified sequence, and transmitting the resulting random access signal over the air.
• a UE autonomously selects (or can be allocated) at least one random access preamble signal (304 or 314) from the pre-defined set of random access preamble signals. Subsequently, UE transmits the selected signal over the air. Node B searches within the finite pre-defined set of random access signals, and is therefore able to detect an occurrence of a random access transmission by the UE.
• One method of pre-defining the set of random access preamble signals is to allow a selection of modifications to a fixed root CAZAC sequence, such as a ZC CAZAC sequence.
• distinct random access preamble signals are constructed by applying distinct cyclic shifts when performing the modification of a root CAZAC sequence.
• UE autonomously selects the random preamble access signal by selecting a value for the cyclic shift.
• the selected value of the cyclic shift is applied during the process of modification of the root CAZAC sequence.
• the corresponding cyclically shifted sequence is [c(n) c(n+l) c(n+2) ... c(L-l ) c(0) c(l) ... c(n-l)], where V is the value of the cyclic shift.
• the set of possible cyclic shifts defines the set of allowed random access preamble signals.
• An alternate method of pre-defining the set of random access preamble signals is to permit a selection of applicable root CAZAC sequences, such as ZC sequences.
• distinct random access preamble signals are constructed by applying pre-defined common modifications to distinct root CAZAC sequences. Consequently, UE autonomously selects the random access preamble signal by selecting a distinct root CAZAC sequence, which UE then modifies to produce the random access preamble signal.
• the set of allowed root CAZAC sequences also defines the set of allowed random access preamble signals.
• the set of allowed random access preamble signals is defined by two other sets: 1) a set of allowed root CAZAC sequences, and 2) a set of allowed modifications to a given root CAZAC sequence.
• random access preamble signal is constructed by first selecting the root ZC CAZAC sequence, and second, by .selecting the value of the cyclic shift. Selections can be performed autonomously by the UE, and the UE applies the selected value of the cyclic shift during the process of modification of the selected root ZC CAZAC sequence.
• FIG 4 is a block diagram showing an apparatus in accordance with an embodiment of the present disclosure.
• Apparatus 400 comprises ZC Root Sequence Selector 401, Cyclic Shift Selector 402, Repeat Selector 403, ZC Root Sequence Generator 404, Cyclic Shifter 405, DFT in 406, Tone Map 407, other signals or zero-padding in 411, IDFT in 408, Repeater in 409, optional repeated samples 412, Add CP in 410, and the random access signal in 413.
• Elements of the apparatus may be implemented as components in a fixed or programmable processor.
• the IDFT block in 408 may be implemented using an Inverse Fast Fourier Transform (IFFT), and the DFT block in 406 may be implemented using a Fast Fourier Transform (FFT).
• Apparatus 400 is used to select and perform the random access preamble signal transmission as follows. The UE performs selection of the ZC CAZAC root sequence using the ZC Root Sequence Selector 401 and the selection of the cyclic shift value using the Cyclic Shift Selector 402. Next, UE generates the ZC sequence using the ZC Root Sequence Selector 404. Then, if necessary, the UE performs cyclic shifting of the selected ZC sequence using the Cyclic Shifter 405.
• IFFT Inverse Fast Fourier Transform
• FFT Fast Fourier Transform
• the UE performs DFT (Discrete Fourier Transform) of the cyclically shifted ZC sequence in DFT 406.
• the result of the DFT operation is mapped onto designated set of tones (sub — carriers) using the Tone Map 407. Additional signals or zero — padding 411, may or may not be present.
• the UE next performs IDFT of the mapped signal using the IDFT 408.
• the size of the BDFT in 408 may optionally be larger than the size of DFT in 406.
• Block-Repetition of the IDFT-ed signal is optional, and performed using 409.
• the repeated signals 412 represent optional repeated samples. This repetition can be applied when the preamble transmission occupies two or more sub-frames.
• An optional cyclic prefix (CP) can be added using 410, to arrive at the random access signal 413.
• the random access signal 413 is transmitted over the air.
• CP cyclic prefix
• FIG 5 is a block diagram showing an apparatus in accordance with an alternative embodiment of the present disclosure.
• Apparatus 500 comprises ZC Root Sequence Selector 501, Cyclic Shift Selector 502, Repeat Selector 503, ZC Root Sequence Generator 504, Cyclic Shifter 505, DFT in 506, Tone Map 507, other signals or zero-padding in 511, IDFT in 508, Repeater in 509, optional repeated samples 512, Add CP in 510, and the random access signal in 513.
• Elements of the apparatus may be implemented as components in a fixed or programmable processor.
• the IDFT block in 508 may be implemented using an Inverse Fast Fourier Transform (IFFT), and the DFT block in 506 may be implemented using a Fast Fourier Transform (FFT).
• Apparatus 500 is used to select and perform the random access preamble signal transmission as follows. The UE performs selection of the ZC CAZAC root sequence using the ZC Root Sequence Selector 501 and the selection of the cyclic shift value using the Cycle Shift Selector 502. Then, UE generates the ZC sequence using the ZC Root Sequence Generator 504. The selected ZC sequence is transformed using DFT in 506. The result of the DFT operation is then mapped onto designated set of tones (sub — carriers) using the Tone Map 507.
• IFFT Inverse Fast Fourier Transform
• FFT Fast Fourier Transform
• Additional signals or zero - padding 511 may or may not be present.
• the UE then performs IDFT of the mapped signal using 508.
• the Cyclic Shifter 505 the selected value of lhe cyclic shift is applied to the IDFT-ed signal.
• the value of the cyclic shift is obtained from the Cyclic Shift Selector 502.
• Block-Repetition of the cyclically shifted IDFT-ed signal is optional, and performed using the Repeater 509.
• 512 represents optional repeated samples. This repetition can be applied when the preamble transmission occupies two or more sub-frames.
• An optional cyclic prefix (CP) can then be added using 510 to arrive at the random access signal 513.
• the random access signal 513 is transmitted over the air.
• FIG 6 is a block diagram showing an apparatus in accordance with a third embodiment of the present disclosure.
• Apparatus 600 comprises ZC Root Sequence Selector 601, Cyclic Shift Selector 602, Repeat Selector 603, ZC Root Sequence Generator 604, Cyclic Shifter 605, Tone Map 607, other signals or zero-padding in 611, DOFT in 608, Repeater in 609, optional repeated 5 samples 612, Add CP in 610, and the random access signal in 613.
• Elements of the apparatus may be implemented as components in a fixed or programmable processor.
• the IDFT block in 608 may be implemented using an Inverse Fast Fourier Transform (IFFT).
• Apparatus is 600 used to select and perform the random access preamble signal transmission as follows. The UE performs selection of the ZC CAZAC root sequence using ZC Root Sequence
• the value of the cyclic shift is obtained from the Cyclic Shift Selector 602.
• Block- Repetition of the cyclically shifted IDFT-ed signal is optional, and performed using 609.
• 612 represents optional repeated samples. This repetition can be applied when the preamble transmission occupies two or more sub-frames.
• An optional cyclic prefix (CP) can then be added using 610, to arrive at the random access signal 613.
• the random access signal 613 is then be
• the set of allowed cyclic shifts can be dimensioned in accordance with the physical limitations of the cell, which include cells maximum round trip delay plus the delay spread of the channel.
• a single root ZC CAZAC sequence may be cyclically shifted by any integer multiple of the cell's maximum round trip delay
• the maximum round trip delay plus the delay spread of the channel calls for conversion to the sampling unit of the sequence.
• possible choices for cyclic shift values can be dimensioned as n from ⁇ 0, x, 2x, ..., (u- 1 )x ⁇ where ux can't exceed the length of the sequence which is being cyclically shifted.
• the round-trip delay is ;the delay of the earlier radio path.
• a typical earlier path is the line-of-sight path, defined as the direct (straight-line) radio path between the UE and the base station.
• delay spread the time period over which these copies are delayed.
• these additional root ZC CAZAC sequences provide good inter-cell interference mitigation.
• a scenario where adjacent cells use identical root sequences should be avoided. This can be achieved through a number of possible techniques, including but not limited to: cellular system planning, sequence hopping, or a combination thereof.
• the set of allowed random access preamble signals is made known to the UB prior to the random access transmission. This can be achieved in a number of different ways, including hardwiring this information in the UE.
• the preferred approach is for the Node B to broadcast information which allows the UE to infer the set of allowed random access preamble signals. For example, the Node B can broadcast: 1) which root CAZAC sequences are permitted, and 2) which values of the "cyclic - shift" are permitted.
• the UE reads the broadcasted information, infers the allowed set of random access preamble signals, selects at least one signal from the set, and performs the random access transmission.
• the selection of the random access preamble signal amounts to the selection of the root ZC CAZAC sequence, the selection of the value of the cyclic shift, and possibly the selection of the frequency bin (in case multiple bins are configured per random access time slot).
• additional broadcasted information may be added, such as whether or not the UE needs to perform signal repetition.
• this approach based on broadcasting the added information, is preferred, in that the approach allows for optimizing the cellular network based on physical limitations, such as the cell — size. Any given UE is then flexible enough to be used in all types of cells, and system optimization is performed by the cell design.
• Sequences obtained from cyclic shifts of a single CAZAC root sequence are orthogonal to one another if the cyclic shift value is larger than the maximum time uncertainty of the received signal, including the delay spread and the spill-over.
• the cyclic shifts create zones with zero correlation between distinct random access preamble signals.
• a cyclically shifted sequence can be observed without any interference from sequences created using different cyclic shifts.
• Sequences obtained from cyclic shifts of different Zadoff-Chu (ZC) sequences are not orthogonal, but have optimal cross-correlation as long as the sequence length is a prime number. Therefore, in various embodiments, orthogonal sequences are preferred over non- orthogonal sequences.
• Zadoff-Chu (ZC) root sequences may be used when the required number of sequences cannot be generated by cyclic shifts of a single root sequence.
• cyclic shift dimensioning is of primary importance in the random access sequence design.
• the cyclic shift value is dimensioned to account for the maximum time uncertainty in random access preamble reception. This time uncertainty reflects the Node B-UE-Node B signal propagation delay ("round-trip time") plus the delay spread.
• round-trip time the delay spread.
• delay spread can be assumed to be constant, signal round-trip time depends on the cell size.
• the larger the cell the larger the cyclic shift used to generate orthogonal sequences, and correspondingly, the larger the number of Zadoff-Chu (ZC) root sequences used to provide the required number of sequences.
• Table 1 provides an example of random access preamble sequence design for different cell sizes. Table 1 illustrates how the number of root ZC CAZAC sequences increases from 1 to 8, when the cell size is increased from 0.8 km (Cell Scenario 1) to 14 km (Cell Scenario 4). Table 1 is derived using following parameters: Maximum delay spread is 5 ⁇ sec, root ZC CAZAC sequence length is 863 samples, preamble sampling rate is 1.07875 MHz, and spill-over guard period is 2 samples. Because the expected inter-cell interference and load (user density) increases as cell size decreases, smaller cells call for more protection from co-preamble interference than larger cells.
• the relationship between cell size and the required number of Zadoff-Chu (ZC) root sequences allows for system optimization, and the Node B should configure the primitive cyclic shift to be used in each cell independently.
• the set of cyclic shifts values to be used is then built as integral multiples of the primitive cyclic shift value.
• the system can be optimized either by configuring the primitive cyclic shift value, or by configuring the number of different root Zadoff-Chu (ZC) sequences to be used in a cell.
• This configurability advantageously provides a constant number of distinct random access preamble signals irrespective of the cell size, which simplifies the specification of the Medium Access Control (MAC) procedure.
• MAC Medium Access Control
• FIG. 7 shows an embodiment of a random access signal receiver.
• This receiver advantageously makes use of the time " and frequency domain transforming components used to map and de-map data blocks in the up-link sub-frame.
• the received random access signal 701 comprising cyclic prefix and random access preamble signal, is input to cyclic prefix removal component 702 which strips cyclic prefix from the random access signal producing signal 703.
• Frequency domain transforming component DFT 704 couples to cyclic prefix removal component 702.
• Frequency domain transforming component 704 converts signal 703 into sub-carrier mapped frequency tones 705.
• Sub-carrier de-mapping component 706 is coupled to frequency domain transforming component 704.
• Sub-carrier de-mapping component 706 de-maps sub-carrier mapped frequency tones 705 to produce useful frequency tones 707.
• Product component 711 is coupled to both sub-carrier de-mapping component 707 and frequency domain transforming component 709.
• Frequency domain transforming component (DFT) 709 converts a preamble root sequence 710, such as a prime length Zadoff-Chu sequence, into a corresponding set of pilot frequency tones 708.
• Complex conjugation of pilot frequency tones 708 is performed using 721, to produce samples 720.
• Product component 711 computes a tone by tone complex multiplication of received frequency tones 707 with samples 720 to produce a set of frequency tones 712.
• Time domain transforming component (IDFT) 713 is coupled to product component 711.
• Time domain transforming component 713 converts multiplied frequency tones 712 into correlated time signal 714.
• Correlated lime signal 714 contains concatenated power delay profiles of the cyclic shift replicas of the preamble root sequence 710.
• Energy detection block 715 is coupled to time domain transforming block 713.
• Energy detection block 715 identifies received preamble sequences by detecting the time of peak correlation between received random access signal 701 and preamble root sequence 710.
• frequency domain transforming component 709 is called for when using the transmitters illustrated in FIG. 4, or FIG. 5. When using the transmitter of FIG. 6, frequency domain transforming component 709 may be omitted.
• a prime length preamble sequence is recommended for use with the up-link transmitter system.
• N p sub-carriers are allocated to the random access channel, and the preamble was shortened to the nearest lower prime number of samples (N p ), there are unused sub-carriers that may be zeroed and distributed outside the preamble sub-carriers to isolate the preamble from the surrounding frequency bands.
• FIG. 8 shows a flow diagram of an illustrative method for adapting a prime length sequence for use with an up-link transmitter.
• a preamble duration T p is selected.
• T p is an integer multiple of the up-link sub-frame data block duration.
• the reference length derived in 804 is shortened to the nearest lower prime number of samples, N p , to derive the preamble sequence length.
• the N p -length sequence is generated.
• the N p time samples are converted into N p frequency tones.
• the N p frequency tones are mapped onto the allocated random access channel sub-carriers in 810. Because N p j sub-carriers are allocated to the random access channel, and the preamble sequence length was shortened to N p samples resulting in only N p frequency tones to be mapped onto the sub-carriers, N p j - N p sub- carriers remain unused. In 812, the unused sub-carriers are zeroed and distributed around the preamble sub-carriers to provide isolation from adjacent frequency bands. These unused sub- carriers can be potentially re-used for cubic metric reduction through either cyclic extension or tone reservation.
• FIG. 9 shows a flow diagram of an alternative method of generating a prime length sequence for use with an up-link transmitter.
• the preamble sequence is deterministic, prime length preamble sequences can be predefined and stored for later use.
• the prime length preamble sequences are generated and converted into frequency domain preamble samples.
• the frequency domain preamble samples are stored in a storage device to be retrieved as needed.
• a random access signal transmission is initiated, and a preamble duration is selected. The selected duration is an integer multiple of up-link sub- carrier data block duration, and is chosen to meet system coverage needs.
• a stored preamble sequence is selected.
• the selected sequence preferably is the sequence having the prime number of samples immediately lower than the number of samples computed from the duration selected in 906 and random access signal bandwidth.
• the preamble frequency samples are read from the storage device and mapped onto the sub-carriers allocated to the random access channel. Because more sub-carriers are allocated to the random access channel than there are preamble frequency samples, unused sub-carriers are zeroed and distributed around the preamble sub-carriers to provide isolation from adjacent frequency bands. This alternate implementation allows omission of the frequency domain transforming component 402 from the random access preamble transmitter.
• the preamble samples are frequency domain transformed only once, prior to storage, and therefore the transform process is not concerned with the latency requirements of the random access preamble transmitter, and can be implemented in a simpler and less costly manner.
• frequency domain transforming component 406 can be totally eliminated if the preamble root sequence is configured directly in frequency representation by the Node B.
• the preamble sequence is defined to be a Cyclic Shifted Zadoff-Chu sequence, the cyclic shift is " implemented. The cyclic shift may be performed at the system sampling rate before cyclic prefix insertion 410.
• FIG. 14 illustrates the principle of orthogonal multiplexing in Orthogonal Frequency Division Multiplexed ("OFDM") systems.
• Each tone carries a modulated symbol according to a frequency overlapped time limited orthogonal structure.
• the frequency tones overlap with each other so that in the center of a tone, the spectral envelopes of the surrounding tones are null.
• This principle allows multiplexing of different transmissions in the same system bandwidth in an orthogonal manner. However, this only holds true if the sub-carrier spacing ⁇ f is kept constant, ⁇ f is equal to the inverse of the OFDM symbol duration T, used to generate the frequency tones by DFT.
• the preamble OFDM symbol is longer than the data OFDM symbol, the sub-carrier spacing of the preamble OFDM symbol will be shorter than the sub-carrier spacing of the data OFDM symbol.
• data and preamble OFDM symbols are neither aligned nor have the same durations (FIG. 15)
• strict orthogonality cannot be achieved.
• the following design rules are directed towards minimizing the co-interference between preamble and data OFDM symbols.
• fixing the preamble OFDM symbol duration to an integer multiple of the data symbol duration provides some commensurability between preamble and data sub-carriers, thus reducing interference these sub-carriers.
• the preamble sampling frequency should be an integer multiple of the data symbol sub-carrier spacing.
• the preamble In order to facilitate the frequency multiplexing of the random access preamble and the data transmission, the preamble preferably is allocated a integer number of resource blocks.
• random access preamble signal 304 allows base station 101 to analyze the frequency response of up-link 111, over a range of frequencies within the preamble bandwidth. Characterization of up-link 111 frequency response allows base station 101 to tailor the narrow band up-link 111 resources allocated to UE 109 within the preamble bandwidth to match up-link 111 frequency response, resulting in more efficient utilization of up-link resource.
• FIG. 16 shows an alternate embodiment of a random access signal, designed to address the situation in which the ratio between the random access preamble signal bandwidth and the first post-preamble up-link transmission is too small to adequately benefit from sounding the channel using only the random access preamble signal itself.
• Both a one sub-frame random access signal 1601 and a two sub-frame random access signal 1621 are illustrated.
• the addition of wide-band pilot signal 1610 to random access signal 1601 allows base station 101 to analyze the frequency response of up-link 111 over a wider range of frequencies than would be possible with the random access preamble signal alone.
• cyclic prefix 1608 follows random access preamble signal 1604.
• Cyclic prefix 1608 comprises a guard interval designed to eliminate interference between random access preamble signal 1604 and wide-band pilot signal 1610.
• Guard interval 1612 follows wide-band pilot signal 1610 to prevent interference between wide-band pilot signal 1610 and any transmission in the subsequent sub-frame on the same transmission frequencies used by wide-band pilot signal 1610.
• Random access signal 1621 occupies two sub-frames 1634. Random access signal 1621 is structurally similar to random access signal 1601, however, random access preamble signal 1624 is extended to occupy most of two sub-frames. Such extension can be accomplished either by repeating one sub-frame random access preamble signal 1604, or by extending the CAZAC sequence. Guard interval 1622 precedes random access preamble signal 1624, and cyclic prefix 1628. Wide-band pilot signal 1630 and guard interval 1632 follow random access preamble signal. 1624 to complete two sub-frame random access signal 1621.
• guard interval 306 follows random access preamble signal 304 to prevent interference between random access preamble signal 304 and any transmission in the subsequent sub-frame on the same transmission frequencies used by random access preamble signal 304.
• two sub-frame random access signal 311 begins with guard interval 312, which may comprise a cyclic prefix, to prevent inter-symbol interference between subsequent random access preamble signal 314 and any transmission in the previous sub-frame.
• Random access preamble signal 314 is extended into the second sub-frame. Such extension may be effectuated by concatenating multiple copies of one sub-frame random access preamble signal 304, or by generating random access preamble signal 314 as an extended CAZAC sequence, keeping the number of orthogonal CAZAC sequences obtained by cyclically shifting the root CAZAC sequence in an approximately constant manner.
• FIG. 10 and FIG. 11 illustrate two conventional approaches to transferring data during a random access.
• UE 1001 transmits random access signal 1003.
• Random access signal 1003 is extended to include information useful to the Node B 1002.
• Node B 1002 responds with timing information 1004 to adjust the up-link timing of UE 1001, and an up-link resource allocation 1005 that UE 1001 will use for subsequent uplink data transmission 1006.
• UE 1101 transmits a random access signal 1103 without additional information.
• Node B 1 102 responds with timing information and an up-link resource allocation 1104 to be used by the subsequent scheduling request 1105.
• UE 1101 transmits scheduling request 1105 using the allocated up-link resource, and
• Node B 1102 responds by transmitting an up-link resource allocation 1106.
• UE 1101 uses the allocated up-link resource for subsequent up-link data transmission 1107.
• the procedure of FIG- 10 exhibits lower latency than the procedure of FIG. 11.
• the information message included in burst 1003 may be several times longer than the preamble. Accordingly, the procedure of FIG. 10 results in higher overhead than the procedure of FIG. 11. Finally, when the higher efficiency of the scheduled channel relative to the contention channel is considered, the procedure of FIG. 11 may be preferable.
• FIG. 12 illustrates a novel embodiment of a random access procedure in which UE 1201 transmits a random access signal implicitly containing information relevant to Node B 1201 decision making.
• the information of 1201 is not explicitly conveyed as in the procedure of FIG. 10, but is encoded by selection of, for example, preamble sequence and transmission band. If, for example, UE 1201 encodes a 3 bit random access cause, a 2 bit DL CQI, and 1 random bit in the random access signal, this information might be encoded in any 2 s unique combinations of random access preamble signals. Additional combinations can be provided by allocating multiple frequency bands 201 to random access.
• Node B 1202 When “ Node B 1202 receives random access signal 1203, it employs the encoded information to, for example, determine the response to a resource request. The determined response may be based on down link channel quality, urgency of resource request, predefined up-link allocation based on random access cause, or other relevant criteria. Node B 1202 responds, if appropriate, to random access signal 1203 with timing information and a scheduling request resource allocation 1204. UE 1201 transmits scheduling request 1205 using the transmission resource allocated in message 1204. On receipt of scheduling request 1205, Node B 1202 transmits uplink resource allocation 1206, and UE 1201 makes subsequent data transmission 1207 via the allocated resource. In a further embodiment, the procedure of FIG.
• Encoding random access cause in the random access signal enables the implementation of selective access restrictions based on the cause of the random access.
• the Node B may accept UE's random access attempts related to handover or emergency calls, but reject random access attempts for initial access.
• This example illustrates a hard restriction, in which new users are rejected based on cell loading.
• soft restrictions allowing acceptance of new users based on link quality are also possible. Enabling selective access restrictions based on random access cause encoded in the random access signal allows implementation of fast and efficient load balancing at the physical layer, reducing the latency associated with load balancing implemented at higher layers.
• the random access procedure supports the following features: 1) the random access signal includes the random access cause, and 2) the Node B is adapted to refuse a UE's request through a non-acknowledgment (NACK) in the random access response.
• NACK non-acknowledgment
• the 2 6 combinations of random access preamble signals ("signatures"), used to encode information may be subdivided into groups of signatures serving uses having similar response priority or latency requirements.
• the 64 available signatures might be divided into 6 groups ("access types").
• the access types may be, for example, handover type 1, high priority UE connection, handover type 2, normal priority UE connection, out of sync recovery with up-link allocation request, and timing advance maintenance without up-link allocation request.
• Each access type represents a different access priority or urgency; and accordingly a corresponding latency requirement.
• Each access type may employ a different number of signatures, and access types requiring lower latency may be assigned a larger number of signatures.
• the number of signatures allocated to each access type may be dynamically configured within each cell to optimize access type signature diversity based on, for example, cell load.
• Additional information may be encoded within the signatures of an access type by selecting subgroups of signatures to represent the information values. For example, if 16 signatures are allocated to handover type 1, those signatures may be divided into two subgroups of 8 signatures each, each subgroup representing one state of one information bit.
• the 64 available signatures might be partitioned into 2 cause groups: the urgent causes (e.g., handover, new data to transmit in RRC_COJNNECTED state) and non urgent causes (e.g., initial access, tracking area update).
• a fair partitioning would consist of allocating to each group a number of signatures corresponding to the respective load of each group.
• an unfair partitioning might also be used to favor the urgent causes (more signatures) over the non-urgent causes (less signatures).
• the urgent causes might be further split into two sub-partitions to carry one bit, for example, radio link quality.
• the Node B takes advantage of this information when allocating the UL grant for the first UL transmission on the shared channel.
• a UE with an urgent cause in good radio link conditions can potentially send its complete random access request in one message, which further accelerates the procedure.
• Signature diversity is the principal means of avoiding collision. When collisions do occur, however, they cal for resolution. Collisions may be resolved, for example, by a combination of back-off procedures and signature space randomness. As indicated above, access types requiring lower latency should be assigned a larger number of signatures to reduce the likelihood of collisions when signatures are randomly selected. Additionally, the expected load of each access type is a consideration when allocating signatures to each access type. For example, reordering the list of six access types identified above by decreasing load may result in: handover type 1, out of sync recovery with up-link allocation request, timing advance maintenance without up-link allocation request, handover type 2, high priority UE connection, and normal priority UE connection.
• An allocation of signatures considering both latency and load might result in signature allocation as follows: handover type 1 — 16 signatures, timing advance maintenance without up-link allocation request — 16 signatures, out of sync recovery with up-link allocation request — 12 signatures, high priority UE connection — 8 signatures, handover type 2 — 8 signatures, and normal priority UE connection - 4 signatures.
• the associated signatures may be partially allocated for randomness and partially allocated non- contention use. " ;
• FIG. 13 is a flow diagram of an illustrative collision resolution method incorporating both back-off and randomness in the signature space.
• the unscheduled transmission procedure begins by zeroing a counter holding the number of collisions detected.
• a signature is randomly selected from the pool of available signatures in 1304.
• the next occurring random access time slot is identified, and the random access signal is transmitted in 1308.
• Node B detects a collision and transmits a NACK to the UE in 1310, or due to collision, Node B is unable to detect the random access signal and no response is received by the UE in 1312, then the collision counter is incremented in 1318, and if fewer than a predefined maximum number of collisions have been registered in 1320, transmission is restarted with random signature selection in 1304. If the random access signal transmitted in 1308 is not NACK' d by Node B in 1310 and a response including a resource allocation is received from Node B in 1312, then UE transmits its data on the allocated resource in 1314.
• the UE transmissions of 1314 will collide.
• the collision counter is incremented in 1318, and if fewer than a predefined maximum number of collisions have been registered in 1320, transmission is restarted with random signature selection in 1304.
• the back-off procedure is initiated in 1322.
• the predefined maximum number of collisions may be different for each access type.
• the back-off delay may also vary for each access type. In one embodiment, the back-off delay is a function of the number of previously unsuccessful attempts (Nu) such that the first attempt after back-off occurs in the next random access time slot with probability (2/3) Ml .
• a first embodiment of the disclosed present disclosure comprises an apparatus for transmitting a random access signal comprising: a CAZAC root sequence selector coupled to a CAZAC root sequence generator, wherein the CAZAC root sequence generator generates at least one CAZAC root sequence, and wherein the CAZAC root sequence selector selects a preamble root sequence from the at least one CAZAC root sequences.
• the CAZAC root sequence generator is a Zadoff-Chu sequence generator.
• the apparatus may further comprise a sequence modifier for modifying the preamble root sequence coupled to the CAZAC root sequence generator, and a sequence modification selector for selecting a preamble root sequence modification coupled to the sequence modifier.
• the sequence modifier is a cyclic shifter.
• the apparatus may further comprise a frequency transformer for transforming a modified preamble sequence into frequency tones coupled to the sequence modifier.
• the apparatus may further comprise a tone mapper for mapping frequency transformer output onto sub-carriers coupled to the frequency transformer.
• the apparatus may further comprise an inverse frequency transformer for transforming output of the tone mapper coupled to the tone mapper.
• the apparatus may further comprise a block repeater for replicating output of the inverse frequency transformer coupled to the inverse frequency transformer, and a block repeat selector for selecting block replication coupled to the block repeater.
• the apparatus may further comprise a cyclic prefix inserter for adding cyclic prefix to block repeater output coupled to the block repeater.
• a second embodiment of the disclosed present disclosure comprises an apparatus for transmitting a random access signal comprising: a CAZAC root sequence selector coupled to a CAZAC root sequence generator, wherein the CAZAC root sequence generator generates at least one CAZAC root sequence, and wherein the CAZAC root sequence selector selects a preamble root sequence from the at least one CAZAC root sequences.
• the apparatus may further comprise a tone mapper for mapping the preamble root sequence onto sub-carriers coupled to the CAZAC root generator.
• the apparatus may further comprise an inverse frequency transformer for transforming the output of the tone mapper coupled to the tone mapper.
• the apparatus may further comprise a sequence modifier for modifying the inverse frequency transformer output coupled to the inverse frequency transformer, and a sequence modification selector for selecting a sequence modification coupled to the sequence modifier.
• the sequence modifier may comprise a cyclic shifter.
• the apparatus may further comprise a block repeater for replicating the output of the sequence modifier coupled to the sequence modifier, and a block repeat selector for selecting block replication coupled to the block repeater.
• the apparatus may further comprise a cyclic prefix inserter for adding cyclic prefix to the block repeater output coupled to the block repeater.
• a third embodiment of the disclosed present disclosure comprises an apparatus for transmitting a random access signal comprising: a CAZAC root sequence selector coupled to a CAZAC root sequence generator, wherein the CAZAC root sequence generator generates at least one CAZAC root sequence, and wherein the CAZAC root sequence selector selects a preamble root sequence from the at least one CAZAC root sequences.
• the apparatus may further comprise a frequency transformer for transforming a modified preamble sequence into frequency tones coupled to the sequence modifier.
• the apparatus may further comprise a tone mapper for mapping the preamble root sequence onto sub-carriers coupled to the CAZAC root generator.
• the apparatus may further comprise an inverse frequency transformer for transforming the output of the tone mapper coupled to the tone mapper.
• the apparatus may further comprise a sequence modifier for modifying the inverse frequency transformer output coupled to the inverse frequency transformer, and a sequence modification selector for selecting a sequence modification coupled to the sequence modifier.
• the sequence modifier may comprise a cyclic shifter.
• the apparatus may further comprise a block repeater for replicating the output of the sequence modifier coupled to the sequence modifier, and a block repeat selector for selecting block replication coupled to the block repeater.
• the apparatus may further comprise a cyclic prefix inserter for adding cyclic prefix to the block repeater output coupled to the block repeater.
• an embodiment of the disclosed present disclosure comprises an apparatus for receiving a random access signal comprising: a frequency transformer for transforming a root CAZAC sequence into pilot tones coupled to a complex multiplier.
• the apparatus may further comprise a sub-carrier de-mapping component for de-mapping sub-carrier mapped frequency tones coupled to the complex multiplier.
• the apparatus may further comprise a frequency transformer for transforming random access signal into sub-carrier mapped frequency tones coupled to the sub-carrier demapper.
• the apparatus may further comprise a cyclic prefix remover for removing cyclic prefix from a random access signal coupled to the frequency transformer.
• the apparatus may further comprise an inverse frequency transformer for transforming complex multiplier output into time signal coupled to the complex multiplier.
• the apparatus may further comprise an energy detector for detecting the peak con-elation between the random access signal and the root CAZAC sequence coupled to the inverse frequency transformer.
• a first method of the disclosed present disclosure comprises a method of accessing a wireless network comprising: transmitting a signal; said signal comprising a CAZAC sequence selected from a plurality of CAZAC sequences.
• the method may further comprise a prime length Zadoff-Chu sequence.
• the duration of said signal is determined independently for each network cell.
• An integer number of resource blocks are allocated for transmission of said signal, and said signal duration is an integer number of data symbols.
• the plurality of CAZAC sequences is subdivided into groups comprising a non-contention use group and a contention use group.
• the plurality of CAZAC sequences comprise CAZAC sequences created by applying modifications to at least one root CAZAC sequence.
• the modifications applied to the at least one root CAZAC sequence comprise cyclic shifts.
• the cyclic shifts applied to the at least one root CAZAC sequence are integer multiples of the (maximum cell round trip delay + delay spread) of the telecommunications network cell.
• the method may further comprise determining the cyclic shifts applied to the at least one root CAZAC sequence independently for each telecommunication network cell.
• the method may further comprise analyzing said signal to estimate the frequency response of the up-link transmission channel, and allocating up-link resources based on said frequency response estimation.
• the method may further comprise analyzing the random access preamble signal to estimate the frequency response the up-link.
• the method may further comprise allocating up-link resources based on the estimated frequency response of the up-link.
• the method may further comprise transmitting at least one wide band pilot signal.
• the method may further comprise analyzing the wide-band pilot signal to estimate the frequency response of the up-link.
• the method may further comprise allocating up-link resources based on the estimated frequency response of the up-link.
• the plurality of CAZAC sequences represents a plurality of information values.
• the information represented by the random access preamble signal comprises: one of at least a down-link channel quality indicator and a random access cause.
• the method may further comprise allocating transmission resources according to said random access cause.
• the method may further comprise balancing telecommunication network cell loading by selective access restriction according to said random access cause.
• the method may further comprise subdividing said plurality of CAZAC sequences into access type groups.
• the method may further comprise allocating said plurality of CAZAC sequences to access type groups according to the latency requirements of the access type.
• the method may further comprise randomly selecting the CAZAC sequence to be transmitted from the plurality of CAZAC sequences allocated to the access type.
• the method may further comprise subdividing the plurality of CAZAC sequences allocated to each access type into sub-groups wherein each sub-group represents an information value.
• the method may further comprise determining for each telecommunication network cell, the number of CAZAC sequences per access type group, and the subdivision of access type groups into info ⁇ nation representative sub-groups.
• a second method of the disclosed present disclosure comprises a method for adapting a random access preamble for up-link transmission comprising: computing a frequency domain CAZAC sequence; storing the frequency domain CAZAC sequence in a storage device; reading the frequency domain CAZAC sequence from the storage device; and mapping the frequency domain CAZAC sequence onto the sub-carriers allocated to the random access channel.
• a method of resolving random access signal collisions comprising: randomly selecting a random access preamble signal from a plurality of random access preamble signals; and delaying transmission of the random access signal.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Mobile Radio Communication Systems (AREA)

Priority Applications (1)

Applications Claiming Priority (8)

Publications (1)

Family

ID=38353833

Family Applications (1)

Country Status (3)

Cited By (3)

Families Citing this family (36)

Family Cites Families (2)

• 2007
  • 2007-03-27 EP EP07754106A patent/EP2002626A2/de not_active Withdrawn
  • 2007-03-27 KR KR1020087026133A patent/KR101025993B1/ko active IP Right Grant
  • 2007-03-27 WO PCT/US2007/007535 patent/WO2007126793A2/en active Application Filing

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events