基于线性约束LSCMA在TS101上的实现  

Application of Least Squar Constant Modulus Algorithm based on Linear Constrains inADSP TS101S

作　　者：杨鹏[1] 斯炜玮[1] 吴瑛[1] 李崇[1] 

机构地区：[1]郑州解放军信息工程大学信息工程学院,硕士450002

出　　处：《微计算机信息》2005年第10Z期63-64,30,共3页Control & Automation

基　　金：十五军事预研项目;编号不公开

摘　　要：本文探讨了ADSPTigerSHARC101S的在基于线性约束最小二乘恒模算法(LSCMA)中的应用。首先介绍了最小二乘恒模算法基本原理和权值迭代公式,并对其进行线性约束然后介绍了ADSPTigerSHARC101S芯片的基本结构特征和它强大的功能并简单描述了其相应开发软件VisualDSP++3.0的功能及使用方法。给出了最小二乘恒模算法实现波束合成的具体流程图,在经过Matlab软件成功进行仿真模拟之后用VisualDSP++3.0设计了DSP程序,用C语言嵌套部分汇编语言的形式实现了用ADSPTigerSHARC101S进行迭代求权向量的过程。This article describes the application of ADSP Tiger SHARC101S in the Least Squar Constant Modulus Algorithm based on Linear Constrains . First it makes a general introduce for the basic theory of CMA, of which flow chart is presented detailed later , the formula of weight＇s iterative and describes the basic feature of the chip＇s configuration as well as its powerful function. After a seccessful computer simulation with the software-MALAB , design a program by Visual DSP＋＋3.0 to realize the course of weight vectots＇ iterating with C language partially embeded by assemble language .

关 键 词：TigerSHARCIOIS 线性约束最小二乘恒模 VISUAL DSP++3.0 

分 类 号：TN911[电子电信—通信与信息系统]