传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squ...传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。展开更多
The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexit...The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexity iterative message passing scheme is proposed for joint channel estima- tion, equalization and decoding. Two kinds of schedules （parallel and serial） are adopted in message updates to produce two algorithms with different latency. The computational complexity per iteration of the proposed algorithms grows only linearly with the channel length, which is a significantly de- crease compared to the optimal maximum a posteriori （MAP） detection with the exponential com- plexity. Computer simulations demonstrate the effectiveness of the proposed schemes in terms of bit error rate performance.展开更多
文摘传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。
基金Supported by the National Natural Science Foundation of China(61201181)Specialized Research Fund for the Doctoral Program of Higher Education(20121101120020)the Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexity iterative message passing scheme is proposed for joint channel estima- tion, equalization and decoding. Two kinds of schedules （parallel and serial） are adopted in message updates to produce two algorithms with different latency. The computational complexity per iteration of the proposed algorithms grows only linearly with the channel length, which is a significantly de- crease compared to the optimal maximum a posteriori （MAP） detection with the exponential com- plexity. Computer simulations demonstrate the effectiveness of the proposed schemes in terms of bit error rate performance.
