A compressed sensing（CS） based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel.A compressive basis expansion channel model with sparsity in both time and frequ...A compressed sensing（CS） based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel.A compressive basis expansion channel model with sparsity in both time and frequency domains is given.The pilots in accordance with a novel random pilot matrix in both time and frequency domains are sent to measure the delay-Doppler sparsity channel.The relatively nonzero channel coefficients are tracked by random pilots at a sampling rate significantly below the Nyquist rate.The sparsity channels are estimated from a very limited number of channel measurements by the basis pursuit algorithm.The proposed algorithm can effectively improve the channel estimation performance when the number of pilot symbols is reduced with improvement of throughput efficiency.展开更多
Differential unitary space-time modulation （DUSTM）, which obtains full transmit diversity in slowly fiat-fading channels without channel state iufonnation, has generated significant interests recently. To combat fre...Differential unitary space-time modulation （DUSTM）, which obtains full transmit diversity in slowly fiat-fading channels without channel state iufonnation, has generated significant interests recently. To combat frequency-selective fading, DUSTM has been applied to each subcarrier of an OFDM system and DUSTM-OFDM system was proposed. Both DUSTM and DUSTM-OFDM, however, are designed for slowly fading channels and suffer performance deterioration in fast fading channels. In this paper, two novel differential unitary space-time modulation schemes are proposed for fast fading channels. For fast fiat-fading channels, a subatrix interleaved DUSTM （SMI-DUSTM） scheme is proposed, in which matrix-segmentation and sub-matrix based interleaving are introduced into DUSTM system. For fast frequency-selective fading channels, a differential unitary space-frequency modulation （DUSFM） scheme is proposed, in which existing unitary space-time codes are employed across transmit antennas and OFDM subcarriers simultaneouslv and differential modulation is performed between two adjacent OFDM blocks. Compared with DUSTM and DUSTM-OFDM schemes, SMI-DUSTM and DUSFM-OFDM are more robust to fast channel fading with low decoding complexity, which is demonstrated by performance analysis and simulation resuits.展开更多
The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shif...The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shift is used in the simulation. The channel estimator obtains the sampled channel impulse response (SIR) from the predetermined training sequence. The FTF is a computationally efficient implementation of the recursive least squares (RLS) algorithm of the conventional Kalman filter. A stabilization FTF is used to overcome the problem caused by the accumulation of roundoff errors, and, in addition, degree-one prediction is incorporated into the algorithm (Predictive FTF) to improve the estimation performance and to track changes of the mobile channel. The efficiency of the algorithm is confirmed by simulation results for slow and fast varying mobile channel. The results show about 5 to 15 dB improvement in the Mean Square Error (Deviation) between the estimated taps and the actual ones depending on the speed of channel time variations. Slow and fast vehicular channels with Doppler frequencies 100 Hz and 222 Hz respectively are used in these tests. The predictive FTF (PFTF) algorithm give a better channel SIR estimation performance than the conventional FTF algorithm, and it involves only a small increase in complexity.展开更多
The Fast Broadcasting scheme is one of the simplest schemes that provide video services. In this scheme, the video is divided into equal-sized segments depending upon the bandwidth allocated by the video server. If th...The Fast Broadcasting scheme is one of the simplest schemes that provide video services. In this scheme, the video is divided into equal-sized segments depending upon the bandwidth allocated by the video server. If the video length is not known, then this scheme cannot be applied as the number of video segments cannot be determined. In a live video wherein the video size is unknown, especially the ending time of the live broadcast, e.g., cricket match, this scheme cannot be applied. In this paper, we propose a model that helps the Fast Broadcasting scheme to support live video broadcasting. The basic architecture of the system consists of a live system with one video channel that broadcasts the live video and a video server that broadcasts the already broadcast live video to users.展开更多
This paper proposes a wavelet based receiver structure for frequency-flat time-varying Rayleigh channels, consisting of a receiver front-end followed by a Maximum A-Posteriori (MAP) detector. Discretization of the rec...This paper proposes a wavelet based receiver structure for frequency-flat time-varying Rayleigh channels, consisting of a receiver front-end followed by a Maximum A-Posteriori (MAP) detector. Discretization of the received continuous time signal using filter banks is an essential stage in the front-end part, where the Fast Haar Transform (FHT) is used to reduce complexity. Analysis of our receiver over slow-fading channels shows that it is optimal for certain modulation schemes. By comparison with literature, it is shown that over such channels our receiver can achieve optimal performance for Time-Orthogonal modulation. Computed and Monte-Carlo simulated performance results over fast time-varying Rayleigh fading channels show that with Minimum Shift Keying (MSK), our receiver using four basis functions (filters) lowers the error floor by more than one order of magnitude with respect to other techniques of comparable complexity. Orthogonal Frequency Shift Keying (FSK) can achieve the same performance as Time-Orthogonal modulation for the slow-fading case, but suffers some degradation over fast-fading channels where it exhibits an error floor. Compared to MSK, however, Orthogonal FSK provides better performance.展开更多
基金supported by the National Natural Science Foundation of China(60972056)the Innovation Foundation of Shanghai Education Committee(09ZZ89)Shanghai Leading Academic Discipline Project and STCSM(S30108and08DZ2231100)
文摘A compressed sensing（CS） based channel estimation algorithm is proposed by using the delay-Doppler sparsity of the fast fading channel.A compressive basis expansion channel model with sparsity in both time and frequency domains is given.The pilots in accordance with a novel random pilot matrix in both time and frequency domains are sent to measure the delay-Doppler sparsity channel.The relatively nonzero channel coefficients are tracked by random pilots at a sampling rate significantly below the Nyquist rate.The sparsity channels are estimated from a very limited number of channel measurements by the basis pursuit algorithm.The proposed algorithm can effectively improve the channel estimation performance when the number of pilot symbols is reduced with improvement of throughput efficiency.
基金Supported by the High Technology Research and Development Program of China （No. 2003AA12331007 ） and National Natural Science Foundation of China （ No. 60272079）.
文摘Differential unitary space-time modulation （DUSTM）, which obtains full transmit diversity in slowly fiat-fading channels without channel state iufonnation, has generated significant interests recently. To combat frequency-selective fading, DUSTM has been applied to each subcarrier of an OFDM system and DUSTM-OFDM system was proposed. Both DUSTM and DUSTM-OFDM, however, are designed for slowly fading channels and suffer performance deterioration in fast fading channels. In this paper, two novel differential unitary space-time modulation schemes are proposed for fast fading channels. For fast fiat-fading channels, a subatrix interleaved DUSTM （SMI-DUSTM） scheme is proposed, in which matrix-segmentation and sub-matrix based interleaving are introduced into DUSTM system. For fast frequency-selective fading channels, a differential unitary space-frequency modulation （DUSFM） scheme is proposed, in which existing unitary space-time codes are employed across transmit antennas and OFDM subcarriers simultaneouslv and differential modulation is performed between two adjacent OFDM blocks. Compared with DUSTM and DUSTM-OFDM schemes, SMI-DUSTM and DUSFM-OFDM are more robust to fast channel fading with low decoding complexity, which is demonstrated by performance analysis and simulation resuits.
文摘The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shift is used in the simulation. The channel estimator obtains the sampled channel impulse response (SIR) from the predetermined training sequence. The FTF is a computationally efficient implementation of the recursive least squares (RLS) algorithm of the conventional Kalman filter. A stabilization FTF is used to overcome the problem caused by the accumulation of roundoff errors, and, in addition, degree-one prediction is incorporated into the algorithm (Predictive FTF) to improve the estimation performance and to track changes of the mobile channel. The efficiency of the algorithm is confirmed by simulation results for slow and fast varying mobile channel. The results show about 5 to 15 dB improvement in the Mean Square Error (Deviation) between the estimated taps and the actual ones depending on the speed of channel time variations. Slow and fast vehicular channels with Doppler frequencies 100 Hz and 222 Hz respectively are used in these tests. The predictive FTF (PFTF) algorithm give a better channel SIR estimation performance than the conventional FTF algorithm, and it involves only a small increase in complexity.
文摘The Fast Broadcasting scheme is one of the simplest schemes that provide video services. In this scheme, the video is divided into equal-sized segments depending upon the bandwidth allocated by the video server. If the video length is not known, then this scheme cannot be applied as the number of video segments cannot be determined. In a live video wherein the video size is unknown, especially the ending time of the live broadcast, e.g., cricket match, this scheme cannot be applied. In this paper, we propose a model that helps the Fast Broadcasting scheme to support live video broadcasting. The basic architecture of the system consists of a live system with one video channel that broadcasts the live video and a video server that broadcasts the already broadcast live video to users.
文摘This paper proposes a wavelet based receiver structure for frequency-flat time-varying Rayleigh channels, consisting of a receiver front-end followed by a Maximum A-Posteriori (MAP) detector. Discretization of the received continuous time signal using filter banks is an essential stage in the front-end part, where the Fast Haar Transform (FHT) is used to reduce complexity. Analysis of our receiver over slow-fading channels shows that it is optimal for certain modulation schemes. By comparison with literature, it is shown that over such channels our receiver can achieve optimal performance for Time-Orthogonal modulation. Computed and Monte-Carlo simulated performance results over fast time-varying Rayleigh fading channels show that with Minimum Shift Keying (MSK), our receiver using four basis functions (filters) lowers the error floor by more than one order of magnitude with respect to other techniques of comparable complexity. Orthogonal Frequency Shift Keying (FSK) can achieve the same performance as Time-Orthogonal modulation for the slow-fading case, but suffers some degradation over fast-fading channels where it exhibits an error floor. Compared to MSK, however, Orthogonal FSK provides better performance.
