How to solve the collision problem in Aloha is a popular research direction all the time. In order to solve this problem in multi-receiver satellite IoT networks, a novel random access scheme named Cooperative Slotted Aloha with Reservation (R-CSA) is proposed. One characteristic of multi-receiver satellite IoT networks is the different propagation delay among receivers, which can be used in the proposed R-CSA for iterative interference cancellation. The other problem common in Aloha schemes is low critical point (after this point, as the normalized load increases, the throughput decreases). For this problem, reservation is considered in the proposed scheme. The performance of R-CSA is analyzed with mathematical method and simulations. Simulation results show that R-CSA outperforms R-CRDSA in terms of packet loss ratio and throughput. According to the simulation results, the critical point of R-CSA is higher than R-CRDSA. And in the aspect of packet loss ratio(PLR), even if the normalized load is up to 1, the PLR of R-CSA is still lower than 0.1.
{"title":"Cooperative Slotted Aloha with Reservation for Multi-Receiver Satellite IoT Networks","authors":"Rumeng Wang, Pengxu Li, Gaofeng Cui, Weidong Wang, Yinghai Zhang","doi":"10.1109/ICCCHINA.2018.8641112","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641112","url":null,"abstract":"How to solve the collision problem in Aloha is a popular research direction all the time. In order to solve this problem in multi-receiver satellite IoT networks, a novel random access scheme named Cooperative Slotted Aloha with Reservation (R-CSA) is proposed. One characteristic of multi-receiver satellite IoT networks is the different propagation delay among receivers, which can be used in the proposed R-CSA for iterative interference cancellation. The other problem common in Aloha schemes is low critical point (after this point, as the normalized load increases, the throughput decreases). For this problem, reservation is considered in the proposed scheme. The performance of R-CSA is analyzed with mathematical method and simulations. Simulation results show that R-CSA outperforms R-CRDSA in terms of packet loss ratio and throughput. According to the simulation results, the critical point of R-CSA is higher than R-CRDSA. And in the aspect of packet loss ratio(PLR), even if the normalized load is up to 1, the PLR of R-CSA is still lower than 0.1.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"50 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":"114701992","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.8641259
Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang
Recently, deep convolutional neural networks (CNNs) have led to significant improvement over semantic image segmentation and have also been the best choice. In this paper, we propose a deep neural network architecture, Multi-Path Fusion Network (MPFNet), for semantic image segmentation. In MPFNet, we add more convolution paths to every convolution layer. The depth of each convolutional path increases linearly, which provides a superior method for pixel level prediction. Using this method, we integrate contextual information and local information to produce good quality results on the semantic segmentation task. In addition, dense skip connections are added to repeatedly leverage previous features. The proposed approach improves strong baselines built upon VGG16 on two urban scene datasets, CamVid and Cityscapes, which demonstrate its effectiveness in modeling context information.
{"title":"Multi-path Fusion Network For Semantic Image Segmentation","authors":"Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang","doi":"10.1109/ICCCHINA.2018.8641259","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641259","url":null,"abstract":"Recently, deep convolutional neural networks (CNNs) have led to significant improvement over semantic image segmentation and have also been the best choice. In this paper, we propose a deep neural network architecture, Multi-Path Fusion Network (MPFNet), for semantic image segmentation. In MPFNet, we add more convolution paths to every convolution layer. The depth of each convolutional path increases linearly, which provides a superior method for pixel level prediction. Using this method, we integrate contextual information and local information to produce good quality results on the semantic segmentation task. In addition, dense skip connections are added to repeatedly leverage previous features. The proposed approach improves strong baselines built upon VGG16 on two urban scene datasets, CamVid and Cityscapes, which demonstrate its effectiveness in modeling context information.","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":"121598379","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.8641231
Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang
Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.
{"title":"Joint Random Pilot and Multi-Slot Access in Massive MIMO for Space Information Networks","authors":"Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641231","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641231","url":null,"abstract":"Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.","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":"122446308","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.8641250
Yue Zhu, Gongpu Wang, Hengliang Tang, R. He, Yulong Zou
Recently, ambient backscatter has attracted much attention since it enables battery-free devices to communicate with other devices by utilizing environmental radio frequency signals. Existing studies about ambient backscatter often assume flat fading channels. In fact, most practical channels are frequency-selective. Thus, in this paper, we consider the ambient backscatter communication systems over frequency-selective channels and focus on the problem of channel estimation. Specifically, we first adopt the least square (LS) algorithm to obtain the estimates of channel parameters when the tag is in different states. Next, an iterative estimator is proposed to improve the estimation performance. In addition, the Cramér-Rao Lower Bounds (CRLBs) for different channel parameters are derived to evaluate the mean square error (MSE) performance. Finally, simulation results are provided to corroborate the proposed studies.
{"title":"Channel Estimation for Ambient Backscatter Systems over Frequency-Selective Channels","authors":"Yue Zhu, Gongpu Wang, Hengliang Tang, R. He, Yulong Zou","doi":"10.1109/ICCCHINA.2018.8641250","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641250","url":null,"abstract":"Recently, ambient backscatter has attracted much attention since it enables battery-free devices to communicate with other devices by utilizing environmental radio frequency signals. Existing studies about ambient backscatter often assume flat fading channels. In fact, most practical channels are frequency-selective. Thus, in this paper, we consider the ambient backscatter communication systems over frequency-selective channels and focus on the problem of channel estimation. Specifically, we first adopt the least square (LS) algorithm to obtain the estimates of channel parameters when the tag is in different states. Next, an iterative estimator is proposed to improve the estimation performance. In addition, the Cramér-Rao Lower Bounds (CRLBs) for different channel parameters are derived to evaluate the mean square error (MSE) performance. Finally, simulation results are provided to corroborate the proposed studies.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"12 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":"130188249","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.8641257
He Huang, Chaowei Yuan
In this study, product of two independent and non-identically distributed (i.n.i.d.) random variables (RVs) for κ-μ fading distribution and α-μ fading distribution is considered. The novel exact series formulas for the product of two i.n.i.d. fading distributions κ-μ and α-μ are derived instead of Fox H-function to solve the problem that Fox H-function with multiple RVs cannot be implemented in professional mathematical software packages as MATHEMATICA and MAPLE. Exact close-form expressions of probability density function (PDF) and cumulative distribution function (CDF) are deduced to represent provided product expressions and generalized composite multipath shadowing models. At last, these analytical results are validated with Monte Carlo simulations, it shows that for provided κ-μ/α-μ model nonlinear parameter has more important influence than multipath component in PDF and CDF when the ratio between the total power of the dominant components and the total power of the scattered waves is same.
{"title":"Product of κ-μ and α-μ Distributions and Their Composite Fading Distributions","authors":"He Huang, Chaowei Yuan","doi":"10.1109/ICCCHINA.2018.8641257","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641257","url":null,"abstract":"In this study, product of two independent and non-identically distributed (i.n.i.d.) random variables (RVs) for κ-μ fading distribution and α-μ fading distribution is considered. The novel exact series formulas for the product of two i.n.i.d. fading distributions κ-μ and α-μ are derived instead of Fox H-function to solve the problem that Fox H-function with multiple RVs cannot be implemented in professional mathematical software packages as MATHEMATICA and MAPLE. Exact close-form expressions of probability density function (PDF) and cumulative distribution function (CDF) are deduced to represent provided product expressions and generalized composite multipath shadowing models. At last, these analytical results are validated with Monte Carlo simulations, it shows that for provided κ-μ/α-μ model nonlinear parameter has more important influence than multipath component in PDF and CDF when the ratio between the total power of the dominant components and the total power of the scattered waves is same.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"44 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":"128149144","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.8641260
Xiaonan Liu, Guan Gui, Nan Zhao, W. Meng, Zan Li, Yunfei Chen, F. Adachi
Unmanned aerial vehicles (UAVs) can be exploited to provide emergency coverage in disasters, due to its mobility and flexibility. In this paper, we propose multi-antenna precoding design and multi-hop device-to-device (D2D) communication to guarantee the reliable transmission and extend the UAV coverage for downlink in disasters. Firstly, multi-hop D2D links are established to extend the coverage of UAV emergency networks with limited transmit power. In particular, a shortest-path-routing algorithm is proposed to establish the D2D links rapidly with minimum nodes, with closed-form solutions for the number of hops derived. Secondly, the precoding design for the UAV downlink is studied, to optimize the performance of UAV transmission. Due to the non-convexity of the problem, a second-order-cone programming based algorithm is proposed to solve it efficiently. Simulation results show the effectiveness of the proposed schemes for UAV coverage in disasters.
{"title":"UAV Coverage for Downlink in Disasters: Precoding and Multi-hop D2D","authors":"Xiaonan Liu, Guan Gui, Nan Zhao, W. Meng, Zan Li, Yunfei Chen, F. Adachi","doi":"10.1109/ICCCHINA.2018.8641260","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641260","url":null,"abstract":"Unmanned aerial vehicles (UAVs) can be exploited to provide emergency coverage in disasters, due to its mobility and flexibility. In this paper, we propose multi-antenna precoding design and multi-hop device-to-device (D2D) communication to guarantee the reliable transmission and extend the UAV coverage for downlink in disasters. Firstly, multi-hop D2D links are established to extend the coverage of UAV emergency networks with limited transmit power. In particular, a shortest-path-routing algorithm is proposed to establish the D2D links rapidly with minimum nodes, with closed-form solutions for the number of hops derived. Secondly, the precoding design for the UAV downlink is studied, to optimize the performance of UAV transmission. Due to the non-convexity of the problem, a second-order-cone programming based algorithm is proposed to solve it efficiently. Simulation results show the effectiveness of the proposed schemes for UAV coverage in disasters.","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":"122319208","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 next generation network, types of services will be more diverse due to the increment of users demand. Traffic Engineering (TE), which solves the problem of performance optimization in network, cannot meet the QoS needs of different services because of the limitations of routing strategies in existing networks. Software-defined network (SDN) is a promising network paradigm that separates control plane and data plane, and enhances network flexibility. SDN brings benefits to TE via collecting and analyzing data dynamically. Existing mobile network solutions mostly focus on single network, such as radio access network or core network. In this paper, edge nodes in software-defined backhaul network are selected as the entrances of network flows from base stations in heterogeneous cellular network. An Access Selection Method (ASM) is proposed to choose access nodes by measuring the similarity between the service characteristics and performance of backhaul edge nodes with weighted Euclidean distance. Network flows traversing the edge nodes split into multiple sub-service flows among backhaul based on types of services. A Service Awareness Routing (SAR) scheme is proposed to minimize overhead from perspective of service combining ASM. The joint design with SAR and ASM solves entrances selection and network flowing routing problems in consideration of network services. Extensive simulations show the effectiveness and reliability of the proposed scheme.
{"title":"Joint Optimization of Heterogeneous Cellular and Backhaul Networks for Services Awareness in SDN","authors":"Wensheng Zhu, X. Liu, Xiaorong Zhu, Ting Jiang, Xuejian Zhao","doi":"10.1109/ICCCHINA.2018.8641115","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641115","url":null,"abstract":"In next generation network, types of services will be more diverse due to the increment of users demand. Traffic Engineering (TE), which solves the problem of performance optimization in network, cannot meet the QoS needs of different services because of the limitations of routing strategies in existing networks. Software-defined network (SDN) is a promising network paradigm that separates control plane and data plane, and enhances network flexibility. SDN brings benefits to TE via collecting and analyzing data dynamically. Existing mobile network solutions mostly focus on single network, such as radio access network or core network. In this paper, edge nodes in software-defined backhaul network are selected as the entrances of network flows from base stations in heterogeneous cellular network. An Access Selection Method (ASM) is proposed to choose access nodes by measuring the similarity between the service characteristics and performance of backhaul edge nodes with weighted Euclidean distance. Network flows traversing the edge nodes split into multiple sub-service flows among backhaul based on types of services. A Service Awareness Routing (SAR) scheme is proposed to minimize overhead from perspective of service combining ASM. The joint design with SAR and ASM solves entrances selection and network flowing routing problems in consideration of network services. Extensive simulations show the effectiveness and reliability of the proposed scheme.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"28 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":"122650648","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.8641143
Beini Rong, Shiqi Gong, Zesong Fei
We investigate how to design the robust training matrix for spatially correlated multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying channels with imperfect channel covariance matrices, where the unitary-invariant channel covariance error matrices and the colored noise are assumed. Moreover, the superimposed training technology and the total power constraint are both taken into account. In our work, the robust training design for linear minimum mean-squared-error (LMMSE) channel estimation is formulated as a nonconvex problem. In order to effectively solve the considered nonconvex optimization problem, we resort to an upper bound of the performance of the training optimization and then an iterative SDP algorithm is proposed for the training optimization. Finally, numerical simulations demonstrate the excellent advantages of the proposed robust training design for the LMMSE based channel estimation.
{"title":"Robust Superimposed Training Designs for MIMO AF Relaying Channels under Total Power Constraint","authors":"Beini Rong, Shiqi Gong, Zesong Fei","doi":"10.1109/ICCCHINA.2018.8641143","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641143","url":null,"abstract":"We investigate how to design the robust training matrix for spatially correlated multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying channels with imperfect channel covariance matrices, where the unitary-invariant channel covariance error matrices and the colored noise are assumed. Moreover, the superimposed training technology and the total power constraint are both taken into account. In our work, the robust training design for linear minimum mean-squared-error (LMMSE) channel estimation is formulated as a nonconvex problem. In order to effectively solve the considered nonconvex optimization problem, we resort to an upper bound of the performance of the training optimization and then an iterative SDP algorithm is proposed for the training optimization. Finally, numerical simulations demonstrate the excellent advantages of the proposed robust training design for the LMMSE based channel estimation.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","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":"123072724","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.8641170
Tse-Tin Chan, T. Lok
In this paper, we propose the ideas of signal-aligned network coding (SNC). We present the ideas in two-user time-varying interference channels with limited receiver cooperation. We assume that the receivers are connected to a central processor via wired cooperation links with individual limited capacities. Our SNC scheme determines the precoding matrices of the transmitters so that the transmitted signals are aligned at the receivers. The aligned signals are then decoded into linear combinations of messages by physical-layer network coding strategy. The key idea of our scheme is to ensure that independent linear combinations of messages, also known as network-coded messages, can be decoded at the receivers. Hence the central processor can recover the original messages of the transmitters by solving the linearly independent equations. We prove that our SNC scheme achieves full degrees of freedom (DoF) by utilizing signal alignment and physical-layer network coding. Simulation results show the DoF achieved by our SNC scheme almost doubles that by the orthogonal transmission scheme in two-user time-varying interference channels with limited receiver cooperation. The performance improvement of our SNC scheme mainly comes from efficient utilization of the signal subspaces for conveying independent linear combinations of messages to the central processor.
{"title":"Signal-Aligned Network Coding in Interference Channels with Limited Receiver Cooperation","authors":"Tse-Tin Chan, T. Lok","doi":"10.1109/ICCCHINA.2018.8641170","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641170","url":null,"abstract":"In this paper, we propose the ideas of signal-aligned network coding (SNC). We present the ideas in two-user time-varying interference channels with limited receiver cooperation. We assume that the receivers are connected to a central processor via wired cooperation links with individual limited capacities. Our SNC scheme determines the precoding matrices of the transmitters so that the transmitted signals are aligned at the receivers. The aligned signals are then decoded into linear combinations of messages by physical-layer network coding strategy. The key idea of our scheme is to ensure that independent linear combinations of messages, also known as network-coded messages, can be decoded at the receivers. Hence the central processor can recover the original messages of the transmitters by solving the linearly independent equations. We prove that our SNC scheme achieves full degrees of freedom (DoF) by utilizing signal alignment and physical-layer network coding. Simulation results show the DoF achieved by our SNC scheme almost doubles that by the orthogonal transmission scheme in two-user time-varying interference channels with limited receiver cooperation. The performance improvement of our SNC scheme mainly comes from efficient utilization of the signal subspaces for conveying independent linear combinations of messages to the central processor.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"29 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":"126481695","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.8641181
Yuyan Zhao, Yanan Liu, G. Boudreau, A. B. Sediq, Xianbin Wang
In order to exploit the potential capacity of 5G, the combination of millimeter-wave (mmWave) and massive multiple input multiple output (MIMO) techniques provides a promising solution through beamforming. However, the extremely high carrier frequency dramatically reduces the channel coherence time, leading to frequent channel estimation and substantially increased overhead for the conventional channel information based beamforming. In this paper, we propose an angle-based beamforming scheme to reduce the overhead of beamforming by increasing the beam serving period. A novel multi-zone beamforming technique is proposed to support users with different distance to base station (BS) adaptively, while the selected users in the same zone could be served for a longer period due to similar angular statistics. The simulation results show that the throughput of our scheme is close to the instantaneous beamforming, while the real minimum serving time of chosen beams is hundreds times of the channel coherence time.
{"title":"A Low Overhead Angle-based Beamforming Using Multi-Pattern Codebooks for mmWave Massive MIMO Systems","authors":"Yuyan Zhao, Yanan Liu, G. Boudreau, A. B. Sediq, Xianbin Wang","doi":"10.1109/ICCCHINA.2018.8641181","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641181","url":null,"abstract":"In order to exploit the potential capacity of 5G, the combination of millimeter-wave (mmWave) and massive multiple input multiple output (MIMO) techniques provides a promising solution through beamforming. However, the extremely high carrier frequency dramatically reduces the channel coherence time, leading to frequent channel estimation and substantially increased overhead for the conventional channel information based beamforming. In this paper, we propose an angle-based beamforming scheme to reduce the overhead of beamforming by increasing the beam serving period. A novel multi-zone beamforming technique is proposed to support users with different distance to base station (BS) adaptively, while the selected users in the same zone could be served for a longer period due to similar angular statistics. The simulation results show that the throughput of our scheme is close to the instantaneous beamforming, while the real minimum serving time of chosen beams is hundreds times of the channel coherence time.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"77 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":"128988384","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
扫码关注我们
求助内容：
应助结果提醒方式：