Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599692
Deniz Gunduz, E. Erkip
We consider transmission of a continuous amplitude source over a quasi-static Rayleigh fading channel. We analyze three different source and channel coding strategies in terms of overall expected distortion (ED). Our goal is to maximize the distortion exponent (Delta), which is the exponential decay rate of ED with increasing SNR. In each case, by adjusting the system parameters we find the best Delta as a function of the bandwidth expansion. We also find an upper bound for Delta and illustrate how this upper bound can be achieved for all bandwidth expansions even with reasonably simple strategies. Although we focus on a Gaussian source for brevity, we demonstrate that our results can be extended to more general source distributions
{"title":"Source and Channel Coding for Quasi-Static Fading Channels","authors":"Deniz Gunduz, E. Erkip","doi":"10.1109/ACSSC.2005.1599692","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599692","url":null,"abstract":"We consider transmission of a continuous amplitude source over a quasi-static Rayleigh fading channel. We analyze three different source and channel coding strategies in terms of overall expected distortion (ED). Our goal is to maximize the distortion exponent (Delta), which is the exponential decay rate of ED with increasing SNR. In each case, by adjusting the system parameters we find the best Delta as a function of the bandwidth expansion. We also find an upper bound for Delta and illustrate how this upper bound can be achieved for all bandwidth expansions even with reasonably simple strategies. Although we focus on a Gaussian source for brevity, we demonstrate that our results can be extended to more general source distributions","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114713491","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 : 2005-12-01DOI: 10.1109/ACSSC.2005.1599810
H. Shah, Aria Nosratinia
Digital watermarking is equivalent to a communication problem, where the embedded message goes through an effective channel consisting of the image interference, noise, and attacks. Understanding and quantifying the performance of watermarking strategies, i.e., bit error rates (BER), under various scenarios is key to the further development of this field. Although a few watermark-specific and attack-specific results do exist, a general framework for performance evaluation of watermarking has not been available to date. Motivated by results in communication theory, we propose a modeling and performance evaluation strategy that uses the concept of intersymbol interference (ISI) channels and applies to a variety of embedding methods as well as various attacks. We first show the applicability of this general approach to several watermarks and attacks. We derive pair wise error probability equations that are used to calculate BER bounds. These bounds are verified by simulations. Finally, we study the use of MMSE detectors in watermarking, and give some results
{"title":"Channel Modeling and Performance Analysis in Watermarking","authors":"H. Shah, Aria Nosratinia","doi":"10.1109/ACSSC.2005.1599810","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599810","url":null,"abstract":"Digital watermarking is equivalent to a communication problem, where the embedded message goes through an effective channel consisting of the image interference, noise, and attacks. Understanding and quantifying the performance of watermarking strategies, i.e., bit error rates (BER), under various scenarios is key to the further development of this field. Although a few watermark-specific and attack-specific results do exist, a general framework for performance evaluation of watermarking has not been available to date. Motivated by results in communication theory, we propose a modeling and performance evaluation strategy that uses the concept of intersymbol interference (ISI) channels and applies to a variety of embedding methods as well as various attacks. We first show the applicability of this general approach to several watermarks and attacks. We derive pair wise error probability equations that are used to calculate BER bounds. These bounds are verified by simulations. Finally, we study the use of MMSE detectors in watermarking, and give some results","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116115372","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 : 2005-12-01DOI: 10.1109/ACSSC.2005.1599920
Renqiu Wang, Wanlun Zhao, G. Giannakis
Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin ,α ) for any MSC scheme with code rateR and minimum (free) Hamming distance dmin ,w hereα =1 +� L(1 − R)� is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M ,i fM idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simu- lations verify that DCC-MSC can improve system performance markedly.
{"title":"Multi-Source Cooperative Networks with Distributed Convolutional Coding","authors":"Renqiu Wang, Wanlun Zhao, G. Giannakis","doi":"10.1109/ACSSC.2005.1599920","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599920","url":null,"abstract":"Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin ,α ) for any MSC scheme with code rateR and minimum (free) Hamming distance dmin ,w hereα =1 +� L(1 − R)� is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M ,i fM idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simu- lations verify that DCC-MSC can improve system performance markedly.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114289462","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 : 2005-12-01DOI: 10.1109/ACSSC.2005.1599772
R. Samanta, R. Heath
Quantized multiple-input multiple-output (MIMO) beamforming systems use predesigned codebooks for the quantization of transmit beamforming vectors. The quantized vector, which is conveyed to the transmitter using a low-rate feedback channel, is used for transmission to provide significant diversity and array gain. The codebook for quantization is a function of the channel distribution, and is typically designed for fixed channel distributions. In this paper, we propose a channel adaptive feedback strategy for arbitrary channel distributions, and present a simple codebook design methodology based on the channel statistics. The codebook for quantization is dynamically chosen rom a structured set of pre-designed codebooks, called the code set, wherein all codebooks are derived from one mother codebook. Simulations illustrate that the proposed method can improve error rate performance in correlated and/or channels with strongly line-of-sight components
{"title":"Codebook Adaptation for Quantized MIMO Beamforming Systems","authors":"R. Samanta, R. Heath","doi":"10.1109/ACSSC.2005.1599772","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599772","url":null,"abstract":"Quantized multiple-input multiple-output (MIMO) beamforming systems use predesigned codebooks for the quantization of transmit beamforming vectors. The quantized vector, which is conveyed to the transmitter using a low-rate feedback channel, is used for transmission to provide significant diversity and array gain. The codebook for quantization is a function of the channel distribution, and is typically designed for fixed channel distributions. In this paper, we propose a channel adaptive feedback strategy for arbitrary channel distributions, and present a simple codebook design methodology based on the channel statistics. The codebook for quantization is dynamically chosen rom a structured set of pre-designed codebooks, called the code set, wherein all codebooks are derived from one mother codebook. Simulations illustrate that the proposed method can improve error rate performance in correlated and/or channels with strongly line-of-sight components","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":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134495908","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 : 2005-12-01DOI: 10.1109/ACSSC.2005.1599773
B. Mondal, R. Heath
The knowledge of the wireless channel is crucial for realizing the capacity and diversity gains of a MIMO system. In the absence of perfect channel knowledge at the transmitter, channel information can be quantized at the receiver and sent back using a low-rate feedback link. In the case of flat-fading channels, considerable work has been done in reducing the feedback information. This work, however, does not naturally extend to the case of frequency selective channels and leads to an explosion in the feedback overhead. In this paper, OFDM is considered as an implementation of linearly precoded MIMO spatial multiplexing systems over frequency selective channels. Two classes of algorithms are discussed for quantizing channel information-clustering and transform. The clustering group the subcarriers and choose a common frequency-domain representation of the channel information for each group. Thus the feedback rate depends on the number of groups and not on the number of subcarriers. The transform algorithms quantize the channel information in time-domain where the transform essentially decorrelates the channel information. Both the algorithms provide significant compression of channel information maintaining bit-error-rate performance close to the case of perfect channel knowledge
{"title":"Algorithms for Quantized Precoded MIMO-OFDM Systems","authors":"B. Mondal, R. Heath","doi":"10.1109/ACSSC.2005.1599773","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599773","url":null,"abstract":"The knowledge of the wireless channel is crucial for realizing the capacity and diversity gains of a MIMO system. In the absence of perfect channel knowledge at the transmitter, channel information can be quantized at the receiver and sent back using a low-rate feedback link. In the case of flat-fading channels, considerable work has been done in reducing the feedback information. This work, however, does not naturally extend to the case of frequency selective channels and leads to an explosion in the feedback overhead. In this paper, OFDM is considered as an implementation of linearly precoded MIMO spatial multiplexing systems over frequency selective channels. Two classes of algorithms are discussed for quantizing channel information-clustering and transform. The clustering group the subcarriers and choose a common frequency-domain representation of the channel information for each group. Thus the feedback rate depends on the number of groups and not on the number of subcarriers. The transform algorithms quantize the channel information in time-domain where the transform essentially decorrelates the channel information. Both the algorithms provide significant compression of channel information maintaining bit-error-rate performance close to the case of perfect channel knowledge","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133865953","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 : 2005-12-01DOI: 10.1109/ACSSC.2005.1600008
I. Wong, B. Evans
OFDM channel prediction algorithms have been proposed to combat feedback delay in adaptive OFDM systems. However, no simple closed-form expression that relates prediction mean-square error (MSE) with the design parameters in OFDM channel prediction has been reported in the literature. This paper attempts to fill that gap by deriving simple closed- form asymptotic lower bounds of the MSE for OFDM channel prediction in deterministic doubly-selective fading channels. The bounds relate the best-achievable MSE with the predictor design parameters in a simple manner, thus providing important insight into the design of OFDM channel predictors. We compare the bounds to the deterministic Cramer-Rao bound for parameters consistent with IEEE 802.16e, and show that the asymptotic bounds are reasonably tight for practical scenarios.
{"title":"Performance Bounds in OFDM Channel Prediction","authors":"I. Wong, B. Evans","doi":"10.1109/ACSSC.2005.1600008","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600008","url":null,"abstract":"OFDM channel prediction algorithms have been proposed to combat feedback delay in adaptive OFDM systems. However, no simple closed-form expression that relates prediction mean-square error (MSE) with the design parameters in OFDM channel prediction has been reported in the literature. This paper attempts to fill that gap by deriving simple closed- form asymptotic lower bounds of the MSE for OFDM channel prediction in deterministic doubly-selective fading channels. The bounds relate the best-achievable MSE with the predictor design parameters in a simple manner, thus providing important insight into the design of OFDM channel predictors. We compare the bounds to the deterministic Cramer-Rao bound for parameters consistent with IEEE 802.16e, and show that the asymptotic bounds are reasonably tight for practical scenarios.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124446127","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 : 2005-11-28DOI: 10.1109/ACSSC.2005.1600066
Wei Kang, S. Ulukus
The capacity region of the multiple access channel with arbitrarily correlated sources remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the form of single-letter entropy and mutual information expressions, without a single-letter converse. Cover, El Gamal and Salehi also gave a converse in terms of some n-letter mutual informations, which are incomputable. In this paper, we derive an upper bound for the sum rate of this channel in a single-letter expression by using spectrum analysis. The incomputability of the sum rate of Cover, El Gamal and Salehi scheme comes from the difficulty of characterizing the possible joint distributions for the n-letter channel inputs. Here we introduce a new data processing inequality, which leads to a single-letter necessary condition for these possible joint distributions. We develop a single-letter upper bound for the sum rate by using this single-letter necessary condition on the possible joint distributions.
具有任意相关源的多址信道的容量区域一直是一个有待解决的问题。Cover, El Gamal和Salehi以单字母熵和互信息表达的形式给出了一个可实现的区域，没有单字母的逆。Cover、El Gamal和Salehi也给出了一些不可计算的n字母互信息的逆。在本文中，我们用频谱分析的方法导出了该信道的和速率的上界。Cover、El Gamal和Salehi方案和速率的不可计算性来自于难以描述n字母信道输入的可能联合分布。在这里，我们引入了一个新的数据处理不等式，它导致了这些可能的联合分布的一个必要条件。利用这一可能联合分布的单字母必要条件，给出了和率的单字母上界。
{"title":"A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources","authors":"Wei Kang, S. Ulukus","doi":"10.1109/ACSSC.2005.1600066","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600066","url":null,"abstract":"The capacity region of the multiple access channel with arbitrarily correlated sources remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the form of single-letter entropy and mutual information expressions, without a single-letter converse. Cover, El Gamal and Salehi also gave a converse in terms of some n-letter mutual informations, which are incomputable. In this paper, we derive an upper bound for the sum rate of this channel in a single-letter expression by using spectrum analysis. The incomputability of the sum rate of Cover, El Gamal and Salehi scheme comes from the difficulty of characterizing the possible joint distributions for the n-letter channel inputs. Here we introduce a new data processing inequality, which leads to a single-letter necessary condition for these possible joint distributions. We develop a single-letter upper bound for the sum rate by using this single-letter necessary condition on the possible joint distributions.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122233523","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 : 2005-11-20DOI: 10.1109/ACSSC.2005.1599752
Bingtuo Guo, Luzhou Xu, Jian Li
In this correspondence, a new time reversal (TR) based ultra-wideband (UWB) microwave method for hyperthermia treatment of breast cancer is presented. Two high-resolution techniques, time reversal (TR) and robust Capon beamformer (RGB), are employed to shape the transmitted signals both temporally and spatially. As shown in the two-dimensional (2D) numerical simulations, this method has better electromagnetic (EM) energy focusing ability than the existing methods, and can provide the necessary temperature gradients required for effective hyperthermia
{"title":"Time Reversal Based Microwave Hyperthermia Treatment of Breast Cancer","authors":"Bingtuo Guo, Luzhou Xu, Jian Li","doi":"10.1109/ACSSC.2005.1599752","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599752","url":null,"abstract":"In this correspondence, a new time reversal (TR) based ultra-wideband (UWB) microwave method for hyperthermia treatment of breast cancer is presented. Two high-resolution techniques, time reversal (TR) and robust Capon beamformer (RGB), are employed to shape the transmitted signals both temporally and spatially. As shown in the two-dimensional (2D) numerical simulations, this method has better electromagnetic (EM) energy focusing ability than the existing methods, and can provide the necessary temperature gradients required for effective hyperthermia","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126749957","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 : 2005-11-01DOI: 10.1109/ACSSC.2005.1599821
H. Balta, M. Kovaci, A. de Baynast
In this paper, we analyze the performance in terms of bit error rate and frame error rate of a turbo-coded system over Nakagami frequency-nonselective (flat) fading multipaths channels. First, an efficient method to generate uncorrelated Nakagami-m fading samples is proposed. Through the parameter m, the Nakagami distribution accurately model signal fading conditions that range from severe to moderate. The primary justification for the use of the Nakagami-m distribution is its good fit to empirical fading data. Second, we modify calculation of the channel log likelihood ratios at the input of the decoder in order to take into account the Nakagami distribution of the channel fading. The simulation results show that turbo-codes provide tremendous gain over uncoded transmission in presence of Nakagami fading
{"title":"Performance of Turbo-Codes on Nakagami Flat Fading (Radio) Transmission Channels","authors":"H. Balta, M. Kovaci, A. de Baynast","doi":"10.1109/ACSSC.2005.1599821","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599821","url":null,"abstract":"In this paper, we analyze the performance in terms of bit error rate and frame error rate of a turbo-coded system over Nakagami frequency-nonselective (flat) fading multipaths channels. First, an efficient method to generate uncorrelated Nakagami-m fading samples is proposed. Through the parameter m, the Nakagami distribution accurately model signal fading conditions that range from severe to moderate. The primary justification for the use of the Nakagami-m distribution is its good fit to empirical fading data. Second, we modify calculation of the channel log likelihood ratios at the input of the decoder in order to take into account the Nakagami distribution of the channel fading. The simulation results show that turbo-codes provide tremendous gain over uncoded transmission in presence of Nakagami fading","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":"2005-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629718","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 : 2005-11-01DOI: 10.1109/ACSSC.2005.1600024
M. F. Duarte, S. Sarvotham, D. Baron, M. Wakin, Richard Baraniuk
Compressed sensing is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for recon- struction. In this paper we expand our theory for distributed compressed sensing (DCS) that enables new distributed cod- ing algorithms for multi-signal ensembles that exploit both intra- and inter-signal correlation structures. The DCS the- ory rests on a new concept that we term the joint sparsity of a signal ensemble. We present a second new model for jointly sparse signals that allows for joint recovery of multi- ple signals from incoherent projections through simultane- ous greedy pursuit algorithms. We also characterize theo- retically and empirically the number of measurements per sensor required for accurate reconstruction.
{"title":"Distributed Compressed Sensing of Jointly Sparse Signals","authors":"M. F. Duarte, S. Sarvotham, D. Baron, M. Wakin, Richard Baraniuk","doi":"10.1109/ACSSC.2005.1600024","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600024","url":null,"abstract":"Compressed sensing is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for recon- struction. In this paper we expand our theory for distributed compressed sensing (DCS) that enables new distributed cod- ing algorithms for multi-signal ensembles that exploit both intra- and inter-signal correlation structures. The DCS the- ory rests on a new concept that we term the joint sparsity of a signal ensemble. We present a second new model for jointly sparse signals that allows for joint recovery of multi- ple signals from incoherent projections through simultane- ous greedy pursuit algorithms. We also characterize theo- retically and empirically the number of measurements per sensor required for accurate reconstruction.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133179665","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
扫码关注我们
求助内容：
应助结果提醒方式：