1. Field
Embodiments described herein relate generally to a channel estimator configured to estimate a channel response in the frequency region, and more particularly to a channel estimator that is used in a receiver in a radio system having a frame configuration in which a specific known pattern signal whose code sequence is cyclically extended is periodically inserted.
2. Description of the Related Art
Generally, in a radio communication/broadcasting system, the waveform of a radio signal transmitted from a transmitting station/broadcasting station may be distorted, because until the radio signal reaches a receiver, the radio signal is reflected, scattered and diffracted by topography, land objects, and the like, so that a plurality of radio waves transmitted through a plurality of paths resulting from the reflection, scattering and diffraction, are synthesized with each other. This phenomenon is generally referred to as multipath.
Thus, in the receiver, processing (equalization processing) is performed, by which the original waveform of the radio signal transmitted from the transmitting station/broadcasting station is extracted from the received signal whose waveform is distorted. In many cases, the equalization processing is performed by digital signal processing. In the processing, it is important to accurately estimate distortion components generated through the multipath channels.
Generally, the distortion components generated through the multipath channels are obtained as a filter response at the time when an impulse is used as an input signal, and hence are expressed by using a channel impulse response (delay profile) which expresses, in the time domain, the propagation delay, the amplitude attenuation, and the phase rotation in each of the paths, and by using a channel frequency response which expresses, in the frequency domain, the frequency characteristics of amplitude and phase in each of the paths. Therefore, the accuracy of the signal distortion equalization processing in the receiver largely depends on the estimation accuracy of these channel responses.
Conventionally, as a channel estimator in a receiver in a radio system, an estimator is known, which is configured to obtain a complex time correlation between a received signal and a reference signal that is a known signal sequence, and which is configured to calculate a delay profile by arranging the complex time correlation in time series (see, for example, “Principles and Applications of CDMA Technology” by Talcum Sato, published by Realize Inc. (see for example, Chapter 1, Section 1.11)).
However, in the conventional channel estimator, there is a problem that since pseudo peaks (referred to as image path) are generated in the delay profile in the case where the received signal has a frame configuration in which a unique word formed by cyclically extending a PN (pseudo random noise) sequence is inserted as the reference signal (known pattern signal), it is not possible to discriminate only actual incoming paths and hence the channel estimation accuracy is significantly deteriorated.
In order to avoid the detection of the image path, instead of the channel estimator configured to obtain correlation in the time domain, a channel estimator configured to estimate the channel response in the frequency domain is proposed (see, for example, Japanese Patent Application Laid-Open Publication No. 2005-51404, Japanese Patent Application Laid-Open Publication No. 2005-223698, J. Wang, etc., “Iteractive padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and F. Yang etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system,” IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008).
Note that Japanese Patent Application Laid-Open Publication No. 2005-51404 discloses a technique that improves the estimation accuracy of the channel characteristics by reducing the adverse influence on the channel estimation values, which influence is caused by that frequency components having a small amount of power are included in the transmission signal.
Japanese Patent Application Laid-Open Publication No. 2005-223698 discloses a technique that improves the accuracy of channel characteristic estimation values obtained by a channel characteristic estimator in a radio communication system using a pilot signal whose frequency characteristics are not flat in the case where the pilot signal is a sequence whose power is fixed in the time domain.
In the above described channel estimator which estimates the channel response in the frequency domain, it is advantageous that the equalization in the frequency domain can be realized without taking into consideration the existence of the image path. However, in the estimator, an FFT window is set so as to include a range from the start of the unique word of the preceding wave to the end of the latest delayed wave. Thus, when the sequence length of the unique word is long, or when the delay time due to the multipath is long, large-size FFT and IFFT need to be performed, which results in a problem that the circuit scale and the processing delay amount are significantly increased. For example, FFT and IFFT of 2048 points are adopted for the unique word of at most 945 symbols in the technique as described in J. Wang, etc., “Iterative padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and described in F. Yang, etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system,” IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008.
Further, in the case where such large FFT size is used, there is a problem that the estimation accuracy of the channel response is deteriorated because data signals before and after the unique word enter the FFT window to cause interference. To cope with the problem, iterative cancellation processing for generating and subtracting an interference replica is introduced in the technique as described in J. Wang, etc., “Iterative padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and described in F. Yang, etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system,” IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008. However, this causes the circuit scale to be further increased. Further, in the case where the FFT size is set large beforehand, there is a problem that even when the multipath delay time is actually short, the power consumption of the circuit is too large.
In the following, embodiments according to the present invention will be described with reference to the accompanying drawings.
In
When the received signal is set as r(t) and the reference signal is set as c(t), and when a delay time is set as τ, the conventional channel estimator as described in “Principles and Applications of CDMA Technology” by Takuro Sato, published by Realize Inc. (see, for example, Chapter 1, Section 1.11), accumulates the results of Equation (1) described below in a memory and arranges the results in time series so as to output the arranged results as a delay profile.
Note that in Equation (1), Ts designates the sequence length of the reference signal c(t). In the discrete-time digital signal domain, the integration of Equation (1) can be transformed into Equation (2) described below.
Note that in Equation (2), Δt designates a sampling interval. Therefore, Equation (2) can be realized by hardware of a transversal filter with N taps as shown in
In the correlator 901 shown in
Generally, in the CDMA (Code Division Multiple Access) system and a radio system including a specific known pattern, Equation (2) is realized by hardware using a sliding correlator or a matched filter.
On the other hand, depending on a radio system, there is a case where a specific known pattern is periodically inserted, which is formed in such a manner that a cyclic prefix and a cyclic postfix, each of which is formed by cyclically extending a specific code sequence (such as, for example, PN sequence), are respectively inserted before and after the specific code sequence (hereinafter, such known pattern or known pattern signal is expressed as unique word). Here, in the unique word, the same code sequence is included in the cyclic prefix and the end region of the PN sequence, while the same code sequence is included in the cyclic postfix and the starting region of the PN sequence.
As shown in
Here, it is assumed that a signal frame (hereinafter simply referred to as frame) is configured by the unique word as a frame header, and a frame body as a data section, and that the frames having the same configuration are continuously or intermittently arranged in series. When a delay profile is calculated by obtaining correlation between a received signal and a reference signal (unique word) by using a conventional channel estimator as described in “Principles and Applications of CDMA Technology” by Takuro Sato, published by Realize Inc. (see, for example, Chapter 1, Section 1.11) as shown in
In this way, the conventional channel estimator has a problem that in the case where the received signal has the frame configuration in which the unique word is inserted, since an image path is generated in the delay profile on the basis of the results of calculation performed by the correlator in the channel estimator, it is not possible to discriminate only actual incoming paths and thereby the channel estimation accuracy is significantly deteriorated.
In order to avoid that the image path is detected, a channel estimator is proposed which, instead of obtaining the correlation in the time domain, estimates the channel response in the frequency domain.
A received signal is obtained by convolution of a unique word with a channel impulse response. Thus, in the channel estimator configured to estimate a channel response in the frequency domain, the channel impulse response h in the time domain can be obtained in such a manner that the received signal transformed to the frequency domain is divided by the known unique word transformed to the frequency domain, and that the division result is again transformed to the time domain (see Equation (3) described below).
In the channel estimator configured to estimate the channel response in the frequency domain described above, the equalization in the frequency domain can be realized without taking into consideration the existence of the image path. However, in the case where the sequence length of the unique word is long, and where the delay time due to the multipath is long, since the FFT window is set so as to include the period from the start of the unique word of the preceding wave to the end of the unique word of the latest delayed wave, FFT and IFFT with a large FFT size are required, which results in a problem that the circuit scale and the processing delay amount are significantly increased. For example, as described above, FFT and IFFT of 2048 points are adopted for a unique word of at most 945 symbols in the technique described in J. Wang, etc., “Iterative padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and described in F. Yang, etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system,” IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008.
Further, there is a problem that in the case of such large FFT size, the channel estimation accuracy is deteriorated because the data signals before and after the unique word is included in the FFT window so as to interfere with the unique word. To cope with this problem, the iterative cancellation processing for generating and subtracting an interference replica is introduced in the technique described in J. Wang, etc., “Iterative padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and described in F. Yang, etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system,” IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008. However, this results in a further increase in the circuit scale.
Further, since the FFT size is set large beforehand, there is a problem that even when the multipath delay time is actually short, the FFT processing load is heavy and hence the circuit power consumption is too large.
Thus, embodiments according to the present invention are configured such that when a signal has a frame configuration in which a specific known pattern formed by cyclically extending a code sequence is periodically inserted, and when the delay time of the signal is short, the FFT size can be reduced to reduce the circuit power consumption, and also extra interference symbols can be reduced to prevent the deterioration of the channel estimation accuracy.
In the following, a configuration of a channel estimator according to a first embodiment of the present invention will be described with reference to
First, the channel response in the frequency domain, which is used in the embodiment according to the present invention, will be described with reference to
Received signals transmitted from a transmitting station/broadcasting station and received by the receiver through radio channels include a main wave which directly reaches the receiver and has a high signal power and plural delayed waves, each of which is received with a time delay after being reflected by a building, a mountain, and the like. Two delayed waves are assumed in
In the case where the channel response is estimated in the time domain, when a correlation (similarity) between the multipath synthesized wave as the received signal and the known pattern is detected per frame by moving (sweeping) the known pattern on the time axis with respect to the multipath synthesized wave, one peak P0 is detected, as shown in
In
Here, Ci designates a channel coefficient, and S(t−τi) (i=0 to N) designates the signal of the main wave and each of the signals of the delayed waves. Reference character τ0 means the delay time 0.
In Equation (4), the value of the channel coefficient Ci is changed according to where the radio signal is reflected or absorbed. The respective (convolution operation) terms in Equation (4) are added together in such a manner that the direct wave directly coming to the receiver and the delayed waves delayed from the direct wave are not added coherently in the same phase.
When the received signal R(t) in the time domain expressed by Equation (4) is subjected to fast Fourier transform (FFT) by the FFT section, so as to be transformed to a signal in the frequency domain, the received signal R(f) in the frequency domain is expressed by Equation (5).
Here, C(f) designates a spectrum of the channel coefficient in the frequency domain, and S(f) designates a spectrum of the known signal in the frequency domain.
A transmission signal, which has frequency spectrum S(f) as shown in
Meanwhile, as shown by Equation (5), the received signal R(f) in the frequency domain is expressed as received signal R(f)=[channel coefficient C(f) in the frequency domain]×[known signal S(f) in the frequency domain]. Thus, when the known signal S(f) in the frequency domain is known, [channel coefficient C(f) in the frequency domain] as the channel response can be obtained by calculating [received signal R(f) in the frequency domain]/[known signal S(f) in the frequency domain].
When the channel coefficient C(f) in the frequency domain is subjected to inverse fast Fourier transform (IFFT), a channel impulse response, that is, a delay profile can be obtained. Therefore, the maximum delay time τ can be estimated from the obtained delay profile. The estimation is performed according to the change of the received signal R(f) in the frequency domain. Thus, in the case where the FFT size and the FFT window position are determined according to the estimated maximum delay time τ, and where the FFT section and the IFFT section in the channel estimator are operated in the frequency domain on the basis of the determined FFT size, when the maximum delay time τ is short, the FFT and IFFT processing can be performed by reducing the FFT size. Thereby the operation amount of FFT and IFFT processing and the circuit scale can be reduced, so that wasteful power consumption in the circuit can be suppressed.
As shown in
The first FFT section 101 transforms the received signal to the frequency domain on the basis of the FFT window position and the FFT size which are determined by the FFT parameter determination section 106. The second FFT section 102 transforms the known pattern signal to the frequency domain on the basis of the FFT size determined by the FFT parameter determination section 106. The channel response calculation section 103 calculates a channel response by performing processing to divide the FFT output of the first FFT section 101 by the FFT output of the second FFT section 102. The IFFT section 104 applies IFFT to the output of the channel response calculation section 103 on the basis of the FFT size determined by the FFT parameter determination section 106.
The channel response calculation section 103 divides the FFT output of the received signal by the FFT output of the known pattern signal, as shown by Equation (3). This is an estimation method based on the zero forcing (ZF) algorithm. However, in the ZF algorithm, in the case where the amplitude of a specific subcarrier (frequency component) is too small among the FFT outputs of the known pattern signal, when the denominator of the division at the frequency component becomes close to 0, the calculation accuracy becomes insufficient, and thereby the division result becomes a very large value. This results in a problem that the noise component included in the received signal is extremely emphasized so that the result of equalization based on the channel response becomes incorrect. This problem is caused in the case where the amplitude change of the frequency response of the known pattern signal is small, and where the amplitude of a specific subcarrier of the received signal is made extremely small due to the multipath. The above described problem of noise emphasis can be solved in such a manner that the channel response is estimated by using the Minimum Mean Square Error (MMSE) algorithm as shown by Equation (6). Here, h designates a channel impulse response in the time domain, R designates a frequency response of a received signal, C designates a frequency response of a known pattern signal, and σ2 designates noise power. The symbol * designates a complex conjugate.
The noise power is estimated by using a value of squared Euclidean distance between the reference signal and the demodulation signal which is subjected to the signal determination after the equalization. Alternatively, as the noise power estimation value, a value may be set, which is obtained by integrating electric power of a time waveform (delay profile) of a channel response only during a period in which it is possible to express, by the delay profile, the power of the waveform at the time when the path electric power is not more than a predetermined threshold value.
In the delay time estimation section 105, the delay time τ of each delayed wave is obtained from the time domain channel response (delay profile) obtained as the output of the IFFT section 104. For example, a path having a maximum power is searched in the delay profile. Then, a path, which has a power larger than a predetermined attenuation level relative to the maximum power level of the searched path, is recognized as a delayed wave, so that the delay time of the recognized paths is measured. Note that it is assumed that one or more delayed waves are recognized.
In the FFT parameter determination section 106, the FFT window position and the FFT size corresponding to the delay time (for example, maximum delay time) estimated by the delay time estimation section 105 are determined. This processing is essential for the method of estimating the channel response in the frequency domain, similarly to the conventional example as described in J. Wang, etc., “Iterative padding subtraction of the PN sequence for the TDS-OFDM over broadcast channel,” IEEE Trans. Consumer Electronics, vol. 51, no. 4, pp. 1148-1152, November 2005, and described in F. Yang, etc., “Novel channel estimation method based on PN sequence reconstruction for Chinese DTTB system, “IEEE Trans. Consumer Electronics, vol. 54, no. 4, pp. 1583-1589, November 2008.
In the conventional channel estimation in the frequency domain, a fixed large FFT size (for example, 2048 points) is used so as to include the maximum delay time of the known pattern or the unique word.
As shown in
On the other hand, in the embodiment according to the present invention, it is possible to adaptively change the FFT size and the FFT window position according to a delay time (for example, maximum delay time). Each of the first and second FFT sections 101 and 102, and of the IFFT section 104 is configured by a plurality of stages of butterfly operation circuits having a radix of two or more, and hence has flexibility in the FFT size in correspondence with the number of combinations of the circuits.
When the maximum delay time ti is not more than the time ((M−N)T) corresponding to the cyclically extended portions 1101 and 1103, the FFT size is adaptively selected so as to include a part of the PN sequence or cyclically extended portions, of the preceding wave and of all the delayed waves. That is, the FFT size is not less than the N points of the PN sequence and not more than the M points of the unique word length.
Alternatively, when the maximum delay time ti is more than the time ((M−N)T) corresponding to the cyclically extended portions 1101 and 1103, the FFT size is adaptively selected so as to have more points than the length corresponding to the cyclically extended portions 1101 and 1103. That is, the FFT size is larger than the cyclically extended portions 1101 and 1103.
In summary, when it is set that t is the maximum delay time, T is the symbol time, P is the preceding wave position, and K is the FFT size, the FFT sizes to be selected are expressed as follows.
When τ≦(M−N)T,
FFT size K=any arbitrary value from N to M
FFT window position=P+M−K (7)
When τ>(M−N)T,
FFT size K=any arbitrary value satisfying τ<KT
FFT window position=P+M−K (8)
Here, the term (M−N) is equivalent to the length of the cyclically extended portions (=cyclic prefix+cyclic postfix). Further, the meaning of (P+M−K) of the FFT window position is as follows. That is, the term (P+M) means the addition of the unique word length M to the preceding wave position P, and expresses the position of the end of the unique word. Therefore, the term (P+M−K) expresses the position returned from the end of the unique word by the FFT size K, and the position is set as the FFT window position.
As shown in
Further, in the case where of τ>(M−N)T as shown in
However, in the initial state, a delay profile is not obtained and the maximum delay time τ is not known. Thus, as the first step, the size of FFT and IFFT is first fixed to the maximum size (for example, 2048 points) that can be assumed as the multipath delay time, and the FFT processing and the IFFT processing are performed on the basis of the FFT size. From the obtained channel response, the maximum delay time τ is obtained by the delay time estimation section 105. In the second step, an accurate channel response is estimated in such a manner that, on the basis of Equation (7) expressing the relationship between the maximum delay time τ, the PN sequence length N, and the unique word length M, the respective FFT size of the first and second FFT sections 101 and 102, and of the IFFT section 104 is made variable in the FFT parameter determination section 106 according to the maximum delay time t. Note that the above described operation flow can be performed on the basis of the control of the control section (not shown).
Thereby, when the maximum delay time τ obtained by the delay time estimation section 105 is short, it is possible to obtain the effect that the power consumption of the circuit can be reduced by reducing the FFT size, and also the effect that extra interference symbols can be reduced as much as possible thereby preventing deterioration of the channel estimation accuracy.
Note that the other criterion regarding the FFT window position as expressed by Equation (7) and Equation (8), is the delay time of the latest delayed wave having power not less than a predetermined threshold value may also be used as the FFT window position setting reference. A fixed value set beforehand or a value attenuated by a predetermined level relative to the maximum power value of the delayed waves may be used as the predetermined threshold value used for recognizing the latest delayed wave.
When τ≦(M−N)T,
FFT size K=any arbitrary value from N to M
FFT window position=delay time of the latest delayed wave (9)
When τ>(M−N)T,
FFT size K=any arbitrary value satisfying τ<KT
FFT window position=delay time of the latest delayed wave (10)
According to the first embodiment, in the first step, the size of FFT and IFFT are fixed to the size that can include the maximum delay time (for example, 2048 points), to obtain a channel response, and then the maximum delay time τ is obtained from the obtained channel response. In the next step, on the basis of Equations (7) and (8) or Equations (9) and (10), which express the relationship between the maximum delay time τ, the PN sequence length N, and the unique word length M, an accurate channel response is estimated by making the size of FFT and IFFT variable according to the maximum delay time τ. As a result, when the maximum delay time τ obtained by the delay time estimation section 105 is short, the circuit power consumption can be reduced by reducing the FFT size, and the deterioration of channel estimation accuracy can be prevented by reducing extra interference symbols.
In the second embodiment, the case where the preceding wave position is not known is assumed. In this case, it is necessary to know the delay time (for example, the maximum delay time τ) of the delayed wave and the preceding wave position P in order to set the FFT size and the FFT window position in the FFT parameter determination section 206.
A channel estimator 200 shown in
The first FFT section 201 transforms the received signal to the frequency domain on the basis of the FFT window position and the FFT size which are determined by the FFT parameter determination section 206. The second FFT section 202 transforms the known pattern signal to the frequency domain on the basis of the FFT size determined by the FFT parameter determination section 206. The channel response calculation section 203 calculates the channel response by dividing the FFT output of the first FFT section 201 by the FFT output of the second FFT section 202. The IFFT section 204 applies IFFT to the output of the channel response calculation section 203 on the basis of the FFT size determined by the FFT parameter determination section 206.
The major difference between the configuration of the second embodiment according to the present invention and the configuration of the first embodiment shown in
The preceding wave position detection section 207 is realized by performing the preceding wave position detection processing described below. In an example of the preceding wave position detection method performed in the preceding wave position detection section, complex correlation processing between a known signal, such as the unique word, and a received signal continues to be performed in the time domain to obtain a correlation result, and then a position, at which a peak of the correlation value representing the correlation result is detected, is set as the preceding wave position P. Further, when the position P is varied for each frame, the correlation results between the known signal and the plurality of frames may be averaged, or a predetermined condition may also be set to perform synchronization protection to provide synchronization of the peak detection position P between the frames. Alternatively, the correlation of a pair of the cyclically extended portions (the pair of the portions designated by reference numerals 1101 and 1102c or by reference numerals 1103 and 1102a in
The preceding wave position detection section 207 also obtains correlation between the received signal and the unique word as the known pattern signal having at least the sequence length N of the PN sequence, and performs threshold determination on the power value of the correlation value representing the obtained correlation result. The preceding wave position detection section 207 does not regard, as the preceding wave, the received signal corresponding to the power value less than the threshold value. The synchronization is taken by the preceding wave position detection processing performed in this way.
The maximum delay time τ is not known at first. Thus, as the first step, the sizes of FFT and IFFT are fixed to the size that can include the maximum delay time (for example, 2048 points). Then, a channel response is once estimated by setting, as the starting position of the FFT window, the preceding wave position P detected by the preceding wave position detection section 207. The circuit for obtaining the channel response is configured by the FFT sections 201 and 202, the channel response calculation section 203, and the IFFT section 204. The operation of each of the circuits is the same as the operation of each of the FFT sections 101 and 102, the channel response calculation section 103, and the IFFT section 104 in the first embodiment. Then, the maximum delay time τ is obtained by the delay time estimation section 205 by using the obtained channel response. In the second step, an accurate channel response is estimated in such a manner that on the basis of the relationship between the maximum delay time τ, the PN sequence length N, and the unique word length M, the size of FFT and IFFT is made variable according to the maximum delay time τ. When the estimation processing is switched from the first step to the second step, the switching section 208 switches from the output of the preceding wave position detection section 207 to the output of the delay time estimation section 205, and supplies the switched output to the FFT parameter determination section 206.
Note that the switching section 208 includes: for example, a switch configured to switch between the output of the preceding wave position detection section 207 and the output of the delay time estimation section 205; and a control section configured to perform control to switch the switch at the time of the shift from the first step to the second step, and switches from the output of the preceding wave position detection section 207 to the output of the delay time estimation section 205 at the time of the shift from the first step to the second step. Alternatively, it may also be configured such that the switching section 208 is configured only by a selector switch, such that the output of the preceding wave position detection section 207, and the output of the delay time estimation section 205 are monitored by the other control section (not shown), and such that the selector switch is switched at the time when the control section detects the shift from the first step to the second step. The other control section may be realized by a controller such as a CPU or an MPU in the receiver provided with the channel estimator.
Here,
According to second embodiment, even in the case where a frame synchronization detection circuit, and the like, is not separately prepared, the preceding wave position detection processing is performed and a channel response is temporarily estimated in the state where the detected preceding wave position is set as the FFT window position and where the FFT size is maximized. Then, the FFT parameters (window position and size) are again determined on the basis of the maximum delay time obtained from the estimation result, so as to estimate the channel response by using the FFT with the minimum FFT size that can be set according to the obtained maximum delay time. Thereby, the channel estimation can be accurately performed with low power consumption without relying on the frame synchronization.
Note that in the channel estimator according to all the embodiments of the present invention, in the environment in which the channel delay spread is large, the peak accuracy of the output of the correlator, which performs correlation detection, may be slightly lowered because the amount of a preceding frame signal, which is delayed to enter the unique word portion of a subsequent frame, is large. In this case, the deterioration of channel estimation accuracy can be prevented in such a manner that the result obtained by estimating the delay profile of the preceding frame by using the channel estimator according to the present invention, and a signal obtained by re-modulating the demodulation result of the frame body (data section) of the preceding frame are used to generate replicas of the delayed signals which enter the next frame, and that the replicas of the delayed signals are subtracted from the next frame before the delay profile of the next frame is estimated.
In the above described embodiments, the case where a cyclic prefix and a cyclic postfix, each of which is formed by cyclically extending a specific code sequence (for example, PN sequence), are respectively included before and after the specific code sequence is explained as the frame configuration of the unique word. However, the channel estimator according to the present invention can also be similarly applied to the case of the unique word which includes only the specific code sequence and the cyclic prefix that is formed by cyclically extending the specific code sequence and that is arranged before the specific code sequence. Further, the channel estimator according to the present invention can also be similarly applied to the case of the unique word which includes only the specific code sequence and the cyclic postfix that is formed by cyclically extending the specific code sequence and that is arranged after the specific code sequence.
Further, the above described embodiments are described by using the PN sequence as the specific code sequence, but an arbitrary code sequence having high autocorrelation characteristics as code characteristics may also be used as the specific code sequence.
Note that the present invention is not limited to the above described embodiments, and various modification, changes or the like, are possible within the scope and spirit of the invention. Further, various configuration can be formed by adaptively combining a plurality of components disclosed in the above described embodiments. For example, some components may be eliminated from all the components shown in the above described embodiments. Further, components of different embodiments may also be adaptively combined.
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions. Indeed, the novel embodiments described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the embodiments described herein may be made without departing from the spirit of the inventions. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the inventions.
Number | Date | Country | Kind |
---|---|---|---|
2009-181821 | Aug 2009 | JP | national |
This application is based upon and claims the benefit of priority from Japanese Patent Application No. 2009-181821 filed on Aug. 4, 2009, the entire contents of which are incorporated herein by reference.