Pub Date : 2018-08-01DOI: 10.1109/ISWCS.2018.8491228
Pedro M. Gameiro, R. Rocha
A cubesat is a very small, low cost, artificial satellite designed for space research purposes, very popular in the academic community. The ISTsat-1 is the first cubesat being developed in Instituto Superior Tecnico (IST)[1], with a IU size (103cm cube). In space, communication links are typically unstable, with high delays and low throughputs and where disruptions can be frequent. This motivated the creation of Delay/Disruptive Tolerant Network (DTN) protocols, a concept designed to deal with the characteristic problems of disruptive environments. However, even with DTN, the transmission of big data files can be difficult. This is specially true in the case of cubesats, working typically in Low Earth Orbits (LEO), which suffer from very long disruptions periods with the Ground Stations (GS) on Earth. In this project we intend to create an enhanced solution, a distributed DTN protocol capable of performing normal DTN tasks, but in a manner where a single transmission can be distributed over different GS, thus increasing the number of links, reducing the disruption time periods and increasing the much needed performance of space transmissions.
{"title":"Distributed Delay Tolerant Protocol","authors":"Pedro M. Gameiro, R. Rocha","doi":"10.1109/ISWCS.2018.8491228","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491228","url":null,"abstract":"A cubesat is a very small, low cost, artificial satellite designed for space research purposes, very popular in the academic community. The ISTsat-1 is the first cubesat being developed in Instituto Superior Tecnico (IST)[1], with a IU size (103cm cube). In space, communication links are typically unstable, with high delays and low throughputs and where disruptions can be frequent. This motivated the creation of Delay/Disruptive Tolerant Network (DTN) protocols, a concept designed to deal with the characteristic problems of disruptive environments. However, even with DTN, the transmission of big data files can be difficult. This is specially true in the case of cubesats, working typically in Low Earth Orbits (LEO), which suffer from very long disruptions periods with the Ground Stations (GS) on Earth. In this project we intend to create an enhanced solution, a distributed DTN protocol capable of performing normal DTN tasks, but in a manner where a single transmission can be distributed over different GS, thus increasing the number of links, reducing the disruption time periods and increasing the much needed performance of space transmissions.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115735669","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}
In this paper, we investigate the designation of transmission time intervals (TTls) in a LAA system. With considerations of backward compatibility and feasibility, two shortened TTI schemes are proposed to increase the flexibility of frame structure in the unlicensed spectrum. Additionally, the advantage of the designed shortened TTI schemes on the DL transmission performance is also studied for different cases of packet size. More specially, it is found that the system using the proposed shortened TTI schemes is able to reach the start point of a transmission more quickly when sending small packets. Therefore, the performance of small packets can be improved. Differently, the proposed shortened TTI schemes are able to reduce the padding time when transmitting large packets, so that the performance, especially the utilization of the maximum channel occupancy time (MCOT), can be improved. The simulation results verify that remarkable performance gain can be achieved under the proposed shortened TTI schemes. In addition, based on the analysis in this paper, it is suggested that shortened TTI should be included in the future designation of LAA systems in order to achieve better performance.
{"title":"Study on Flexible TTI Scheduling for LAA Systems","authors":"Lulu Wang, Yuehong Gao, Yangming Dong, Zhidu Li, Zhening Zhang, Xin Zhang, Xiaofeng Liu","doi":"10.1109/ISWCS.2018.8491044","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491044","url":null,"abstract":"In this paper, we investigate the designation of transmission time intervals (TTls) in a LAA system. With considerations of backward compatibility and feasibility, two shortened TTI schemes are proposed to increase the flexibility of frame structure in the unlicensed spectrum. Additionally, the advantage of the designed shortened TTI schemes on the DL transmission performance is also studied for different cases of packet size. More specially, it is found that the system using the proposed shortened TTI schemes is able to reach the start point of a transmission more quickly when sending small packets. Therefore, the performance of small packets can be improved. Differently, the proposed shortened TTI schemes are able to reduce the padding time when transmitting large packets, so that the performance, especially the utilization of the maximum channel occupancy time (MCOT), can be improved. The simulation results verify that remarkable performance gain can be achieved under the proposed shortened TTI schemes. In addition, based on the analysis in this paper, it is suggested that shortened TTI should be included in the future designation of LAA systems in order to achieve better performance.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133422232","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-08-01DOI: 10.1109/ISWCS.2018.8491035
S. M. R. Naqvi, P. Ho, Limei Peng
This paper introduces a novel distributed antenna access architecture for achieving a cost-effective solution of 5G indoor service provisioning. The proposed architecture takes advantage of multi-pair local area network (LAN) cables to support simultaneous transmission of multiple baseband and intermediate frequency (IF) signals between the remote radio unit (RRU) and each distributed antenna unit (DAU), so as to meet the massive antenna requirements and overcome the non-line-of-sight nature of the indoor environment with extremely low cost. Two new functional modules, namely Multi-Pair Air-to-Cable (MP-A2C) and DeFEXTer, are defined at the RRU for the purpose of resource mapping between the antenna signals and the LAN cable sub-channels, as well as the mitigation of far end crosstalk (FEXT) due to the signal traversal along the LAN cable. We will discuss in detail the proposed system architecture and enumerate the research issues.
{"title":"A Novel 5G Indoor Service Provisioning Architecture","authors":"S. M. R. Naqvi, P. Ho, Limei Peng","doi":"10.1109/ISWCS.2018.8491035","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491035","url":null,"abstract":"This paper introduces a novel distributed antenna access architecture for achieving a cost-effective solution of 5G indoor service provisioning. The proposed architecture takes advantage of multi-pair local area network (LAN) cables to support simultaneous transmission of multiple baseband and intermediate frequency (IF) signals between the remote radio unit (RRU) and each distributed antenna unit (DAU), so as to meet the massive antenna requirements and overcome the non-line-of-sight nature of the indoor environment with extremely low cost. Two new functional modules, namely Multi-Pair Air-to-Cable (MP-A2C) and DeFEXTer, are defined at the RRU for the purpose of resource mapping between the antenna signals and the LAN cable sub-channels, as well as the mitigation of far end crosstalk (FEXT) due to the signal traversal along the LAN cable. We will discuss in detail the proposed system architecture and enumerate the research issues.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133426569","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-08-01DOI: 10.1109/ISWCS.2018.8491099
Pablo Ramírez-Espinosa, J. F. Paris, J. A. Cortés, E. Martos-Naya
In this paper, we propose a generalization of the well-known $kappa-mu$ shadowed fading model. Based on the clustering of multipath waves as the baseline model, the novelty of this new distribution is the addition of an arbitrary correlation for the scattered components within each cluster. It also inherits the random fluctuation of the dominant component, which is assumed to be the same for all clusters. Thus, it unifies a wide variety of models: Rayleigh, Rician, Rician shadowed, Nakagami@ $m, kappa-mu$ and $kappa-mu$ shadowed as well as multivariate Rayleigh, Rician and Rician shadowed. The main statistics of the newly proposed model, i.e. moment generating function, probability density function and cumulative density function, are given in terms of exponentials and powers, and some numerical results are provided in order to analyze the impact of the arbitrary intercluster correlation.
{"title":"The k-μ Shadowed Fading Model with Arbitrary Intercluster Correlation","authors":"Pablo Ramírez-Espinosa, J. F. Paris, J. A. Cortés, E. Martos-Naya","doi":"10.1109/ISWCS.2018.8491099","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491099","url":null,"abstract":"In this paper, we propose a generalization of the well-known $kappa-mu$ shadowed fading model. Based on the clustering of multipath waves as the baseline model, the novelty of this new distribution is the addition of an arbitrary correlation for the scattered components within each cluster. It also inherits the random fluctuation of the dominant component, which is assumed to be the same for all clusters. Thus, it unifies a wide variety of models: Rayleigh, Rician, Rician shadowed, Nakagami@ $m, kappa-mu$ and $kappa-mu$ shadowed as well as multivariate Rayleigh, Rician and Rician shadowed. The main statistics of the newly proposed model, i.e. moment generating function, probability density function and cumulative density function, are given in terms of exponentials and powers, and some numerical results are provided in order to analyze the impact of the arbitrary intercluster correlation.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"68 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131268098","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-08-01DOI: 10.1109/ISWCS.2018.8491229
D. Mattera, M. Tanda, M. Bellanger
This paper deals with the problem of blind symbol timing estimation for filter bank multicarrier systems with pulse amplitude modulation (FBMe-PAM). In FBMe-PAM a sequence of real-valued symbols can be transmitted over 2 $M$ spectrally separated subcarriers operating at the same symbol rate as OFDM. This recently proposed system exhibits many advantages in comparison with the OFDM system; in particular, it does not require a cyclic prefix and, in the multi-user context, it provides a high level of spectral separation among users. In this paper is derived the maximum likelihood (ML) blind symbol timing estimator for AWGN channel under the assumption of low SNR conditions. Since the FBMe-PAM signal is a noncircular random process (i.e., its conjugate correlation function or relation function is different from zero), the obtained ML estimator exploits both the conjugate and the unconjugate correlation. In addition, a closed-form low-complexity blind estimator exploiting only the unconjugate correlation, is proposed. The performance of the derived estimators, assessed via computer simulation, is compared with that of the two estimators obtained by separately maximizing the contribution to the ML cost function exploiting the unconjugate correlation or the conjugate correlation.
{"title":"On Blind Symbol-Timing Estimation for FBMC Systems: The Case of FBMC-PAM","authors":"D. Mattera, M. Tanda, M. Bellanger","doi":"10.1109/ISWCS.2018.8491229","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491229","url":null,"abstract":"This paper deals with the problem of blind symbol timing estimation for filter bank multicarrier systems with pulse amplitude modulation (FBMe-PAM). In FBMe-PAM a sequence of real-valued symbols can be transmitted over 2 $M$ spectrally separated subcarriers operating at the same symbol rate as OFDM. This recently proposed system exhibits many advantages in comparison with the OFDM system; in particular, it does not require a cyclic prefix and, in the multi-user context, it provides a high level of spectral separation among users. In this paper is derived the maximum likelihood (ML) blind symbol timing estimator for AWGN channel under the assumption of low SNR conditions. Since the FBMe-PAM signal is a noncircular random process (i.e., its conjugate correlation function or relation function is different from zero), the obtained ML estimator exploits both the conjugate and the unconjugate correlation. In addition, a closed-form low-complexity blind estimator exploiting only the unconjugate correlation, is proposed. The performance of the derived estimators, assessed via computer simulation, is compared with that of the two estimators obtained by separately maximizing the contribution to the ML cost function exploiting the unconjugate correlation or the conjugate correlation.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346542","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-08-01DOI: 10.1109/ISWCS.2018.8491050
Asma Ghorbel, Apostolos Destounis, M. Kobayashi, G. Paschos
Coded caching has emerged as one of the promising solutions to deal with an exponentially increasing video traffic. This breakthrough builds on a careful design of file placement such that the total transmission time is minimized by multicasting sub-files simultaneously useful to many users. A number of follow-up works recently studied the extension of coded caching, initially assuming a perfect bottleneck link, to practical wireless channels. However, most of existing works address either the scalability of the cached wireless networks by assuming that each user requests a single file or the dynamic arrival of user requests by ignoring the scalability. In this work, we propose a low-complexity gradient- based scheduling that exploits multicast opportunities offered by coded caching, while keeping a number of multicast groups linear in the number of users. Simulation results illustrate that the proposed algorithm outperforms both coded caching and opportunistic scheduling over time-varying fading channels.
{"title":"An Efficient Fair Content Delivery Scheme for Coded Caching","authors":"Asma Ghorbel, Apostolos Destounis, M. Kobayashi, G. Paschos","doi":"10.1109/ISWCS.2018.8491050","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491050","url":null,"abstract":"Coded caching has emerged as one of the promising solutions to deal with an exponentially increasing video traffic. This breakthrough builds on a careful design of file placement such that the total transmission time is minimized by multicasting sub-files simultaneously useful to many users. A number of follow-up works recently studied the extension of coded caching, initially assuming a perfect bottleneck link, to practical wireless channels. However, most of existing works address either the scalability of the cached wireless networks by assuming that each user requests a single file or the dynamic arrival of user requests by ignoring the scalability. In this work, we propose a low-complexity gradient- based scheduling that exploits multicast opportunities offered by coded caching, while keeping a number of multicast groups linear in the number of users. Simulation results illustrate that the proposed algorithm outperforms both coded caching and opportunistic scheduling over time-varying fading channels.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130051875","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-08-01DOI: 10.1109/ISWCS.2018.8491220
Gregory Larmore, Willie K. Harrison
This paper presents a technique for active topology inference in store, code, and forward networks. Many techniques exist for topology inference and are well suited for store-and-forward and cut-through switching; however, these simpler techniques fail to capitalize on the flexibility of recoding afforded by store, code, and forward networks. This is in contrast to network coding, which recodes the data whenever possible and consequently achieves the maximum flow (and minimum cut) of throughput across a network. The technique herein utilizes a single probe message between a single source and potentially many destination nodes to achieve deterministic topology inference.
{"title":"Active Topology Inference in Store, Code, and Forward Networks","authors":"Gregory Larmore, Willie K. Harrison","doi":"10.1109/ISWCS.2018.8491220","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491220","url":null,"abstract":"This paper presents a technique for active topology inference in store, code, and forward networks. Many techniques exist for topology inference and are well suited for store-and-forward and cut-through switching; however, these simpler techniques fail to capitalize on the flexibility of recoding afforded by store, code, and forward networks. This is in contrast to network coding, which recodes the data whenever possible and consequently achieves the maximum flow (and minimum cut) of throughput across a network. The technique herein utilizes a single probe message between a single source and potentially many destination nodes to achieve deterministic topology inference.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658824","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-08-01DOI: 10.1109/ISWCS.2018.8491089
Tianyu Yang, Yulin Hu, M. C. Gursoy, A. Schmeink, R. Mathar
In this paper, we investigate strategies for the allocation of computational resources using deep reinforcement learning in mobile edge computing networks that operate with finite blocklength codes to support low latency communications. The end-to-end (E2E) reliability of the service is addressed, while both the delay violation probability and the decoding error probability are taken into account. By employing a deep reinforcement learning method, namely deep Q-learning, we design an intelligent agent at the edge computing node to develop a real-time adaptive policy for computational resource allocation for offloaded tasks of multiple users in order to improve the average E2E reliability. Via simulations, we show that under different task arrival rates, the realized policy serves to increase the task number that decreases the delay violation rate while guaranteeing an acceptable level of decoding error probability. Moreover, we show that the proposed deep reinforcement learning approach outperforms the random and equal scheduling benchmarks.
{"title":"Deep Reinforcement Learning based Resource Allocation in Low Latency Edge Computing Networks","authors":"Tianyu Yang, Yulin Hu, M. C. Gursoy, A. Schmeink, R. Mathar","doi":"10.1109/ISWCS.2018.8491089","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491089","url":null,"abstract":"In this paper, we investigate strategies for the allocation of computational resources using deep reinforcement learning in mobile edge computing networks that operate with finite blocklength codes to support low latency communications. The end-to-end (E2E) reliability of the service is addressed, while both the delay violation probability and the decoding error probability are taken into account. By employing a deep reinforcement learning method, namely deep Q-learning, we design an intelligent agent at the edge computing node to develop a real-time adaptive policy for computational resource allocation for offloaded tasks of multiple users in order to improve the average E2E reliability. Via simulations, we show that under different task arrival rates, the realized policy serves to increase the task number that decreases the delay violation rate while guaranteeing an acceptable level of decoding error probability. Moreover, we show that the proposed deep reinforcement learning approach outperforms the random and equal scheduling benchmarks.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114526421","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-08-01DOI: 10.1109/ISWCS.2018.8491217
Jingbo Du, Wei Xu, Chunming Zhao, L. Vandendorpe
A multiuser hybrid beamforming system with orthogonal frequency division multiplexing (OFDM) is considered. We propose an alternating optimization algorithm based on manifold optimization to maximize the performance in terms of the system spectral efficiency. Moreover, two simplified methods with low complexity are also proposed which are of practical relevance for massive MIMO. The proposed methods are verified by simulation results to have smaller spectral efficiency gaps with the fully-digital beamforming than the scheme in another recent research. With the proposed designs, significant cost savings are obtained with only marginal loss in performance.
{"title":"Hybrid Beamforming Design for Multiuser Massive MIMO-OFDM Systems","authors":"Jingbo Du, Wei Xu, Chunming Zhao, L. Vandendorpe","doi":"10.1109/ISWCS.2018.8491217","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491217","url":null,"abstract":"A multiuser hybrid beamforming system with orthogonal frequency division multiplexing (OFDM) is considered. We propose an alternating optimization algorithm based on manifold optimization to maximize the performance in terms of the system spectral efficiency. Moreover, two simplified methods with low complexity are also proposed which are of practical relevance for massive MIMO. The proposed methods are verified by simulation results to have smaller spectral efficiency gaps with the fully-digital beamforming than the scheme in another recent research. With the proposed designs, significant cost savings are obtained with only marginal loss in performance.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114941252","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-08-01DOI: 10.1109/ISWCS.2018.8491082
P. Pedrosa, R. Dinis
In this paper we consider the use of massive multiple-input, multiple-output (MIMO) combined with single-carrier with frequency-domain equalization (SC-FDE) modulations for the uplink, where phase noise occurs both at the receiver and the transmitter. To cope with the channel and the phase noise effects, we propose a receiver structure for joint equalization and phase noise estimation using low-complexity iterative frequency-domain equalization based on the equal gain combining (EGC) concept for the channel equalization allied to a particle filter for the phase noise estimation procedure. Since the equalization step decouples the data streams, the complexity of the phase noise estimation step grows linearly with the number of transmit antennas. In fact, phase noise estimation occurs concurrently for each receive antenna phase noise process. Assuming small phase noise levels at the receiver (i.e., the base station) while letting the phase noise levels take larger values at the transmitter the proposed scheme displays excellent performance.
{"title":"Joint Equalization and Phase Noise Estimation for the Uplink in Massive MIMO SC-FDE Schemes","authors":"P. Pedrosa, R. Dinis","doi":"10.1109/ISWCS.2018.8491082","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491082","url":null,"abstract":"In this paper we consider the use of massive multiple-input, multiple-output (MIMO) combined with single-carrier with frequency-domain equalization (SC-FDE) modulations for the uplink, where phase noise occurs both at the receiver and the transmitter. To cope with the channel and the phase noise effects, we propose a receiver structure for joint equalization and phase noise estimation using low-complexity iterative frequency-domain equalization based on the equal gain combining (EGC) concept for the channel equalization allied to a particle filter for the phase noise estimation procedure. Since the equalization step decouples the data streams, the complexity of the phase noise estimation step grows linearly with the number of transmit antennas. In fact, phase noise estimation occurs concurrently for each receive antenna phase noise process. Assuming small phase noise levels at the receiver (i.e., the base station) while letting the phase noise levels take larger values at the transmitter the proposed scheme displays excellent performance.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"1991 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125515069","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
扫码关注我们
求助内容：
应助结果提醒方式：