Pub Date : 2018-06-01DOI: 10.1109/SPAWC.2018.8445862
Bho Matthiesen, Eduard Axel Jorswieck
Optimal resource allocation in interference networks requires the solution of non-convex optimization problems. Except from treating interference as noise (IAN) one usually has to optimize jointly over the achievable rates and transmit powers. This non-convexity is normally only due to the transmit powers while the rates are linear. Conventional approaches like the Polyblock Algorithm treat all variables equally and, thus, require a two layer solver to exploit the linearity in the rates and keep the computational complexity at a reasonable level. In this paper, we develop a branch and bound algorithm that exploits most of the problem structure and, compared to previous algorithms, has significantly better performance, improved numerical stability and provides a feasible solution even if terminated prematurely. We employ this novel algorithm to study throughput optimal power allocation in a multi-way relay channel with simultaneous non-unique decoding (SND) and rate splitting (RS) encoders. We evaluate the performance gains of RS over “pure” SND and IAN numerically. While SND often achieves significantly higher throughput than IAN, the benefits of rate splitting are not that pronounced on average and largely depend on the channel condition.
{"title":"Optimal Resource Allocation for Non-Regenerative Multiway Relaying with Rate Splitting","authors":"Bho Matthiesen, Eduard Axel Jorswieck","doi":"10.1109/SPAWC.2018.8445862","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445862","url":null,"abstract":"Optimal resource allocation in interference networks requires the solution of non-convex optimization problems. Except from treating interference as noise (IAN) one usually has to optimize jointly over the achievable rates and transmit powers. This non-convexity is normally only due to the transmit powers while the rates are linear. Conventional approaches like the Polyblock Algorithm treat all variables equally and, thus, require a two layer solver to exploit the linearity in the rates and keep the computational complexity at a reasonable level. In this paper, we develop a branch and bound algorithm that exploits most of the problem structure and, compared to previous algorithms, has significantly better performance, improved numerical stability and provides a feasible solution even if terminated prematurely. We employ this novel algorithm to study throughput optimal power allocation in a multi-way relay channel with simultaneous non-unique decoding (SND) and rate splitting (RS) encoders. We evaluate the performance gains of RS over “pure” SND and IAN numerically. While SND often achieves significantly higher throughput than IAN, the benefits of rate splitting are not that pronounced on average and largely depend on the channel condition.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131820860","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445959
Liumeng Wang, Sheng Zhou
In this paper, we consider the deployment of unmanned aerial vehicles (UAVs) along a straight road, and aim to minimize the total energy consumption of UAVs, including the baseband processing energy, the wireless fronthauling energy and the constant circuit energy. Specifically, the horizontal location, vertical location, coverage radius and the functional split scheme selection of UAVs are jointly optimized. Both the user data rate and the total delay consisting of baseband processing and fron-transmission are guaranteed. To reduce the optimization complexity, we further derive the upper and lower bounds of the optimal number of UAVs. Numerical results show that, with flexible functional split, the energy consumption of UAVs can be considerably reduced compared with fixed functional split. We also observe that more baseband functions should be placed at the UAV side when the distance between the UAV and the baseband units (BBU) on the ground is larger,
{"title":"Energy-Efficient UAV Deployment with Flexible Functional Split Selection","authors":"Liumeng Wang, Sheng Zhou","doi":"10.1109/SPAWC.2018.8445959","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445959","url":null,"abstract":"In this paper, we consider the deployment of unmanned aerial vehicles (UAVs) along a straight road, and aim to minimize the total energy consumption of UAVs, including the baseband processing energy, the wireless fronthauling energy and the constant circuit energy. Specifically, the horizontal location, vertical location, coverage radius and the functional split scheme selection of UAVs are jointly optimized. Both the user data rate and the total delay consisting of baseband processing and fron-transmission are guaranteed. To reduce the optimization complexity, we further derive the upper and lower bounds of the optimal number of UAVs. Numerical results show that, with flexible functional split, the energy consumption of UAVs can be considerably reduced compared with fixed functional split. We also observe that more baseband functions should be placed at the UAV side when the distance between the UAV and the baseband units (BBU) on the ground is larger,","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133082171","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445995
C. Tsinos, A. Kalantari, S. Chatzinotas, B. Ottersten
While (Multiple Input-Multiple Output) MIMO systems based on large-scale antenna arrays are seen as the solution to the continuously increasing demands in modern wireless systems, they require high hardware complexity and power consumption. To tackle this, solutions based on low resolution Analog-to-Digital Converters (ADCs) / Digital-to-Analog Converters (DACs) have been developed in the literature where they mainly propose quantized versions of typical channel dependent linear precoding solutions. Alternatively, nonlinear Symbol level Precoding techniques have been recently proposed for downlink Multi User (MU)-MIMO systems with low resolution DACs that achieve significantly improved performance in several cases. The existing SLP approaches support only DACs of 1-bit resolution which result in significant performance degradations, especially when constellations with order greater than 4 are employed. To that end, in this work a novel SLP approach is developed that supports systems with DACs of any resolution and it is applicable for any type of constellation. As it is verified by the presented numerical results, the proposed approach exhibits significantly improved performance when constellations with order greater than 4 are employed and require reduced computational complexity, compared to the existing solutions for the 1-bit DAC case.
{"title":"Symbol-Level Precoding with Low Resolution DACs for Large-Scale Array MU-MIMO Systems","authors":"C. Tsinos, A. Kalantari, S. Chatzinotas, B. Ottersten","doi":"10.1109/SPAWC.2018.8445995","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445995","url":null,"abstract":"While (Multiple Input-Multiple Output) MIMO systems based on large-scale antenna arrays are seen as the solution to the continuously increasing demands in modern wireless systems, they require high hardware complexity and power consumption. To tackle this, solutions based on low resolution Analog-to-Digital Converters (ADCs) / Digital-to-Analog Converters (DACs) have been developed in the literature where they mainly propose quantized versions of typical channel dependent linear precoding solutions. Alternatively, nonlinear Symbol level Precoding techniques have been recently proposed for downlink Multi User (MU)-MIMO systems with low resolution DACs that achieve significantly improved performance in several cases. The existing SLP approaches support only DACs of 1-bit resolution which result in significant performance degradations, especially when constellations with order greater than 4 are employed. To that end, in this work a novel SLP approach is developed that supports systems with DACs of any resolution and it is applicable for any type of constellation. As it is verified by the presented numerical results, the proposed approach exhibits significantly improved performance when constellations with order greater than 4 are employed and require reduced computational complexity, compared to the existing solutions for the 1-bit DAC case.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351246","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445909
Hakan Sac, Baran Tan Bacinoglu, E. Uysal-Biyikoglu, G. Durisi
We consider a communication system in which a source transmits information updates to a destination node through a binary erasure channel (BEC). When a packet containing an information update, which consists of a fixed number of information bits, arrives at the transmitter, it gets queued in a buffer, to be encoded and sent over the channel. Before transmitting a packet, the transmitter selects a channel coding blocklength n and then uses an automatic repeat request (ARQ) protocol, whereby packets that are decoded incorrectly are repeated. The choice of the coding blocklength thus affects the end-to-end status age. However, this dependency is nontrivial since, on the one hand, the duration of a single transmission attempt is directly proportional to n, so the smaller n the better. On the other hand, a smaller value of the blocklength n yields a higher probability of decoding error, which increases the end-to-end status age. Employing recent finite-blocklength information-theoretic bounds and approximations on the rate achievable on a BEC for a given blocklength and a given error probability, we study the age-optimal design of this system. We find that for any nontrivial BEC, there exists an optimal blocklength that minimizes the average age and average peak age of information.
{"title":"Age-Optimal Channel Coding Blocklength for an M/G/1 Queue with HARQ","authors":"Hakan Sac, Baran Tan Bacinoglu, E. Uysal-Biyikoglu, G. Durisi","doi":"10.1109/SPAWC.2018.8445909","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445909","url":null,"abstract":"We consider a communication system in which a source transmits information updates to a destination node through a binary erasure channel (BEC). When a packet containing an information update, which consists of a fixed number of information bits, arrives at the transmitter, it gets queued in a buffer, to be encoded and sent over the channel. Before transmitting a packet, the transmitter selects a channel coding blocklength n and then uses an automatic repeat request (ARQ) protocol, whereby packets that are decoded incorrectly are repeated. The choice of the coding blocklength thus affects the end-to-end status age. However, this dependency is nontrivial since, on the one hand, the duration of a single transmission attempt is directly proportional to n, so the smaller n the better. On the other hand, a smaller value of the blocklength n yields a higher probability of decoding error, which increases the end-to-end status age. Employing recent finite-blocklength information-theoretic bounds and approximations on the rate achievable on a BEC for a given blocklength and a given error probability, we study the age-optimal design of this system. We find that for any nontrivial BEC, there exists an optimal blocklength that minimizes the average age and average peak age of information.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131827781","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445844
K. Hummel, René Gabner, H. Schwefel
Computationally intensive mobile apps may be migrated to a cloud infrastructure for faster remote execution. Decreased execution time and lower energy consumption at the mobile device are the expected benefits when offloading the application to the cloud. The migration decision can be taken based on a continuous-time Markov model that considers network quality, cloud and mobile device capabilities, as well as migration costs, as we have shown in previous work. One of the influencing dynamic characteristics is the network performance. In this work, we focus on characterizing network performance under node mobility in terms of throughput and latency. Our final goal is to derive a mobile performance model that goes beyond an on-off network model. The analysis is based on performance measurements taken on a train while commuting. By clustering the measurement data, we derive a realistic network model.
{"title":"On Data-Driven Network Performance Modeling for Mobile Cloud Computing","authors":"K. Hummel, René Gabner, H. Schwefel","doi":"10.1109/SPAWC.2018.8445844","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445844","url":null,"abstract":"Computationally intensive mobile apps may be migrated to a cloud infrastructure for faster remote execution. Decreased execution time and lower energy consumption at the mobile device are the expected benefits when offloading the application to the cloud. The migration decision can be taken based on a continuous-time Markov model that considers network quality, cloud and mobile device capabilities, as well as migration costs, as we have shown in previous work. One of the influencing dynamic characteristics is the network performance. In this work, we focus on characterizing network performance under node mobility in terms of throughput and latency. Our final goal is to derive a mobile performance model that goes beyond an on-off network model. The analysis is based on performance measurements taken on a train while commuting. By clustering the measurement data, we derive a realistic network model.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133836344","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445881
Michael A. Varner, G. Durgin
This paper explores the range and signalling limitations of ambient scatter wireless communications. Using previously modulated and transmitted electromagnetic waves as a means of power and as the RF carrier for their own communications, Reflection of Modulated Radio (ReMoRa) systems require little to no power to establish a communication link. However, employing a carrier the ReMoRa users have no control over poses a set of signalling problems that must be addressed to ensure a functioning communication link. This paper seeks to outline these obstacles and the unique demands they place on ambient scatter systems. A novel waveform, the perfect pulse, is further characterized to better solidify their candidacy as a powerful tool for the ambient communications problem, paying specific attention to DC-nulling behaviors and synchronization benefits. Spectral Exceedance is proposed as a means to compare the depth and width of DC-nulling waveforms. A realistic RF link budget is proposed to model expected RF returns and range limitations of ReMoRa systems.
{"title":"Reflection of Modulated Radio (ReMoRa): Link Analysis of Ambient Scatter Radio Using Perfect Pulses","authors":"Michael A. Varner, G. Durgin","doi":"10.1109/SPAWC.2018.8445881","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445881","url":null,"abstract":"This paper explores the range and signalling limitations of ambient scatter wireless communications. Using previously modulated and transmitted electromagnetic waves as a means of power and as the RF carrier for their own communications, Reflection of Modulated Radio (ReMoRa) systems require little to no power to establish a communication link. However, employing a carrier the ReMoRa users have no control over poses a set of signalling problems that must be addressed to ensure a functioning communication link. This paper seeks to outline these obstacles and the unique demands they place on ambient scatter systems. A novel waveform, the perfect pulse, is further characterized to better solidify their candidacy as a powerful tool for the ambient communications problem, paying specific attention to DC-nulling behaviors and synchronization benefits. Spectral Exceedance is proposed as a means to compare the depth and width of DC-nulling waveforms. A realistic RF link budget is proposed to model expected RF returns and range limitations of ReMoRa systems.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"280 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976700","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445777
Emmanouil Theodosis, P. Maragos
The Viterbi algorithm and its pruning variant, are some of the most frequently used algorithms in communications and speech recognition. There has been extended research on improving the algorithms' computational complexity, however work trying to interpret their nonlinear structure and geometry has been limited. In this work we analyse the Viterbi algorithm in the field of tropical (min-plus) algebra, and we utilize its pruning variant in order to define a polytope. Then, we interpret certain faces of the polytope as the most probable states of the algorithm. This also provides a useful geometrical interpretation of the Viterbi algorithm.
{"title":"Analysis of the Viterbi Algorithm Using Tropical Algebra and Geometry","authors":"Emmanouil Theodosis, P. Maragos","doi":"10.1109/SPAWC.2018.8445777","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445777","url":null,"abstract":"The Viterbi algorithm and its pruning variant, are some of the most frequently used algorithms in communications and speech recognition. There has been extended research on improving the algorithms' computational complexity, however work trying to interpret their nonlinear structure and geometry has been limited. In this work we analyse the Viterbi algorithm in the field of tropical (min-plus) algebra, and we utilize its pruning variant in order to define a polytope. Then, we interpret certain faces of the polytope as the most probable states of the algorithm. This also provides a useful geometrical interpretation of the Viterbi algorithm.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915343","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445876
G. Muzio, M. Kuscu, Ö. Akan
Molecular Communications (MC) is a bio-inspired wireless communication technique that uses molecules as a means of information transfer among bio-nano devices. In this paper, we focus on the signal detection problem of MC receivers employing receptor molecules to infer the transmitted messages encoded into the concentration of molecules, i.e., ligands. We particularly consider a very common scenario in physiological conditions, where there is non-negligible concentration of interferer molecules in the channel, which have similar binding characteristics with the ligands, and thus, can bind to the receptors, causing substantial interference with the MC signal. We investigate three different maximum likelihood (ML) detection methods based on different observable parameters of the ligand-receptor binding mechanism, which are the instantaneous number of bound receptors and the amount of time the receptors stay unbound or bound within an observation time window. We carry out a comparative analysis to numerically evaluate the performance of the detection methods under different system settings.
{"title":"Selective Signal Detection with Ligand Receptors Under Interference in Molecular Communications","authors":"G. Muzio, M. Kuscu, Ö. Akan","doi":"10.1109/SPAWC.2018.8445876","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445876","url":null,"abstract":"Molecular Communications (MC) is a bio-inspired wireless communication technique that uses molecules as a means of information transfer among bio-nano devices. In this paper, we focus on the signal detection problem of MC receivers employing receptor molecules to infer the transmitted messages encoded into the concentration of molecules, i.e., ligands. We particularly consider a very common scenario in physiological conditions, where there is non-negligible concentration of interferer molecules in the channel, which have similar binding characteristics with the ligands, and thus, can bind to the receptors, causing substantial interference with the MC signal. We investigate three different maximum likelihood (ML) detection methods based on different observable parameters of the ligand-receptor binding mechanism, which are the instantaneous number of bound receptors and the amount of time the receptors stay unbound or bound within an observation time window. We carry out a comparative analysis to numerically evaluate the performance of the detection methods under different system settings.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115970071","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445983
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi
In this paper, we consider solving the topological interference management (TIM) problem by using a generalized low-rank matrix completion (LRMC) model, thereby maximizing the achievable degrees of freedom (DoF) only based on the network connectivity information. The LRMC problem is NP-hard due to the nonconvex rank objective function. The nuclear norm relaxation fails as it always returns a full-rank matrix in our model. Another approach named Riemannian Pursuit (RP) is often inefficient for finding highly accurate feasible solutions. We thus propose a novel Generalized Low-Rank Optimization along with the Difference of Convex Algorithm (GLRO-DCA), which aims to find a low-rank solution while always keeping the feasiblity. The GLRO-DCA increases the rank consecutively and solves the associated fixed-rank LRMC problem, where the generalized fixed-rank LRMC problem is reformulated by minimizing the difference between the nuclear norm and the Ky Fan norm and solved by the DCA. We accelerate the DCA by applying extrapolation techniques to improve the computational efficiency. Numerical results exhibit the ability of our proposed GLRO-DCA for the TIM problem to find low-rank solutions, which is superior to the existing nuclear norm relaxation approach and the RP approach.
{"title":"Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations","authors":"Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi","doi":"10.1109/SPAWC.2018.8445983","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445983","url":null,"abstract":"In this paper, we consider solving the topological interference management (TIM) problem by using a generalized low-rank matrix completion (LRMC) model, thereby maximizing the achievable degrees of freedom (DoF) only based on the network connectivity information. The LRMC problem is NP-hard due to the nonconvex rank objective function. The nuclear norm relaxation fails as it always returns a full-rank matrix in our model. Another approach named Riemannian Pursuit (RP) is often inefficient for finding highly accurate feasible solutions. We thus propose a novel Generalized Low-Rank Optimization along with the Difference of Convex Algorithm (GLRO-DCA), which aims to find a low-rank solution while always keeping the feasiblity. The GLRO-DCA increases the rank consecutively and solves the associated fixed-rank LRMC problem, where the generalized fixed-rank LRMC problem is reformulated by minimizing the difference between the nuclear norm and the Ky Fan norm and solved by the DCA. We accelerate the DCA by applying extrapolation techniques to improve the computational efficiency. Numerical results exhibit the ability of our proposed GLRO-DCA for the TIM problem to find low-rank solutions, which is superior to the existing nuclear norm relaxation approach and the RP approach.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010316","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 : 2018-06-01DOI: 10.1109/SPAWC.2018.8445854
Ahmed Raafat, A. Agustin, J. Vidal
Receive spatial modulation (RSM) schemes enable simple and energy efficient multiple-input-multiple-output (MIMO) transceivers and yet attain high spectral efficiency, which renders them promising schemes for millimeter wave (mmWave) communication in massive MIMO systems. When these schemes are designed to include zero forcing (ZF) precoders, performance can be impaired in the presence of highly spatially correlated channels. Extending these schemes for minimum mean square error (MMSE) precoding is not trivial due to the hardware constraints of the energy efficient user terminal architecture. In this paper, we adapt the MMSE precoder to the low complexity RSM architecture and develop detection methods for the spatial and modulation symbols. The proposed MMSE RSM scheme with total and per-antenna power constraints have been compared with ZF RSM in terms of average and outage mutual information by simulations showing superior gain for mmWave channels.
{"title":"MMSE Precoding for Receive Spatial Modulation in Large MIMO Systems","authors":"Ahmed Raafat, A. Agustin, J. Vidal","doi":"10.1109/SPAWC.2018.8445854","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445854","url":null,"abstract":"Receive spatial modulation (RSM) schemes enable simple and energy efficient multiple-input-multiple-output (MIMO) transceivers and yet attain high spectral efficiency, which renders them promising schemes for millimeter wave (mmWave) communication in massive MIMO systems. When these schemes are designed to include zero forcing (ZF) precoders, performance can be impaired in the presence of highly spatially correlated channels. Extending these schemes for minimum mean square error (MMSE) precoding is not trivial due to the hardware constraints of the energy efficient user terminal architecture. In this paper, we adapt the MMSE precoder to the low complexity RSM architecture and develop detection methods for the spatial and modulation symbols. The proposed MMSE RSM scheme with total and per-antenna power constraints have been compared with ZF RSM in terms of average and outage mutual information by simulations showing superior gain for mmWave channels.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123390068","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
扫码关注我们
求助内容：
应助结果提醒方式：