2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)最新文献

筛选
英文 中文
Fastest-known near-ML decoding of golden codes 已知最快的接近ml解码黄金密码
S. Kundu, Shubham Chamadia, D. Pados, S. Batalama
{"title":"Fastest-known near-ML decoding of golden codes","authors":"S. Kundu, Shubham Chamadia, D. Pados, S. Batalama","doi":"10.1109/SPAWC.2014.6941455","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941455","url":null,"abstract":"We present a reliability-based near-maximum-likelihood (near-ML) decoder of Golden code with significantly reduced average decoding complexity over the current state of the art We first pre-process the received signal via zero-forcing (ZF) filtering and compute symbol reliabilities at the filter output Reliable symbols are directly decoded and removed from the received signal. The remaining symbols are decoded by reduced-dimension ML or near-ML decoding. Computational studies included herein reveal extensive complexity savings when compared with state-of-the art ML and near-ML decoders for the Golden code. For instance, for the 16-QAM signal constellation at pre-detection signal-to-noise ratio of 28dB that corresponds to bit-error-rate of about 10-4, the presented algorithm achieves more than 96.6% average-complexity savings, while maintaining indistinguishable to ML performance.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"20 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":"130327325","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}
引用次数: 2
Modulation and Coding Classification for Adaptive Power Control in 5G Cognitive Communications 5G认知通信中自适应功率控制的调制与编码分类
Anestis Tsakmalis, S. Chatzinotas, B. Ottersten
{"title":"Modulation and Coding Classification for Adaptive Power Control in 5G Cognitive Communications","authors":"Anestis Tsakmalis, S. Chatzinotas, B. Ottersten","doi":"10.1109/SPAWC.2014.6941505","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941505","url":null,"abstract":"A key concept suggested for 5G networks is spectrum sharing within the context of Cognitive Communications (CC). This efficient spectrum usage has been explored intensively the last years. In this paper, a mechanism is proposed to allow a cognitive user, also called Secondary User (SU), to access the frequency band of a Primary User (PU) operating based on an Adaptive Coding and Modulation (ACM) protocol. The Spectrum Sensing (SS) technique used considers Higher Order Statistical (HOS) features of the signal and log-likelihood ratios (LLRs) of the code syndromes in order to constantly monitor the modulation and coding scheme (MODCOD) of the PU respectively. Once the Modulation and Coding Classification (MCC) is completed, a Power Control (PC) scheme is enabled. The SU can attempt to access the frequency band of the PU and increase its transmitting power until it causes a change of the PU's transmission scheme due to interference. When the SU detects the change of the PU's MODCOD, then it reduces its transmitting power to a lower level so as to regulate the induced interference. The proposed blind Adaptive Power Control (APC) algorithm converges without any interference channel information to the aforementioned interference limit and guarantees the preservation of the PU link throughput.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"51 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":"117155820","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}
引用次数: 35
Energy efficiency analysis of rank-1 Ricean fading MIMO channels 1级稻米衰落MIMO信道的能量效率分析
Jingya Li, M. Matthaiou, Shi Jin, T. Svensson
{"title":"Energy efficiency analysis of rank-1 Ricean fading MIMO channels","authors":"Jingya Li, M. Matthaiou, Shi Jin, T. Svensson","doi":"10.1109/SPAWC.2014.6941742","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941742","url":null,"abstract":"This paper studies the energy efficiency (EE) of a point-to-point rank-1 Ricean fading multiple-input-multiple-output (MIMO) channel. In particular, a tight lower bound and an asymptotic approximation for the EE of the considered MIMO system are presented, under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. Moreover, the effects of different system parameters, namely, transmit power, spectral efficiency (SE), and number of transmit and receive antennas, on the EE are analytically investigated. An important observation is that, in the high signal-to-noise ratio regime and with the other system parameters fixed, the optimal transmit power that maximizes the EE increases as the Ricean-K factor increases. On the contrary, the optimal SE and the optimal number of transmit antennas decrease as K increases.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"67 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":"125106993","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}
引用次数: 4
Power allocation for distortion minimization in distributed estimation with security constraints 带安全约束的分布式估计中失真最小化的功率分配
Xiaoxi Guo, Alex S. C. Leong, S. Dey
{"title":"Power allocation for distortion minimization in distributed estimation with security constraints","authors":"Xiaoxi Guo, Alex S. C. Leong, S. Dey","doi":"10.1109/SPAWC.2014.6941664","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941664","url":null,"abstract":"In this paper we explore the distortion performance of distributed estimation schemes in wireless sensor networks (WSNs) in the presence of an eavesdropper. The sensors use an uncoded amplify and forward scheme to transmit their observations to the fusion center (FC), which at the same time can be overheard by the eavesdropper. Both the FC and the eavesdropper reconstruct a minimum mean squared error (MMSE) estimate of the physical quantity observed. In this paper, we address the problem of transmit power allocation for system performance optimization subject to a total average power constraint on the sensors and a security constraint on the eavesdropper. In the case of full channel state information (CSI) the proposed scheme allows the sensors to adapt their transmission strategy based on the instantaneous channel gains of both the FC and the eavesdropper. In the partial CSI case, transmit power is allocated only according to the FC instantaneous channel gains and statistical channel gains of the eavesdropper. Numerical results illustrate the performance of the power allocation algorithms.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"25 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":"125746109","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}
引用次数: 4
Beamspace MIMO prototype for low-complexity Gigabit/s wireless communication 波束空间MIMO原型低复杂性千兆/秒无线通信
J. Brady, P. Thomas, Dave Virgilio, A. Sayeed
{"title":"Beamspace MIMO prototype for low-complexity Gigabit/s wireless communication","authors":"J. Brady, P. Thomas, Dave Virgilio, A. Sayeed","doi":"10.1109/SPAWC.2014.6941332","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941332","url":null,"abstract":"The rapid proliferation of data hungry devices is creating a bandwidth crisis, with aggregate data rates expected to increase 1000 fold by 2020. Millimeter-wave (mm-wave) systems, operating in the 30-300GHz band, are poised to meet this exploding demand through large bandwidths and high-dimensional MIMO operation. However traditional MIMO techniques result in prohibitively high-complexity transceivers. In this paper, we report initial results on a Continuous Aperture Phase MIMO (CAP-MIMO) prototype that uses a discrete lens array (DLA) for analog spatial beamforming to reduce complexity. The CAP-MIMO prototype is based on the theory of beamspace MIMO communication - modulating data onto orthogonal spatial beams - to achieve near-optimal performance with the lowest transceiver complexity. We build on previous theoretical and experimental results to construct a prototype CAP-MIMO link at 10GHz for line-of-sight communication and for initial proof-of-concept demonstration. The prototype supports four spatial channels with Gigabits/s data rates.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"99 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":"121295701","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}
引用次数: 9
MIMO soft demodulation via semidefinite relaxation: Efficient dual-scaling implementation and performance analysis 半定松弛的MIMO软解调:高效双标度实现与性能分析
Mahsa Salmani, T. Davidson
{"title":"MIMO soft demodulation via semidefinite relaxation: Efficient dual-scaling implementation and performance analysis","authors":"Mahsa Salmani, T. Davidson","doi":"10.1109/SPAWC.2014.6941313","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941313","url":null,"abstract":"For MIMO systems with binary or QPSK signalling, soft demodulation techniques based on semidefinite relaxation (SDR) offer a desirable balance between performance and computational cost. In this paper we expand on an extension of that approach to systems with higher-order QAM signalling. In particular, we develop a customized dual-scaling algorithm to solve the semidefinite program that constitutes the core computational task of the demodulator, and we evaluate its performance via simulations and using an EXIT chart analysis. In comparison to several state-of-the-art demodulators, the proposed demodulator provides performance that comes close to that of the list sequential (LISS) demodulator, at a computational cost that is close to that of the minimum mean square error (parallel) soft interference cancellation (MMSE-SIC). Furthermore, the distribution of the computational cost is concentrated around its mean.","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":"126893209","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}
引用次数: 0
Achievable SNR and rate regions for OFDM-based asynchronous two-way relay networks 基于ofdm的异步双向中继网络可实现的信噪比和速率区域
J. Mirzaee, S. Shahbazpanahi
{"title":"Achievable SNR and rate regions for OFDM-based asynchronous two-way relay networks","authors":"J. Mirzaee, S. Shahbazpanahi","doi":"10.1109/SPAWC.2014.6941326","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941326","url":null,"abstract":"In this paper, we develop an algorithm to characterize the achievable signal-to-noise ratio (SNR) and rate regions for an asynchronous bi-directional multi-carrier relay network. The network we consider is composed of two single-antenna transceivers and multiple single-antenna relays, thereby creating a multipath communication between the two transceivers. Each subcarrier is used to enable a bidirectional communication between two outer transceivers. In our data model, we assume that different relaying paths have different propagation delays. We aim to find the achievable rate region of such a network through optimal distributed beamforming at the relays and subcarrier power control at two transceivers. To do so, we introduce our optimization framework, analyze its structure, and show how it can be tackled.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"11 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":"126072663","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}
引用次数: 4
Simple switch-based relay selection for amplify-and-forward cooperative diversity on rayleigh fading channels 基于开关的瑞利衰落信道放大转发合作分集的简单中继选择
Y. Chau, M. Al-Harbawi
{"title":"Simple switch-based relay selection for amplify-and-forward cooperative diversity on rayleigh fading channels","authors":"Y. Chau, M. Al-Harbawi","doi":"10.1109/SPAWC.2014.6941641","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941641","url":null,"abstract":"Amplify-and-forward cooperative diversity with simple switch-based relay (SSR) selection is addressed. With the SSR selection, dual-hop relaying is not always used for transmissions. Only when the signal-to-noise ratio (SNR) of the source-to-destination (SD) channel is lower than a preset threshold, the relays are tested one-by-one by comparing their SNR with the threshold. If the SD signal is not satisfied, with the SSR selection scheme, the first relay whose SNR is larger than the threshold is selected and its signal is combined with the SD signal by using maximal-ratio combining (MRC). The SSR selection scheme can save the total processing resource compared to the best-relay selection scheme. For performance evaluation, the bit error probability (BEP) of BPSK on independent and identically distributed (i.i.d.) flat Rayleigh fading channels is derived, and the average number of active relays (ANR) is also obtained. Numerical results are presented for performance illustrations and comparisons.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"111 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":"124110166","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}
引用次数: 5
Joint pairing and power allocation optimization in multichannel MABC-based two-way relaying 基于mabc的多路双向中继联合配对与功率分配优化
Min-Yao Chang, Min Dong, S. Shahbazpanahi
{"title":"Joint pairing and power allocation optimization in multichannel MABC-based two-way relaying","authors":"Min-Yao Chang, Min Dong, S. Shahbazpanahi","doi":"10.1109/SPAWC.2014.6941689","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941689","url":null,"abstract":"We consider two-way amplify-and-forward relaying in a multichannel system with two end nodes and a single relay, using a two-slot multi-access broadcast (MABC) relaying strategy. We investigate the problem of joint subchannel pairing and power allocation to maximize the achievable sum-rate in the network, under an individual power budgets at each node. To solve this challenging joint optimization problem, an iterative approach is proposed to decompose the problem into pairing optimization and joint power allocation optimization, and solve them iteratively. For the joint power allocation at the relay and the two end nodes, we propose another iterative optimization procedure to optimize the power at the two end nodes and at the relay iteratively. By using different forms of optimization parameters, the sum-rate maximization problem turns out to be convex and the optimal solutions can be obtained for each subproblem. The simulation performance demonstrates the gain of joint optimization approach over other pairing-only or power-allocation-only optimization approaches.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"3 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":"128818529","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}
引用次数: 3
Tradeoff analysis of partial zero-forcing beamforming in large random spectrum sharing networks 大型随机频谱共享网络中部分零强迫波束形成的权衡分析
Ran Cai, P. Ching, T. Davidson
{"title":"Tradeoff analysis of partial zero-forcing beamforming in large random spectrum sharing networks","authors":"Ran Cai, P. Ching, T. Davidson","doi":"10.1109/SPAWC.2014.6941320","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941320","url":null,"abstract":"In wireless networks, the availability of multiple transmitting antennas can be exploited in several ways. One way is to reduce the interference to unintended receivers by placing beamforming nulls in those directions, as is done in zero-forcing beamforming. Another is to boost the received signal strength at the desired receiver using “matched” transmit beamforming. This work studies a partial zero-forcing beamforming scheme that combines these two traditional transmission schemes, and examines its performance gain in large random spectrum sharing networks. Specifically, beamforming vectors are designed to null the aggregate interference towards a number of selected primary receivers and to boost the received signal strength at the intended receiver. Considering Poisson distributed users and Rayleigh fading channels, the statistical characterizations of signal and interference are analyzed and the optimal number of nulled receivers is discussed. The simulation results show that by employing partial zero-forcing beamforming with a judiciously chosen number of nulls, the permissible density of secondary transmitters can be maximized while protecting the successful transmission probabilities of individual networks.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"3 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":"116987034","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信