ON THE DECODING OF ALGEBRAIC GEOMETRIC CODES BASED ON FIA

Suppose C is an irreducible algebraic curve of genus g, C*(D,G) is an algebraic geometric code with designed minimum distance d* = deg(G)-2g 2. In this paper, a decoding algorithm based on Fundamental Iterative Algorithm(FIA) is presented, also its reasonableness is proved. In fact, our decoding algorithm is a modification of the algorithm proposed by G. L. Fend and T. R. N. Rao(1993) and can correct any received words with errors not more than (d*-1)/2, whereas the complexity is only about one half as much as Feng and Rao's. The procedure can be implemented easily by hardware or software.     

THE APPLICATION OF LINEAR COMPLEXITY OF SEQUENCES TO LOWER BOUNDS ON THE MINIMUM DISTANCE OF CYCLIC CODES

Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexityof sequences,and new theorems about the lower bounds are obtained.     

AN ALGORITHM OF MOTION ESTIMATION BASED ON UNIT QUATERNION DECOMPOSITION OF THE ROTATION MATRIX

Based on the unit quaternion decomposition of rotation matrix, this paper puts forward an algorithm to estimate motion parameters from the space position vectors of 3D feature points. Rotation matrix's representation with the unit quaternion has no singular points, so the unit quaternion-based estimation method is of more practical importance, and the algorithm in this paper does not need iteration computation compared to those unit quaternion-based methods proposed by Horn(1987) and Su, et al.(1989). Solution's uniqueness analysis of the algorithm and simulation experiment results are also presented, it can be seen that performance of our method is satisfactory.     

THE STUDY OF AN M-ARY MC-CDMA SYSTEM BASED ON CYCLIC SPREADING CODES & PRE-EQUALIZATION

A novel fast despreading scheme for M-ary Multi-Carrier Code-Division Multiple Access (MC-CDMA) system is proposed based on cyclic spreading codes and pre-equalizer. In the transmitter, the M spreading codes of each user are generated by circularly shifting the prototype spreading code. A feedback pre-equalizer is employed to process the M-ary MCCDMA signal before transmitted. The received signal is multiplied by the Inverse Discrete Fourier Transform (IDFT) result of the mirror image code of the prototype spreading code, and then demodulated by Orthogonal Frequency-Division Multiplexing (OFDM) demodulator. Compared with the conventional M-ary MC-CDMA receiver, the proposed scheme increases bandwidth efficiency, meanwhile, it achieves M-ary despread spectrum and multi-carrier demodulation, which reduces computation complexity remarkably.     

The study of an m -ary MC-CDMA system based on cyclic spreading codes & pre-equalization

A novel fast despreading scheme for M-ary Multi-Carrier Code-Division Multiple Access (MC-CDMA) system is proposed based on cyclic spreading codes and pre-equalizer. In the transmitter, the M spreading codes of each user are generated by circularly shifting the prototype spreading code. A feedback pre-equalizer is employed to process the M-ary MC-CDMA signal before transmitted. The received signal is multiplied by the Inverse Discrete Fourier Transform (IDFT) result of the mirror image code of the prototype spreading code, and then demodulated by Orthogonal Frequency-Division Multiplexing (OFDM) demodulator. Compared with the conventional M-ary MC-CDMA receiver, the proposed scheme increases bandwidth efficiency, meanwhile, it achieves M-ary despread spectrum and multi-carrier demodulation, which reduces computation complexity remarkably. Supported by the National Natural Science Foundation of China (No.60172029). Communication author: Chu Zhenyong, born in 1972, male, Ph.D. candidate, lecturer. Post Box 119, State Key Lab. of ISN, Xidian University, Xi’an 710071, China.     

序列的线性复杂度在循环码最小距离下界研究中的应用

本文首先介绍了有限域中傅氏变换及序列线性复杂度的概念,然后简述了循环码最小距离的几个下界,最后用序列的线性复杂度分析了循环码的最小距离,得到了关于最小距离下界的几个新定理。     

A NOVEL CONSTRUCTION OF QUANTUM LDPC CODES BASED ON CYCLIC CLASSES OF LINES IN EUCLIDEAN GEOMETRIES

The dual-containing (or self-orthogonal) formalism of Calderbank-Shor-Steane (CSS) codes provides a universal connection between a classical linear code and a Quantum Error-Correcting Code (QECC).We pr...     

AN IMPROVED ALGORITHM OF GMM VOICE CONVERSION SYSTEM BASED ON CHANGING THE TIME-SCALE

This paper improves and presents an advanced method of the voice conversion system based on Gaussian Mixture Models (GMM) models by changing the time-scale of speech.The Speech Transformation and Repre...     

A CLASS OF LDPC CODE''''S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.