Pub Date : 2014-06-22DOI: 10.1109/SPAWC.2014.6941584
Kapil M. Borle, Fangfang Zhu, Yu Zhao, Biao Chen
This paper describes a simple software radio design approach to communication and spectrum access in a system without user coordination. The work is a result of our recent participation in the DARPA Spectrum Challenge that provides a venue for head-to-head competitions of software radio designs from teams around the country. Two modes of operations are involved, one is competitive and the other cooperative; each mode calls for completely different way of dealing with interference incurred amongst transceiver pairs. Several signal processing issues encountered in the software radio design are described along with their solutions. In addition, we provide our own observations on potential research issues for communication and spectrum access in a congested and uncoordinated environment.
{"title":"A software radio design for communications in uncoordinated networks","authors":"Kapil M. Borle, Fangfang Zhu, Yu Zhao, Biao Chen","doi":"10.1109/SPAWC.2014.6941584","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941584","url":null,"abstract":"This paper describes a simple software radio design approach to communication and spectrum access in a system without user coordination. The work is a result of our recent participation in the DARPA Spectrum Challenge that provides a venue for head-to-head competitions of software radio designs from teams around the country. Two modes of operations are involved, one is competitive and the other cooperative; each mode calls for completely different way of dealing with interference incurred amongst transceiver pairs. Several signal processing issues encountered in the software radio design are described along with their solutions. In addition, we provide our own observations on potential research issues for communication and spectrum access in a congested and uncoordinated environment.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117155497","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941914
H. Abdulkader, B. Benammar, C. Poulliat, M. Boucheret, N. Thomas
This paper proposes neural networks-based turbo equalization (TEQ) applied to a non linear channel. Based on a Volterra model of the satellite non linear communication channel, we derive a soft input soft output (SISO) radial basis function (RBF) equalizer that can be used in an iterative equalization in order to improve the system performance. In particular, it is shown that the RBF-based TEQ is able to achieve its matched filter bound (MFB) within few iterations. The paper also proposes a blind implementation of the TEQ using a multilayer perceptron (MLP) as an adaptive model of the nonlinear channel. Asymptotic analysis as well as reduced complexity implementations are also presented and discussed.
{"title":"Neural networks-based turbo equalization of a satellite communication channel","authors":"H. Abdulkader, B. Benammar, C. Poulliat, M. Boucheret, N. Thomas","doi":"10.1109/SPAWC.2014.6941914","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941914","url":null,"abstract":"This paper proposes neural networks-based turbo equalization (TEQ) applied to a non linear channel. Based on a Volterra model of the satellite non linear communication channel, we derive a soft input soft output (SISO) radial basis function (RBF) equalizer that can be used in an iterative equalization in order to improve the system performance. In particular, it is shown that the RBF-based TEQ is able to achieve its matched filter bound (MFB) within few iterations. The paper also proposes a blind implementation of the TEQ using a multilayer perceptron (MLP) as an adaptive model of the nonlinear channel. Asymptotic analysis as well as reduced complexity implementations are also presented and discussed.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124964168","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941357
Weiliang Zuo, J. Xin, Guangmin Wang, Jiasong Wang, Nanning Zheng, A. Sano
In this paper, we consider the source localization for the multiple near-field narrowband signals impinging on a uniform linear array (ULA) with partly gain and phase uncertainties. By dividing the ULA into two overlapped symmetric subarrays and assuming that they have partly unknown gain and phase responses but correspondingly identical, a new modified generalized ESPRIT based method is presented, in which the direction of arrival (DOA) and range are estimated separately. Moreover, we prove that the proposed method is equivalent to the spectral Fresnel-region rank reduction (FR-RARE) [15] method, but more computationally efficient than it. The simulations demonstrate the effectiveness of the proposed method.
{"title":"Near-field source localization with partly sensor gain and phase uncertainties","authors":"Weiliang Zuo, J. Xin, Guangmin Wang, Jiasong Wang, Nanning Zheng, A. Sano","doi":"10.1109/SPAWC.2014.6941357","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941357","url":null,"abstract":"In this paper, we consider the source localization for the multiple near-field narrowband signals impinging on a uniform linear array (ULA) with partly gain and phase uncertainties. By dividing the ULA into two overlapped symmetric subarrays and assuming that they have partly unknown gain and phase responses but correspondingly identical, a new modified generalized ESPRIT based method is presented, in which the direction of arrival (DOA) and range are estimated separately. Moreover, we prove that the proposed method is equivalent to the spectral Fresnel-region rank reduction (FR-RARE) [15] method, but more computationally efficient than it. The simulations demonstrate the effectiveness of the proposed method.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126902297","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941323
Arash Shahmansoori, Rafael Montalban, G. Seco-Granados
A key aspect to design an OFDM system for combined positioning and high-data-rate communications is to find optimal data and pilot power allocations. Previous work has investigated the capacity maximizing design taking into account the effects of channel and time-delay estimation for finite number of subcarriers and channel taps. In this paper, we propose a method based on the asymptotic expected Cramér-Rao bound of joint time-delay and channel coefficients that reduces the complexity of the bounds by increasing the number of subcarriers or channel taps for data and pilot power allocations design. Specifically, for long channels a general form of matrix inversion, which is computationally complex, is converted to only the inversion at strong eigenvalues or pilots. Numerical results show that as the number of subcarriers increases, the non-asymptotic bounds converge to the asymptotic bounds at a fast speed. Moreover, even for a finite number of subcarriers or channel taps the difference between joint data and pilot power allocations is negligible compared to the non-asymptotic expected Cramér-Rao bounds.
{"title":"Optimal OFDM pilot sequences for time-delay and channel estimation based on the expected CRB for a large number of subcarriers","authors":"Arash Shahmansoori, Rafael Montalban, G. Seco-Granados","doi":"10.1109/SPAWC.2014.6941323","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941323","url":null,"abstract":"A key aspect to design an OFDM system for combined positioning and high-data-rate communications is to find optimal data and pilot power allocations. Previous work has investigated the capacity maximizing design taking into account the effects of channel and time-delay estimation for finite number of subcarriers and channel taps. In this paper, we propose a method based on the asymptotic expected Cramér-Rao bound of joint time-delay and channel coefficients that reduces the complexity of the bounds by increasing the number of subcarriers or channel taps for data and pilot power allocations design. Specifically, for long channels a general form of matrix inversion, which is computationally complex, is converted to only the inversion at strong eigenvalues or pilots. Numerical results show that as the number of subcarriers increases, the non-asymptotic bounds converge to the asymptotic bounds at a fast speed. Moreover, even for a finite number of subcarriers or channel taps the difference between joint data and pilot power allocations is negligible compared to the non-asymptotic expected Cramér-Rao bounds.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116611828","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941316
Mirsad Cirkic, E. Larsson
This work discusses efficient techniques for detection in large-dimension multi-user multiple-input multiple-output (MIMO) systems that are highly overdetermined. We exemplify the application of conjugate gradient methods in the setup of our interest and compare its performance with respect to methods based on the Neumann series expansion. We also bring to light some important insights on the performance versus complexity tradeoffs that have not been uplifted before.
{"title":"On the complexity of very large multi-user MIMO detection","authors":"Mirsad Cirkic, E. Larsson","doi":"10.1109/SPAWC.2014.6941316","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941316","url":null,"abstract":"This work discusses efficient techniques for detection in large-dimension multi-user multiple-input multiple-output (MIMO) systems that are highly overdetermined. We exemplify the application of conjugate gradient methods in the setup of our interest and compare its performance with respect to methods based on the Neumann series expansion. We also bring to light some important insights on the performance versus complexity tradeoffs that have not been uplifted before.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124068333","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941651
J. Rubio, A. Pascual-Iserte, Jaume del Olmo Alos, J. Vidal
In this paper, we present a procedure for switching on and off base stations (BSs) that are powered with solar panels and have finite batteries. In the scenario under consideration it is considered that the BSs are placed at the same site with fully overlapped coverage areas and using different frequencies. We propose a decision strategy where we assume perfect knowledge of the traffic profile and a second approach where a robust Bayesian strategy is considered in order to account for possible error modeling in the traffic profile information.
{"title":"Dynamic base station switch on/off strategies for sustainable wireless networks","authors":"J. Rubio, A. Pascual-Iserte, Jaume del Olmo Alos, J. Vidal","doi":"10.1109/SPAWC.2014.6941651","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941651","url":null,"abstract":"In this paper, we present a procedure for switching on and off base stations (BSs) that are powered with solar panels and have finite batteries. In the scenario under consideration it is considered that the BSs are placed at the same site with fully overlapped coverage areas and using different frequencies. We propose a decision strategy where we assume perfect knowledge of the traffic profile and a second approach where a robust Bayesian strategy is considered in order to account for possible error modeling in the traffic profile information.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314922","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941327
M. Živković, R. Mathar
The optimization of wireless orthogonal frequency division multiplexing (OFDM) systems is based on the knowledge of the signal-to-noise ratio (SNR). Most of the existing methods for the SNR estimation operates in the frequency-domain and assumes perfect carrier frequency offset (CFO) synchronization. However, it has been shown that in real systems in the presence of the residual CFO this estimators are prone to performance degradation. This problem can be avoided by estimating the SNR in the time-domain. In this paper, a novel low-complexity time-domain SNR estimator based on time periodic Zadoff-Chu (ZC) sequence, named TDZCE, is proposed. When applied to the time periodic synchronization preamble, commonly used in packed based OFDM systems, the special property of a ZC sequence preserves the considered comb-type structure both in the frequency and time-domain. This allows for easy adaptation of previously proposed moment-based SNR estimator to be applied to the time-domain samples. The TDZCE outperforms the existing time-domain SNR estimators in frequency-flat channels in the presence of the CFO, and approaches the Cramer-Rao bound (CRB) as the number of periodic parts of the proposed preamble increases. Additionally, it offers considerable computational savings compared to the existing time-domain SNR estimators.
{"title":"Zadoff-Chu sequence based time-domain SNR estimation for OFDM systems","authors":"M. Živković, R. Mathar","doi":"10.1109/SPAWC.2014.6941327","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941327","url":null,"abstract":"The optimization of wireless orthogonal frequency division multiplexing (OFDM) systems is based on the knowledge of the signal-to-noise ratio (SNR). Most of the existing methods for the SNR estimation operates in the frequency-domain and assumes perfect carrier frequency offset (CFO) synchronization. However, it has been shown that in real systems in the presence of the residual CFO this estimators are prone to performance degradation. This problem can be avoided by estimating the SNR in the time-domain. In this paper, a novel low-complexity time-domain SNR estimator based on time periodic Zadoff-Chu (ZC) sequence, named TDZCE, is proposed. When applied to the time periodic synchronization preamble, commonly used in packed based OFDM systems, the special property of a ZC sequence preserves the considered comb-type structure both in the frequency and time-domain. This allows for easy adaptation of previously proposed moment-based SNR estimator to be applied to the time-domain samples. The TDZCE outperforms the existing time-domain SNR estimators in frequency-flat channels in the presence of the CFO, and approaches the Cramer-Rao bound (CRB) as the number of periodic parts of the proposed preamble increases. Additionally, it offers considerable computational savings compared to the existing time-domain SNR estimators.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132635859","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941695
Maximilian Riemensberger, Lennart Gerdes, W. Utschick
We discuss noisy network coding bounds on the capacity region of Gaussian multiple access relay networks. These networks feature a single destination node and multiple nodes that can be either sources or relays or both. We show that simple inner and outer bounds on the capacity region obtained from noisy network coding exhibit a submodular structure and differ only in a constant, which is independent of the channel parameters and grows linearly only in the number of dedicated relay nodes. This tightens previous results where the gap grows linear in the total network size. Furthermore, the combination of submodularity with convexity of the bound expressions with respect to the optimal quantization noise parameters leads to an efficient characterization of a noisy network coding achievable rate region for multiple access relay networks via Lagrangian duality.
{"title":"Submodular structure and optimal quantization in Gaussian multiple access relay networks","authors":"Maximilian Riemensberger, Lennart Gerdes, W. Utschick","doi":"10.1109/SPAWC.2014.6941695","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941695","url":null,"abstract":"We discuss noisy network coding bounds on the capacity region of Gaussian multiple access relay networks. These networks feature a single destination node and multiple nodes that can be either sources or relays or both. We show that simple inner and outer bounds on the capacity region obtained from noisy network coding exhibit a submodular structure and differ only in a constant, which is independent of the channel parameters and grows linearly only in the number of dedicated relay nodes. This tightens previous results where the gap grows linear in the total network size. Furthermore, the combination of submodularity with convexity of the bound expressions with respect to the optimal quantization noise parameters leads to an efficient characterization of a noisy network coding achievable rate region for multiple access relay networks via Lagrangian duality.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115422522","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941331
H. Deng, A. Sayeed
Millimeter-wave (mm-wave) communication systems operating between 30GHz and 300GHz are emerging as a promising technology for meeting the exploding bandwidth requirements of future wireless systems. In addition to large bandwidths, mm-wave systems afford high-dimensional multiple input multiple output (MIMO) operation with relatively compact arrays, and the corresponding narrow spatial beams make beamspace MIMO communication particular attractive. An important implication is that while the ambient spatial dimension is high, mm-wave MIMO channels exhibit a low-rank structure that is manifested in the sparsity of the beamspace MIMO channel matrix. In this paper, we develop a model for sparse mm-wave MIMO channels and propose an approach to mobile station (MS) localization that exploits changes in statistics of the sparse beamspace channel matrix as a function of the MS position. Unlike most existing methods, line-of-sight (LoS) propagation is not mandatory and the proposed approach benefits from the information provided by non-line-of-sight (NLoS) paths. Beamspace sparsity is exploited for developing a low-dimensional maximum-likelihood (ML) classifier that delivers near-optimal performance with dramatically reduced complexity compared to conventional designs. Numerical results illustrate the impact of the physical environment, grid-resolution, and MIMO dimensions on localization performance.
{"title":"Mm-wave MIMO channel modeling and user localization using sparse beamspace signatures","authors":"H. Deng, A. Sayeed","doi":"10.1109/SPAWC.2014.6941331","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941331","url":null,"abstract":"Millimeter-wave (mm-wave) communication systems operating between 30GHz and 300GHz are emerging as a promising technology for meeting the exploding bandwidth requirements of future wireless systems. In addition to large bandwidths, mm-wave systems afford high-dimensional multiple input multiple output (MIMO) operation with relatively compact arrays, and the corresponding narrow spatial beams make beamspace MIMO communication particular attractive. An important implication is that while the ambient spatial dimension is high, mm-wave MIMO channels exhibit a low-rank structure that is manifested in the sparsity of the beamspace MIMO channel matrix. In this paper, we develop a model for sparse mm-wave MIMO channels and propose an approach to mobile station (MS) localization that exploits changes in statistics of the sparse beamspace channel matrix as a function of the MS position. Unlike most existing methods, line-of-sight (LoS) propagation is not mandatory and the proposed approach benefits from the information provided by non-line-of-sight (NLoS) paths. Beamspace sparsity is exploited for developing a low-dimensional maximum-likelihood (ML) classifier that delivers near-optimal performance with dramatically reduced complexity compared to conventional designs. Numerical results illustrate the impact of the physical environment, grid-resolution, and MIMO dimensions on localization performance.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"36 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176629","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 : 2014-06-22DOI: 10.1109/SPAWC.2014.6941477
L. Landau, G. Fettweis
The present paper deals with a bandlimited signal which is sampled with 1-bit precision at the receiver. The sampling rate is assumed to be an arbitrary integer multiple of the symbol rate. Assuming a scenario with additive Gaussian noise, pulse shaping filter and receive filter, the setup corresponds to a discrete channel with memory. The achievable rate is investigated by providing upper and lower bounds, where the latter correspond to different receiver principles. The numerical evaluation shows significant differences in the quality of the bounds. The results are valuable to evaluate system performance which confirm that oversampling with 1-bit precision is beneficial in terms of the achievable rate.
{"title":"Information rates employing 1-bit quantization and oversampling at the receiver","authors":"L. Landau, G. Fettweis","doi":"10.1109/SPAWC.2014.6941477","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941477","url":null,"abstract":"The present paper deals with a bandlimited signal which is sampled with 1-bit precision at the receiver. The sampling rate is assumed to be an arbitrary integer multiple of the symbol rate. Assuming a scenario with additive Gaussian noise, pulse shaping filter and receive filter, the setup corresponds to a discrete channel with memory. The achievable rate is investigated by providing upper and lower bounds, where the latter correspond to different receiver principles. The numerical evaluation shows significant differences in the quality of the bounds. The results are valuable to evaluate system performance which confirm that oversampling with 1-bit precision is beneficial in terms of the achievable rate.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2673 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652179","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
扫码关注我们
求助内容：
应助结果提醒方式：