Multiple Turbo Codes for Satellite Communications

Satellite communication channel has the characteristic of power limited, band abundance, and powerful error correcting ability FEC scheme is needed. For its near Shannon limit error correcting capability, Turbo codes may be suitable for satellite communication systems. The multiple Turbo codes can utilize channel capacity sufficiency and overcome the disadvantages of power limited for satellite communication systems. Force on the needed for satellite communication systems, multiple Turbo codes is adopted and server decoding schemes were proposed with simulation. Simulation results show that, the schemes proposed can get near channel capacity error correcting performance with short code block.     

Design of a Class of LDPC Encoder and Decoder

Low-Density Parity-Check(LDPC) codes are first introduced by Gallagerin 1960's,and independently rediscovered by both MacKay and Neal. In past few years, LDPC codes have received a lot of attention and many new developments have been brought in this area. This paper has designed a class of Low Density Parity Check(LDPC)codes based on ITU. Our design is for 6-bit quantizaton with a code rate of 0.7572 and a block size of 276 bits. This paper brings forward the architecture of the partly parallel decoder and the corresponding parallel encoder based on CPLD technology. Also we have derived the encoder scheme. And this LDPC code is used for ADSL transmission.     

A Method to Improve the Decoding Iteration Convergence Performance of Turbo Codes

Turbo codes is an effective method for digital communication systems to get near channel capacity error correcting performance, its iteration convergence performance is the key factor for practicability. Based on the universal decoding method of Turbo codes, a step increment factor was introduced in the paper to improve the iteration convergence performance. The method to generate the step increment factor was also presented as well as its' computer simulations. Simulation results show the method proposed can improve the convergence performance efficiency for Turbo codes with short interleaver.     

Low complexity rate control scheme for real-time video coding

Considering the deficiency of H.264 rate control scheme and the coding efficiency requirements for real-time encoding,a low complexity rate control algorithm in MB-layer is proposed..MAD is predicted by combining motion vector and the temporal and spatial correlation to reduce the complexity of G012-MAD prediction algorithm from linear regression to the complexity of the weighted average. For the rate-distortion model,the linear model with low computational complexity instead of the quadratic fitting algorithm in G012 is used,while the possibility of is discussed combining with SSIM. For the fluctuation of the PSNR of the coded image with large movement,the determination of QP in GOP layer and the bit allocation of P frame are improved,and the current quantization parameter is adjusted by making full use of the information of coded MBto control the rateeffectively. The experimental results show that the algorithm is more effective in resisting the fluctuation of PSNR for smoothly output sequence,and can decrease computational complexity.     

Color Image Compression Method Based on Incomplete Scanning Method

In view of color image characteristic, the paper improves the zero algorithm in the application of concrete algorithm, draws a new algorithm-incomplete scanning method, which is applied to color image compression. The authorsconvert color image from the RGB space into luminance-chrominance YUV space, then compress the converted image to encode/decode. Theoretical analysis and simulation experiment indicate that the compression ratio and encoding/decoding speed are increased, at the sase time the quality of restored image is guaranteed.     

Soft-decision Decoding of MPPM and Its Application in Ultra Wideband Communications

Pulse Position Modulation is quite suitable for UWB. Existing methods for MPPM decoding are based on harddecision. As the information of the received signal has been deeply used by the soft decode technology, demodulation can be realized more perfectly. The soft decode technology of pulse position modulation was proposed. Formulas for soft-decision computaion have educed. Theoretic analysis and simulation results show that the proposed method achieves excellent performance than the hard decoding method, and that it is fit for UWB.     

Algorithm for Mining Sequential Pattern

Mining sequential pattern is an important topic in the data mining research. In this paper, on the basis of recording the Ctid scheme of the set in every frequent set, the authors propose an algorithm named ISP for mining sequential pattern. In the algorithm the items and the sequence are discussed respectively, and the time join method is used to introduce the candidate sets, so the frequent sets can be gotten. The ISP algorithm takes full use of the existing and updated Ctid scheme, therefore the efficiency of the process is increased besides guaranteeing the validity of the algorithm. Comparing with the algorithm named IMSP,more efficient rules are obtained.     

DATA COMPRESSION WITH HASH CODES

In many database applications, data have to be compressed before they can be stored. Data compression techniques with less overhead and better space saving are expected. This paper gives a data compression technique by which the size of a file may be reduced through substituting codes for its field values. The codes are the corresponding locations of the values in the hash table that is comprised of all the values of the field.The compression is effective for many applications, and the cost of the coding/decoding is equal to that of one access to the hash table. The implementation of the technique as a compression tool in DBMS for date storage and the algorithms of the coding/decoding are discussed.     

Improvement of Using Hash Table in Computer Bridge Double-dummy Solver

Incomplete information of the poker games make the research progress lags behind the chess games in AI. Although it is still very difficult to find a fast algorithm to solve a poker game with complete information which is the foundation of some advance researches. This paper gives a standard way to encode and store a game state into hash table, so the memory of hash table can be used more effectively and higher hit rate can be gotten in Scout search meth od. With the new encoding method, the total expanding leaf nodes reduces by around 5%.     

OPTIMUM ARC APPROXIMATION OF COMPLEX PLANE CURVES

Arc approximation method is widely used in machining those parts contoured by various complex plane curves. In this paper, several arc approximation methods are reviewed, and the algorithm of the optimum arc approximation, which ensures the continuity of derivatives, is established. The algorithm presented can be used to precisely machine the parts with complex plane curves and the revolving body with a curved surace. In addition, it can also be used in part-programming of CNC machining.     

Logistic map controlled secure arithmetic coding and its application in image encryption

A logistic map controlled secure arithmetic coding is proposed, the Logistic map is used to control the order of the symbols in the model and change the probabilities of the symbols, which is applied to the image encryption. The proposed scheme makes the image transmit more secure and comfortably on the Internet, and that is done at little expense in terms of coding efficiency. In the coding process, it ensures the uniformity of the model being changed by the chaotic sequence, thus to meet the security requirements of image compression. The algorithm can be applied to any arithmetic codec based on multimedia data including video, image and audio. Its most strength compared with other cipher mode is that, there is a significant reduction in the redundancy of information during the compression process, and it is robust when attempting to estimate the information of the image and discovering the key. The scheme can effectively resist differential analyses from both cryptography and coding.     

A Medical Image Quantization Method Suited for PACS

Image compression is very important in picture archiving and communication system(PACS). The author studied the statistical distribution of image wavelet subimage coefficients and concluded that the distribution of wavelet subimage coefficients is similar to that of Laplasian distribution. On the other hand, in image reconstruction, the coefficient with different amplitude owns different weight, and different accuracy can be applied to different coefficients according to their different weight. Then, the author has designed a image quantization encoding scheme for PACS. In this scheme, they selected the sample-standard-deviation of coefficients in every subimage as the quantization threshold, and accurately encoded those coefficients with higher weight. Also, this algorithm utilized the visual character of human. The test has proved that the main advantages of this method are the simplicity in computing and predictable encoded coefficients, and a high compression efficiency can obtain too.     

Implement of Extracting Circuit for Soft-information in M-ary Orthogonal Code Spread-spectrum System

In the coherent M-ary Orthogonal Code Spread-Spectrum System,the maximal value decision of the output signals from the multiple matched filters is needed before channel decoding.Based on the Log-likelihood Radio(LLR),a suboptimal soft-information extracting scheme in the M-ary Orthogonal Code Spread-spectrum System is proposed and the performance of the system in the AWGN channel is analyzed.Then the architecture of the system implemented on FPGA is presented.The practical results indicate that the scheme is effective and can be implemented on FPGA easily and conveniently.     

An Unsteady Flow Analysis in Gas Transmission Pipeline Based on Theory of Functional Analysis

Branch -like pipeline is a common structure in gas transmission pipeline. In the light of the constituent properties of natural gas branch - like pipeline system, the system can be divided into fundamental constituent units. This paper presents a realistic unsteady flow model consisting of simple models of pipeline units and connecting conditions, boundary conditions and initial condition associated with units by using system analysis method. The solutions in wide sense are obtained by theory of functional analysis and operator series method, Such a method has the properties of both analytical solution and numerical solution methods. When the divided pipeline unit is larger, an intuitive approximate analytical solution may be obtained; while the one is smaller, a more accurate numerical solution may be acquired. Based on this, a general computer program has been developed for this model and solutions have been used successfully in a local natural gas transmission network in Sichuan. It is proved that the model and algorithm proposed in this paper are of the advantages of convenient calculation, high precision, time saving and wide application range by way of analysis and application.     

One intra prediction mode selection algorithm based on edge direction detection in H.〖STHZ〗264〖ST〗

Motion estimation is the most complex part in H.264. Intra prediction is an important part of motion estimation. There are a number of intra prediction modes in H.264, which no doubt greatly increase encoding complexity. In intra prediction, the way of choosing prediction method is rate distortion optimization or using correlation properties. For complexity problem, the paper provides an improved intra prediction mode selection algorithm. This algorithm uses a new detection method to detect the pixel correlation in the direction of mode selection. Test results show that the algorithm has reduced the computational complexity and increased the encoding speed highly in the premise of ensuring video quality.     

Optimal sensor deployment scheme for heterogeneous wireless sensor networks

For the high density of distributed heterogeneity nodes in wireless sensor networks (WSNs), the optimal sensor deployment is studied. A cost optimal heterogeneous sensor deployment scheme based on genetic algorithm is proposed. The cost of sensor node deployment is used as objective function for optimization computation subjected to network coverage and fault tolerance to obtain the suitable types and positions of the sensors. The algorithm can be used for boolean sensing model as well as probabilistic sensing model. The simulation results demonstrate that the proposed algorithm converges fast toward the optimal solutions and reduces the cost of sensor deployment, which is feasible for heterogenous nodes deployment in WSNs.     

Robust Adaptive Control Based on On-line Identification to Multi-parameters

In system controlled,Sampling these parameters and with parameters for controller in time, it is an object to adaptive control. The article presents a scheme that the structure parameters on it's model and model parameters is robust identified by on line, while to optimal of algorithm on adaptive control is fulfilled. In control scheme, method of intelligent identifying to the structure parameters(levels of model) and algorithm of robust pole placement are introduced also It is advancer for already mentioned scheme. Whole scheme presents new model on adaptive control.     

履带式拖拉机自动驾驶系统路径智能跟踪控制研究

为实现复杂环境下履带式拖拉机田间作业的路径跟踪控制,设计了履带式拖拉机自动驾驶系统,并对路径跟踪与控制算法进行了研究。自动驾驶系统由MCU、双源激光定位系统、速度控制系统、点火/熄火控制系统、液压转向系统等组成。采用模糊算法对行驶过程中的路径偏差进行补偿,实现对路径的跟踪控制。为验证算法的有效性,进行了Matlab/Simulate仿真与田间试验。结果显示对于NF502型履带拖拉机,该系统在100 m范围内可实现有效控制,表明该算法能实现对行驶路线跟踪与控制。     

Hybrid Genetic Algorithm Based on Novel Adaptive Penalty Function

The authors introduce a sort of novel adaptive penalty gene, transform the constrained problem into unconstrained problems. An solution is given for this unconstrained problem with genetic algorithm, and then it is used as initial values for the constrained variable metric method to get precise solution. The numerical experiments illustrate that this hybrid genetic algorithm is more efficient than the genetic algorithm, and at most situations globally optimal solution can be gotten.     

FPGA Implementation of Pipelined FFT

A pipelined FFT processor designed for fast and real-time requirements with FPGA is introduced. This FFT processor can be used to real-time frequency analysis and its working frequency can reach to 75 MHz. The leakage error is reduced through multiply the sampled signal by a weighting window. In order to improve FFT's working frequency and economize FPGA resources, an algorithm of 1024-point complex to compute 2048-point real data is adopted. In addition, an approximate algorithm to compute module value of complex number is introduced.