Pub Date : 2011-06-26DOI: 10.1109/SPAWC.2011.5990417
M. Jar, E. Bouton, C. Schlegel
In this paper, the performance of a jointly Gaussian approach (JGA) as a detection method for Single Carrier Frequency Division Multiple Access (SC-FDMA) is analyzed. Combined with an iterative detector, the JGA can efficiently remove residual interference by exchanging extrinsic log-likelihood ratios (LLRs) with a successive error control decoder. At the cost of a moderate increase in complexity, this system can significantly enhance overall performance. Monte Carlo simulations are used to illustrate the gains in terms of bit error rates (BER) of the JGA over traditional non-iterative equalization methods, as well as the throughput gains for the uplink-scenario of the long-term evolution (LTE) standard.
{"title":"Frequency domain iterative equalization for single-carrier FDMA","authors":"M. Jar, E. Bouton, C. Schlegel","doi":"10.1109/SPAWC.2011.5990417","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990417","url":null,"abstract":"In this paper, the performance of a jointly Gaussian approach (JGA) as a detection method for Single Carrier Frequency Division Multiple Access (SC-FDMA) is analyzed. Combined with an iterative detector, the JGA can efficiently remove residual interference by exchanging extrinsic log-likelihood ratios (LLRs) with a successive error control decoder. At the cost of a moderate increase in complexity, this system can significantly enhance overall performance. Monte Carlo simulations are used to illustrate the gains in terms of bit error rates (BER) of the JGA over traditional non-iterative equalization methods, as well as the throughput gains for the uplink-scenario of the long-term evolution (LTE) standard.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"20 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120867746","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990380
S. S. Pereira, A. Pagès-Zamora
In this paper we study the convergence of consensus algorithms in wireless sensor networks with random topologies and instantaneous symmetric links which exist with different probabilities independently in time but correlated in space. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive a closed-form expression, and propose a general formulation for the spatial correlation among the links that allows us to compute the optimum parameters ensuring almost sure convergence. We show that our general formulation can be particularized for existing protocols found in literature, and derive additionally closed-form expressions for the optimal parameters in two particular cases of equal probability of connection for all the links.
{"title":"Consensus in random WSNs with correlated symmetric links","authors":"S. S. Pereira, A. Pagès-Zamora","doi":"10.1109/SPAWC.2011.5990380","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990380","url":null,"abstract":"In this paper we study the convergence of consensus algorithms in wireless sensor networks with random topologies and instantaneous symmetric links which exist with different probabilities independently in time but correlated in space. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive a closed-form expression, and propose a general formulation for the spatial correlation among the links that allows us to compute the optimum parameters ensuring almost sure convergence. We show that our general formulation can be particularized for existing protocols found in literature, and derive additionally closed-form expressions for the optimal parameters in two particular cases of equal probability of connection for all the links.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243643","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990476
Xiao Li, Yonina C. Eldar, A. Scaglione
In this paper, a low complexity algorithm for GPS signal acquisition is proposed. It is shown that the samples acquired by a bank of much fewer correlators suffice to detect the GPS signals in contrast to that in existing GPS acquisition algorithms. Our acquisition scheme is based on the recently developed analog compressed sensing framework and employs compressive multichannel correlators as the matched filters, which allows to identify the strongest satellite signals in the field of view and pinpoint the correct code-phase and Doppler shifts for acquisition.
{"title":"Low complexity acquisition of GPS signals","authors":"Xiao Li, Yonina C. Eldar, A. Scaglione","doi":"10.1109/SPAWC.2011.5990476","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990476","url":null,"abstract":"In this paper, a low complexity algorithm for GPS signal acquisition is proposed. It is shown that the samples acquired by a bank of much fewer correlators suffice to detect the GPS signals in contrast to that in existing GPS acquisition algorithms. Our acquisition scheme is based on the recently developed analog compressed sensing framework and employs compressive multichannel correlators as the matched filters, which allows to identify the strongest satellite signals in the field of view and pinpoint the correct code-phase and Doppler shifts for acquisition.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128981168","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990421
Zachary Chance, Mayur Agrawal, D. Love, V. Balakrishnan
In recent years, hybrid-automatic repeat request (ARQ) protocol has become one of the most popular packet transmission schemes. Hybrid-ARQ aims to combine the advantages of forward error correction codes with the traditional ARQ scheme to increase the reliability and throughput of the network. In this paper, we look at improving upon this performance for block fading channels (e.g., Rayleigh, Rician, etc.) by using feedback information from the destination; in particular, using a turbo code [1] in conjunction with a proposed linear feedback code under additive white Gaussian noise. The scheme is developed for the general case of multiple antennas at both the transmitter and receiver, and is analyzed for varying amounts of feedback information sent from the destination to the source. Simulations are presented to illustrate the gains in throughput offered by the proposed scheme over the existing ones.
{"title":"A hybrid-ARQ protocol using channel output feedback","authors":"Zachary Chance, Mayur Agrawal, D. Love, V. Balakrishnan","doi":"10.1109/SPAWC.2011.5990421","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990421","url":null,"abstract":"In recent years, hybrid-automatic repeat request (ARQ) protocol has become one of the most popular packet transmission schemes. Hybrid-ARQ aims to combine the advantages of forward error correction codes with the traditional ARQ scheme to increase the reliability and throughput of the network. In this paper, we look at improving upon this performance for block fading channels (e.g., Rayleigh, Rician, etc.) by using feedback information from the destination; in particular, using a turbo code [1] in conjunction with a proposed linear feedback code under additive white Gaussian noise. The scheme is developed for the general case of multiple antennas at both the transmitter and receiver, and is analyzed for varying amounts of feedback information sent from the destination to the source. Simulations are presented to illustrate the gains in throughput offered by the proposed scheme over the existing ones.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120955523","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990430
L. G. Ordóñez, D. Palomar, J. Fonollosa
The diversity and multiplexing tradeoff (DMT) has been extensively applied in the literature to compare the high-SNR outage performance of relaying techniques and to propose new design guidelines. The problem with this approach is that the DMT provides only a coarse measure of performance and, hence, it is more convenient to adopt the diversity, multiplexing, and array gain (DMA) framework, in which the error probability is characterized by two parameters: the diversity gain (associated with the SNR exponent) and the array gain (related to the SNR offset). In this paper, we derive the DMA tradeoff associated with the cut-set bound outage probability of the static half-duplex MIMO relay under uncorrelated/semicorrelated Rayleigh fading and uncorrelated Rician fading. This provides an upper bound to the DMA tradeoff achievable by any relaying scheme.
{"title":"DMA tradeoff for the MIMO static half-duplex relay","authors":"L. G. Ordóñez, D. Palomar, J. Fonollosa","doi":"10.1109/SPAWC.2011.5990430","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990430","url":null,"abstract":"The diversity and multiplexing tradeoff (DMT) has been extensively applied in the literature to compare the high-SNR outage performance of relaying techniques and to propose new design guidelines. The problem with this approach is that the DMT provides only a coarse measure of performance and, hence, it is more convenient to adopt the diversity, multiplexing, and array gain (DMA) framework, in which the error probability is characterized by two parameters: the diversity gain (associated with the SNR exponent) and the array gain (related to the SNR offset). In this paper, we derive the DMA tradeoff associated with the cut-set bound outage probability of the static half-duplex MIMO relay under uncorrelated/semicorrelated Rayleigh fading and uncorrelated Rician fading. This provides an upper bound to the DMA tradeoff achievable by any relaying scheme.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126272712","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990446
Jitendra Tugnait
Recently several time-domain approaches relying on the generalized likelihood ratio test (GLRT) paradigm have been proposed for multiple antenna spectrum sensing in cognitive radios. These approaches are suitable for flat-fading channels in white noise with equal noise variances across antennas; knowledge of the noise variance is not required, unlike the energy detector. In this paper we investigate a method based on analysis of the multivariate power spectral density (PSD) of the received multiantenna signal. Our proposed approach is also based on GLRT and flat-fading channels, but it allows the noise variances to be different at different antennas without requiring knowledge of their values. A performance analysis of the proposed detector is carried out. Simulation examples are provided in support of the proposed approach.
{"title":"Multiple antenna spectrum sensing for cognitive radios in unknown noise","authors":"Jitendra Tugnait","doi":"10.1109/SPAWC.2011.5990446","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990446","url":null,"abstract":"Recently several time-domain approaches relying on the generalized likelihood ratio test (GLRT) paradigm have been proposed for multiple antenna spectrum sensing in cognitive radios. These approaches are suitable for flat-fading channels in white noise with equal noise variances across antennas; knowledge of the noise variance is not required, unlike the energy detector. In this paper we investigate a method based on analysis of the multivariate power spectral density (PSD) of the received multiantenna signal. Our proposed approach is also based on GLRT and flat-fading channels, but it allows the noise variances to be different at different antennas without requiring knowledge of their values. A performance analysis of the proposed detector is carried out. Simulation examples are provided in support of the proposed approach.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131960742","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990434
R. F. Wyrembelski, H. Boche
Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we assume multiple transmit and receive antennas and consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept completely secret from the other, non-intended node. This is the MIMO Gaussian bidirectional broadcast channel with confidential messages for which we establish the secrecy capacity region.
{"title":"Secrecy in MIMO Gaussian bidirectional broadcast channels","authors":"R. F. Wyrembelski, H. Boche","doi":"10.1109/SPAWC.2011.5990434","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990434","url":null,"abstract":"Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we assume multiple transmit and receive antennas and consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept completely secret from the other, non-intended node. This is the MIMO Gaussian bidirectional broadcast channel with confidential messages for which we establish the secrecy capacity region.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"393 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347404","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990472
J. Hoydis, A. Kammoun, J. Najim, M. Debbah
We consider a general class of Rician fading multiple-input multiple-output (MIMO) channels, modeled by a random, non-centered channel matrix with a variance profile, i.e., the independent elements of the matrix are allowed to have each a different mean and variance. This channel model is motivated by the recent interest in cooperative small-cell systems where several densely deployed base stations (BSs) cooperatively serve multiple user terminals (UTs). We study the fluctuations of the mutual information of this channel under the form of a central limit theorem (CLT) and provide an explicit expression of the asymptotic variance. The result can be used to compute an approximation of the outage probability of such channels. Although the derived expressions are only tight in the large system limit, we show by simulations that they provide very accurate approximations for realistic system dimensions.
{"title":"Outage performance of cooperative small-cell systems under Rician fading channels","authors":"J. Hoydis, A. Kammoun, J. Najim, M. Debbah","doi":"10.1109/SPAWC.2011.5990472","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990472","url":null,"abstract":"We consider a general class of Rician fading multiple-input multiple-output (MIMO) channels, modeled by a random, non-centered channel matrix with a variance profile, i.e., the independent elements of the matrix are allowed to have each a different mean and variance. This channel model is motivated by the recent interest in cooperative small-cell systems where several densely deployed base stations (BSs) cooperatively serve multiple user terminals (UTs). We study the fluctuations of the mutual information of this channel under the form of a central limit theorem (CLT) and provide an explicit expression of the asymptotic variance. The result can be used to compute an approximation of the outage probability of such channels. Although the derived expressions are only tight in the large system limit, we show by simulations that they provide very accurate approximations for realistic system dimensions.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985842","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990334
D. D. Ariananda, G. Leus
Compressive sampling (CS) is famous for its ability to perfectly reconstruct a sparse signal based on a limited number of measurements. In some applications, such as in spectrum sensing for cognitive radio, perfect signal reconstruction is not really needed. Instead, only statistical measures such as the power spectrum or equivalently the auto-correlation sequence are required. In this paper, we introduce a new approach for reconstructing the power spectrum based on samples produced by sub-Nyquist rate sampling. Depending on the compression rate, the entire problem can be presented as either under-determined or over-determined. In this paper, we mainly focus on the over-determined case, which allows us to employ a simple least-squares (LS) reconstruction method. We show under which conditions this LS reconstruction method yields a unique solution, without including any sparsity constraints.
{"title":"Wideband power spectrum sensing using sub-Nyquist sampling","authors":"D. D. Ariananda, G. Leus","doi":"10.1109/SPAWC.2011.5990334","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990334","url":null,"abstract":"Compressive sampling (CS) is famous for its ability to perfectly reconstruct a sparse signal based on a limited number of measurements. In some applications, such as in spectrum sensing for cognitive radio, perfect signal reconstruction is not really needed. Instead, only statistical measures such as the power spectrum or equivalently the auto-correlation sequence are required. In this paper, we introduce a new approach for reconstructing the power spectrum based on samples produced by sub-Nyquist rate sampling. Depending on the compression rate, the entire problem can be presented as either under-determined or over-determined. In this paper, we mainly focus on the over-determined case, which allows us to employ a simple least-squares (LS) reconstruction method. We show under which conditions this LS reconstruction method yields a unique solution, without including any sparsity constraints.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132658340","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 : 2011-06-26DOI: 10.1109/SPAWC.2011.5990399
A. A. Kumar, A. Makur
Decoding of real BCH DFT (RBDFT) codes is considered in this paper. RBDFT codes find applications in several areas. Though the generator matrix of RBDFT codes is real, the parity check matrix is still complex, because of which complex arithmetic operations are necessary at the decoder. But for a real message vector, the syndromes of RBDFT code preserve Hermitian symmetry. This Hermitian symmetric structure is exploited and a new alternative subspace based formulation is proposed in this paper. The performance of the proposed formulation is identical to the current state-of-art RBDFT decoding algorithm, while it requires only real arithmetic operations. Simulation results are provided which demonstrates the reduction in the decoding complexity with no degradation in the performance.
{"title":"A lowcomplexity subspace based decoding algorithm for real BCH DFT codes","authors":"A. A. Kumar, A. Makur","doi":"10.1109/SPAWC.2011.5990399","DOIUrl":"https://doi.org/10.1109/SPAWC.2011.5990399","url":null,"abstract":"Decoding of real BCH DFT (RBDFT) codes is considered in this paper. RBDFT codes find applications in several areas. Though the generator matrix of RBDFT codes is real, the parity check matrix is still complex, because of which complex arithmetic operations are necessary at the decoder. But for a real message vector, the syndromes of RBDFT code preserve Hermitian symmetry. This Hermitian symmetric structure is exploited and a new alternative subspace based formulation is proposed in this paper. The performance of the proposed formulation is identical to the current state-of-art RBDFT decoding algorithm, while it requires only real arithmetic operations. Simulation results are provided which demonstrates the reduction in the decoding complexity with no degradation in the performance.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114923904","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
扫码关注我们
求助内容：
应助结果提醒方式：