New scale factor correction scheme for CORDIC algorithm

To overcome the drawbacks such as irregular circuit construction and low system throughput that exist in conventional methods, a new factor correction scheme for coordinate rotation digital computer（ CORDIC） algorithm is proposed. Based on the relationship between the iteration formulae, a new iteration formula is introduced, which leads the correction operation to be several simple shifting and adding operations. As one key part, the effects caused by rounding error are analyzed mathematically and it is concluded that the effects can be degraded by an appropriate selection of coefficients in the iteration formula. The model is then set up in Matlab and coded in Verilog HDL language. The proposed algorithm is also synthesized and verified in field-programmable gate array （FPGA）. The results show that this new scheme requires only one additional clock cycle and there is no change in the elementary iteration for the same precision compared with the conventional algorithm. In addition, the circuit realization is regular and the change in system throughput is very minimal.

Renormalization-group theory of first-order phase transition dynamics in field-driven scalar model

Through a detailed study of the mean-field approximation, the Gaussian approximation, the perturbation expansion, and the field-theoretic renormalization-group analysis of a φ^3 theory, we show that the instability fixed points of the theory, together with their associated instability exponents, are quite probably relevant to the scaling and universality behavior exhibited by the first-order phase transitions in a field-driven scalar Ca model, below its critical temperature and near the instability points. Finite- time scaling and leading corrections to the scaling are considered. We also show that the instability exponents of the first-order phase transitions are equivalent to those of the Yang-Lee edge singularity, and employ the latter to improve our estimates of the former. The outcomes agree well with existing numerical results.

A novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization

In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is introduced for each check-sum of the parity-check matrix and a scaling factor is used to weaken the overestimation of extrinsic information. Furthermore, the updating process of the reliability measure takes advantage of turbo-like iterative decoding strategy. The main computational complexity of the proposed algorithm only includes logical and integer operations with the bit uniform quantization criterion. Simulation results show that the novel decoding algorithm can achieve excellent error-correction performance and a fast decoding convergence speed.