Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641168
Yunlong Shao, Yongyu Dai, T. Gulliver, Xiaodai Dong
This paper considers the linear source and relay precoders and destination combiner design for a multiple-input multiple-output (MIMO) full-duplex (FD) amplify-and-forward (AF) relay communication system. The effect of the residual interference due to imperfect loop interference (LI) cancellation is also considered. By taking the full-duplex relay into account, an iterative algorithm is proposed to minimize the mean squared error (MSE) of the received signal at the destination. The original non-convex problem is converted into three convex subproblems, and these are solved alternately to obtain a suboptimal solution to the design problem. The convergence of the iterative algorithm is investigated. Results are presented which show that the proposed FD relay communication system can approximately double the achievable rate compared to the corresponding half-duplex (HD) system when the residual LI level is not high.
{"title":"Precoding for MIMO Full-Duplex Amplify-and-Forward Relay Communication Systems","authors":"Yunlong Shao, Yongyu Dai, T. Gulliver, Xiaodai Dong","doi":"10.1109/ICCCHINA.2018.8641168","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641168","url":null,"abstract":"This paper considers the linear source and relay precoders and destination combiner design for a multiple-input multiple-output (MIMO) full-duplex (FD) amplify-and-forward (AF) relay communication system. The effect of the residual interference due to imperfect loop interference (LI) cancellation is also considered. By taking the full-duplex relay into account, an iterative algorithm is proposed to minimize the mean squared error (MSE) of the received signal at the destination. The original non-convex problem is converted into three convex subproblems, and these are solved alternately to obtain a suboptimal solution to the design problem. The convergence of the iterative algorithm is investigated. Results are presented which show that the proposed FD relay communication system can approximately double the achievable rate compared to the corresponding half-duplex (HD) system when the residual LI level is not high.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"32 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":"115271834","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/ICCCHINA.2018.8641244
Kezhong Zhang, Li Xu, Yueyan Zhang, Han Zhang, Z. Feng
Automatic Modulation Classification (AMC) is an important technology in various communication systems. However, AMC is vulnerable to the frequency offset. Previous works treat the frequency offset as a constant while the frequency offset is a stochastic variable in some communication systems. Thus in this paper, we propose an unsupervised clustering based method, termed as Clustering based Dynamic Identification(CDI), which can blindly identify signals with stochastic frequency offset. First, we locate one of the cluster centers in constellation through hill-climbing method. Then the modulation order is derived via calculating the number of signals in the certain section. We adopt the clustering method to identify the modulation type. Different from traditional clustering methods which use the Euclidean metric, our specially designed metric is adopted in CDI to diminish the influence of stochastic frequency offset. Finally, experimental results based on hardware measurement verify that our method outperforms than previous methods. It is shown that the Bit Error Rate (BER) for classification decreases by 0.98% for 16QAM and 1.16% for 8PSK, compared with the k-means method.
{"title":"Automatic Modulation Classification with Gaussian Distributed Frequency Offset","authors":"Kezhong Zhang, Li Xu, Yueyan Zhang, Han Zhang, Z. Feng","doi":"10.1109/ICCCHINA.2018.8641244","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641244","url":null,"abstract":"Automatic Modulation Classification (AMC) is an important technology in various communication systems. However, AMC is vulnerable to the frequency offset. Previous works treat the frequency offset as a constant while the frequency offset is a stochastic variable in some communication systems. Thus in this paper, we propose an unsupervised clustering based method, termed as Clustering based Dynamic Identification(CDI), which can blindly identify signals with stochastic frequency offset. First, we locate one of the cluster centers in constellation through hill-climbing method. Then the modulation order is derived via calculating the number of signals in the certain section. We adopt the clustering method to identify the modulation type. Different from traditional clustering methods which use the Euclidean metric, our specially designed metric is adopted in CDI to diminish the influence of stochastic frequency offset. Finally, experimental results based on hardware measurement verify that our method outperforms than previous methods. It is shown that the Bit Error Rate (BER) for classification decreases by 0.98% for 16QAM and 1.16% for 8PSK, compared with the k-means method.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","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":"122735617","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/ICCCHINA.2018.8641083
Hongxu Jin, Rongke Liu
Cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoding algorithm has brought good error performance. Recently, some researchers utilized multiple CRC codes to reduce decoding complexity of CA-SCL decoding algorithm. However, based on CA-SCL decoding frame, we not only reduce decoding complexity but also improve error performance. We divide polar codeword into independent sub-blocks during the process of encoding. Meanwhile, locations of multiple CRC are optimized according to a value of each average Bhattacharyya parameter. Finally, for CA-SCL decoding, results indicate that our constructed polar codes show an admirable error performance and low decoding complexity than that of equal sub-block codewords.
{"title":"Location Design of Multiple Cyclic Redundancy Checks for Polar Codes in Successive Cancellation List Decoding","authors":"Hongxu Jin, Rongke Liu","doi":"10.1109/ICCCHINA.2018.8641083","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641083","url":null,"abstract":"Cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoding algorithm has brought good error performance. Recently, some researchers utilized multiple CRC codes to reduce decoding complexity of CA-SCL decoding algorithm. However, based on CA-SCL decoding frame, we not only reduce decoding complexity but also improve error performance. We divide polar codeword into independent sub-blocks during the process of encoding. Meanwhile, locations of multiple CRC are optimized according to a value of each average Bhattacharyya parameter. Finally, for CA-SCL decoding, results indicate that our constructed polar codes show an admirable error performance and low decoding complexity than that of equal sub-block codewords.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"22 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":"124796562","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/ICCCHINA.2018.8641135
Peng Ge, Tiejun Lv
The increased energy consumption and operational expenditure (OPEX) that result from the heavy terminal load and network densification increase the cost of 5G networks. Using machine learning algorithms more potential information may be obtained from the user-related data that can play a pivotal role in automatic resource management enabling self-organizing networking (SON) in 5G networks. This paper proposes an energy efficiency (EE)-oriented self-optimization function based on proactive predictions in a multi-cell massive multiple-input multiple-output (MIMO) network. Our self-optimization function can automatically adjust the active antennas in each cell based on the predicted quantity of users in the next time interval to proactively adapt to the fluctuations in the traffic load. Furthermore, a two-step optimization scheme is proposed. The first-step independent optimization scheme employs the single-cell proactive prediction result to obtain the appropriate number of active antennas in each cell to maximize EE. The second-step joint optimization scheme employs multi-cell information related to the number of active antennas and users to further optimize the network. We use a real dataset from existing base stations (BSs) to test our prediction model and optimization schemes. The simulation results demonstrate that both schemes can yield a considerable performance improvement in EE compared with the static antennas adjustment scheme.
{"title":"Data enabled Self-Organizing Network with Adaptive Antennas based on Proactive Prediction for Enabling 5G","authors":"Peng Ge, Tiejun Lv","doi":"10.1109/ICCCHINA.2018.8641135","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641135","url":null,"abstract":"The increased energy consumption and operational expenditure (OPEX) that result from the heavy terminal load and network densification increase the cost of 5G networks. Using machine learning algorithms more potential information may be obtained from the user-related data that can play a pivotal role in automatic resource management enabling self-organizing networking (SON) in 5G networks. This paper proposes an energy efficiency (EE)-oriented self-optimization function based on proactive predictions in a multi-cell massive multiple-input multiple-output (MIMO) network. Our self-optimization function can automatically adjust the active antennas in each cell based on the predicted quantity of users in the next time interval to proactively adapt to the fluctuations in the traffic load. Furthermore, a two-step optimization scheme is proposed. The first-step independent optimization scheme employs the single-cell proactive prediction result to obtain the appropriate number of active antennas in each cell to maximize EE. The second-step joint optimization scheme employs multi-cell information related to the number of active antennas and users to further optimize the network. We use a real dataset from existing base stations (BSs) to test our prediction model and optimization schemes. The simulation results demonstrate that both schemes can yield a considerable performance improvement in EE compared with the static antennas adjustment scheme.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"13 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":"127857463","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/ICCCHINA.2018.8641230
Shengxiao Chen, Meiying Ji, Xiao Ma
The performance of spatial modulation (SM) in an indoor multiple-input multiple-output visible light communication (MIMO-VLC) system is severely limited by the inherent strong correlations of the optical MIMO channels. To cope with this problem, a power allocation scheme by minimizing the bit-error rate (BER) bound is proposed in this paper, which can achieve a trade-off between the computational complexity and BER performance. On the other hand, a recently proposed coding scheme called block Markov superposition transmission (BMST) is constructed and combined with SM-VLC, where a genie-aided lower bound is also presented to predict the BER performance in the low-BER region. Furthermore, an iterative receiver, which exchanges messages between the BMST decoder and the soft-in soft-out (SISO) SM demapper, is employed to improve the BER performance. Simulation results demonstrate that the BMST-SM-VLC system with power allocation and iterative receiver can achieve significant coding gain even over strongly correlated optical MIMO channels.
在室内多输入多输出可见光通信(MIMO- vlc)系统中，空间调制(SM)的性能受到光学MIMO信道固有的强相关性的严重限制。为了解决这一问题，本文提出了一种最小化误码率(BER)边界的功率分配方案，该方案可以在计算复杂度和误码率性能之间取得平衡。另一方面，构造了最近提出的分组马尔可夫叠加传输(BMST)，并将其与SM-VLC相结合，其中还提出了一个基因辅助下界来预测低误码率区域的误码率性能。此外，在BMST解码器和软入软出(SISO) SM demapper之间采用迭代接收交换消息，提高了误码率性能。仿真结果表明，采用功率分配和迭代接收机的BMST-SM-VLC系统即使在强相关光MIMO信道上也能获得显著的编码增益。
{"title":"Performance of Power Allocation and Iterative Receiver in SM-VLC System with Block Markov Superposition Transmission","authors":"Shengxiao Chen, Meiying Ji, Xiao Ma","doi":"10.1109/ICCCHINA.2018.8641230","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641230","url":null,"abstract":"The performance of spatial modulation (SM) in an indoor multiple-input multiple-output visible light communication (MIMO-VLC) system is severely limited by the inherent strong correlations of the optical MIMO channels. To cope with this problem, a power allocation scheme by minimizing the bit-error rate (BER) bound is proposed in this paper, which can achieve a trade-off between the computational complexity and BER performance. On the other hand, a recently proposed coding scheme called block Markov superposition transmission (BMST) is constructed and combined with SM-VLC, where a genie-aided lower bound is also presented to predict the BER performance in the low-BER region. Furthermore, an iterative receiver, which exchanges messages between the BMST decoder and the soft-in soft-out (SISO) SM demapper, is employed to improve the BER performance. Simulation results demonstrate that the BMST-SM-VLC system with power allocation and iterative receiver can achieve significant coding gain even over strongly correlated optical MIMO channels.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"4 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":"117123656","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/ICCCHINA.2018.8641150
Yong Liao, Ling Chen, Yuanxiao Hua, Shumin Zhang, Xuanfan Shen, Hu Yi
In frequency division duplex (FDD) massive MIMO systems, the feedback of channel state information (CSI) increases greatly with the number of antennas raising. Therefore, it is a hot-spot to research how to reduce the feedback overhead. It is considered that massive MIMO channel is sparse and in actual situation the sparsity is unknown, so the sparse adaptive matching pursuit (SAMP) algorithm is introduced to cope with these problems. Aiming at solving the shortcomings of SAMP, including the fixed step size and too much iterations, the modified SAMP (M-SAMP) is proposed in this paper. We combine the signal segmenting, the initial sparsity estimating and variable step size to reconstruct the signal quickly and accurately. The simulation results show that M-SAMP is superior than the SAMP algorithm both in reconstruction accuracy and computation time. In addition, compared with the orthogonal matching pursuit (OMP), subspace tracking (SP), and SAMP algorithms, the better normalized mean squared error (NMSE) performance of M-SAMP could be witnessed, which demonstrates the practicability of M-SAMP in massive MIMO systems.
{"title":"M-SAMP: A Low-complexity Modified SAMP Algorithm for Massive MIMO CSI Feedback","authors":"Yong Liao, Ling Chen, Yuanxiao Hua, Shumin Zhang, Xuanfan Shen, Hu Yi","doi":"10.1109/ICCCHINA.2018.8641150","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641150","url":null,"abstract":"In frequency division duplex (FDD) massive MIMO systems, the feedback of channel state information (CSI) increases greatly with the number of antennas raising. Therefore, it is a hot-spot to research how to reduce the feedback overhead. It is considered that massive MIMO channel is sparse and in actual situation the sparsity is unknown, so the sparse adaptive matching pursuit (SAMP) algorithm is introduced to cope with these problems. Aiming at solving the shortcomings of SAMP, including the fixed step size and too much iterations, the modified SAMP (M-SAMP) is proposed in this paper. We combine the signal segmenting, the initial sparsity estimating and variable step size to reconstruct the signal quickly and accurately. The simulation results show that M-SAMP is superior than the SAMP algorithm both in reconstruction accuracy and computation time. In addition, compared with the orthogonal matching pursuit (OMP), subspace tracking (SP), and SAMP algorithms, the better normalized mean squared error (NMSE) performance of M-SAMP could be witnessed, which demonstrates the practicability of M-SAMP in massive MIMO systems.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"20 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":"125964838","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/ICCCHINA.2018.8641186
Yao Zhang, Q. Ni
Quantum key distribution (QKD) has received great attention towards future secure communication systems. Since the laws of the quantum mechanics make sure the security and it cannot be cracked by using any mathematical method, there is a great deal of research work in this area which achieves groundbreaking progress. However, some obvious issues are still the obstacle of the daily use of QKD, such as the distance of communications. Using trusted repeaters is a promising approach to extend the range of QKD. This paper proposes a possible QKD system with current network structures and comes up with a novel method of using trusted repeaters to satisfy the requirement of secure QKD network.
{"title":"Design and Analysis of Secure Quantum Network System with Trusted Repeaters","authors":"Yao Zhang, Q. Ni","doi":"10.1109/ICCCHINA.2018.8641186","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641186","url":null,"abstract":"Quantum key distribution (QKD) has received great attention towards future secure communication systems. Since the laws of the quantum mechanics make sure the security and it cannot be cracked by using any mathematical method, there is a great deal of research work in this area which achieves groundbreaking progress. However, some obvious issues are still the obstacle of the daily use of QKD, such as the distance of communications. Using trusted repeaters is a promising approach to extend the range of QKD. This paper proposes a possible QKD system with current network structures and comes up with a novel method of using trusted repeaters to satisfy the requirement of secure QKD network.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","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":"128402862","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/ICCCHINA.2018.8641090
Jianwen Xu, K. Ota, M. Dong
Initially as an extension of cloud computing, fog computing has been inspiring new ideas about moving computing tasks to the edge of a network. In fog, we often repeat the procedure of placing service because of the geographical distribution of mobile users. We may not expect a fixed demand and supply relationship between users and service providers since users always prefer nearby service with less time delay and transmission consumption. That is, a plug-and-play service mode is what we need in fog. In this paper, we put forward a dynamic placement strategy for fog service in a three-tier wireless multimedia network to guarantee the normal service provision and optimize the Quality of Service (QoS). The simulation results show that our strategy can achieve better performance under metrics including energy consumption and end-to-end latency compared with existed methods.
{"title":"Plug-and-Play for Fog: Dynamic Service Placement in Wireless Multimedia Networks","authors":"Jianwen Xu, K. Ota, M. Dong","doi":"10.1109/ICCCHINA.2018.8641090","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641090","url":null,"abstract":"Initially as an extension of cloud computing, fog computing has been inspiring new ideas about moving computing tasks to the edge of a network. In fog, we often repeat the procedure of placing service because of the geographical distribution of mobile users. We may not expect a fixed demand and supply relationship between users and service providers since users always prefer nearby service with less time delay and transmission consumption. That is, a plug-and-play service mode is what we need in fog. In this paper, we put forward a dynamic placement strategy for fog service in a three-tier wireless multimedia network to guarantee the normal service provision and optimize the Quality of Service (QoS). The simulation results show that our strategy can achieve better performance under metrics including energy consumption and end-to-end latency compared with existed methods.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"106 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":"127301133","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/ICCCHINA.2018.8641215
Liping Kui, Sai Huang, Qixun Zhang, Z. Feng
Due to severe isotropic path loss at millimeter wave (mmWave) frequencies, highly directional transmission is required to achieve high beamforming gain. However, this directional transmission complicates initial access (IA) for mmWave communications. In this paper, we formulate the blind base station (BS) discovery and synchronization in IA process as a bivariate hypothesis detection test, and then propose a reliable and effective detection scheme under non-cooperative reception for mmWave cellular networks. In the scheme, three scanning modes are introduced to intercept signal, namely single-fixed direction scan, polling direction scan, half-direction scan. We derive two different detectors based on energy and correlation, respectively. Through analyzing the test statistics at different delays, the BS time offset is estimated coarsely at UE receiver. Simulation results show that the detection performance of our proposed detectors for mmWave BS discovery is close to the theoretical analysis, and the polling direction scan is more accurate and reliable for mmWave system with narrow beams at low signal-to-noise ratio (SNR).
{"title":"A Reliable Detection Scheme under Non-cooperative Reception for BS Discovery in Millimeter Wave Systems","authors":"Liping Kui, Sai Huang, Qixun Zhang, Z. Feng","doi":"10.1109/ICCCHINA.2018.8641215","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641215","url":null,"abstract":"Due to severe isotropic path loss at millimeter wave (mmWave) frequencies, highly directional transmission is required to achieve high beamforming gain. However, this directional transmission complicates initial access (IA) for mmWave communications. In this paper, we formulate the blind base station (BS) discovery and synchronization in IA process as a bivariate hypothesis detection test, and then propose a reliable and effective detection scheme under non-cooperative reception for mmWave cellular networks. In the scheme, three scanning modes are introduced to intercept signal, namely single-fixed direction scan, polling direction scan, half-direction scan. We derive two different detectors based on energy and correlation, respectively. Through analyzing the test statistics at different delays, the BS time offset is estimated coarsely at UE receiver. Simulation results show that the detection performance of our proposed detectors for mmWave BS discovery is close to the theoretical analysis, and the polling direction scan is more accurate and reliable for mmWave system with narrow beams at low signal-to-noise ratio (SNR).","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"20 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":"131622079","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/ICCCHINA.2018.8641180
Lin Mei, Shihong Cui, Zhenduo Wang
As a novel 5G waveform candidate, universal filtered multicarrier (UFMC) systems are proposed to suppress out of band power (OOBP) radiation and reduce intercarrier interference of orthogonal frequency division multiplexing (OFDM) systems through filtering. In this paper, UFMC systems with weighted-type fractional Fourier transform (WFRFT) precoding are put forward to extend the framework, where UFMC and DFT spread UFMC waveforms are the special cases. Analytical bit error rate (BER) expressions of the WFRFT precoded UFMC framework over AWGN and fading channels are derived and verified by simulation results, where the ZF or MMSE criterion is employed for channel equalization.
{"title":"BER Performance Analysis for Universal Filtered Multicarrier System with WFRFT precoding","authors":"Lin Mei, Shihong Cui, Zhenduo Wang","doi":"10.1109/ICCCHINA.2018.8641180","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641180","url":null,"abstract":"As a novel 5G waveform candidate, universal filtered multicarrier (UFMC) systems are proposed to suppress out of band power (OOBP) radiation and reduce intercarrier interference of orthogonal frequency division multiplexing (OFDM) systems through filtering. In this paper, UFMC systems with weighted-type fractional Fourier transform (WFRFT) precoding are put forward to extend the framework, where UFMC and DFT spread UFMC waveforms are the special cases. Analytical bit error rate (BER) expressions of the WFRFT precoded UFMC framework over AWGN and fading channels are derived and verified by simulation results, where the ZF or MMSE criterion is employed for channel equalization.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"30 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":"133232176","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
扫码关注我们
求助内容：
应助结果提醒方式：