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.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.8491223
A. Moawad, K. Yao, A. Mansour, R. Gautier
This paper provides a novel blind spectrum sensing technique based on cepstral analysis in interweave cognitive radio (CR) system. The main scope of this work is to mitigate the problem of weak signal detection so as to allow for interference-free spectrum sharing. The misdetection problem of a possible legitimate user occupies a desired frequency band leads to erroneous sensing results. Based on the periodicity revealing property of cepstral analysis approaches, we formulate a spectrum sensing technique based on the autocepstrum concept. We employ the proposed approach to detect a spread spectrum (SS) primary user (PU) signal. The blind theme of the proposed approach implies that no knowledge of the spreading code employed in a SS signal is provided at the CR receiver. The distribution of the detection test statistic is derived under the null hypothesis based on Neyman-Pearson lemma (NPL). The corresponding detection threshold is analytically computed. The performance of the proposed spectrum sensing algorithm is compared with conventional energy detection (CED) in terms of detection probability. As a result, the proposed detector outperforms CED, and indicates lower misdetection probability in low signal-to-noise (SNR) ratio environment.
{"title":"Autocepstrum Approach for Spectrum Sensing in Cognitive Radio","authors":"A. Moawad, K. Yao, A. Mansour, R. Gautier","doi":"10.1109/ISWCS.2018.8491223","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491223","url":null,"abstract":"This paper provides a novel blind spectrum sensing technique based on cepstral analysis in interweave cognitive radio (CR) system. The main scope of this work is to mitigate the problem of weak signal detection so as to allow for interference-free spectrum sharing. The misdetection problem of a possible legitimate user occupies a desired frequency band leads to erroneous sensing results. Based on the periodicity revealing property of cepstral analysis approaches, we formulate a spectrum sensing technique based on the autocepstrum concept. We employ the proposed approach to detect a spread spectrum (SS) primary user (PU) signal. The blind theme of the proposed approach implies that no knowledge of the spreading code employed in a SS signal is provided at the CR receiver. The distribution of the detection test statistic is derived under the null hypothesis based on Neyman-Pearson lemma (NPL). The corresponding detection threshold is analytically computed. The performance of the proposed spectrum sensing algorithm is compared with conventional energy detection (CED) in terms of detection probability. As a result, the proposed detector outperforms CED, and indicates lower misdetection probability in low signal-to-noise (SNR) ratio environment.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"146 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":"122953892","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.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.8491097
Erhu Chen, Minghua Xia, S. Aïssa
In this paper, by deploying hybrid relaying nodes (HNs), capable of both, data relaying and power radiation, the technique of wireless power transfer is integrated into legacy wireless communications networks. In particular, applying the nearest-neighbour criterion to associate HNs to base stations, or user equipments (UEs) to HNs, a two-tier hierarchical wireless network is developed. Using stochastic geometry tools, the transmission probability of UEs and the coverage probability of uplink data transmission are investigated. Moreover, to optimize the coverage probability for given densities of UEs and base stations, the optimal HN density is derived. Simulation results demonstrate the effectiveness of the developed analyses.
{"title":"Coverage Probability of Hierarchical Wireless Networks with Hybrid Powering/Relaying Nodes (Invited Paper)","authors":"Erhu Chen, Minghua Xia, S. Aïssa","doi":"10.1109/ISWCS.2018.8491097","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491097","url":null,"abstract":"In this paper, by deploying hybrid relaying nodes (HNs), capable of both, data relaying and power radiation, the technique of wireless power transfer is integrated into legacy wireless communications networks. In particular, applying the nearest-neighbour criterion to associate HNs to base stations, or user equipments (UEs) to HNs, a two-tier hierarchical wireless network is developed. Using stochastic geometry tools, the transmission probability of UEs and the coverage probability of uplink data transmission are investigated. Moreover, to optimize the coverage probability for given densities of UEs and base stations, the optimal HN density is derived. Simulation results demonstrate the effectiveness of the developed analyses.","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":"129005108","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.8491072
Christos E. Tsirakis, Elena López-Aguilera, Panagiotis Matzoros, G. Agapiou, D. Varoutas
In this research work, we analyze the problem of spectrum trading in virtualized multi-tenant 5G networks using principles from matching theory. More specifically, we deal with the matching problem among the Mobile Network Operators (MNOs) and the Mobile Virtual Network Operators (MVNOs) and we propose a matching scheme that takes into account the preferences of each entity in terms of different utility variables. Our proposal includes a many-to-many matching scheme, that is an extension of the deferred acceptance algorithm, where each MNO and MVNO can cooperate with one or more MVNOs and MNOs, respectively. The performance of our proposed scheme is finally investigated by comparing it with various schemes and some useful conclusions are drawn.
{"title":"Spectrum Trading in Virtualized Multi-Tenant 5G Networks","authors":"Christos E. Tsirakis, Elena López-Aguilera, Panagiotis Matzoros, G. Agapiou, D. Varoutas","doi":"10.1109/ISWCS.2018.8491072","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491072","url":null,"abstract":"In this research work, we analyze the problem of spectrum trading in virtualized multi-tenant 5G networks using principles from matching theory. More specifically, we deal with the matching problem among the Mobile Network Operators (MNOs) and the Mobile Virtual Network Operators (MVNOs) and we propose a matching scheme that takes into account the preferences of each entity in terms of different utility variables. Our proposal includes a many-to-many matching scheme, that is an extension of the deferred acceptance algorithm, where each MNO and MVNO can cooperate with one or more MVNOs and MNOs, respectively. The performance of our proposed scheme is finally investigated by comparing it with various schemes and some useful conclusions are drawn.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"17 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":"123163964","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
扫码关注我们
求助内容：
应助结果提醒方式：