VBLAST-OFDM系统中改进的QR分解检测算法

基于VBLAST-OFDM系统中传统QR分解算法,将最大似然和并行干扰消除的思想引入QR分解算法中,提出了对QR分解算法的改进方法,克服了传统QR分解算法检测性能差的缺点,运用QR分解从最后两层信号开始,等效为2收2发的MIMO系统。用最优算法检测判决后,回代到原QR分解算法检测余下层信号;或者依次并行消除已判决信号的影响,再进行下个等效MIMO系统的判决,直至所有信号检测完毕。仿真结果表明,本文改进的QR分解检测算法比传统的QR算法和迫零算法在误码性能上得到改善。     

Nature-inspired optimal tuning of input membership functions of Takagi-Sugeno-Kang fuzzy models for Anti-lock Braking Systems

This paper suggests a synergy of fuzzy logic and nature-inspired optimization in terms of the nature-inspired optimal tuning of the input membership functions of a class of Takagi-Sugeno-Kang (TSK) fuzzy models dedicated to Anti-lock Braking Systems (ABSs). A set of TSK fuzzy models is proposed by a novel fuzzy modeling approach for ABSs. The fuzzy modeling approach starts with the derivation of a set of local state-space models of the nonlinear ABS process by the linearization of the first-principle process model at ten operating points. The TSK fuzzy model structure and the initial TSK fuzzy models are obtained by the modal equivalence principle in terms of placing the local state-space models in the rule consequents of the TSK fuzzy models. An operating point selection algorithm to guide modeling is proposed, formulated on the basis of ranking the operating points according to their importance factors, and inserted in the third step of the fuzzy modeling approach. The optimization problems are defined such that to minimize the objective functions expressed as the average of squared modeling errors over the time horizon, and the variables of these functions are a part of the parameters of the input membership functions. Two representative nature-inspired algorithms, namely a Simulated Annealing (SA) algorithm and a Particle Swarm Optimization (PSO) algorithm, are implemented to solve the optimization problems and to obtain optimal TSK fuzzy models. The validation and the comparison of SA and PSO and of the new TSK fuzzy models are carried out for an ABS laboratory equipment. The real-time experimental results highlight that the optimized TSK fuzzy models are simple and consistent with both training data and validation data and that these models outperform the initial TSK fuzzy models.     

可压缩传感重构算法与近似QR分解

讨论了可压缩传感CS重构算法,并提出了一种新的改进算法效率、提高图像质量的方法,即：测量矩阵的近似QR分解。精确的重构算法（极小化L0范数）是一个NP完全问题,而这种算法的一个近似估计（极小化L1范数）能够对信号或图像高效率地重构。本文研究了L1算法的重构效果,通过改变测量矩阵的奇异值能够提高算法的重构效率。对测量矩阵的近似QR分解进行了研究,并给出了对测量矩阵的一些改进和相关的实验。     

基于GA-NN的复杂工艺生产过程多目标优化研究

在复杂非线性多目标优化问题求解中,非线性模型结构很难事先给定,需要检验的参数也非常繁多,应用传统的建模方法和优化模型已难以解决更为复杂的现实问题。人工神经网络技术为解决复杂非线性系统建模问题提供了一条新的途径。将神经网络响应面作为目标函数或者约束条件,加上其他常规约束条件进行系统模型的建立,再应用遗传算法进行优化,从而实现设计分析与设计优化的分离。以某化工企业的生产过程优化问题为例,利用BP神经网络建立了工艺参数与性能目标之间的模型,然后利用遗传算法搜索最优工艺参数,获取了用于指导生产的样本点数据。研究结果表明,该方法能够获得高精度的多目标优化模型,从而使优化效率大为提高。     

Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors

This paper studies the parallel solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The key components required for solving a sparse linear least squares problem are sparse QR factorization and sparse triangular solution. A block-oriented parallel algorithm for sparse QR factorization has already been described in the literature. In this paper, new block-oriented parallel algorithms for sparse triangular solution are proposed. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are analyzed. The proposed parallel sparse triangular solution algorithms together with the block-oriented parallel sparse QR factorization algorithm result in a highly efficient approach to the parallel solution of sparse linear least squares problems. Performance results obtained on an IBM Scalable POWERparallel system SP2 are presented. The largest least squares problem solved has over two million rows and more than a quarter million columns. The execution speed for the numerical factorization of this problem achieves over 3.7 gigaflops per second on an IBM SP2 machine with 128 processors.     

Process structure-based recurrent neural network modeling for model predictive control of nonlinear processes

In this work, physics-based recurrent neural network (RNN) modeling approaches are proposed for a general class of nonlinear dynamic process systems to improve prediction accuracy by incorporating a priori process knowledge. Specifically, a hybrid modeling method is first introduced to integrate first-principles models and RNN models. Subsequently, a partially-connected RNN modeling method that designs the RNN structure based on a priori structural process knowledge, and a weight-constrained RNN modeling method that employs weight constraints in the optimization problem of the RNN training process are developed. The proposed physics-based RNN models are utilized in model predictive controllers and applied to a chemical process network example to demonstrate their improved approximation performance compared to the fully-connected RNN model that is developed as a black box model.     

一种新的平行干扰消除QR分解检测算法

提出了一种VBLAST-OFDM系统中的平行干扰消除QR分解检测算法,称为P-ICQR算法。该算法首先对最先检测层信号做出假设,分成多个平行分支,在每个分支上依次干扰消除已检测信号的影响,运用QR分解判决余下层信号而只保留分集增益最高的最后检测层判决信号,最后用部分最大似然法对平行分支选取最优解作为最终检测结果,有效提高了系统的检测性能。仿真结果表明,提出的P-ICQR算法比传统的平行算法、循环迭代QR分解算法、QR算法、迫零算法的误码性能都要好。     

Adaptive block size for dense QR factorization in hybrid CPU–GPU systems via statistical modeling

QR factorization is a computational kernel of scientific computing. How can the latest computer be used to accelerate this task? We investigate this topic by proposing a dense QR factorization algorithm with adaptive block sizes on a hybrid system that contains a central processing unit (CPU) and a graphic processing unit (GPU). To maximize the use of CPU and GPU, we develop an adaptive scheme that chooses block size at each iteration. The decision is based on statistical surrogate models of performance and an online monitor, which avoids unexpected occasional performance drops. We modify the highly optimized CPU–GPU based QR factorization in MAGMA to implement the proposed schemes. Numerical results suggest that our approaches are efficient and can lead to near-optimal block sizes. The proposed algorithm can be extended to other one-sided factorizations, such as LU and Cholesky factorizations.     

Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class

We consider three algorithms for solving linear least squares problems based upon the modified Huang algorithm (MHA) in the ABS class for linear systems recently introduced by Abaffy, Broyden and Spedicato. The first algorithm uses an explicit QR factorization of the coefficient matrixA computed by applying MHA to the matrixA ^T . The second and the third algorithm is based upon two representations of the Moore-Penrose pseudoinverse constructed with the use of MHA. The three algorithms are tested on a large set of problems and compared with the NAG code using QR factorization with Householder rotations. The comparison shows that the algorithms based on MHA are generally more accurate.     

Complex radial basis function networks trained by QR‐decomposition recursive least square algorithms applied in behavioral modeling of nonlinear power amplifiers

In this article, we propose a novel complex radial basis function network approach for dynamic behavioral modeling of nonlinear power amplifier with memory in 3 G systems. The proposed approach utilizes the complex QR‐decomposition based recursive least squares (QRD‐RLS) algorithm, which is implemented using the complex Givens rotations, to update the weighting matrix of the complex radial basis function (RBF) network. Comparisons with standard least squares algorithms, in batch and recursive process, the QRD‐RLS algorithm has the characteristics of good numerical robustness and regular structure, and can significantly improve the complex RBF network modeling accuracy. In this approach, only the signal's complex envelope is used for the model training and validation. The model has been validated using ADS simulated and real measured data. Finally, parallel implementation of the resulting method is briefly discussed. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.     

Design of ANN Based Non-Linear Network Using Interconnection of Parallel Processor

Suspicious mass traffic constantly evolves, making network behaviour tracing and structure more complex. Neural networks yield promising results by considering a sufficient number of processing elements with strong interconnections between them. They offer efficient computational Hopfield neural networks models and optimization constraints used by undergoing a good amount of parallelism to yield optimal results. Artificial neural network (ANN) offers optimal solutions in classifying and clustering the various reels of data, and the results obtained purely depend on identifying a problem. In this research work, the design of optimized applications is presented in an organized manner. In addition, this research work examines theoretical approaches to achieving optimized results using ANN. It mainly focuses on designing rules. The optimizing design approach of neural networks analyzes the internal process of the neural networks. Practices in developing the network are based on the interconnections among the hidden nodes and their learning parameters. The methodology is proven best for nonlinear resource allocation problems with a suitable design and complex issues. The ANN proposed here considers more or less 46k nodes hidden inside 49 million connections employed on full-fledged parallel processors. The proposed ANN offered optimal results in real-world application problems, and the results were obtained using MATLAB.     

Continuous-Time Varying Complex QR Decomposition via Zeroing Neural Dynamics

Neural Processing Letters - QR decomposition (QRD) is of fundamental importance for matrix factorization in both real and complex cases. In this paper, by using zeroing neural dynamics method, a...     

Performance of a QR algorithm implementation on a multicluster of transputers

Some results of an implementation of the QR factorization by Householder reflectors, on a multicluster transputer system with distributed memory are presented, that show how important is the communication time between processor in the performance of the algorithm. The QR factorization was chosen as test method because it is required for many real life applications, for instance in least squares problems. We use a version of Householder transformation that is the basis for numerically stable QR factorization. The machine used was the MultiCluster 2 model of Parsytec which is distributed memory system with 16 Inmos T800 processors. The Helios operating system was chosen because it provides transparency in CPU management. However it limits the sets of connecting topologies to be used. The results are presented in terms of speedup and efficiency, showing the importance of the communication time on the total elapsed time.     

基于标准神经网络模型的非线性系统分布式无线网络化控制

针对采用标准神经网络模型(SNNM)描述的非线性系统,提出一种基于无线控制网络(WCN)的全分布式控制方法.采用置信因子模拟WCN中无线通信链路的不确定性,利用Lyapunov理论和Lur’e系统方法,将无线网络化控制系统(WNCS)的稳定性分析转化为一个具有线性矩阵不等式(LMI)约束的凸优化问题;使用CVX工具包求解该凸优化问题,得到了保证闭环系统全局渐近稳定的WCN配置参数.仿真结果验证了所提出控制策略的正确性和有效性.     

Optimization of parameter design: An intelligent approach using neural network and simulated annealing

Parameter design optimization problems have found extensive industrial applications, including product development, process design and operational condition setting. The parameter design optimization problems are complex because non-linear relationships and interactions may occur among parameters. To resolve such problems, engineers commonly employ the Taguchi method. However, the Taguchi method has some limitations in practice. Therefore, in this work, we present a novel means of improving the effectiveness of the optimization of parameter design. The proposed approach employs the neural network and simulated annealing, and consists of two phases. Phase 1 formulates an objective function for a problem using a neural network method to predict the value of the response for a given parameter setting. Phase 2 applies the simulated annealing algorithm to search for the optimal parameter combination. A numerical example demonstrates the effectiveness of the proposed approach.     

Network modeling and evolutionary optimization for scheduling in manufacturing

Scheduling is one of the most important fields in Advanced Planning and Scheduling or a manufacturing optimization. In this paper, we propose a network modeling technique to formulate the complex scheduling problems in manufacturing, and focus on how to model the scheduling problems to mathematical formulation. We propose a multi-section evolutionary algorithm for the scheduling models formulated by network modeling. Through a combination of the network modeling and this multi-section evolutionary algorithm, we can implement the auto-scheduling in the manufacturing system. The effectiveness and efficiency of proposed approach are investigated with various scales of scheduling problems by comparing with recent related researches. Lastly, we introduced service-oriented evolutionary computation architecture software. It help improved the evolutionary computation??s availability in the variable practical scheduling in manufacturing.     

Simulation of linear compartment models with application to nuclear medicine kinetic modeling

Several techniques are evaluated for solving the linear ordinary differential equations arising from compartment models. The methods involve approximating the matrix exponential of the state matrix (i.e. the transition matrix). The computational efficiencies of these techniques, together with that of a general purpose differential equation solver, are compared for several models arising from radiopharmacokinetic studies. The matrix exponential calculations are performed using both Ward's Padé approximation method and an eigenvalue-eigenvector decomposition (QR factorization) of the matrix A. These two algorithms have been incorporated as simulation options into the programs of the ADAPT package. ADAPT consists of a set of high-level programs for simulation, parameter estimation and experiment design, developed primarily for basic and clinical research modeling and data analysis applications involving pharmacokinetic and pharmacodynamic processes. The advantages and disadvantages of these simulation strategies for solving linear kinetic models within a parameter estimation setting are illustrated and discussed.     

Interconnection of Local Computer Networks: Modeling and Optimization Problems

We study problems of optimization of the topology of interconnected local computer networks using random access to a single channel. An approach to modeling of the system by a queueing network is proposed: the analytical solution of the model allows us to obtain global performance measures, which may be used as evaluation criteria in network topology optimization problems. A heuristic is proposed for the latter aspect for one class of problems. We also derive from the model the time needed, for a new user which joins the network, to transmit its number of messages.     

Automatically extracting T–S fuzzy models using cooperative random learning particle swarm optimization

This paper proposes a methodology for automatically extracting T–S fuzzy models from data using particle swarm optimization (PSO). In the proposed method, the structures and parameters of the fuzzy models are encoded into a particle and evolve together so that the optimal structure and parameters can be achieved simultaneously. An improved version of the original PSO algorithm, the cooperative random learning particle swarm optimization (CRPSO), is put forward to enhance the performance of PSO. CRPSO employs several sub-swarms to search the space and the useful information is exchanged among them during the iteration process. Simulation results indicate that CRPSO outperforms the standard PSO algorithm, genetic algorithm (GA) and differential evolution (DE) on the functions optimization and benchmark modeling problems. Moreover, the proposed CRPSO-based method can extract accurate T–S fuzzy model with appropriate number of rules.     

催化裂化过程稳态优化控制研究

催化裂化装置是一个高度非线性、时变、长时延、强耦合、分布参数和不确定性的复杂 系统.在研究其过程机理的基础上,定义了一种模糊神经网络用以建模,用自相关函数检验法检 验模型的正确性,再用改进的Frank-Wolfe算法进行稳态优化计算,并以一炼油厂催化裂化装 置为对象进行试验,研究其辨识、建模和稳态优化控制.这种模糊神经网络具有隐层数多、隐层 结点数多、泛化能力和逼近能力强、收敛速度快的优点,更突出的特点还在于可由输出端对输入 求导,为稳态优化计算提供了极大方便,它与改进的Frank-Wolfe算法相结合用于解决非线性 复杂生产过程的建模和稳态优化控制问题是可行的.