Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923926
K. Nishikawa, H. Kiya
This paper proposes a new structure of the affine projection algorithm (APA) based on the subband adaptive system (SAS). It is known that the APA can increase the rate of convergence when the input signal is highly correlated. The SAS used in the proposed structure differs from the conventional ones, i.e., it does not include the decimation operations, the adaptive filters in subbands share the same coefficients, and coefficients of analysis filters are determined according to the Hadamard transform. These differences make the proposed structure have some advantages over the conventional structures of the APA, e.g., we can greatly reduce the computational requirement for implementing the APA because the proposed structure does not require the matrix inversion.
{"title":"New structure of affine projection algorithm using a novel subband adaptive system","authors":"K. Nishikawa, H. Kiya","doi":"10.1109/SPAWC.2001.923926","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923926","url":null,"abstract":"This paper proposes a new structure of the affine projection algorithm (APA) based on the subband adaptive system (SAS). It is known that the APA can increase the rate of convergence when the input signal is highly correlated. The SAS used in the proposed structure differs from the conventional ones, i.e., it does not include the decimation operations, the adaptive filters in subbands share the same coefficients, and coefficients of analysis filters are determined according to the Hadamard transform. These differences make the proposed structure have some advantages over the conventional structures of the APA, e.g., we can greatly reduce the computational requirement for implementing the APA because the proposed structure does not require the matrix inversion.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116827884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923874
O. Ertug, B. Baykal
RAKE receivers suffer degradation in performance under fast fading due to errors in channel state estimation. The wide-sense stationary uncorrelated scatterer channel model lends itself to a time-frequency canonical representation, and provides additional diversity in the frequency axis. Using the joint multipath-Doppler diversity model based on this canonical representation, we propose a nonlinear time-frequency decorrelating decision-feedback multiuser detector for synchronous CDMA which utilizes decisions of the stronger users when forming the decisions for the weaker ones. Analytical and simulation results based on realistic fast-fading assumptions demonstrate that the proposed decision-feedback multiuser detector promises substantially improved bit-error-rate performance compared to the time-frequency decorrelating multiuser detector for the weaker users, while the error probability of the weakest user approaches the single-user bound as the interferers grow stronger. The proposed detector exhibits strong resistance to the near-far effect for all users and the time complexity per bit is linear in the number of users.
{"title":"Time-frequency decorrelating decision-feedback multiuser detector over fast-fading multipath channels for synchronous DS-CDMA systems","authors":"O. Ertug, B. Baykal","doi":"10.1109/SPAWC.2001.923874","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923874","url":null,"abstract":"RAKE receivers suffer degradation in performance under fast fading due to errors in channel state estimation. The wide-sense stationary uncorrelated scatterer channel model lends itself to a time-frequency canonical representation, and provides additional diversity in the frequency axis. Using the joint multipath-Doppler diversity model based on this canonical representation, we propose a nonlinear time-frequency decorrelating decision-feedback multiuser detector for synchronous CDMA which utilizes decisions of the stronger users when forming the decisions for the weaker ones. Analytical and simulation results based on realistic fast-fading assumptions demonstrate that the proposed decision-feedback multiuser detector promises substantially improved bit-error-rate performance compared to the time-frequency decorrelating multiuser detector for the weaker users, while the error probability of the weakest user approaches the single-user bound as the interferers grow stronger. The proposed detector exhibits strong resistance to the near-far effect for all users and the time complexity per bit is linear in the number of users.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124457319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923916
D. Astely, A. Artamo
Uplink RAKE combining with receiver diversity for a WCDMA FDD radio link in the presence of interference is considered. Expressions for the correlation between interference of different fingers after despreading are presented. By taking the correlation into account when combining the fingers, interference can be rejected. Spatial interference rejection combining (IRC), which accounts only for spatial correlation of the interference, and spatio-temporal IRC, which accounts also for correlation between fingers with different delays, are compared for rejection of both narrowband and wideband external interference. External interference may stem from narrowband communication systems operating in the same or distant frequency bands and by spectral regrowth from wideband systems operating in adjacent bands.
{"title":"Uplink spatio-temporal interference rejection combining for WCDMA","authors":"D. Astely, A. Artamo","doi":"10.1109/SPAWC.2001.923916","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923916","url":null,"abstract":"Uplink RAKE combining with receiver diversity for a WCDMA FDD radio link in the presence of interference is considered. Expressions for the correlation between interference of different fingers after despreading are presented. By taking the correlation into account when combining the fingers, interference can be rejected. Spatial interference rejection combining (IRC), which accounts only for spatial correlation of the interference, and spatio-temporal IRC, which accounts also for correlation between fingers with different delays, are compared for rejection of both narrowband and wideband external interference. External interference may stem from narrowband communication systems operating in the same or distant frequency bands and by spectral regrowth from wideband systems operating in adjacent bands.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124714474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923921
T. Deng, Wu-Sheng Lu
This paper proposes a closed-form weighted least-squares solution for designing variable two-dimensional (2D) digital filters with continuously variable 2D fractional delays. First, the coefficients of the variable 2D FIR filter are represented by using the polynomials of a pair of fractional delays (p/sub 1/,p/sub 2/). Then the weighted squared-error function of the variable 2D frequency response is derived without sampling the two frequencies (w/sub 1/,w/sub 2/) and the two fractional delays (p/sub 1/, p/sub 2/), which leads to a significant reduction in computational complexity. With the assumption that the overall weighting function is separable and stepwise, the design problem is reduced to the minimization of the weighted squared-error function. Finally, the closed-form solutions for the optimal coefficient matrices of the variable 2D FIR filter are derived.
{"title":"Discretization-free method for designing variable fractional delay 2-D FIR filters","authors":"T. Deng, Wu-Sheng Lu","doi":"10.1109/SPAWC.2001.923921","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923921","url":null,"abstract":"This paper proposes a closed-form weighted least-squares solution for designing variable two-dimensional (2D) digital filters with continuously variable 2D fractional delays. First, the coefficients of the variable 2D FIR filter are represented by using the polynomials of a pair of fractional delays (p/sub 1/,p/sub 2/). Then the weighted squared-error function of the variable 2D frequency response is derived without sampling the two frequencies (w/sub 1/,w/sub 2/) and the two fractional delays (p/sub 1/, p/sub 2/), which leads to a significant reduction in computational complexity. With the assumption that the overall weighting function is separable and stepwise, the design problem is reduced to the minimization of the weighted squared-error function. Finally, the closed-form solutions for the optimal coefficient matrices of the variable 2D FIR filter are derived.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129045057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923928
S. Ozaydin, B. Baykal
Efficient quantization of linear predictive coding (LPC) filter coefficients play an essential role in very-low-bit-rate speech coding systems. This paper examines a new suboptimal matrix quantization scheme for LPC parameters, called multi-stage matrix quantization (MSMQ), which operates at bit rates between 400 and 800 bit/s. With the new matrix quantization method, using a 22.5 ms LPC analysis frame, spectral distortion about 1 dB is achieved at 800 bit/s. In the proposed coder, line spectral frequency (LSF) parameters of multiple consecutive frames are grouped into a superframe and jointly quantized. The new residual LSF vector quantization scheme gives a bit rate reduction in MSMQ without any additional complexity or storage. The new MSMQ leads into several schemes of various computational complexity/storage characteristics.
线性预测编码(LPC)滤波器系数的有效量化在极低比特率语音编码系统中起着至关重要的作用。本文研究了LPC参数的一种新的次优矩阵量化方案，称为多级矩阵量化(MSMQ)，它的比特率在400到800比特/秒之间。采用新的矩阵量化方法，使用22.5 ms LPC分析帧，在800 bit/s下实现了约1 dB的频谱失真。该编码器将多个连续帧的线谱频率(LSF)参数组合成一个超帧并进行联合量化。新的残差LSF矢量量化方案在不增加复杂性和存储空间的情况下降低了MSMQ的比特率。新的MSMQ导致了几种不同计算复杂度/存储特性的方案。
{"title":"Multi stage matrix quantization for very low bit rate speech coding","authors":"S. Ozaydin, B. Baykal","doi":"10.1109/SPAWC.2001.923928","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923928","url":null,"abstract":"Efficient quantization of linear predictive coding (LPC) filter coefficients play an essential role in very-low-bit-rate speech coding systems. This paper examines a new suboptimal matrix quantization scheme for LPC parameters, called multi-stage matrix quantization (MSMQ), which operates at bit rates between 400 and 800 bit/s. With the new matrix quantization method, using a 22.5 ms LPC analysis frame, spectral distortion about 1 dB is achieved at 800 bit/s. In the proposed coder, line spectral frequency (LSF) parameters of multiple consecutive frames are grouped into a superframe and jointly quantized. The new residual LSF vector quantization scheme gives a bit rate reduction in MSMQ without any additional complexity or storage. The new MSMQ leads into several schemes of various computational complexity/storage characteristics.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131836478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923934
Sheng-Hong Li, Hong-Wen Zhu, Jian-hua Li
The problem of modeling MPEG-1 VBR video traffic is studied. Based on the analysis of their statistical characteristics, this paper presents a new direct frame-layered traffic model for VBR video traffic using the MPEG-1 scheme and group of pictures (GOP) pattern "IBBPBBPBBPBB". The model can reflect the first- and second-order frame-layered statistical characteristics of this video traffic well simultaneously. Simulation results also show that the model can capture the behavior of this traffic in a queue effectively.
{"title":"Study of a new model for MPEG-1 video traffics in ATM networks","authors":"Sheng-Hong Li, Hong-Wen Zhu, Jian-hua Li","doi":"10.1109/SPAWC.2001.923934","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923934","url":null,"abstract":"The problem of modeling MPEG-1 VBR video traffic is studied. Based on the analysis of their statistical characteristics, this paper presents a new direct frame-layered traffic model for VBR video traffic using the MPEG-1 scheme and group of pictures (GOP) pattern \"IBBPBBPBBPBB\". The model can reflect the first- and second-order frame-layered statistical characteristics of this video traffic well simultaneously. Simulation results also show that the model can capture the behavior of this traffic in a queue effectively.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115746010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923907
Chung-Yao Chang, Shiunn-Jang Chern
A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the "fast" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.
{"title":"Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression","authors":"Chung-Yao Chang, Shiunn-Jang Chern","doi":"10.1109/SPAWC.2001.923907","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923907","url":null,"abstract":"A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the \"fast\" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122066145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923846
J. Xavier, V. Barroso
We derive the asymptotic performance analysis of a recently introduced analytical method for blind identification of multiple-input multiple-output (MIMO) convolutive systems excited by inputs with distinct second-order spectra; the spectral diversity in the second-order moments is induced by correlative filters located at the sources. We establish the asymptotic normality of the MIMO channel estimator and obtain a closed-form expression for the mean square error (MSE) of the channel estimates. The theoretical study permits us to investigate the impact of certain key system parameters on the resulting MSE and to obtain guidelines for the optimum design of the correlative filters. Computer simulations are carried out to validate the theoretical expressions.
{"title":"Blind identification of MIMO channels based on correlative coding: performance analysis","authors":"J. Xavier, V. Barroso","doi":"10.1109/SPAWC.2001.923846","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923846","url":null,"abstract":"We derive the asymptotic performance analysis of a recently introduced analytical method for blind identification of multiple-input multiple-output (MIMO) convolutive systems excited by inputs with distinct second-order spectra; the spectral diversity in the second-order moments is induced by correlative filters located at the sources. We establish the asymptotic normality of the MIMO channel estimator and obtain a closed-form expression for the mean square error (MSE) of the channel estimates. The theoretical study permits us to investigate the impact of certain key system parameters on the resulting MSE and to obtain guidelines for the optimum design of the correlative filters. Computer simulations are carried out to validate the theoretical expressions.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122505139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923848
J. Ayadi, D. Slock
In a multichannel context, the problem of blind estimation of the channel can be parameterized either by the channel impulse response or by the noise-free multivariate prediction error filter and the first vector coefficient of the vector channel. The noise subspace, spanned by a set of vectors that are orthogonal to the signal subspace, can be parameterized according to different linear parameterizations. We begin with the reasons due to which second-order-statistics-based estimation techniques give accurate channel estimates. We focus on the different noise subspace parameterizations in terms of blocking equalizers and classify them. We present linear (in terms of subchannel impulse responses) noise subspace parameterizations and we prove that using a specific parameterization, which is minimal in terms of the number of rows, leads to span the overall noise subspace.
{"title":"On linear channel-based noise subspace parameterizations for blind multichannel identification","authors":"J. Ayadi, D. Slock","doi":"10.1109/SPAWC.2001.923848","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923848","url":null,"abstract":"In a multichannel context, the problem of blind estimation of the channel can be parameterized either by the channel impulse response or by the noise-free multivariate prediction error filter and the first vector coefficient of the vector channel. The noise subspace, spanned by a set of vectors that are orthogonal to the signal subspace, can be parameterized according to different linear parameterizations. We begin with the reasons due to which second-order-statistics-based estimation techniques give accurate channel estimates. We focus on the different noise subspace parameterizations in terms of blocking equalizers and classify them. We present linear (in terms of subchannel impulse responses) noise subspace parameterizations and we prove that using a specific parameterization, which is minimal in terms of the number of rows, leads to span the overall noise subspace.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128826928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-03-20DOI: 10.1109/SPAWC.2001.923856
T. Yamada, T. Matsumoto, S. Tomisato, U. Trautwein
This paper shows results of link level simulations conducted to evaluate performances of spatial and temporal equalizers (S/T-equalizers) using field measurement data. The spatial and temporal equalizer discussed has a configuration expressed as a cascaded connection of adaptive array antenna and maximum likelihood sequence estimator (MLSE): each of the antenna elements has a fractionally spaced tapped delay line (FTDL), and the MLSE has taps covering a portion of channel delay profile. Bit error rate (BER) performance of the S/T-equalizers, including that in the presence of co-channel Interference (CCI) are presented. Performance sensitivity to symbol timing offset is also investigated. Major conclusions of this paper are that allocating more taps to the spatial domain is more effective than to the time domain when the total number of taps is fixed, and that increasing the FTDL length is effective in reducing performance sensitivity to timing offset.
{"title":"Performance evaluation for FTDL-spatial/MLSE-temporal equalizer using field measurement data","authors":"T. Yamada, T. Matsumoto, S. Tomisato, U. Trautwein","doi":"10.1109/SPAWC.2001.923856","DOIUrl":"https://doi.org/10.1109/SPAWC.2001.923856","url":null,"abstract":"This paper shows results of link level simulations conducted to evaluate performances of spatial and temporal equalizers (S/T-equalizers) using field measurement data. The spatial and temporal equalizer discussed has a configuration expressed as a cascaded connection of adaptive array antenna and maximum likelihood sequence estimator (MLSE): each of the antenna elements has a fractionally spaced tapped delay line (FTDL), and the MLSE has taps covering a portion of channel delay profile. Bit error rate (BER) performance of the S/T-equalizers, including that in the presence of co-channel Interference (CCI) are presented. Performance sensitivity to symbol timing offset is also investigated. Major conclusions of this paper are that allocating more taps to the spatial domain is more effective than to the time domain when the total number of taps is fixed, and that increasing the FTDL length is effective in reducing performance sensitivity to timing offset.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126911794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：