Pub Date : 1900-01-01DOI: 10.1109/ACSSC.2005.1599759
Rahul Vanam, C. Creusere
The perceptual evaluation of audio quality (PEAQ), an ITU metric, has been developed for objective measurement of high quality audio. Previously it has been shown that the energy equalization approach (EEA), and a metric that uses EEA as a model output variable (MOV) together with standard five MOVs of the PEAQ advanced version, outperforms over PEAQ metric alone for measuring low bitrate audio quality. In this paper, we show that the latter approach also performs better than both PEAQ advanced version and EEA alone for measuring mid quality audio. Further, the use of bitrate information in our metric improves its accuracy in measuring over different audio qualities, thereby making it scalable
{"title":"Scalable Perceptual Metric for Evaluating Audio Quality","authors":"Rahul Vanam, C. Creusere","doi":"10.1109/ACSSC.2005.1599759","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599759","url":null,"abstract":"The perceptual evaluation of audio quality (PEAQ), an ITU metric, has been developed for objective measurement of high quality audio. Previously it has been shown that the energy equalization approach (EEA), and a metric that uses EEA as a model output variable (MOV) together with standard five MOVs of the PEAQ advanced version, outperforms over PEAQ metric alone for measuring low bitrate audio quality. In this paper, we show that the latter approach also performs better than both PEAQ advanced version and EEA alone for measuring mid quality audio. Further, the use of bitrate information in our metric improves its accuracy in measuring over different audio qualities, thereby making it scalable","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124047544","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1599828
M. Khojastepour, Xiaodong Wang, M. Madihian
In the recent years, we have witnessed an increasing demand for the high data rate wireless communication systems. While most of the research efforts has been focused on the minimization of the packet error probability through an adaptive transmission scheme, the overall optimization of the system throughput is not well addressed. We consider the problem of throughput maximization using a quantized feedback that is an appropriate model for practical systems with limited feedback capacity. We derive the optimal quantized rate control design for general multiple transmit and multiple receive antenna systems. Moreover, an adaptive stochastic gradient search algorithm has been proposed that can efficiently find the optimal solution. It is shown that the proposed quantized rate control design with only a few bits of feedback considerably improves the throughput of a system for a given average power
{"title":"Throughput Maximization In Multiple Antenna Communication Systems Through Quantized Rate Control","authors":"M. Khojastepour, Xiaodong Wang, M. Madihian","doi":"10.1109/ACSSC.2005.1599828","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599828","url":null,"abstract":"In the recent years, we have witnessed an increasing demand for the high data rate wireless communication systems. While most of the research efforts has been focused on the minimization of the packet error probability through an adaptive transmission scheme, the overall optimization of the system throughput is not well addressed. We consider the problem of throughput maximization using a quantized feedback that is an appropriate model for practical systems with limited feedback capacity. We derive the optimal quantized rate control design for general multiple transmit and multiple receive antenna systems. Moreover, an adaptive stochastic gradient search algorithm has been proposed that can efficiently find the optimal solution. It is shown that the proposed quantized rate control design with only a few bits of feedback considerably improves the throughput of a system for a given average power","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129791808","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1600051
H. Takeda, Sina Farsiu, P. Milanfar
This paper introduces an extremely robust adaptive denoising filter in the spatial domain. The filter is based on non-parametric statistical estimation methods, and in particular generalizes an adaptive method proposed earlier by Fukunaga [1]. To denoise a pixel, the proposed filter computes a locally adaptive set of weights and window sizes, which can be proven to be optimal in the context of non-parametric estimation using kernels. While we do not report analytical results on the statistical efficiency of the proposed method in this paper, we will discuss its derivation, and experimentally demonstrate its effectiveness against competing techniques at low SNR and on real noisy data.
{"title":"Image Denoising by Adaptive Kernel Regression","authors":"H. Takeda, Sina Farsiu, P. Milanfar","doi":"10.1109/ACSSC.2005.1600051","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600051","url":null,"abstract":"This paper introduces an extremely robust adaptive denoising filter in the spatial domain. The filter is based on non-parametric statistical estimation methods, and in particular generalizes an adaptive method proposed earlier by Fukunaga [1]. To denoise a pixel, the proposed filter computes a locally adaptive set of weights and window sizes, which can be proven to be optimal in the context of non-parametric estimation using kernels. While we do not report analytical results on the statistical efficiency of the proposed method in this paper, we will discuss its derivation, and experimentally demonstrate its effectiveness against competing techniques at low SNR and on real noisy data.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128717783","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1600009
B. Krongold
OFDM systems generally utilize a periodic extension, or cyclic prefix, to aid in equalization at the receiver. The cyclic prefix also incorporates a special autocorrelation structure into the signal that can be used for timing, carrier recovery, and delay-spread estimation. Central to these techniques is estimating the N-lag correlation function at the receiver, and in this paper, we analyze this function and its estimation error and discuss the resulting performance effects. Often overlooked is the dispersive nature of the channel, as many techniques are derived under a non-dispersive model out of convenience. The dispersive channel also results in correlated estimation error, which can significantly certain algorithms.
{"title":"Analysis of Cyclic-Prefix Correlation Statistics and their Use in OFDM Timing and Frequency Synchronization","authors":"B. Krongold","doi":"10.1109/ACSSC.2005.1600009","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600009","url":null,"abstract":"OFDM systems generally utilize a periodic extension, or cyclic prefix, to aid in equalization at the receiver. The cyclic prefix also incorporates a special autocorrelation structure into the signal that can be used for timing, carrier recovery, and delay-spread estimation. Central to these techniques is estimating the N-lag correlation function at the receiver, and in this paper, we analyze this function and its estimation error and discuss the resulting performance effects. Often overlooked is the dispersive nature of the channel, as many techniques are derived under a non-dispersive model out of convenience. The dispersive channel also results in correlated estimation error, which can significantly certain algorithms.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129566659","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1600012
H. Huh, T. Pande, J. Krogmeier
Orthogonal frequency division multiplexing (OFDM) is a bandwidth efficient modulation scheme used widely for high speed data communication. Fast and ro- bust synchronization algorithms are necessary for OFDM systems operating in burst mode like WLANs. In this paper, we propose an efficient timing and carrier frequency synchronization method for OFDM. The proposed scheme needs only one OFDM symbol for both symbol/frame timing and frequency offset estimation, while previous synchronization algorithms need more than two OFDM symbols as a training sequence. Numerical analysis shows that the proposed frequency estimator nearly achieves the Cramer-Rao lower bound for the variance of the frequency offset estimate, despite the reduction in the training sequence length.
{"title":"Efficient Timing and Frequency Offset Estimation in OFDM Systems","authors":"H. Huh, T. Pande, J. Krogmeier","doi":"10.1109/ACSSC.2005.1600012","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600012","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is a bandwidth efficient modulation scheme used widely for high speed data communication. Fast and ro- bust synchronization algorithms are necessary for OFDM systems operating in burst mode like WLANs. In this paper, we propose an efficient timing and carrier frequency synchronization method for OFDM. The proposed scheme needs only one OFDM symbol for both symbol/frame timing and frequency offset estimation, while previous synchronization algorithms need more than two OFDM symbols as a training sequence. Numerical analysis shows that the proposed frequency estimator nearly achieves the Cramer-Rao lower bound for the variance of the frequency offset estimate, despite the reduction in the training sequence length.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127223673","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1599884
W. Chu
A novel prediction scheme referred to as sinusoidal prediction (SP) is described, which can be used for redundancy removal in audio signals. The scheme works by extracting a number of sinusoids from the input signal inside an interval, a subset of the extracted sinusoids is selected and used to oscillate toward the future to form a prediction. The performance of SP is measured under various conditions, with the design of an SP- based waveform coder presented. II. SINUSOIDAL PREDICTION
{"title":"Sinusoidal Prediction for Waveform Coding","authors":"W. Chu","doi":"10.1109/ACSSC.2005.1599884","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599884","url":null,"abstract":"A novel prediction scheme referred to as sinusoidal prediction (SP) is described, which can be used for redundancy removal in audio signals. The scheme works by extracting a number of sinusoids from the input signal inside an interval, a subset of the extracted sinusoids is selected and used to oscillate toward the future to form a prediction. The performance of SP is measured under various conditions, with the design of an SP- based waveform coder presented. II. SINUSOIDAL PREDICTION","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128920608","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1599812
Yugang Zhou, W. Chan
Conjugate vector quantizer (CVQ), a joint source channel coding scheme robust to channel bit errors, is used in various popular speech coders such as ITU-T G.729 and ISO/IEC MPEG4 audio. We propose two multiple description CVQ (MD-CVQ) schemes for combating channel erasure errors. MD-CVQ offers an advantage of moderate computational complexity and storage over conventional MD vector quantizers (MDVQs). Experiments are performed for both i.i.d. Gaussian source and speech/audio signals. Results show that for low channel loss rates, a tradeoff exists between choosing MD-CVQ for its low complexity and MDVQ for its higher signal-to-noise ratio (SNR) performance. For medium to high channel loss rates, MD-CVQ is preferred for its low complexity and comparable SNR performance to MDVQ
{"title":"Multiple Description Conjugate Vector Quantizers with Side Distortion Compensation","authors":"Yugang Zhou, W. Chan","doi":"10.1109/ACSSC.2005.1599812","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599812","url":null,"abstract":"Conjugate vector quantizer (CVQ), a joint source channel coding scheme robust to channel bit errors, is used in various popular speech coders such as ITU-T G.729 and ISO/IEC MPEG4 audio. We propose two multiple description CVQ (MD-CVQ) schemes for combating channel erasure errors. MD-CVQ offers an advantage of moderate computational complexity and storage over conventional MD vector quantizers (MDVQs). Experiments are performed for both i.i.d. Gaussian source and speech/audio signals. Results show that for low channel loss rates, a tradeoff exists between choosing MD-CVQ for its low complexity and MDVQ for its higher signal-to-noise ratio (SNR) performance. For medium to high channel loss rates, MD-CVQ is preferred for its low complexity and comparable SNR performance to MDVQ","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129050371","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1599742
P. van Vugt, M. Adams
Reversible integer-to-integer (ITI) transforms that approximate linear wavelet transforms have proven extremely useful in signal coding applications. The coding efficiency achievable with such reversible transforms, however, depends on how well they approximate their parent linear transforms. In this paper, a simple but effective method for constructing reversible ITI wavelet transforms which better approximate their parent linear transforms is proposed. Furthermore, the transforms obtained with this new method are shown to have superior performance for signal coding applications
{"title":"Reversible Integer-to-Integer Wavelet Transforms With Improved Approximation Properties","authors":"P. van Vugt, M. Adams","doi":"10.1109/ACSSC.2005.1599742","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599742","url":null,"abstract":"Reversible integer-to-integer (ITI) transforms that approximate linear wavelet transforms have proven extremely useful in signal coding applications. The coding efficiency achievable with such reversible transforms, however, depends on how well they approximate their parent linear transforms. In this paper, a simple but effective method for constructing reversible ITI wavelet transforms which better approximate their parent linear transforms is proposed. Furthermore, the transforms obtained with this new method are shown to have superior performance for signal coding applications","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130933947","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1600063
R. Nadakuditi, A. Edelman
The Capon-MVDR algorithm has been widely studied by several authors. The famous Capon-Goodman result on the probability distribution of the Capon-MVDR spectral estimator was also used to accurately predict the bias and variance of the Capon-MVDR algorithm due to finite sample effects. The goal of this present analysis is to extend these results to compute the probability distribution, and hence the bias and variance, of the output of the Capon-MVDR processor when the sample covariance matrix is diagonally loaded. Of particular interest is the computation, for the first time, in the snapshot deficient scenario where the diagonal loading is used to combat the ill-conditioned or rank deficient sample covariance matrix.
{"title":"On the Probability Distribution of the Outputs of the Diagonally Loaded Capon-MVDR Processor","authors":"R. Nadakuditi, A. Edelman","doi":"10.1109/ACSSC.2005.1600063","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600063","url":null,"abstract":"The Capon-MVDR algorithm has been widely studied by several authors. The famous Capon-Goodman result on the probability distribution of the Capon-MVDR spectral estimator was also used to accurately predict the bias and variance of the Capon-MVDR algorithm due to finite sample effects. The goal of this present analysis is to extend these results to compute the probability distribution, and hence the bias and variance, of the output of the Capon-MVDR processor when the sample covariance matrix is diagonally loaded. Of particular interest is the computation, for the first time, in the snapshot deficient scenario where the diagonal loading is used to combat the ill-conditioned or rank deficient sample covariance matrix.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123323954","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 : 1900-01-01DOI: 10.1109/ACSSC.2005.1599819
T. Moon, J. S. Crockett, J. Gunther
The eigenmessage decoder has been shown to reduce the number of decoding iterations required for LDPC and other iteratively-decoded codes by introducing a degree of nonlocality into the decoding algorithm. In this paper, the multiple loop eigenmessage approach is extended using normalized matrices. Performance is examined via EXIT charts, showing that eigenmessage algorithms have wider channels in the chart. Performance as a function of the girth of the graph is examined, showing the performance to be largely invariant to girth. Finally, performance on matrices denser than typical "low density" parity check matrices is examined, showing that eigenmessage methods perform better than message passing, but still break down as the matrix density increases
{"title":"Improvements on Accelerating Iterative Decoding Using Eigenmessages","authors":"T. Moon, J. S. Crockett, J. Gunther","doi":"10.1109/ACSSC.2005.1599819","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599819","url":null,"abstract":"The eigenmessage decoder has been shown to reduce the number of decoding iterations required for LDPC and other iteratively-decoded codes by introducing a degree of nonlocality into the decoding algorithm. In this paper, the multiple loop eigenmessage approach is extended using normalized matrices. Performance is examined via EXIT charts, showing that eigenmessage algorithms have wider channels in the chart. Performance as a function of the girth of the graph is examined, showing the performance to be largely invariant to girth. Finally, performance on matrices denser than typical \"low density\" parity check matrices is examined, showing that eigenmessage methods perform better than message passing, but still break down as the matrix density increases","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121324324","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
扫码关注我们
求助内容：
应助结果提醒方式：