A Reduced Search Soft-Output Detection Algorithm and Its Application to Turbo-Equalization

To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M algorithm for turbo equalization, which is a suboptimum version of the Lee algorithm. This algorithm is called soft output M algorithm (denoted as SO M algorithm), which applies the M strategy to both the forward recursion and the extended forward recursion of the Lee algorithm. Computer simulation results show that, by properly selecting and adjusting the breadth parameter and depth parameter during the iteration of turbo equalization, this algorithm can obtain good performance and complexity trade off.

Blind Equalization Algorithm Based on MCMA and DSE-CMA

A new blind equalization algorithm based on the modified constant modulus algorithm （MCMA） and dithered signederror constant modulus algorithm （DSE-CMA） is proposed. This dithered signed-error MCMA （DSE-MCMA） can not only reduce the computational complexity, but also recover the phase rotation in the complex channel. Simulation results have verified the analysis and indicated the good property of DSE-MCMA.

Improved Algorithm of Histogram Equalization and Its Actualization

A new improved algorithm of histogram equalization was discussed and actualized by analyzing the traditional algorithm. This improved algorithm has better effect than the traditional one, especially it is used to process poor quality images.

BLIND EQUALIZATION OF MIMO SYSTEMS BASED ON ORTHOGONAL CONSTANT MODULUS ALGORITHM

This paper investigates adaptive blind source separation and equalization for Multiple Input Multiple Output (MIMO) systems. To effectively recover input signals, remove Inter-Symbol Interference (ISI) and suppress Inter-User Interference (IUI), the array input is first transformed into the signal subspace, then with the derived orthogonality between weight vectors of different input signals, a new orthogonal Constant Modulus Algorithm (CMA) is proposed. Computer simulation results illustrate the promising performance of the proposed method. Without channel identification, the proposed method can recover all the system inputs simultaneously and can be adaptive to channel changes without prior knowledge about signals.

An Orthogonal Wavelet Transform Fractionally Spaced Blind Equalization Algorithm Based on the Optimization of Genetic Algorithm

An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square error and local convergence of traditional constant modulus blind equalization algorithm(CMA).The proposed algorithm can reduce the signal autocorrelation through the orthogonal wavelet transform of input signal of fractionally spaced blind equalizer,and decrease the possibility of CMA local convergence by using the global random search characteristics of genetic algorithm to optimize the equalizer weight vector.The proposed algorithm has the faster convergence rate and smaller mean square error compared with FSE and WT-FSE.The efficiency of the proposed algorithm is proved by computer simulation of underwater acoustic channels.

Blind Equalization Using a Hybrid Algorithm of Multilayer Neural Network

A novel blind equalization scheme based on multilayer neural network and Higher OrderCumulants(HOC)is proposed in the paper.The training of the neural network uses a newhybrid algorithm which has strict convex character(after a threshold)and converges muchfaster than the CMA algorithm.The inverse channel is built on the basis of the estimatedchannel and the training of neural network.The scheme can be used in nonlinear and timevarying channel and to deal with PAM or QAM signals.Simulation results Show that it per-forms well for blind equalization.

The Fast Blind Equalization Algorithm with Global Convergence

ＴｈｅＦａｓｔＢｌｉｎｄＥｑｕａｌｉｚａｔｉｏｎＡｌｇｏｒｉｔｈｍｗｉｔｈＧｌｏｂａｌＣｏｎｖｅｒｇｅｎｃｅＬｕＪｕｎＬｉＴｏｎｇ（ＩｎｓｔｉｔｕｔｅｏｆＩｎｆｏｒｍａｔｉｏｎａｎｄＥｎｇｉｎｅｅｒｉｎｇｏｆＰＬＡ，Ｚｈｅｎｇｚｈｏｕ４５０００２）Ａ...

Fast Fading Channel Neural Equalization Using Levenberg-Marquardt Training Algorithm and Pulse Shaping Filters

Artificial Neural Network (ANN) equalizers have been successfully applied to mitigate Inter symbolic Interference (ISI) due to distortions introduced by linear or nonlinear communication channels. The ANN architecture is chosen according to the type of ISI produced by fixed, fast or slow fading channels. In this work, we propose a combination of two techniques in order to minimize ISI yield by fast fading channels, i.e., pulse shape filtering and ANN equalizer. Levenberg-Marquardt algorithm is used to update the synaptic weights of an ANN comprise only by two recurrent perceptrons. The proposed system outperformed more complex structures such as those based on Kalman filtering approach.

A DECISION FEEDBACK EQUALIZER FOR NON-LINEAR CHANNELS

A Simple and useful decision feedback equalizer used for non-linear channels with severe linear distortion and mild non-linear distortion is proposed. It is a combination of a nonlinear channel equalizer based on connectionist model and a common decision feedback equalizer for linear channels. For a typical non-linear channel model it is shown that the equalization performances of the proposed equalizer are improved significantly.

A Variable Metric Algorithm with Broyden Rank One Modifications for Nonlinear Equality Constraints Optimization

In this paper, a variable metric algorithm is proposed with Broyden rank one modifications for the equality constrained optimization. This method is viewed expansion in constrained optimization as the quasi-Newton method to unconstrained optimization. The theoretical analysis shows that local convergence can be induced under some suitable conditions. In the end, it is established an equivalent condition of superlinear convergence.

NON-LINEAR DYNAMIC MODEL RETRIEVAL OF SUBTROPICAL HIGH BASED ON EMPIRICAL ORTHOGONAL FUNCTION AND GENETIC ALGORITHM

Aiming at the difficulty of accurately constructing the dynamic model of subtropical high, based on the potential height field time series over 500 hPa layer of T106 numerical forecast products, by using EOF（empirical orthogonal function） temporal-spatial separation technique, the disassembled EOF time coefficients series were regarded as dynamical model variables, and dynamic system retrieval idea as well as genetic algorithm were introduced to make dynamical model parameters optimization search, then, a reasonable non-linear dynamic model of EOF time-coefficients was established. By dynamic model integral and EOF temporal-spatial components assembly, a mid-/long-term forecast of subtropical high was carried out. The experimental results show that the forecast results of dynamic model are superior to that of general numerical model forecast results. A new modeling idea and forecast technique is presented for diagnosing and forecasting such complicated weathers as subtropical high.

THE APPLICATION OF GENETIC ALGORITHM IN NON-LINEAR INVERSION OF ROCK MECHANICS PARAMETERS

The non-linear inversion of rock mechanics parameters based on genetic algorithm is presented. The principIe and step of genetic algorithm is also given. A brief discussion of this method and an application example is presented at the end of this paper. From the satisfied result, quick, convenient and practical new approach is developed to solve this kind of problems.

An Innovative Genetic Algorithms-Based Inexact Non-Linear Programming Problem Solving Method

In this paper, an innovative Genetic Algorithms (GA)-based inexact non-linear programming (GAINLP) problem solving approach has been proposed for solving non-linear programming optimization problems with inexact information (inexact non-linear operation programming). GAINLP was developed based on a GA-based inexact quadratic solving method. The Genetic Algorithm Solver of the Global Optimization Toolbox (GASGOT) developed by MATLABTM was adopted as the implementation environment of this study. GAINLP was applied to a municipality solid waste management case. The results from different scenarios indicated that the proposed GA-based heuristic optimization approach was able to generate a solution for a complicated nonlinear problem, which also involved uncertainty.

Joint receiving mechanism based on blind equalization with variable step size for M-QAM modulation

The problem of inter symbol interference（ ISI） in wireless communication systems caused by multipath propagation when using high order modulation like M-Q AMis solved. Since the wireless receiver doesn＇t require a training sequence,a blind equalization channel is implemented in the receiver to increase the throughput of the system. To improve the performances of both the blind equalizer and the system,a joint receiving mechanismincluding variable step size（ VSS） modified constant modulus algorithms（ MC-MA） and modified decision directed modulus algorithms（ MD DMA） is proposed to ameliorate the convergence speed and mean square error（ MSE） performance and combat the phase error when using high order QAM modulation. The VSS scheme is based on the selection of step size according to the distance between the output of the equalizer and the desired output in the constellation plane. Analysis and simulations showthat the performance of the proposed VSS-MCMA-MD DMA mechanismis better than that of algorithms with a fixed step size. In addition,the MCMA-MDDMA with VSS can performthe phase recovery by itself.

Research on User Profile Construction Method Based on Improved TF-IDF Algorithm

In the data-driven era of the internet and business environments,constructing accurate user profiles is paramount for personalized user understanding and classification.The traditional TF-IDF algorithm has some limitations when evaluating the impact of words on classification results.Consequently,an improved TF-IDF-K algorithm was introduced in this study,which included an equalization factor,aimed at constructing user profiles by processing and analyzing user search records.Through the training and prediction capabilities of a Support Vector Machine(SVM),it enabled the prediction of user demographic attributes.The experimental results demonstrated that the TF-IDF-K algorithm has achieved a significant improvement in classification accuracy and reliability.

A Novel Sequential Soft Output Viterbi Algorithm

In order to fully utilize the soft decision ability of the outer decoder in a concatenated system, reliability information (called soft output) from the inner decoder or equalizer is required. In this paper, based on the analysis of typical implementations of soft output VA, a novel algorithm is proposed by utilizing the property of Viterbi algorithm. Compared with the typical implementations, less processing expense is required by the new algorithm for weighting the hard decisions of VA. Meanwhile, simulation results show that, deterioration in performance of this algorithm is usually small for decoding of convolutional code and negligible for equalization.

Nonlinear Rayleigh wave inversion based on the shuffled frog-leaping algorithm

At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm （SFLA）, into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.

Self-adjusting decision feedback equalizer for variational underwater acoustic channel environments

Aimed at the abominable influences to blind equaliza-tion algorithms caused by complex time-space variability existing in underwater acoustic channels, a new self-adjusting decision feedback equalization （DFE） algorithm adapting to different under-water acoustic channel environments is proposed by changing its central tap position. Besides, this new algorithm behaves faster convergence speed based on the analysis of equalizers’ working rules, which is more suitable to implement communications in dif-ferent unknown channels. Corresponding results and conclusions are validated by simulations and spot experiments.

AN EFFICIENT FAST ENCODING ALGORITHM FOR VECTOR QUANTIZATION

A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates and the other contains the remaining coordinates. Three inequalities based on the characteristics of the sums and variances of a vector and its two subvectors were introduced to reject those codewords which are impossible to be the nearest codeword. The simulation results show that the proposed algorithm is faster than the improved equal average eaual variance nearest neighbor search (EENNS) algorithm.

VISCOSITY APPROXIMATION METHODS FOR THE SPLIT EQUALITY COMMON FIXED POINT PROBLEM OF QUASI-NONEXPANSIVE OPERATORS

Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.