Patent Application
20090011717
This application is based upon and claims the benefit of priority from Japanese Patent Applications No. 2006-271455 filed on Oct. 3, 2006, No. 2006-338372 filed on Dec. 15, 2006, No. 2007-211717 filed on Aug. 15, 2007, the contents of which are incorporated by references.
1. Field of the Invention
The present invention relates to communication between a base station device and a terminal device in a mobile communication system.
2. Description of the Related Art
On an air interface between a base station device and a terminal device of a Long Term Evolution (LTE) mobile communication system, the logical channels of control signals and data signals are transferred through various transport channels according to the type thereof. Through a Random Access Channel (RACH), that is one example of a transport channel, a preamble and a message are transferred.
First, the terminal device generates a preamble when the preamble is transferred over the RACH.
The base station device detects the preamble to be received from the uplink on the RACH. More specifically, the base station device calculates cross-correlation values between a plurality of predetermined preamble patterns and received signals, detects a preamble based on the cross-correlation values, and identifies the preamble sent from the terminal device.
Upon verifying that the preamble has been received from the terminal device, the base station device identifies the preamble and the signature, and notifies the terminal device that the preamble has been detected. Upon receiving the notification, the terminal device sends a message to the uplink using a shared channel.
However, the above mentioned technique has the following problem.
Various signals are sent/received over various transport channels between the base station device and the terminal device of the LTE mobile communication system. As described above, preambles are sent/received through the RACH, for example. However, concrete regulation of the length of a signal sent/received over these transport channels has not been defined. What is required is that a signal length, that would be effective from the point of view of implementation, be defined.
An exemplary object of the present invention is to provide a mobile communication system and a signal transfer method, which use a signal having a preferred signal length from the implementation view point.
In order to achieve the above object, the mobile communication system according to an exemplary aspect of the invention has a sending device and a receiving device.
The sending device sends a notification signal in which the time length is defined to be such a time that the number of samples, when sampling at the sampling frequency, becomes the product of the exponentiation of the predetermined number of prime numbers that are taken from the smaller number. The receiving device detects the notification signal by performing predetermined signal processing on the signal received from the sending device.
In addition, the signal transfer method of an exemplary aspect of the invention is a signal transfer method in a mobile communication system having a sending device and a receiving device, which communicate with each other through a radio signal, wherein
The above and other objects, features, and advantages of the present invention will become apparent from the following description with references to the accompanying drawings which illustrate examples of the present invention.
An exemplary embodiment of the present invention will be described in detail with reference to the drawings.
Signal generator 21 generates a preamble to be sent to base station device 11 (RACH sequence). A generating polynomial of a Zadoff-Chu Zero Correlation Zone (ZC-ZCZ) sequence is used to generate a ZC sequence from a predetermined parameter, and the ZC sequence is cyclic-shifted, thus the preamble is generated. Information called a signature, which is represented by the value of the parameter described above, the shift amount of cyclic shifts, or both of them, is attached to the generated preamble. The signature may be used for data transfer.
The preamble generated by signal generator 21 is a signal in a time domain, and has a predetermined time length. In the present exemplary embodiment, the predetermined time length (hereinafter referred to as “preamble time length”) is defined to be such a time length that the number of samples obtained when sampling at the sampling frequency used in the mobile communication system, becomes the product of the exponentiation of the predetermined number of prime numbers that are taken from the smaller number (hereinafter referred to as “preamble sample number”).
DFT section 22 transforms the RACH sequence in time domain generated by signal generator 21 into a signal in frequency domain by discrete Fourier transform (DFT).
Subcarrier mapper 23 maps the signal transformed by DFT section 22 into a frequency domain to a predetermined subcarrier (assigned frequency).
The subcarrier mapping the RACH is predetermined by a base station parameter or the like.
IDFT section 24 transforms the signal in a frequency domain mapped to the subcarrier by subcarrier mapper 23 into a signal in a time domain by inverse discrete Fourier transform (IDFT). Since the time length of the preamble transformed back to the time domain by IDFT is the preamble time length described above, it is preferred that the number of samples used in IDFT is the preamble sample number.
The end of the preamble that has been returned to the signal in a time domain by IDFT section 24 is added as a cyclic prefix (CP) to the beginning of the preamble by CP inserter 25. The preamble to which the CP is attached by CP inserter 25 is transmitted over the RACH.
DFT section 31 transforms the signal received over the RACH from terminal device 12 into a signal in a frequency domain by DFT. Since the preamble that has been sent from terminal device 12 has the preamble time length, in order for the entirety of the preamble to become an input to DFT, it is sufficient that samples from the sampling of the received signal at the sampling frequency be inputted to the DFT, for a preamble sampling number that corresponds to the preamble time length. Then, DFT section 31 performs DFT with the preamble sample number.
The amount of calculation of DFT depends on the number of complex multiplications. For example, when DFT is performed by software, the larger the number of complex multiplications, the larger is the amount of processing. When the DFT is performed by hardware, the larger the number of complex multiplication, the larger is the circuit scale. In addition, the number of complex multiplications of DFT varies depending on the number of samples. Performing complex multiplications only a small number of times is sufficient if the number of samples is a value that can be expressed as a product of the exponentiation of a small prime number.
Multiplier 32 performs multiplication of a pattern from the transformation of a predetermined preamble pattern to a frequency domain and multiplication of a signal transformed to frequency domain by DFT section 31.
Note that when there is one predetermined preamble pattern (ZC sequence), and when a signature is represented by only the shift amount of the cyclic shifts with respect to this ZC sequence, multiplier 32 only needs to multiply the one preamble pattern and the output of DFT section 31.
In addition, when a plurality of preamble patterns (ZC sequences) are predetermined, and signatures are represented by the plurality of ZC sequences, multiplier 32 multiplies each of the plurality of preamble patterns and the output of DFT section 31. In this case, a constitution in which multiplier 32 is provided with a plurality of multipliers, and the output of DFT 31 is divided and input into each of the multipliers, is sufficient.
The signal that is obtained through multiplication by Multiplier 32 is transformed by IDFT section 33, using the IDFT method, into a signal in a time domain. Accordingly, a cross-correlation value between the signal received over the RACH and the preamble pattern can be obtained. Note that if the constitution is such that multiplier 32 is provided with one multiplier, it suffices that IDFT section 33 have a constitution that provides one IDFT. In addition, if the constitution is such that multiplier 32 is provided with a plurality of multipliers, it suffices that IDFT section 33 have a constitution that provides a plurality of IDFTs corresponding to respective multipliers.
Power converter 34 converts by a square operation the cross-correlation value obtained by IDFT section 33 into a value corresponding to electrical power.
Signal detector 35 detects a preamble from the output of power converter 34. More specifically, if there is a high cross-correlation value in the output of power converter 34, signal detector 35 determines that a preamble has been detected. In addition, at that time, signal detector 35 determines that the preamble of the pattern for which a high cross-correlation value was obtained is the preamble sent by terminal device 12.
The time of a peak in the delay profile of the cross-correlation value obtained by power converter 34 indicates the time when a preamble has been detected. Signal detector 35 can obtain the amount of the cyclic shift, from the time when the preamble has been detected. In addition, signal detector 35 can identify the signature based on either or both of the patterns of the identified preamble and the amount of cyclic shift.
In the mobile communication system of the present exemplary embodiment, since the time length of the preamble is defined to be such a time length that the number of samples becomes the product of the exponentiation of the predetermined number of prime numbers that are taken from the smaller number, only a small amount of calculation for detecting a preamble at base station device 11 is sufficient.
In the mobile communication system of the present exemplary embodiment, since base station device 11 has a sample number of DFT that is the product of the exponentiation of a predetermined number of prime numbers that are taken from the smaller number in a constitution in which a received signal is transformed by DFT into a frequency domain, the signal is multiplied by a preamble pattern in a frequency domain, and the signal is transformed back by IDFT to a time domain, only a small amount of calculations using DFT at base station device 11 is required.
In addition, system design using various cell radii can be considered for a mobile communication system. If the cell radius becomes large, it is preferred that the CP length and guard time are extended accordingly. Therefore, it is preferred that a different value is used according to the cell radius for the time length of a preamble and for the number of samples.
A concrete example of the present exemplary embodiment will be described below.
The generation scheme of RACH preamble in terminal device 12 (transmitter) is explained as follows. First, ZC sequence is generated in time domain. Here, the number of the generated ZC sequence may be a prime number. Then, it is mapped to the assigned frequency. Also, the sampling frequency of the generated RACH sequence may be transformed to fit with the transmitter's sampling frequency, which is usually 1.92×2N MHz.
One typical method is illustrated in
For the detection of RACH Preamble, 2 methods can be considered. One is using a sliding correlator, the other is using DFT and IDFT. In this document, the complexity is evaluated as the required number of multiplication for both method.
In order to compare 2 methods, RACH preamble length is assumed to be 1800sample@1.92 MHz, i.e. 0.9375 msec as an example.
This method calculates the correlation of the received signal and the RACH sequence for each signature. It may be calculated for each delay. Then, the number of complex multiplication NCML is calculated as follows.
NCML=NPRE×NRANGE×NSGN
where NPRE is Preamble Length, NRANGE is Search Range, NSGN is the number of Signatures. The maximum search range is equivalent to the cyclic shift length, which is usually obtained by dividing Preamble Length by the number of Signatures, i.e. NPRE=NRANGE/NSGN. Therefore,
The block diagram of this method is illustrated in
Using this scheme, the delay profile for the cyclic delay whose range is up to the preamble length is obtained. Therefore, since the signatures are equivalent to the propagation delay, every signatures generated by cyclic shifts of the same ZC sequence can be detected simultaneously.
The number of complex multiplication NCML is calculated as follows.
NCML=NDFT×2+NPRE
Here NDFT is the number of complex multiplications required for DFT or IDFT. Using the well known technique, it is can be reduced to as follows.
For the case of NCML=1800, it becomes
NCML=1800×(2×3+3×2+5×2)×2+1800=81,000
In this example, the number of complex multiplications is reduced to 1/40 compared with Method 1 (Sliding Correlator). It is due to the fact that the number of complex multiplications for DFT is reduced when the number of DFT points can be factored to small prime numbers.
From the above discussion, the required condition to reduce the number of complex multiplications is that the number of the samples for the RACH Preamble can be factored to small prime numbers. Therefore, we propose to make the number of the samples for the RACH Preamble 2K×3L×5M, where K, L and M are integer.
According to this requirement, the suitable PRACH Preamble length is obtained as in the table of
In addition to, it is still effective to make the number of the samples for the RACH Preamble 2K×3L×5M×7N, where N is also an integer. According to this formula, following numbers can be the candidates of the number of samples for the RACH Preamble in addition to
Another application is shown in
While preferred exemplary embodiments of the present invention have been described using specific terms, such description is for illustrative purposes only, and it is to be understood that changes and variations may be made without departing from the spirit or scope of the following claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2006-271455 | Oct 2006 | JP | national |
| 2006-338372 | Dec 2006 | JP | national |
| 2007-211717 | Aug 2007 | JP | national |
