波分复用系统中的四波混频估算和非线性仿真

在叔分复用（ＷＤＭ）光纤通信系统中,群速度色散（ＧＶＤ）、自相位调制（ＳＰＭ）、互相位调制（ＸＰＭ）以及四波混频（ＦＷＭ）等非线性效应能明显降低系统性能,给出了在系统中四波混频效应的简单估算公式,以及在采用单信道方法仿真波分复用系统的非线性效应时,为保证计算精度所需的步长的选取公式,提出了一种基于求解多信道耦合波方程组的群速度色散／自位位调制／互相位调制／四波混频仿真算法,可大大减少计算工作量,这     

ZnS∶Tb薄膜电致发光的量子效率及过热电子分布

采用高频溅射的方法制备了高亮度的ＺｎＳ∶Ｔｂ薄膜电致发光器件．测量了发射强度比Ｉ（５Ｄ３－７Ｆ６）／Ｉ（５Ｄ４－７Ｆ４）随激发电压的变化关系、弛豫时间及发光的量子效率，计算了碰撞截面，分析ＺｎＳ∶Ｔｂ的过热电子的分布，并与ＺｎＳ∶Ｍｎ进行了比较．指出了ＺｎＳ∶Ｔｂ效率与ＺｎＳ∶Ｍｎ效率差异的可能原因．     

N_2分子X~1Σ_g~ ,A~3Σ_u~ 和B~3Π_g的势能函数

用文献［１，２，８］介绍的方法推导了Ｎ２分子的基态（Ｘ１Σ＋ｇ）和激发态（Ａ３Σ＋ｕ和Ｂ３Πｇ）的合理离解极限。计算并比较了在６－３１１Ｇ基集合，ＵＨＦ、ＣＩＤ、ＵＣＩＳＤ和ＱＣＩＳＤ水平下Ｎ２分子上述三个电子态的平衡结构和谐振频率；并用ＱＣＩＳＤ／６－３１１Ｇ计算了各态的系列单点势能值，由正规方程组拟合Ｍｕｒｒｅｌ－Ｓｏｒｂｉｅ函数得到了相应各态的完整势能函数，结果与实验数计算值符合得比较好。     

N2分子X^1Σg^＋,A^3Σu^＋和B^3Пg的势能函数

用文献［１，２，８］介绍的方法推导了Ｎ２分子的基态（Ｘ＾１Σｇ＾＋）的激发态（Ａ＾３Σｕ＾＋和Ｂ＾３Пｇ）的合理离解极限。计算并比较了在６－３１１Ｇ＾＊基集合，ＵＨＦ、ＣＩＤ、ＵＣＩＳＤ和ＱＣＩＳＤ水平下Ｎ２分子上述三个电子态的平衡结构和谐振频率；并用ＱＣＩＳＤ／６－３１１Ｇ＾＊计算了各态的系列单点势能值，由正规方程组拟合Ｍｕｒｒｅｌｌ－Ｓｏｒｂｉｅ函数得到了相应各态的完整势能函数，结果与实验数计     

次级通道模型误差下滤波X型最小均方差算法收敛性分析

给出了滤波Ｘ型ＬＭＳ（ＦＸＬＭＳ）算法收敛的一个充分条件，指出如果次级通道传递函数与其估计值在所有频带上满足正实条件，则ＦＸＬＭＳ算法对任意参考信号收敛。若上述正实条件仅在某些频带上满足，则ＦＸＬＭＳ算法的收敛将依赖于参考信号功率谱密度的分布。收敛步长取决于某特定相关矩阵特征值的分布。将上述结论应用于时延型ＬＭＳ（ＤＬＭＳ）算法，得出在时延估计存在误差时，ＤＬＭＳ算法收敛于若干离散的频带，而频带宽度完全取决于“对延估计误差频率”（时延估计误差倒数的１／４）。     

硅键合SOI平面光波导探索

本文分析了ＳＩＭＯＸ／ＳＯＩ和ＤＷＢ／ＳＯＩ结构的性能特点。尝试用ＤＷＢ／ＳＯＩ材料制备不同波导层厚度的平面光波导样品，并测试了１．１５μｍ和１．５２３μｍ激光的ＴＥ和ＴＭ模的传输损耗。１．５２３μｍ光的ＴＥ模的最小传输损耗已达０．２７ｄＢ／ｃｍ。说明ＤＷＢ／ＳＯＩ材料是一种有潜力的光波导材料。     

MPEG音频编码的高效算法研究及单片DSP实现

ＩＳＯ标准推荐ＭＰＥＧ－１音频编码算法要实现起来运算复杂,为便于单片ＤＳＰ实现,算法可以优化。本文简要分析了该算法的各个模块并估计了它们的运算复杂性,然后对子带滤波和心理声学模型作了进一步的探讨,提出了基于逆余弦变换（ＩＤＣＴ）的子带滤波的高效实现算法和不用ＦＦＴ或只用部分ＦＦＴ的快速心理声学掩蔽计算模型。最后用单片ＴＭＳ３２０Ｃ３１＠４０ＭＨｚ实现了ＭＰＥＧ－１层２编码算法。     

稀土元素Dy对金属／绝缘体／金属隧道结发光特性的影响

在普通金属／绝缘体／金属（ＭＩＭ）隧道发光结的基础上，制备了掺稀土元素Ｄｙ的ＭＩＤｙＭ结构隧道发光结，简单介绍了该结的制备工艺，对结构的发光特性及发光过程中表面等离极经激元（ＳＰＰ）的色散关系进行了讨论，对发光光谱进行了分析，阐述了稀土元素Ｄｙ对结的发光特性的影响。     

MPEG-2先进音频编码(AAC)的研究和软件仿真

ＭＰＥＧ－２ＡＡＣ是ＩＳＯ／ＩＥＣ ＭＰＥＧ组织继 ＭＰＥＧ－１、ＭＰＥＧ－２音频编解码标准后,制定 的最新国际标准（ＩＳＯ／ＩＥＣ １３８１８－７）,在６４ｋｂｐｓ／每声道低码率时能提供全透明音质。本文对其编 解码算法进行了简要介绍。论文作者对ＭＰＥＧ－２ＡＡＣ进行了软件仿真,文中介绍了仿真结果,仿 真时对ＡＡＣ标准所附编码范例中的一些不妥之处,作了改进,文中列举了６方面的修正。     

用MOCVD法在YSZ衬底上制备YBCO膜

用低压ＭＯＣＶＤ多源法在单晶ＹＳＺ和具有双轴取向ＩＢＡＤＹＳＺ的金属基带上沉积了ＹＢＣＯ膜,它们的Ｊｃ（７７．３Ｋ,０Ｔ）分别为～２×１０６Ａ／ｃｍ２和～７×１０４Ａ／ｃｍ２．分析了本试验中的Ｊｃ差别原因．在单晶ＹＳＺ上ＹＢＣＯ高Ｊｃ数值显示了用ＭＯＣＶＤ制备涂层膜导体的潜力     

一种光电混合SIMD型计算机(OEHSC)系统结构及其算法的设计

本文基于光计算机结构和算法必须以“门”一级并行为基础的观点，提出了可实现性能较好的光电混合ＳＩＭＤ型计算机的结构和以位平面数据表示为基础的并行算法。通过性能分析，证明了光计算机计算能力的潜力及光电混合系统的有效性     

光学元件波前梯度的数值计算方法

 惯性约束聚变系统中光学元件的波前梯度均方根是一个关键参数,对其数值计算涉及到的空域处理、频域滤波及梯度算法等关键技术进行了理论分析。分别采用最简单差分算法、中心差分算法、最小二乘拟合算法、“五点法”对实测波前数据进行了梯度均方根值计算。结果表明波前数据的空域处理采用Quad-flip技术较为合适;频域滤波器的选用上应着重考虑滤波的有效性。对于原始波前,4种算法计算梯度均方根值的差别小于0.01 λ/cm(λ=632.8 nm);而对于截止频率为0.0303 线/mm的低通滤波后波前,其差别小于0.001 λ/cm,该差别对计算结果的影响可以忽略。     

基于Gadgetron平台的多GPU分布式磁共振图像重建

为了满足磁共振成像（MRI）临床扫描的需求,磁共振图像重建算法的开发一直在不断进行.目前广泛使用的算法实现方式是利用中央处理器（CPU）对磁共振扫描数据进行数学变换得到图像,随着算法复杂度的提升,计算性能问题逐渐显露.利用CPU在大数据量下执行复杂算法时,计算并行性的缺失以及运算中产生的海量数据的存储负荷会导致计算变得极为缓慢,使得一些算法因为重建时间过长,在临床上面临难以推广的问题,也制约了基础研究中新算法的研发.本文设计并实现了一种新的重建算法执行方式,利用Gadgetron磁共振软件重建平台在多核CPU基础上搭载多块图形处理器（GPU）,将磁共振图像重建以分布式并行计算方式实现,并以重建耗时较长的3D径向数据采集Stack of Star（SOS）的图像重建为实例,展示这种重建的实现方法能以相对低廉的硬件成本极大提升重建的速度.     

基于瀑布型多重网格加速的复指数波前复原算法

激光在大气中传输时,由于强湍流或长传输距离的影响,畸变波前中出现由相位起点组成的不连续相位,现有波前复原算法不能有效复原不连续相位,使得自适应光学系统校正效果下降甚至失效.本文分析了最小二乘波前复原算法不能复原相位奇点的原因,提出了基于瀑布型多重网格加速的复指数波前复原算法,给出了复指数波前复原算法中迭代计算、降采样、插值计算的实现方式.研究了该方法对不连续相位和随机连续相位的复原能力,数值分析了采用复指数波前复原算法的自适应光学系统对大气湍流像差的校正效果.仿真结果表明,同等复原精度下,相比直接迭代过程,该方法所需浮点乘数目减少了近2个数量级,且随着夏克-哈特曼波前传感器子孔径数目增加,其在计算量上的优势更加明显. Rytov方差较大时,相比直接斜率法,自适应光学系统采用复指数波前复原算法后校正光束Strehl比提升1倍.     

Fast parallel tracking algorithm for the muon detector of the CBM experiment at fair

Particle trajectory recognition is an important and challenging task in the Compressed Baryonic Matter (CBM) experiment at the future FAIR accelerator at Darmstadt. The tracking algorithms have to process terabytes of input data produced in particle collisions. Therefore, the speed of the tracking software is extremely important for data analysis. In this contribution, a fast parallel track reconstruction algorithm which uses available features of modern processors is presented. These features comprise a SIMD instruction set (SSE) and multithreading. The first allows one to pack several data items into one register and to operate on all of them in parallel thus achieving more operations per cycle. The second feature enables the routines to exploit all available CPU cores and hardware threads. This parallel version of the tracking algorithm has been compared to the initial serial scalar version which uses a similar approach for tracking. A speed-up factor of 487 was achieved (from 730 to 1.5 ms/event) for a computer with 2 × Intel Core i7 processors at 2.66 GHz.     

Comparison of several stochastic parallel optimization algorithms for adaptive optics system without a wavefront sensor

Optimizing the system performance metric directly is an important method for correcting wavefront aberrations in an adaptive optics (AO) system where wavefront sensing methods are unavailable or ineffective. An appropriate “Deformable Mirror” control algorithm is the key to successful wavefront correction. Based on several stochastic parallel optimization control algorithms, an adaptive optics system with a 61-element Deformable Mirror (DM) is simulated. Genetic Algorithm (GA), Stochastic Parallel Gradient Descent (SPGD), Simulated Annealing (SA) and Algorithm Of Pattern Extraction (Alopex) are compared in convergence speed and correction capability. The results show that all these algorithms have the ability to correct for atmospheric turbulence. Compared with least squares fitting, they almost obtain the best correction achievable for the 61-element DM. SA is the fastest and GA is the slowest in these algorithms. The number of perturbation by GA is almost 20 times larger than that of SA, 15 times larger than SPGD and 9 times larger than Alopex.     

Parameter vertex method and its parallel solution for evaluating the dynamic response bounds of structures with interval parameters

In this article, we propose a parameter vertex method to determine the upper and lower bounds of the dynamic response of structures with interval parameters, which can be regarded as an extension of the matrix vertex method proposed by Qiu and Wang. The matrix vertex method requires considerable computation time and encounters the dependency problem in practice, thereby limiting its application in engineering. The proposed parameter vertex method can avoid the dependency problem, and the number of possible vertex combinations in the proposed method is significantly less than that in the matrix vertex method. The parameter vertex method requires that each matrix element in the dynamic differential equation is monotonic with respect to the uncertain parameter, and that the dynamic response reaches its extreme value when the uncertain parameter is at its endpoint. To further reduce the runtime, both vertical and transversal parallel algorithms are introduced and integrated into the parameter vertex method to improve its computational efficiency. Two numerical examples are presented to demonstrate the proposed method combined with both parallel algorithms. The performances of the two parallel algorithms are thoroughly studied. The parameter vertex method combined with parallel algorithm can be used for large-scale computing.     

Quantum wave processing

In recent years, the concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. In general, the ‘speed’ of these computations is compared to that of (classical) digital computers, which use sequential algorithms. However, in most quantum computing approaches, the qubits themselves are treated as analog objects. One then needs to ask whether this computational speed-up of the computation is a result of the quantum mechanics, or whether it is due to the nature of the analog structures that are being ‘generated’ for quantum computation? In this paper, we will make two points: (1) quantum computation utilizes analog, parallel computation which often offers no speed advantage over classical computers which are implemented using analog, parallel computation; (2) once this is realized, then there is little advantage in projecting the quantum computation onto the pseudo-binary construct of a qubit. Rather, it becomes more effective to seek the equivalent wave processing that is inherent in the analog, parallel processing. We will examine some wave processing systems which may be useful for quantum computation.     

波前编码双共轭梯度平方稳定解码算法及其 TMS320DM642平台的实现

波前编码是一种新型的光学-数字混合二步成像系统,采用三次光学编码相位板可以得到系统的非对称点扩散函数和相当景深内模糊程度一致的中间图像.本文利用空间域光学成像模型,结合反镜像边界束缚条件以及矩阵的直积分解,提出一种基于双共轭梯度平方稳定算法(Bi-CGSTAB)的图像复原算法实现波前编码系统的数字解码.该算法具有计算量小、计算速度快,几乎没有边界效应等优点.在此基础上结合TMS320DM642平台并行计算的特点,将新的算法重新优化并移植到TMS320DM642平台上.整个平台由图像采集模块、图象显示模块以及外部存储器等模块组成.通过专门设计的光学系统,分别对物距为1m、5m和10m处的物体以及人像进行成像.对中间模糊像的恢复实验结果表明,新的算法在TMS320DM642平台上图像复原速度快,效果好,为波前编码系统的真正便携和实用提供了可能.