基于ADSP—21060 SHARC高速通用声呐信号处理系统

中国科学院声学研究所信号处理研究室长期从事水声信号处理、水声工程和声呐系统的研究和实验工作,研制出了第二代到第四代声呐系统,积累了丰富的经验、本文介绍一种利用ＡＤＳＰ—２１０６０ＳＨＡＲＣ芯片研发而成的通用信号处理板。它具有体积小、功能完备、运算速度快、并行处理能力强、可靠性高等特点。可任意集成不同的信号处理系统,适用于各种信号处理领域。     

多波束DICANNE系统研究

多波束ＤＩＣＡＮＮＥ系统具有抵消强干扰的良好性能。本文给出这种数字式系统的理论基础，讨论其稳态特性。指出多波束ＤＩＣＡＮＮＥ系统输出的信噪比、干扰噪声比。给出系统硬件实现的方框图及各种参数的选择。同时讨论以ＴＭＳ３２０系列芯片进行硬件设计的问题。     

拖线阵海试数据的窄带PIC自适应处理与分析

本文介绍了对拖线阵海试数据进行窄带ＰＩＣ处理的方法。用梯度算法、协方差矩阵递归直接求逆算法和ＲＭＧＳＥＦ算法进行了窄带ＰＩＣ自适应处理。分析了学习曲线和输出平均功率波束图，进行了稳态计算和比较。表明ＲＭＧＳＥＦ算法是一种可用于多干扰波束、收敛快、抵消性能好、便于拖线阵声呐实现实时ＰＩＣ处理的最好算法。     

数字式声呐中一种新的背景均衡算法

在频谱分析领域,背景均衡技术已被广泛地研究过．已经证明,这种方法对改善线谱检测是有效的．在数字多波束声呐系统中,方位历程显示是信号处理模块和显控模块之间最重要的界面。已经证明,声呐处理系统的增益最容易在不同的信号处理模块接口处丢失．背景均衡技术可以改善方位历程显示的总体性能,将多波束数据的后置处理结果在送至显示器之前首先进行滤波．本文提出的中值滤波和排序截断平均（ＯｒｄｅｒＴｒｕｎｃａｔｅＡｖｅｒａｓｅ,ＯＴＡ）相结合的方法利用可变长的窗口匹配不同主瓣宽度的波束图是一种对不均匀、非平稳背景的有效均衡技术．系统模拟结果表明,此方法对于多波束非均匀背景的均衡是非常有效的。     

声呐设计中的系统模拟技术(Ⅱ)

本文继续前文讨论声呐设计中的系统模拟技术。数字多波束声呐对目标的精确定向问题提出了新的要求。本文给出利用多波束输出实时计算信号入射角的几种方法,即内插法、微分相关法及互谱法。系统模拟的结果指出这些方法可以用于实时跟踪多个目标。 后置积累是声呐信号处理的重要组成部分。文中给出两种数字式积累器的系统响应,比较了它们的性能。指出指数型平均积累器是一种便于实现而性能又接近理想平均器的后置积累系统。我们还给出在计算机上进行模拟的结果。最后讨论声呐设计中系统模拟所面临的新问题。     

基于子带分解的宽带波束域最小方差无畸变响应高分辨方位估计方法研究

针对最小方差无畸变响应法对宽带不适用、计算量较大和如何与实际声呐系统结合这三个问题,提出了基于子带分解的宽带波束域MVDR高分辨方位估计方法:它以子带分解的方法实现MVDR在宽带情形下的扩展;利用波束转换实现降维运算,大大减小运算量和提高算法的稳健性;并且提出了在声呐系统使用中的新思路:可将该方法与声呐的多波束系统结合,直接利用声呐多波束系统的输出,可省去从阵元域到波束域的转换,进一步减少运算量;可用于替代传统的分裂波束精测定向系统或单波束系统,提高整个声呐定向系统的性能。经过理论分析、仿真实验和湖试实验,证明了该方法是简单的、有效的、可行的。     

一种主从式数字处理系统及其在声呐设备中的应用

本文给出一种由ＰＣ？ＡＴ和ＴＭＳ３２０Ｃ２５－ＤＳＰ组成的主从式数字处理系统，介绍了其在声呐设备检查测试中的几个典型应用。     

中国声学学会水声学分会学术研讨会在敦煌召开

中国声学学会水声学分会于２０００年９月２２－２４日在甘肃敦煌市举行学术研讨会及主任、委员扩大会议．收到水声论文报告１６篇,声学相关学科报告３篇．到会水声专家共２２人． 水声分会学术研讨会共有１１位声学家作了学术报告,侯朝焕院士、霍国正、侯自强教授等,从三个角度论述了声响系统设计的趋势和最新方法：其一, 是用并行阵处理机芯片实现ＤＳＰ和ＣＰＵ;其二,是硬／软件折衷设计使声响系统达到最佳;其三,用大型、通用计算机满足声呐系统ＤＳＰ要求．宫先仪教授研究多路径传播的时空多分辨建模及相应的多分辨处理,从而提…     

G.723.1声码器的DSP16k实现

本文介绍了ＩＴＵ－ＴＧ．７２３．１语音编解码器在朗讯科技公司新一代定点数字信号处理芯片ＤＳＰ１６Ｋ上的实时实现技术。本文编程实现了Ｇ７２３．１标准的所有功能模块,包括在变码率下的静音检测（ＶＡＤ）和舒适噪声产生（ＣＮＧ）模块。本文的实现完全复合ＩＴＵ－ＴＧ．７２３．１标准的定点算法,通过了ＩＴＵ－Ｔ的所有测试矢量。同时本文比较了Ｇ．７２３．１在两种定点数字信号处理器ＤＳＰ１６ｘｘ和ＤＳＰ１６Ｋ上实     

声呐设计中的系统模拟技术(Ⅰ)

数字信号处理理论与计算机技术的发展已使系统模拟技术成为声呐设计的新的有力的手段。本文叙述在声呐设计中利用系统模拟技术的必要性以及系统模拟技术的主要功能。文中首先讨论在计算机上模拟声呐环境场的原理及方法。给出一种快速产生带限高斯随机序列的算法和用变采样率产生高精度基阵信号的原理。同时给出数字式多波束、多分层的波束成形系统的计算机模拟的公式。文中给出在计算机上进行系统模拟的某些结果并与理论值作了比较。     

Source implementation to eliminate low-frequency artifacts in finite difference time domain room acoustic simulation

The finite difference time domain (FDTD) method is a numerical technique that is straight forward to implement for the simulation of acoustic propagation. For room acoustics applications, the implementation of efficient source excitation and frequency dependent boundary conditions on arbitrary geometry can be seen as two of the most significant problems. This paper deals with the source implementation problem. Among existing source implementation methods, the hard source implementation is the simplest and computationally most efficient. Unfortunately, it generates a large low-frequency modulation in the measured time response. This paper presents a detailed investigation into these side effects. Surprisingly, some of these side effects are found to exist even if a transparent source implementation is used. By combing a time limited approach with a class of more natural source pulse function, this paper develops a source implementation method in FDTD that is as simple and computationally as efficient as a hard source implementation and yet capable of producing results that are virtually the same as a true transparent source. It is believed that the source implementation method developed in this paper will provide an improvement to the practical usability of the FDTD method for room acoustic simulation.     

A beam interpolation algorithm in digital multi-beam sonar

I.IntroductionThedigita1operationins0narsystembringsagreatadvantageinbeamforming.Itispos-sib1etorealizesomcalg0rithmsindigita1technique,whichisusua11yhardtoorimpossib1etoAnp1ementintraditiona1ana1ogues0nar.Asanexamp1e,ageometrygraphofcirclearrayisil-1ustratedinFig,1.Thetotalnumber0farraye1ementisN.Therearetwokindsofbeam.TheA-c1assbeamconsistsof2M-le1ements,thesteeringdirectionisjustlocatedintheposi-honofoneofthearrayelement;TheB-classbeamconsistsof2Me1ementsandthesteeringdirectionisinthem…     

Photonic Implementation of Quantum Computation Algorithm Based on Spatial Coding

Several implementation methods of quantum computation algorithm by conventional computer have been explored for large-scale emulation. Due to the lack of quantum effects, these methods generally require exponential growth of the size of the hardware with increase of the number of qubits. In this paper, the spatial coding, which is an effective digital optical computing technique, is studied as an efficient implementation method of quantum computation algorithms. In the proposed scheme, quantum information is represented by the intensity and the phase of elemental cells. We confirmed correct operation of the quantum teleportation algorithm by computer simulation. We also demonstrated a photonic implementation of some of the quantum gates experimentally.     

A new implementation of the molecular replacement method using a six-dimensional Patterson vector search

The current molecular replacement programs are primarily implemented in reciprocal space. In this paper a new implementation in direct (real) space is proposed by matching the model atomic vectors with the vectors in the Patterson vector space using a six-dimensional exhaustive search method. It is shown that this implementation can find the correct rotations and translations of alpha helices in a myoglobin crystal structure using experimental diffraction data at 2 A resolution. A comparison with previous Patterson vector search methods is discussed.     

Efficient implementation of x-ray ghost imaging based on a modified compressive sensing algorithm

Towards efficient implementation of x-ray ghost imaging (XGI), efficient data acquisition and fast image reconstruction together with high image quality are preferred. In view of radiation dose resulted from the incident x-rays, fewer measurements with sufficient signal-to-noise ratio (SNR) are always anticipated. Available methods based on linear and compressive sensing algorithms cannot meet all the requirements simultaneously. In this paper, a method based on a modified compressive sensing algorithm with conjugate gradient descent method (CGDGI) is developed to solve the problems encountered in available XGI methods. Simulation and experiments demonstrate the practicability of CGDGI-based method for the efficient implementation of XGI. The image reconstruction time of sub-second implicates that the proposed method has the potential for real-time XGI.     

An improved operator expansion algorithm for direct and inverse scattering computations

Abstract

In the first part of the paper we present an implementation of Milder's operator expansion formalism for acoustic scattering from a rough non-periodic surface. Our main contribution to the forward-field calculation is the development of two accurate ways of computing the order-zero normal differentiation operator N ₀. The accuracy of our implementation is tested numerically. In the second part of our paper we apply this approach, combined with a continuation method, to an inverse scattering problem. The resulting scheme performs significantly better than the classical first-order methods.     

基于VR技术的虚拟校园系统的设计与实现

虚拟现实技术是指利用计算机多媒体技术从人的嗅觉、视觉、触觉和听觉等多方面来全方位模拟环境,使人产生身临其中的感觉,通过人机交互操作,来获得相应的信息或者体验.本文分析了虚拟校园系统的发展现状以及在web2.0下基于VR技术的虚拟校园系统的设计与实现.通过对虚拟现实技术的介绍,结合校园导向标识系统的设计要求,提出利用虚拟现实技术来实现校园导向标识系统的可行性方案.叙述了虚拟校园系统的框架、开发技术以及具体的实现方法,并对虚拟校园系统的建模方法以及交互性进行了重点阐述.     

Increasing resolution of digital images using edge-based approach

This paper presents the results of our research aimed at obtaining new methods for increasing resolution of digital images giving better visual results. Classification of these methods and implementation of some algorithms is also shortly presented here. The main part of the paper presents modification and development of the new methods. Main new feature, which we added to the interpolation algorithms, consists in taking into consideration in the final image (i.e., after interpolation at high resolution) the edges detected in the original image (i.e., before interpolation). Summing an image and its properly processed edges in the interpolation process enables us to get final image characterized by better sharpness with simultaneous precise presentation of the image details interpolated to higher resolution.     

A parallel implementation of a modified Richardson-Lucy algorithm for image de-blurring

Passive imaging in the millimetre wave region of the spectrum is attractive compared with imaging in the visible and infrared because of its better penetration through cloud and rain. However, the diffraction limited spatial resolution is far worse and computer restoration of millimetre wave images is necessary. The Richardson-Lucy algorithm is frequently used for image restoration because compared with linear algorithms it has reduced sensitivity to error in a priori knowledge, and fewer restoration artefacts. However, it requires many iterations to converge and is very slow compared with linear methods. This paper investigates modifications of the Richardson-Lucy algorithm which speed up the execution of the algorthm. Software techniques investigated include incorporating a speedup parameter, using dual point spread functions and implementation in the Fourier domain. A parallel implementation of the algorithm has also been investigated using a tree topology network of between 1 and 10 transputers. Finally an application of the transputer system to the de-blurring of a millimetre-wave image obtained from a mechanical scanning system is described in the paper.     

Simple recursive implementation of fast multipole method

In this paper we present an implementation of the well known “fast multipole” method (FMM) for the efficient calculation of dipole fields. The main advantage of the present implementation is simplicity—we believe that a major reason for the lack of use of FMMs is their complexity. One of the simplifications is the use of polynomials in the Cartesian coordinates rather than spherical harmonics. We have implemented it in the context of an arbitrary hierarchical system of cells—no periodic mesh is required, as it is for FFT (fast Fourier transform) methods. The implementation is in terms of recursive functions. Results are given for application to micromagnetic simulation. Complete source code is provided for an open-source implementation of this method, as well as an installer for the resulting program.