共查询到20条相似文献，搜索用时 656 毫秒
1.
Based on minimum output energy,an improved blind multiuser detection algorithm is proposed by the use of Hopfield neural network.Compared with traditional algorithms,the proposed algorithm does not need the circuit for constraints.The resources are greatly saved and the complexity is reduced as well.The simulation results show that the performance of the improved algorithm is similar to that of the optimal multiuser detection algorithm which is not suitable for the mobile station.Compared with the traditional gradient blind multiuser detection algorithm,the convergence speed of the improved algorithm is quickened. 相似文献
2.
An improved linear-time retiming algorithm is proposed to incrementally optimize the clock period,especially considering the influence of the in-out degree of the critical combinational elements.Firstly,the critical elements are selected from all the critical combinational elements to retime.Secondly,for the nodes that cannot be performed with such retiming,register sharing is implemented while the path delay is kept unchanged.The incremental algorithm can be applied with the technology mapping to minimize the critical path delay and obtain fewer registers in the retimed circuit with the near-optimal clock period.Compared with Singh’s incremental algorithm,experiments show that the proposed algorithm can reduce the flip-flop count by 11% and look-up table(LUT) count by 5% while improving the minimum clock period by 6%.The runtime is also reduced by 9% of the design flow. 相似文献
3.
An improved direction of arrival (DOA) estimation algorithm with sensor gain and phase uncerlatinties for synchronous code divison multiple access(CDMA) system with decorrelator is presented,Through decorrelating processing DOAs of the desired users cna be estimated independently and all other resolved signal interferences are eliminated,Emphasis is directed to applications in which sensor gain and phase are pertubed that often happen actually, It is shown that improved DOA estimation can be achieved for decoupled signals by gain and phase pre-estimation procedures. 相似文献
4.
A new algorithm, named segmented second empirical mode decomposition （EMD） algorithm, is proposed in this paper in order to reduce the computing time of EMD and make EMD algorithm available to online time-frequency analysis. The original data is divided into some segments with the same length. Each segment data is processed based on the principle of the first-level EMD decomposition. The algorithm is compared with the traditional EMD and results show that it is more useful and effective for analyzing nonlinear and non-stationary signals. 相似文献
5.
The parallel spectral-domain optical coherence tomography(PSDOCT) is described for high-speed optical coherence tomography(OCT) without lateral scanning. In this setup, the self-elimination of auto-correlation(AC) interference algorithm was used for eradicating the AC interference and ghost images. However, when performed in free space OCT, this algorithm still generated a weak DC component. The algorithm was improved by adding the background intensity part to compensate for the mutual interference between object and reference arms. The results demonstrate that the DC component can be eradicated. Compared with conventional OCT and complex Fourier-domain optical coherence tomography, the advantages of PSDOCT with the improved algorithm in free space are that it has no moving parts to generate consecutive phase shift, the structure of the object can be reconstructed immediately and automatically, and the speed is approximately 16 times faster than those of the other two in the same case. 相似文献
6.
As a basic mathematical structure,the system of inequalities over symmetric cones and its solution can provide an effective method for solving the startup problem of interior point method which is used to solve many optimization problems.In this paper,a non-interior continuation algorithm is proposed for solving the system of inequalities under the order induced by a symmetric cone.It is shown that the proposed algorithm is globally convergent and well-defined.Moreover,it can start from any point and only needs to solve one system of linear equations at most at each iteration.Under suitable assumptions,global linear and local quadratic convergence is established with Euclidean Jordan algebras.Numerical results indicate that the algorithm is efficient.The systems of random linear inequalities were tested over the second-order cones with sizes of 10,100,,1 000 respectively and the problems of each size were generated randomly for 10 times.The average iterative numbers show that the proposed algorithm can generate a solution at one step for solving the given linear class of problems with random initializations.It seems possible that the continuation algorithm can solve larger scale systems of linear inequalities over the secondorder cones quickly.Moreover,a system of nonlinear inequalities was also tested over Cartesian product of two simple second-order cones,and numerical results indicate that the proposed algorithm can deal with the nonlinear cases. 相似文献
7.
Based on the structures of the short preamble and long preamble,which are defined for synchronization in IEEE802.16e specification,the robust synchronization algorithm for IEEE802.16e OFDM system is proposed.The correlations among the sample sequences in the preamble are investigated,especially the correlation between the first sample sequence and the last sample sequence in the long preamble.The conventional joint timing and frequency synchronization algorithm is reviewed based on the short preamble referring to the algorithm proposed by Schmidl,then a robust joint timing and frequency synchronization algorithm is proposed based on the long preamble.The simulations in the multi-path and frequency selective fading channel show that the proposed algorithm has improved the performances of timing metric plateau,timing offset and synchronization acquisition time even when signal-to-noise ratio is less than-5 dB. 相似文献
8.
Based on a smoothing symmetric disturbance FB-function, a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed. It was proved that under mild conditions, the given algorithm performed global and superlinear convergence without strict complementarity. For the same linear complementarity problem （LCP）, the algorithm needs similar iteration times to the literature. However, its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%, and the iterative number is insensitive to the size of the LCP. Moreover, fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points. 相似文献
9.
In this paper, a new branch-and-bound algorithm based on the Lagrangian dual relaxation and continuous relaxation is proposed for discrete multi-factor portfolio selection model with roundlot restriction in financial optimization. This discrete portfolio model is of integer quadratic programming problems. The separable structure of the model is investigated by using Lagrangian relaxation and dual search. Computational results show that the algorithm is capable of solving real-world portfolio problems with data from US stock market and randomly generated test problems with up to 120 securities. 相似文献
10.
In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization (CQO) based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method (IPM) to O (√nlognlogn/ε), which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter. 相似文献
11.
提出一种改进的并行比特翻转算法. 为了加快校验节点和变量节点之间的信息传递速率, 算法中的比特翻转及校验和更新2个步骤采用并行化处理. 仿真结果表明, 改进后的算法相对于原有的并行比特翻转算法在误帧率性能上能够取得0.1～0.3 dB的增益. 同时, 改进算法在译码吞吐率的性能上也有所改善. 此外, 还讨论了翻转门限的选择方法, 这些门限决定了每次迭代中哪些比特需要被翻转. 通过选择合适的翻转门限, 可使错误的比特尽量多地被翻转, 并避免翻转正确的比特. 该改进算法比较适用于对具有准循环结构的LDPC码进行译码. 相似文献
12.
为了提高小波神经网络的收敛速度,文章提出了将负梯度下降法与DFP变尺度算法相结合进行权值修正的方法,在误差寻优初期采用梯度下降法迭代,当寻优过程开始接近最优时,更改寻优算法,使用DFP变尺度算法。通过仿真结果表明,改进算法减少了迭代次数,提高了算法收敛速度。 相似文献
13.
周红晓 《金华职业技术学院学报》2002,2(4):35-37,14
BP算法是目前应用极为广泛的神经网络算法，但它也存在一些不足。本文提出了一种改进的BP算法，该算法基于黄金分割法自适应调整网络学习速率。仿真结果表明：该算法比传统的BP算法具有更快的学习速度和更高的学习精度。 相似文献
14.
基本遗传算法保持群体多样性的能力较差,所以经常在问题求解的过程中极易陷入局部最优解。根据生物的免疫原理和单亲遗传算法并结合最近邻域算法思想提出的一种改进算法———基于免疫单亲遗传算法（IPGA）。免疫遗传算法中的基因重组、免疫记忆以及免疫元动态等特性,这些特性有助于改进基本遗传算法群体多样性的保持能力。最后结合48个城市旅行商问题进行了求解,仿真结果表明,基于免疫单亲遗传算法具有更好的性能,相对于传统的遗传算法收敛速度提高了30%。 相似文献
15.
张健 《湖州职业技术学院学报》2014,(1):84-87,91
图像分割是一种对不同特征的像素进行聚类的过程,过程中涉及像素的梯度、灰度及邻域特征。由于蚁群算法的离散性、并行性、全局优化性和稳定性等特点,基于蚁群算法提出一种有效的图像分割改进算法。首先通过蚁群改进算法的模糊聚类能力可以分别计算出像素与目标、背景、噪声点、边界点的隶属关系;然后对于蚁群算法循环次数多、计算量较大的问题,设置启发式引导函数和聚类中心,解决传统聚类中运行效率低、初始化敏感度高等缺点;最后引入梯度算子,对目标与背景灰度值相似图像进行分割,对结果进行了进一步的优化。实验表明,应用该改进算法得到的图像分割结果具有较高的准确度和效率。 相似文献
16.
为了克服传统粒子群算法（Pso）的早熟和局部最优问题,通过分析基于惯性权重的粒子群优化在粒子寻优过程中的可行性,提出了一种变惯性权重的改进PSo算法,并对经典的测试函数进行TN试。实验结果证明,与传统PSO算法以及基于惯性权重的PSO相比,改进算法的寻优效果较好,全局搜索能力有显著提高,并能有效地避免早熟收敛问题。 相似文献
17.
王仲民 《天津工程师范学院学报》2007,17(3):19-21
通过对梯度法与模拟退火算法优缺点的分析,提出了一种梯度退火新型混合全局优化算法。该算法利用梯度法的快速寻优特性得到某一局部极值,然后采用模拟退火算法的全局搜索寻优能力跳出该局部极值,经过反复混合迭代最终获得全局最优解。仿真实验表明,该新型混合优化算法显著提高了求解全局优化问题的计算效率。 相似文献
18.
针对涡流场有限元分析形成的大型稀疏复线性方程组,提出了预处理稳定双共轭梯度法(PBiCGSTAB).利用二维正交链表结构实现系数矩阵的全稀疏存储,采用无填充的不完全LU分解对方程组进行预处理以降低系数矩阵的条件数.将稳定双共轭梯度法从实数领域扩展到复数领域,并利用它求解预优过的复线性方程组.基于有限元法和PBiCGSTAB算法编制直线电机性能分析软件,并对一电机堵转的情况进行仿真,将计算结果和ANSYS计算出的结果进行了比较,证明了该软件的正确性.并且通过求解器比较发现,在相同精度条件下PBiCGSTAB算法只需要BiCG算法三分之一的迭代步数,证明了该算法的快速性. 相似文献
19.
续润华 《河南师范大学学报(哲学社会科学版)》2007,34(2):103-106
美国国会于1944年颁布了《退伍士兵权利法案》。该法案规定:联邦政府对在二战期间服役超过90天的退伍士兵提供必要的经济资助,根据其服役时间长短和职位等提供一定数额的退役金、教育训练补助金、失业救济金和住房贷款等。《退伍士兵权利法案》的颁布,奠定了美国战后安置退伍士兵政策的法律框架,为美国二战后在短时间内妥善地安置近千万退伍士兵发挥了重要作用,促进了美国高等教育的大发展,为美国战后经济的腾飞和社会进步提供了强有力的人才支持和智力保障。 相似文献
20.
The generalized internal/external frame-of-reference (GI/E) model explains the formation of self-perceptions and motivational constructs through social and dimensional comparisons. Research examining the GI/E model with primary school children is scarce, especially with first-grade children. Using two fully representative first-grade cohorts and two fully representative third-grade cohorts (N = 21,162; 48% girls) from Luxembourg, we examined the relations between math and verbal achievements and corresponding domain-specific academic self-concepts (ASCs) and interests. In addition, we tested whether the relations between domain-specific achievements and interests are cross-sectionally mediated through ASCs. Positive achievement-ASC and achievement-interest relations were found within matching domains in both grade levels, while the relations between achievements and ASCs and between achievements and interests across nonmatching domains were significantly negative for third-grade children. For first-grade children, the majority of cross-domain relations were nonsignificant, except for the path between math achievement and verbal interest. For school children in both grade levels, domain-specific ASCs were found to mediate the relation between achievements and interests. Overall, the findings indicate that social comparisons play an important role in the formation of domain-specific ASCs and interests for both grade levels, while dimensional comparisons are not as important in the first school year as it is later in the third grade. Gender and cohort invariance were established in both grade levels. 相似文献