Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit seq...Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit sequence step by step and suits to various argument selections of CRC computation. The algorithm proposed is quite suitable for hardware implementation. The simulation implementation and performance analysis suggest that it could efficiently speed up the computation compared with the conventional ones. The algorithm is implemented in hardware at as high as 21Gbps, and its usefulness in high-speed CRC computa-tions is implied, such as Asynchronous Transfer Mode (ATM) networks and 10G Ethernet.展开更多
Combining the mutual information theory and the sequential hypothesis testing(SHT)method,a selfadapting radio frequency(RF)stealth signal design method is proposed. The channel information is gained through the radar ...Combining the mutual information theory and the sequential hypothesis testing(SHT)method,a selfadapting radio frequency(RF)stealth signal design method is proposed. The channel information is gained through the radar echo and feeds back to the radar system,and then the radar system adaptively designs the transmission waveform. So the close-loop system is formed. The correlations between these transmission waveforms are decreased because of the adaptive change of these transmission waveforms,and the number of illuminations is reduced for adopting the SHT,which lowers the transmission power of the radar system. The radar system using the new method possesses the RF stealth performance. Aiming at the application of radar automatic target recognition(RATR),experimental simulations show the effectiveness and feasibility of the proposed method.展开更多
This paper presents a CRC (Cyclic Redundancy Check)-aided turbo equalization approach to reduce the computational complexity. In this approach,CRC code bits are padded to the end of each transmit block,and a cyclic re...This paper presents a CRC (Cyclic Redundancy Check)-aided turbo equalization approach to reduce the computational complexity. In this approach,CRC code bits are padded to the end of each transmit block,and a cyclic redundancy check is performed after decoding each block at the receiver end. If the check sum is zero,which means the receive block is correct,the corresponding LLRs (Log Likelihood Ratios) of this block are set high reliable values,and all the computations corresponding to this block can be cancelled for the subsequent outer iterations. With a lower computational complexity the proposed approach can achieve the same as or even better performance than the conventional non-CRC method.展开更多
Water pollution is one of the major environmental prob- lems, especially in urban areas. Due to rapid urban expansion and industrialization, water pollution in Zhengzhou City, the capital of Henan Province in central ...Water pollution is one of the major environmental prob- lems, especially in urban areas. Due to rapid urban expansion and industrialization, water pollution in Zhengzhou City, the capital of Henan Province in central China has become a serious problem for its development. In this study, the surface water quality was evalu- ated using Nemerow Comprehensive Pollution Index （NCPI）, and the change trend was calculated using methods of Mann-Kendall test and Sen＇s slope estimator, based on the monitoring data from 1998 to 2008. The results show that the NCP1 ranged from 3 to 50 in 70% of the monitoring cases, implying that most rivers were seriously polluted. However, this serious polltuon is expected to be gradually improved, as the concentration of water pollutants and NCPI declined significantly in most rivers. Water pollution in reservoirs was much lower than rivers, and the NCPI in the three monitored reservoirs was lower than 3 in most years, and shows a downward trend. Although the surface water quality was gradually improved, great efforts are still needed to enhance the protection and improvement of surface water environment.展开更多
To study battle-field simulation methods based on Vega,a virtual battle-field simulated by an imaginary combat happened on the sea was designed. The simulation framework in the sea battle-filed included helicopter sim...To study battle-field simulation methods based on Vega,a virtual battle-field simulated by an imaginary combat happened on the sea was designed. The simulation framework in the sea battle-filed included helicopter simulation,fire simulation, collision detection and detonation, and simulation of dynamic sea surface. The method to build the simulation environments and actions to them was discussed. And the simulation experiments were conducted.,It is indicated that the simulated sea battle-field based on Vega is feasible and helpful for forces and battle-field.展开更多
A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are as...A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing assertions.展开更多
基金Supported by the National Natural Science Foundation of China (No.60172029) and the Natural Science Foun-dation of Shaanxi Province (No.2004F04).
文摘Derived from a proposed universal mathematical expression, this paper investigates a novel algo-rithm for parallel Cyclic Redundancy Check (CRC) computation, which is an iterative algorithm to update the check-bit sequence step by step and suits to various argument selections of CRC computation. The algorithm proposed is quite suitable for hardware implementation. The simulation implementation and performance analysis suggest that it could efficiently speed up the computation compared with the conventional ones. The algorithm is implemented in hardware at as high as 21Gbps, and its usefulness in high-speed CRC computa-tions is implied, such as Asynchronous Transfer Mode (ATM) networks and 10G Ethernet.
基金supported by the National Natural Science Foundation of China(No.61661035)the Natural Science Foundation of Jiangxi Province (No.20192BAB207001)the Aviation Science Foundation (No.201920056001)。
文摘Combining the mutual information theory and the sequential hypothesis testing(SHT)method,a selfadapting radio frequency(RF)stealth signal design method is proposed. The channel information is gained through the radar echo and feeds back to the radar system,and then the radar system adaptively designs the transmission waveform. So the close-loop system is formed. The correlations between these transmission waveforms are decreased because of the adaptive change of these transmission waveforms,and the number of illuminations is reduced for adopting the SHT,which lowers the transmission power of the radar system. The radar system using the new method possesses the RF stealth performance. Aiming at the application of radar automatic target recognition(RATR),experimental simulations show the effectiveness and feasibility of the proposed method.
基金Supported in part by the National Natural Science Foundation of China (No.60496311).
文摘This paper presents a CRC (Cyclic Redundancy Check)-aided turbo equalization approach to reduce the computational complexity. In this approach,CRC code bits are padded to the end of each transmit block,and a cyclic redundancy check is performed after decoding each block at the receiver end. If the check sum is zero,which means the receive block is correct,the corresponding LLRs (Log Likelihood Ratios) of this block are set high reliable values,and all the computations corresponding to this block can be cancelled for the subsequent outer iterations. With a lower computational complexity the proposed approach can achieve the same as or even better performance than the conventional non-CRC method.
文摘Water pollution is one of the major environmental prob- lems, especially in urban areas. Due to rapid urban expansion and industrialization, water pollution in Zhengzhou City, the capital of Henan Province in central China has become a serious problem for its development. In this study, the surface water quality was evalu- ated using Nemerow Comprehensive Pollution Index （NCPI）, and the change trend was calculated using methods of Mann-Kendall test and Sen＇s slope estimator, based on the monitoring data from 1998 to 2008. The results show that the NCP1 ranged from 3 to 50 in 70% of the monitoring cases, implying that most rivers were seriously polluted. However, this serious polltuon is expected to be gradually improved, as the concentration of water pollutants and NCPI declined significantly in most rivers. Water pollution in reservoirs was much lower than rivers, and the NCPI in the three monitored reservoirs was lower than 3 in most years, and shows a downward trend. Although the surface water quality was gradually improved, great efforts are still needed to enhance the protection and improvement of surface water environment.
基金Sponsored by the Heilongjiang Natural Fund for Oversea People(Grant No.LC06C08)Heilongjiang Education Science Research Fund for Oversea People (Grant No. 1151hq008)+3 种基金Heilongjiang Postdoctor Research Fund (Grant No.LBH-Z06106)the Natural Science Foundation of China (Grant No.60671011)the Science Fund for Distinguished Young Scholars of Heilongjiang Province (Grant No. JC200611)the Foundation of Harbin Instituteof Technology (Grant No.HIT.2003.53)
文摘To study battle-field simulation methods based on Vega,a virtual battle-field simulated by an imaginary combat happened on the sea was designed. The simulation framework in the sea battle-filed included helicopter simulation,fire simulation, collision detection and detonation, and simulation of dynamic sea surface. The method to build the simulation environments and actions to them was discussed. And the simulation experiments were conducted.,It is indicated that the simulated sea battle-field based on Vega is feasible and helpful for forces and battle-field.
基金This research was partially supported by an National Science Foundation(NSF)Information Technology Research(ITR)award CCR-0113611an NSF award CCR-0203051.
文摘A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing assertions.
