By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating ...By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating the position and velocity of a moving source is proposed. By utilizing the Lagrange multipliers technique, the known relation between the intermediate variables and the source location coordinates could be exploited to constrain the solution. And without requiring apriori knowledge of TDOA and FDOA measurement noises, the proposed algorithm can satisfy the demand of practical applications. Additionally, on basis of con- volute and polynomial rooting operations, the Lagrange multipliers can be obtained efficiently and robustly allowing real-time imple- mentation and global convergence. Simulation results show that the proposed estimator achieves remarkably better performance than the two-step weighted least square （WLS） approach especially for higher measurement noise level.展开更多
A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbo...A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.展开更多
基金supported by the National High Technology Research and Development Program of China (863 Program) (2010AA7010422 2011AA7014061)
文摘By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating the position and velocity of a moving source is proposed. By utilizing the Lagrange multipliers technique, the known relation between the intermediate variables and the source location coordinates could be exploited to constrain the solution. And without requiring apriori knowledge of TDOA and FDOA measurement noises, the proposed algorithm can satisfy the demand of practical applications. Additionally, on basis of con- volute and polynomial rooting operations, the Lagrange multipliers can be obtained efficiently and robustly allowing real-time imple- mentation and global convergence. Simulation results show that the proposed estimator achieves remarkably better performance than the two-step weighted least square （WLS） approach especially for higher measurement noise level.
文摘A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.
