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.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.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}
Pub Date : 2018-06-01DOI: 10.1109/SPAWC.2018.8445856
Michele Polese, M. Zorzi
Communication at mmWave frequencies is one of the major innovations of the fifth generation of cellular networks, because of the potential multi-gigabit data rate given by the large amounts of available bandwidth. The mmWave channel, however, makes reliable communications particularly challenging, given the harsh propagation environment and the sensitivity to blockage. Therefore, proper modeling of the mmWave channel is fundamental for accurate results in system simulations of mmWave cellular networks. Nonetheless, complex models, such as the 3GPP channel model for frequencies above 6 GHz, may introduce a significant overhead in terms of computational complexity. In this paper we investigate the trade offs related to the accuracy and the simplicity of the channel model in end-to-end network simulations, and the impact on the performance evaluation of transport protocols.
{"title":"Impact of Channel Models on the End-to-End Performance of Mmwave Cellular Networks","authors":"Michele Polese, M. Zorzi","doi":"10.1109/SPAWC.2018.8445856","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445856","url":null,"abstract":"Communication at mmWave frequencies is one of the major innovations of the fifth generation of cellular networks, because of the potential multi-gigabit data rate given by the large amounts of available bandwidth. The mmWave channel, however, makes reliable communications particularly challenging, given the harsh propagation environment and the sensitivity to blockage. Therefore, proper modeling of the mmWave channel is fundamental for accurate results in system simulations of mmWave cellular networks. Nonetheless, complex models, such as the 3GPP channel model for frequencies above 6 GHz, may introduce a significant overhead in terms of computational complexity. In this paper we investigate the trade offs related to the accuracy and the simplicity of the channel model in end-to-end network simulations, and the impact on the performance evaluation of transport protocols.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"21 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":"122973027","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.8446036
F. Bellili, Foad Sohrabi, Wei Yu
This paper tackles the problem of channel estimation in mmWave large-scale communication systems. To leverage the sparsity of mmWave MIMO channels in the beam domain, we use discrete Fourier transform (DFT) precoding and combining and recast the channel estimation problem as a compressed sensing (CS) problem. The generalized approximate message passing (GAMP) algorithm is then used to find the minimum mean square estimate (MMSE) of each entry of the unknown mmWave MIMO channel matrix. Unlike the existing works, this paper models the angular-domain channel coefficients by a Laplacian prior and accordingly establishes the closed-form expressions for all the statistical quantities that need to be updated iteratively by GAMP. Further, to render the proposed algorithm fully automated, we develop an expectation-maximization (EM)-based procedure which can be readily embedded within GAMP's iteration loop in order to learn the unknown scale parameter of the underlying Laplacian prior along with the noise variance. Numerical results indicate that the proposed EM-GAMP algorithm under a Laplacian prior yields substantial improvements both in terms of channel estimation accuracy and computational complexity as compared to the existing methods that advocate a Gaussian mixture (GM) prior.
{"title":"Massive MIMO mmWave Channel Estimation Using Approximate Message Passing and Laplacian Prior","authors":"F. Bellili, Foad Sohrabi, Wei Yu","doi":"10.1109/SPAWC.2018.8446036","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446036","url":null,"abstract":"This paper tackles the problem of channel estimation in mmWave large-scale communication systems. To leverage the sparsity of mmWave MIMO channels in the beam domain, we use discrete Fourier transform (DFT) precoding and combining and recast the channel estimation problem as a compressed sensing (CS) problem. The generalized approximate message passing (GAMP) algorithm is then used to find the minimum mean square estimate (MMSE) of each entry of the unknown mmWave MIMO channel matrix. Unlike the existing works, this paper models the angular-domain channel coefficients by a Laplacian prior and accordingly establishes the closed-form expressions for all the statistical quantities that need to be updated iteratively by GAMP. Further, to render the proposed algorithm fully automated, we develop an expectation-maximization (EM)-based procedure which can be readily embedded within GAMP's iteration loop in order to learn the unknown scale parameter of the underlying Laplacian prior along with the noise variance. Numerical results indicate that the proposed EM-GAMP algorithm under a Laplacian prior yields substantial improvements both in terms of channel estimation accuracy and computational complexity as compared to the existing methods that advocate a Gaussian mixture (GM) prior.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"0 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":"121875435","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.8445935
G. Vougioukas, Panos N. Alevizos, A. Bletsas
This work studies ambient backscatter, where the tag utilizes a frequency-shifted form of on-off keying (OOK), which may be coined as pseudo-frequency shift keying (pseudo-FSK). Such scheme, offers the possibility of simple, frequency-domain multiple access (due to FSK), by appropriate selection of the switching frequencies among (possibly receiverless) tags, while reserving bandwidth (due to OOK). A constant envelope-modulated ambient signal is assumed to illuminate the tag, resembling signals from (analog) FM radio, (digital) minimum-shift keying (MSK), or phase-shift keying (PSK) broadcasting stations. Fully coherent, maximum likelihood (ML) detection is derived for tag information, without estimating or detecting the ambient signal; instead, the law of large numbers is exploited, in conjunction with channel estimation techniques, even though the ambient unknown signal changes between successive tag bits. Closed-form expression for the probability of error is also given and simulations verify theoretical results. Ambient is a special case of bistatic backscatter; thus, useful design principles for ambient systems can stem from the bistatic backscatter literature.
{"title":"Coherent Detector for Pseudo-FSK Backscatter Under Ambient Constant Envelope Illumination","authors":"G. Vougioukas, Panos N. Alevizos, A. Bletsas","doi":"10.1109/SPAWC.2018.8445935","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445935","url":null,"abstract":"This work studies ambient backscatter, where the tag utilizes a frequency-shifted form of on-off keying (OOK), which may be coined as pseudo-frequency shift keying (pseudo-FSK). Such scheme, offers the possibility of simple, frequency-domain multiple access (due to FSK), by appropriate selection of the switching frequencies among (possibly receiverless) tags, while reserving bandwidth (due to OOK). A constant envelope-modulated ambient signal is assumed to illuminate the tag, resembling signals from (analog) FM radio, (digital) minimum-shift keying (MSK), or phase-shift keying (PSK) broadcasting stations. Fully coherent, maximum likelihood (ML) detection is derived for tag information, without estimating or detecting the ambient signal; instead, the law of large numbers is exploited, in conjunction with channel estimation techniques, even though the ambient unknown signal changes between successive tag bits. Closed-form expression for the probability of error is also given and simulations verify theoretical results. Ambient is a special case of bistatic backscatter; thus, useful design principles for ambient systems can stem from the bistatic backscatter literature.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"27 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":"123935094","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.8446034
Xin Tian, A. Abdi, E. Liu, F. Fekri
In this paper, we propose a new sparse dictionary learning scheme for lossy compression of seismic signals collected at a single sensor from multiple source shots. The method leverages the entropy constraint and delay compensation for dictionary learning. Using the proposed method for delay compensation in seismic data squeezes more redundancy out of the data which results in a sparser representation for a given dictionary. The objective of entropy constraint term in dictionary learning is to make the sparse coefficients tailored to the compression objective. To solve the above hybrid dictionary learning problem, delay-compensated and entropy-constrained dictionary learning is developed and alternating scheme is proposed for optimization. Furthermore, an offline-training-online-testing way is adopted for the proposed dictionary learning scheme in the seismic data compression. The experimental results demonstrate the effectiveness of the proposed method for maintaining a desirable rate-distortion trade-off for the seismic signal compression.
{"title":"Seismic Signal Compression Through Delay Compensated and Entropy Constrained Dictionary Learning","authors":"Xin Tian, A. Abdi, E. Liu, F. Fekri","doi":"10.1109/SPAWC.2018.8446034","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446034","url":null,"abstract":"In this paper, we propose a new sparse dictionary learning scheme for lossy compression of seismic signals collected at a single sensor from multiple source shots. The method leverages the entropy constraint and delay compensation for dictionary learning. Using the proposed method for delay compensation in seismic data squeezes more redundancy out of the data which results in a sparser representation for a given dictionary. The objective of entropy constraint term in dictionary learning is to make the sparse coefficients tailored to the compression objective. To solve the above hybrid dictionary learning problem, delay-compensated and entropy-constrained dictionary learning is developed and alternating scheme is proposed for optimization. Furthermore, an offline-training-online-testing way is adopted for the proposed dictionary learning scheme in the seismic data compression. The experimental results demonstrate the effectiveness of the proposed method for maintaining a desirable rate-distortion trade-off for the seismic signal compression.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"4 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":"129758718","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.8445897
P. Ciblat, I. Stupia, L. Vandendorpe
We address the problem of allocating different powers amongst parallel channels when effective capacity is the performance metric and sum-power is constrained. We assume that Chase-Combining-HARQ mechanism is applied. Closed-form expressions for the powers are exhibited. Numerical comparisons with other power allocations obtained through either ergodic capacity or throughput optimizations are done.
{"title":"Effective Capacity Based Resource Allocation for Rayleigh-Fading Parallel Channels","authors":"P. Ciblat, I. Stupia, L. Vandendorpe","doi":"10.1109/SPAWC.2018.8445897","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445897","url":null,"abstract":"We address the problem of allocating different powers amongst parallel channels when effective capacity is the performance metric and sum-power is constrained. We assume that Chase-Combining-HARQ mechanism is applied. Closed-form expressions for the powers are exhibited. Numerical comparisons with other power allocations obtained through either ergodic capacity or throughput optimizations are done.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"44 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":"128483570","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
扫码关注我们
求助内容：
应助结果提醒方式：