发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Joint spectrum sensing and direction of arrival recovery from sub-Nyquist samples 亚奈奎斯特样品的联合频谱传感和到达方向恢复
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227054
S. Stein, Or Yair, Deborah Cohen, Yonina C. Eldar
{"title":"Joint spectrum sensing and direction of arrival recovery from sub-Nyquist samples","authors":"S. Stein, Or Yair, Deborah Cohen, Yonina C. Eldar","doi":"10.1109/SPAWC.2015.7227054","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227054","url":null,"abstract":"Joint spectrum sensing and direction of arrival (DOA) estimation is often necessary in communication applications, such as Cognitive Radio (CR). In this paper, we consider joint DOA and carrier frequency recovery of several transmissions as well as signal reconstruction from sub-Nyquist samples to overcome the sampling rate bottleneck of the wideband signals a CR typically deals with. We present two joint DOA and carrier frequency recovery approaches. The first is based on compressed sensing (CS) techniques and the second adapts a 2D-DOA recovery algorithm previously proposed in the Nyquist regime, the Parallel Factor (PARAFAC) analysis algorithm, to our sub-Nyquist samples. This technique allows us to solve the well known pairing issue between the DOA and carrier frequency to be recovered for each transmission. Once these are recovered, we show how the signal itself can be reconstructed from the samples. We also provide sufficient conditions for perfect blind signal recovery in terms of the sampling rate and the number of array elements.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122849502","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}
引用次数: 20
Low-complexity detector for very large and massive MIMO transmission 低复杂度检测器用于非常大的和大量的MIMO传输
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227038
Yasser Fadlallah, A. Aïssa-El-Bey, K. Amis, Dominique Pastor
{"title":"Low-complexity detector for very large and massive MIMO transmission","authors":"Yasser Fadlallah, A. Aïssa-El-Bey, K. Amis, Dominique Pastor","doi":"10.1109/SPAWC.2015.7227038","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227038","url":null,"abstract":"Maximum-Likelihood (ML) joint detection has been proposed as an optimal strategy that detects simultaneously the transmitted signals. In very large multiple-input-multiple output (MIMO) systems, the ML detector becomes intractable due the computational cost that increases exponentially with the antenna dimensions. In this paper, we propose a relaxed ML detector based on an iterative decoding strategy that reduces the computational cost. We exploit the fact that the transmit constellation is discrete, and remodel the channel as a MIMO channel with sparse input belonging to the binary set {0, 1}. The sparsity property allows us to relax the ML problem as a quadratic minimization under linear and ℓ1-norm constraint. We then prove the equivalence of the relaxed problem to a convex optimization problem solvable in polynomial time. Simulation results illustrate the efficiency of the low-complexity proposed detector compared to other existing ones in very large and massive MIMO context.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129449981","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
Make-it-real-and-anticirculating orthogonal space-time coding for MIMO OFDM/OQAM MIMO OFDM/OQAM的实反循环正交空时编码
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227000
D. P. Huy, P. Siohan, M. Hélard
{"title":"Make-it-real-and-anticirculating orthogonal space-time coding for MIMO OFDM/OQAM","authors":"D. P. Huy, P. Siohan, M. Hélard","doi":"10.1109/SPAWC.2015.7227000","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227000","url":null,"abstract":"We propose an orthogonal and full rate MIMO space-time coding technique for OFDM/OQAM, called `make-it-real-and-anticirculating' (MIRAAC), to perform energy efficient wireless data transmission. The equivalent MIMO channel (after space-time coding, propagation and decoding) is made real and anticirculating, so that the receiver can suppress all interference very simply: just by extracting the real part of the received signal. Our simulations show that large antenna arrays (like those being studied for the future 5th generation networks) save a great amount of energy.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125453979","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
Distributed caching in 5G networks: An Alternating Direction Method of Multipliers approach 5G网络中的分布式缓存:乘数方法的交替方向方法
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227022
Azary Abboud, Ejder Bastug, Kenza Hamidouche, M. Debbah
{"title":"Distributed caching in 5G networks: An Alternating Direction Method of Multipliers approach","authors":"Azary Abboud, Ejder Bastug, Kenza Hamidouche, M. Debbah","doi":"10.1109/SPAWC.2015.7227022","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227022","url":null,"abstract":"We consider the problem of distributed caching in next generation mobile cellular networks (a.k.a., 5G) where densely-deployed small base stations (SBSs) are able to store and deliver users' content accordingly. In particular, we formulate the optimal cache allocation policy as a convex optimization problem where a subset of SBSs have their own i) local cost function which captures backhaul consumption aspects in terms of bandwidth and ii) a set of local network parameters and storage constraints. Given the fact that no coordination involves between SBSs, we then solve this problem distributively using the Alternating Direction Method of Multipliers (ADMM) approach. The proposed ADMM-based algorithm relies on the application of random Gauss-Seidel iterations on the Douglas-Rachford splitting operator, which results in a low-complexity and easy-to-implement solution for SBSs. We examine the convergence of our proposed algorithm via numerical simulations with different parameters of interest such as storage capacity distribution of SBSs, content catalogue size, demand intensity and demand shape. Our numerical results show that the proposed algorithm performs well in terms of convergence and requires less iterations as the number of contents in the catalogue increases.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651136","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}
引用次数: 25
Quantization of compressed sensing measurements using Analysis-by-Synthesis with Bayesian-optimal Approximate Message Passing 基于贝叶斯最优近似消息传递的综合分析压缩感知测量量化
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227090
O. Musa, N. Goertz
{"title":"Quantization of compressed sensing measurements using Analysis-by-Synthesis with Bayesian-optimal Approximate Message Passing","authors":"O. Musa, N. Goertz","doi":"10.1109/SPAWC.2015.7227090","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227090","url":null,"abstract":"Compressed sensing allows for stable reconstruction of sparse source vectors from noisy, linear measurement vectors of much lower dimension than the source vectors. In many applications, low-bit rate quantization is unavoidable or even desired in further processing of the signal, and suitable algorithms need to be developed for minimizing negative effects on the recovered source signal due to the quantization of the measurements. We present an Analysis-by-Synthesis (AbS) quantization scheme in which, as a novelty, Bayesian-optimal Approximate Message Passing (BAMP) is used as a reconstruction algorithm. The focus is on source signals that can be modeled by a linear combination of a discrete component and a zero-mean Gaussian component; for those signals suitable estimation functions are given for use in the BAMP algorithm. We investigate different setups of the AbS scheme with BAMP and compare the results with an AbS scheme known from the literature, in which Orthogonal Matching Pursuit is used as the reconstruction algorithm.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132517874","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
Network coding schemes for Device-to-Device communications based relaying for cellular coverage extension 用于蜂窝覆盖扩展的基于中继的设备对设备通信的网络编码方案
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227122
A. Abrardo, Gábor Fodor, Besmir Tola
{"title":"Network coding schemes for Device-to-Device communications based relaying for cellular coverage extension","authors":"A. Abrardo, Gábor Fodor, Besmir Tola","doi":"10.1109/SPAWC.2015.7227122","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227122","url":null,"abstract":"In this paper, we study the performance of device-to-device (D2D) based range extension in terms of sum rate and power efficiency when a relaying user equipment (UE) helps to improve the coverage for cell-edge UEs. In our design, the relaying UE has own traffic to transmit and receive to/from the cellular base station (BS) and can operate either in amplify-and-forward (AF) or decode-and-forward (DF) modes and can make use of either digital or analogue (PHY layer) network coding. In this rather general setting, we propose mode selection, resource allocation and power control schemes and study their performance by means of system simulations. We find that the performance of the DF scheme with network coding is superior both to the traditional cellular and the AF based relaying schemes, including AF with two-slot or three-slot PHY layer network coding.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446663","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}
引用次数: 20
Direction finding by complex L1-principal-component analysis 复l1 -主成分分析测向
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227083
N. Tsagkarakis, Panos P. Markopoulos, D. Pados
{"title":"Direction finding by complex L1-principal-component analysis","authors":"N. Tsagkarakis, Panos P. Markopoulos, D. Pados","doi":"10.1109/SPAWC.2015.7227083","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227083","url":null,"abstract":"In the light of recent developments in optimal real L1-norm principal-component analysis (PCA), we provide the first algorithm in the literature to carry out L1-PCA of complex-valued data. Then, we use this algorithm to develop a novel subspace-based direction-of-arrival (DoA) estimation method that is resistant to faulty measurements or jamming. As demonstrated by numerical experiments, the proposed algorithm is as effective as state-of-the-art L2-norm methods in clean-data environments and significantly superior when operating on corrupted data.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"206 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132227117","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}
引用次数: 19
Velocity-assisted multidimensional scaling 速度辅助的多维缩放
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227102
Sandeep Kumar, K. Rajawat
{"title":"Velocity-assisted multidimensional scaling","authors":"Sandeep Kumar, K. Rajawat","doi":"10.1109/SPAWC.2015.7227102","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227102","url":null,"abstract":"This paper considers the problem of cooperative localization in mobile networks. In static networks, node locations can be obtained from pairwise distance measurements using the classical multidimensional scaling (MDS) approach. This paper introduces a modified MDS framework that also incorporates relative velocity measurements available in mobile networks. The proposed cost function is minimized via a provably convergent, low complexity majorization algorithm similar to SMACOF. The algorithm incurs low computational and communication cost, and allows practical constraints such as missing measurements and variable node velocities. Simulation results corroborate the performance gains obtained by the proposed algorithm over state-of-the-art localization algorithms.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134583687","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}
引用次数: 1
Optimal and suboptimal routing based on partial CSI in wireless ad-hoc networks 无线自组网中基于部分CSI的最优和次优路由
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227026
Yiftach Richter, I. Bergel
{"title":"Optimal and suboptimal routing based on partial CSI in wireless ad-hoc networks","authors":"Yiftach Richter, I. Bergel","doi":"10.1109/SPAWC.2015.7227026","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227026","url":null,"abstract":"In this paper, we analyze and optimize the performance of distributed routing schemes in multihop wireless ad-hoc networks. We assume that the nodes are distributed according to a Poisson-Point-Process (PPP) and consider routing schemes that select the next relay based on geographical locations and local knowledge of the channel state (CSI). At the first stage we define the optimization problem and give an expression for the optimal routing metric in a network that achieves the ergodic rate density (ERD) in each link. We then use a recently published bound on the ERD, and present a low complexity, suboptimal routing metric. Numerical results demonstrate that the low complexity scheme performs nearly as good as the optimal scheme.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"963 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123070094","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
Biometrics in claim-based authentication framework 基于声明的身份验证框架中的生物识别技术
2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2015-08-31 DOI: 10.1109/SPAWC.2015.7227065
T. Ignatenko
{"title":"Biometrics in claim-based authentication framework","authors":"T. Ignatenko","doi":"10.1109/SPAWC.2015.7227065","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227065","url":null,"abstract":"Nowadays biometric authentication and identification becomes a part of every-day life. As a result, many services emerge that rely on biometric-based access control. However, from a user point of view, supplying biometric information to many different service providers imposes high privacy and security risks. In this paper we focus on the use of biometrics in a claimed-based authentication framework. The frameworks allows for a limited number of identity providers, thus overcoming the need to supply biometric data to multiple untrustworthy service provides. We argue that in this case we can deploy the information-theoretic framework for privacy-preserving biometric systems for joint authentication and identification studied in Willems and Ignatenko [2010].","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340889","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信