Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641113
Ran Zhang, Wei-chen Zou, Mingyang Cui
Hybrid precoding has been advocated as a promising technology, which can provide a compromise between system performance and hardware complexity in millimeter-wave (mmWave) multiple-input multiple-output systems. In this paper, we adopt a hierarchical idea to simplify hybrid precoder and combiner design in single-user mmWave systems. We propose a low complexity algorithm, which jointly designs analog precoder and combiner by phase extraction method, to maximize spectral efficiency. Then, the digital precoder and combiner are designed based on the obtained analog precoder and combiner to enhance the spectral efficiency. In addition, the proposed algorithm can be modified for practical scenario, where only finite resolution phase shifters are implemented. Finally, simulation results and mathematical analysis show that the proposed algorithm can achieve near-optimal performance. Moreover, the computational complexity of our algorithm is lower than the reference algorithms.
{"title":"Low Complexity Hybrid Precoder and Combiner Design for mmWave MIMO Systems","authors":"Ran Zhang, Wei-chen Zou, Mingyang Cui","doi":"10.1109/ICCCHINA.2018.8641113","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641113","url":null,"abstract":"Hybrid precoding has been advocated as a promising technology, which can provide a compromise between system performance and hardware complexity in millimeter-wave (mmWave) multiple-input multiple-output systems. In this paper, we adopt a hierarchical idea to simplify hybrid precoder and combiner design in single-user mmWave systems. We propose a low complexity algorithm, which jointly designs analog precoder and combiner by phase extraction method, to maximize spectral efficiency. Then, the digital precoder and combiner are designed based on the obtained analog precoder and combiner to enhance the spectral efficiency. In addition, the proposed algorithm can be modified for practical scenario, where only finite resolution phase shifters are implemented. Finally, simulation results and mathematical analysis show that the proposed algorithm can achieve near-optimal performance. Moreover, the computational complexity of our algorithm is lower than the reference algorithms.","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":"130078997","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.8641249
Fan Jiang, Guan Huang, W. Liu, Changyin Sun
This paper considers the power allocation problem for a device-to-device (D2D) assisted cooperative relaying system with non-orthogonal multiple access (NOMA). Under the constraint of satisfying each user’s minimum rate requirement, we formulate the optimization problem to maximize the sum rate. Specifically, by satisfying one user’s minimum rate requirement, the data rate of the other user is maximized. Then with the Karush-Kuhn-Tucker (KKT) conditions, we obtain two closed-form solutions of power allocation factor. Simulation results substantiate that compared with the traditional framework with orthogonal multiple access (OMA), D2D assisted cooperative relaying system is capable of improving the data rate effectively. Furthermore, by adaptively adjusting the power allocation factor, the proposed power allocation algorithm achieves the maximum sum rate under the two-user model.
{"title":"Adaptive Power Allocation for D2D Assisted Cooperative Relaying System with NOMA","authors":"Fan Jiang, Guan Huang, W. Liu, Changyin Sun","doi":"10.1109/ICCCHINA.2018.8641249","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641249","url":null,"abstract":"This paper considers the power allocation problem for a device-to-device (D2D) assisted cooperative relaying system with non-orthogonal multiple access (NOMA). Under the constraint of satisfying each user’s minimum rate requirement, we formulate the optimization problem to maximize the sum rate. Specifically, by satisfying one user’s minimum rate requirement, the data rate of the other user is maximized. Then with the Karush-Kuhn-Tucker (KKT) conditions, we obtain two closed-form solutions of power allocation factor. Simulation results substantiate that compared with the traditional framework with orthogonal multiple access (OMA), D2D assisted cooperative relaying system is capable of improving the data rate effectively. Furthermore, by adaptively adjusting the power allocation factor, the proposed power allocation algorithm achieves the maximum sum rate under the two-user model.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"120 43","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945722","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.8641199
Zan Zhang, Ziqi Cong, Xiaofeng Tao
This paper established a partial computation offloading paradigm to improve energy consumption and delay performance in single user scenario. This algorithm utilizes task and channel prediction to obtain future state to optimize objective function. A unique advantage of this algorithm is task and channel prediction utilizing markov property. The proposed algorithm utilizing task and channel prediction achieved more than 90% energy consumption reduction compared with no prediction. Finally, simulation achieved reduce in energy consumption are presented to corroborate the theoretical analysis as well as validate the effectiveness of the proposed algorithm. The algorithm proposed in this paper greatly improves the performance of energy-sensitive and delay-sensitive devices.
{"title":"UE Computation Offloading Based on Task and Channel Prediction of Single User","authors":"Zan Zhang, Ziqi Cong, Xiaofeng Tao","doi":"10.1109/ICCCHINA.2018.8641199","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641199","url":null,"abstract":"This paper established a partial computation offloading paradigm to improve energy consumption and delay performance in single user scenario. This algorithm utilizes task and channel prediction to obtain future state to optimize objective function. A unique advantage of this algorithm is task and channel prediction utilizing markov property. The proposed algorithm utilizing task and channel prediction achieved more than 90% energy consumption reduction compared with no prediction. Finally, simulation achieved reduce in energy consumption are presented to corroborate the theoretical analysis as well as validate the effectiveness of the proposed algorithm. The algorithm proposed in this paper greatly improves the performance of energy-sensitive and delay-sensitive devices.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"15 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":"114569649","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.8641088
Rong Sun, Tingting Wang, Jingwei Liu
A modified unquantized Fano sequential decoding (MUFSD) algorithm for rateless spinal codes is proposed. The maximum storage space is introduced in MUFSD algorithm. When the number of stored nodes exceeds the storage space, the decoding is stopped immediately so that the decoding process can be controlled well. The calculated nodes are reserved at each forward calculation which reduces the computational complexity. An expression of the new branch metrics of spinal codes over additive white Gaussian noise (AWGN) channel are derived for the MUFSD algorithm. Simulation results show that the complexity and time consumption of the MUFSD algorithm for spinal codes are further reduced without sacrificing the rate performance compared with those of the bubble decoder and the forward stack decoding (FSD) algorithm. Particularly, in the case of low signal-to-noise ratio (SNR), the complexity and time consumption of the MUFSD algorithm are significantly decreased.
{"title":"A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes","authors":"Rong Sun, Tingting Wang, Jingwei Liu","doi":"10.1109/ICCCHINA.2018.8641088","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641088","url":null,"abstract":"A modified unquantized Fano sequential decoding (MUFSD) algorithm for rateless spinal codes is proposed. The maximum storage space is introduced in MUFSD algorithm. When the number of stored nodes exceeds the storage space, the decoding is stopped immediately so that the decoding process can be controlled well. The calculated nodes are reserved at each forward calculation which reduces the computational complexity. An expression of the new branch metrics of spinal codes over additive white Gaussian noise (AWGN) channel are derived for the MUFSD algorithm. Simulation results show that the complexity and time consumption of the MUFSD algorithm for spinal codes are further reduced without sacrificing the rate performance compared with those of the bubble decoder and the forward stack decoding (FSD) algorithm. Particularly, in the case of low signal-to-noise ratio (SNR), the complexity and time consumption of the MUFSD algorithm are significantly decreased.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"21 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":"114603913","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.8641146
Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang
Recently, deep convolutional neural networks (CNNs) have achieved great success in semantic segmentation systems. In this paper, we show how to improve pixel-wise semantic segmentation by combine both global context information and local image features. First, we implement a fusion layer that allows us to merge global features and local features in encoder network. Second, in decoder network, we introduce a stacked pooling block, which is able to significantly expand the receptive fields of features maps and is essential to contextualize local semantic predictions. Furthermore, our approach is based on ResNet18, which makes our model have much less parameters than current published models. The whole framework is trained in an end-to-end fashion without any post-processing. We show that our method improves the performance of semantic image segmentation on two datasets CamVid and Cityscapes, which demonstrate its effectiveness.
{"title":"ResNet with Global and Local Image Features, Stacked Pooling Block, for Semantic Segmentation","authors":"Hui-Shi Song, Yun Zhou, Zhuqing Jiang, Xiaoqiang Guo, Zixuan Yang","doi":"10.1109/ICCCHINA.2018.8641146","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641146","url":null,"abstract":"Recently, deep convolutional neural networks (CNNs) have achieved great success in semantic segmentation systems. In this paper, we show how to improve pixel-wise semantic segmentation by combine both global context information and local image features. First, we implement a fusion layer that allows us to merge global features and local features in encoder network. Second, in decoder network, we introduce a stacked pooling block, which is able to significantly expand the receptive fields of features maps and is essential to contextualize local semantic predictions. Furthermore, our approach is based on ResNet18, which makes our model have much less parameters than current published models. The whole framework is trained in an end-to-end fashion without any post-processing. We show that our method improves the performance of semantic image segmentation on two datasets CamVid and Cityscapes, which demonstrate its effectiveness.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"15 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":"132214159","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.8641084
Weiliang He, Cheng Zhang, Yongming Huang
In order to meet the high data-rate requirements in next-generation wireless systems, millimeter-wave (mmwave) band has drawn increasing attention. However, the channel training and transmission design become more challenging. Interleaved training-based transmission scheme can achieve the same outage performance as the traditional full-training scheme but with lower average training overhead. This paper studies improved designs of interleaved training codebook for mmwave hybrid massive antenna downlink systems. Via exploiting the spatial features of the mmwave massive downlink channel, the original discrete Fourier transform (DFT) codebook is adjusted via beamsteering design, flat topped design and codebook rearrangement. Simulations show that these specific codebook designs can further reduce the average training overhead of the interleaved scheme compared with existing DFT codebook.
{"title":"Interleaved Training Codebook Design for Millimeter-wave Communication System","authors":"Weiliang He, Cheng Zhang, Yongming Huang","doi":"10.1109/ICCCHINA.2018.8641084","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641084","url":null,"abstract":"In order to meet the high data-rate requirements in next-generation wireless systems, millimeter-wave (mmwave) band has drawn increasing attention. However, the channel training and transmission design become more challenging. Interleaved training-based transmission scheme can achieve the same outage performance as the traditional full-training scheme but with lower average training overhead. This paper studies improved designs of interleaved training codebook for mmwave hybrid massive antenna downlink systems. Via exploiting the spatial features of the mmwave massive downlink channel, the original discrete Fourier transform (DFT) codebook is adjusted via beamsteering design, flat topped design and codebook rearrangement. Simulations show that these specific codebook designs can further reduce the average training overhead of the interleaved scheme compared with existing DFT codebook.","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":"128640397","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.8641089
Y. Zhou, Hongguang Zhang, Libiao Zhang, B. Tang, Yuan’an Liu
Hierarchical clustering is an effective method to save energy in immobile WSNs. In last decade, with the mobility applications of WSNs increasing rapidly, hierarchical clustering of mobile WSNs is becoming a high-effective and high-efficient method to save energy, such as LEACH-M, LEACH-ME, and MBC. We propose an improved LEACH protocol, which uses a fuzzy inference system (FIS) to select cluster heads (CHs). This proposed LEACH is called LEACH-FIS. This FIS considers the node’s residual energy, density, speed and direction. The interesting thing of LEACH-FIS is that, by referring the speed change (and direction change) degree relative to its neighbors, this FIS classifies the node’s speed (and direction) into the corresponding membership-function value. Simulation results show that the network lifetime of LEACH-FIS is 52.8%, 66.1% and 22.6% higher than LEACH-M, LEACH-ME, and MBC, respectively.
{"title":"LEACH-FIS: An Improved LEACH Based on Fuzzy Inference System in MWSNs","authors":"Y. Zhou, Hongguang Zhang, Libiao Zhang, B. Tang, Yuan’an Liu","doi":"10.1109/ICCCHINA.2018.8641089","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641089","url":null,"abstract":"Hierarchical clustering is an effective method to save energy in immobile WSNs. In last decade, with the mobility applications of WSNs increasing rapidly, hierarchical clustering of mobile WSNs is becoming a high-effective and high-efficient method to save energy, such as LEACH-M, LEACH-ME, and MBC. We propose an improved LEACH protocol, which uses a fuzzy inference system (FIS) to select cluster heads (CHs). This proposed LEACH is called LEACH-FIS. This FIS considers the node’s residual energy, density, speed and direction. The interesting thing of LEACH-FIS is that, by referring the speed change (and direction change) degree relative to its neighbors, this FIS classifies the node’s speed (and direction) into the corresponding membership-function value. Simulation results show that the network lifetime of LEACH-FIS is 52.8%, 66.1% and 22.6% higher than LEACH-M, LEACH-ME, and MBC, respectively.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"36 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":"134372713","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.8641128
Qinghai Li, Qian Wang, J. Ge, Chensi Zhang
This paper investigates a cognitive radio-inspired NOMA (CR-NOMA) decode-and-forward (DF) relaying network with imperfect channel state information, and a joint relay and antenna selection strategy is designed to improve the transmission reliability. Exact expression for the outage probability is derived in closed-form. Moreover, the asymptotic outage expression and the existence of error floor (EF) which is caused by channel estimation error are also obtained in high SNR region. Finally, simulation results demonstrate the superiority of CR-NOMA in outage performance over that of NOMA with fixed power allocation (F-NOMA). Compared with orthogonal multiple access, NOMA can achieve a lower outage probability and user fairness.
{"title":"Cognitive Radio-Inspired NOMA Relaying Networks with Imperfect CSI over Nakagami-m Fading","authors":"Qinghai Li, Qian Wang, J. Ge, Chensi Zhang","doi":"10.1109/ICCCHINA.2018.8641128","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641128","url":null,"abstract":"This paper investigates a cognitive radio-inspired NOMA (CR-NOMA) decode-and-forward (DF) relaying network with imperfect channel state information, and a joint relay and antenna selection strategy is designed to improve the transmission reliability. Exact expression for the outage probability is derived in closed-form. Moreover, the asymptotic outage expression and the existence of error floor (EF) which is caused by channel estimation error are also obtained in high SNR region. Finally, simulation results demonstrate the superiority of CR-NOMA in outage performance over that of NOMA with fixed power allocation (F-NOMA). Compared with orthogonal multiple access, NOMA can achieve a lower outage probability and user fairness.","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":"134472145","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.8641178
Jiake Li, Yu Han, Shi Jin, F. Zheng
This paper investigates the achievable rate of a multiuser multiple-input multiple-output system with a hybrid architecture based on the discrete Fourier transform (DFT) processing under Rayleigh fading condition. We first derive the lower bound of the achievable rate when the baseband processing is performed by the minimum mean-square error (MMSE) receiver and the base station (BS) has perfect channel state information (CSI). Analytical results show that the achievable rate is proportional to the large-scale fading coefficients and can be improved by increasing the number of radio frequency (RF) chains. Based on the results, a novel proportional fair (PF) user scheduling scheme is proposed, which updates the priority of users during the scheduling. Simulations show that the theoretical bound is very tight with the Monte-Carlo and validate that the proposed scheduling scheme not only achieves higher rate than round robin (RR) selection, but also has a significant advantage in scheduling fairness.
{"title":"User Scheduling Schemes of DFT-based Hybrid Beamforming Multiuser Systems","authors":"Jiake Li, Yu Han, Shi Jin, F. Zheng","doi":"10.1109/ICCCHINA.2018.8641178","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641178","url":null,"abstract":"This paper investigates the achievable rate of a multiuser multiple-input multiple-output system with a hybrid architecture based on the discrete Fourier transform (DFT) processing under Rayleigh fading condition. We first derive the lower bound of the achievable rate when the baseband processing is performed by the minimum mean-square error (MMSE) receiver and the base station (BS) has perfect channel state information (CSI). Analytical results show that the achievable rate is proportional to the large-scale fading coefficients and can be improved by increasing the number of radio frequency (RF) chains. Based on the results, a novel proportional fair (PF) user scheduling scheme is proposed, which updates the priority of users during the scheduling. Simulations show that the theoretical bound is very tight with the Monte-Carlo and validate that the proposed scheduling scheme not only achieves higher rate than round robin (RR) selection, but also has a significant advantage in scheduling fairness.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"41 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":"133761842","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.8641229
Yingli Cao, Jingxian Wu
This paper presents the explicit inverses of a special class of symmetric matrices with power-law elements, that is, the element on the m-th row and the n-th column is${rho ^{left| {{l_m} - {l_n}} right|}}$, where ρ ∈ [0, 1) is the power-law coefficient and lm is a real number. We derive the explicit inverse matrix and find that it follows a tridiagonal structure. The complexity of the inverse operation scales with$mathcal{O}left( N right)$, with N being the size of the square matrix. The matrix can be considered as the covariance matrix of random variables sampled from a linear wide-sense stationary (WSS) random field, with lm being the coordinate or time stamp of the samples. With the inverse covariance matrix, the discrete random samples are used to reconstruct the continuous random field by following the minimum mean squared error (MMSE) criterion. It is discovered that the MMSE estimation demonstrates a Markovian property, that is, the estimation of any given point in the field using the two discrete samples immediately adjacent to the point of interest yields the same results as using all the N discrete samples.
本文给出一类特殊的幂律元素对称矩阵的显式逆，即第m行第n列上的元素为${rho ^{left| {{l_m} - {l_n}} right|}}$，其中ρ∈[0,1]为幂律系数，lm为实数。我们推导出显式逆矩阵，发现它遵循一个三对角结构。逆操作的复杂度随$mathcal{O}left( N right)$的变化而变化，其中N为方阵的大小。矩阵可以看作是从线性广义平稳(WSS)随机场中采样的随机变量的协方差矩阵，lm为样本的坐标或时间戳。根据最小均方误差(MMSE)准则，利用离散随机样本的逆协方差矩阵重构连续随机场。发现MMSE估计证明了马尔可夫性质，即使用与感兴趣点相邻的两个离散样本对场中任何给定点的估计产生与使用所有N个离散样本相同的结果。
{"title":"Explicit Inverse of the Covariance Matrix of Random Variables with Power-Law Covariance","authors":"Yingli Cao, Jingxian Wu","doi":"10.1109/ICCCHINA.2018.8641229","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641229","url":null,"abstract":"This paper presents the explicit inverses of a special class of symmetric matrices with power-law elements, that is, the element on the m-th row and the n-th column is${rho ^{left| {{l_m} - {l_n}} right|}}$, where ρ ∈ [0, 1) is the power-law coefficient and lm is a real number. We derive the explicit inverse matrix and find that it follows a tridiagonal structure. The complexity of the inverse operation scales with$mathcal{O}left( N right)$, with N being the size of the square matrix. The matrix can be considered as the covariance matrix of random variables sampled from a linear wide-sense stationary (WSS) random field, with lm being the coordinate or time stamp of the samples. With the inverse covariance matrix, the discrete random samples are used to reconstruct the continuous random field by following the minimum mean squared error (MMSE) criterion. It is discovered that the MMSE estimation demonstrates a Markovian property, that is, the estimation of any given point in the field using the two discrete samples immediately adjacent to the point of interest yields the same results as using all the N discrete samples.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"35 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":"134182470","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
扫码关注我们
求助内容：
应助结果提醒方式：