共查询到19条相似文献,搜索用时 140 毫秒
1.
敌我识别系统在现代战争中占有极为重要的地位。分析了敌我识别系统的分类和工作原理,利用敌我识别信号的先验信息,引入时间序列相似性快速匹配原理,提出了一种基于敌我识别脉冲信息的分选识别方法。仿真结果表明,该算法分选速度快,环境适应能力强,能够较好解决复杂环境下敌我识别信号的快速分选识别问题。 相似文献
2.
《零八一科技》2005,(2):19-19
目标识别(target identification)指雷达对搜索空域中已检测到的目标正确地进行识别的方法或处理。合作目标的识别依靠二次大战中开发的敌我识别(IFF)技术,即在我方和友方的每一架飞机上,装有转发机,搜索雷达通过IFF发射机发射信号对目标进行询问,目标上的转发机在规定频率上以编码信号响应,IFF系统接收该响应并用可视符号进行显示。目前世界上大多数空军都采用IFF系统,所有的商用航线均采用其于IFF概念的信标跟踪系统,即所谓的二次雷达(参见二次雷达)。非合作目标识别于雷达和目标之间没有任何通信的情况。在这里,雷达和其操作员通过将可检测目标的参数,例如速度、高度和目标信号特征,诸如幅度、相位、频谱、调制方式等同已知(存库的)目标类型的上述参数进行相关比较来进行识别。非合作目标识别的成功在很大程度上取决于雷达的复杂程度,信号处理系统的先进性和目标有效观测时间的长短。 相似文献
3.
针对协作式二次雷达敌我识别只能识别“我方”,不能唯一地确认“敌方”的不足,提出基于协作式敌我识别器和信号情报的综合敌我识别方法,能较好地提供全局性的“敌方”、“我方”和“中立方”信息.介绍了系统组成,描述了系统工作过程,指出了需要进一步研究的技术. 相似文献
4.
5.
主要从雷达敌我识别综合系统的必要性、实现雷达敌我识别综合系统的可能性、RISS系统中敌我识别应答机、毫米波敌我识别、非协同目标识别等几方面论述了雷达询问敌我识别技术以及综合化问题。 相似文献
6.
敌我识别是避免战场误伤的重要手段之一。出于多国联合作战中避免战场误伤的考虑,北约各国十分重视敌我识别技术与装备的发展。按照不同的技术体制,介绍了北约MARK XIIA敌我识别系统、战场目标识别系统、多体制单兵敌我识别系统的发展现状,包括系统特点、工作机理和指标对比。结合北约近些年的装备发展,指出北约重视敌我识别体系能力建设,并正在推动敌我识别系统向着高性能、综合化、集成化、小型化、智能化、网络化、无人化发展。最后,讨论了敌我识别后续发展重点及对我军敌我识别领域发展和联合作战运用的借鉴意义。 相似文献
7.
8.
雷达敌我识别干扰方法研究 总被引:1,自引:0,他引:1
雷达敌我识别系统用来识别雷达发现目标的敌我属性,它的基本原理是询问机发射射频脉冲询问信号给应答机,应答机收到后自动发回应答信号完成敌我识别;雷达敌我识别干扰则是利用己方的雷达敌我识别对抗装备对敌方的雷达敌我识别系统实施电子干扰的作战行动。文章通过阐述基本工作原理、分析典型信号特征,介绍了雷达敌我识别系统;针对其存在的弱点,分析了雷达敌我识别干扰的可行性;结合已有研究成果和可行性分析,探讨了压制性干扰、欺骗性干扰和灵巧干扰的方法,对雷达敌我识别对抗技术的深入研究具有一定的意义。 相似文献
9.
10.
分析了MarkXIIA敌我识别系统和激光敌我识别系统的现状,提出了射频与激光组合识别方案。该方案综合利用激光指向性高和Mark XIIA系统识别能力强的优点,通过并行使用射频询问射频应答工作方式和激光询问射频应答工作方式,避免了来自射频询问主波束内的多目标应答问题,在具备多目标处理能力的同时,提高了对密集目标中点目标的敌我属性识别能力。该方案也为单兵提供了可行的敌我识别手段。最后,论述了该方案的实用性,以期为新型敌我识别系统的设计提供参考。 相似文献
11.
Dynamic spreading code selection method for PAPR reduction inOFDM-CDMA systems with 4-QAM modulation
We present a new dynamic spreading code selection technique to obtain low peak-to-average-power ratio (PAPR) of an orthogonal frequency-division multiplexing code-division multiple-access (OFDM-CDMA) system with 4-QAM modulation for the down-link in mobile communication. In this method, initially, each user is assigned a low and a high PAPR spreading code, which allows selecting one when the system is operating. The spreading code of each user is dynamically selected so that total PAPR level of the whole user group present in the system is minimized. With the proposed technique, the PAPR level of a system with 10 users and 64 sub-carriers using 64 chip Walsh-Hadamard (WH) codes, can be limited to 15 dB while the worst case theoretical maximum could go up to 28.1 dB. Although 64 chip WH codes are employed to evaluate the performance it can be generalized to all other sets of spreading codes 相似文献
12.
13.
We consider the design of trellis codes for transmission of binary images over additive white Gaussian noise (AWGN) channels. We first model the image as a binary asymmetric Markov source (BAMS) and then design source-channel optimized (SCO) trellis codes for the BAMS and AWGN channel. The SCO codes are shown to be superior to Ungerboeck's codes by approximately 1.1 dB (64-state code, 10-5 bit error probability), We also show that a simple “mapping conversion” method can be used to improve the performance of Ungerboeck's codes by approximately 0.4 dB (also 64-state code and 10 -5 bit error probability). We compare the proposed SCO system with a traditional tandem system consisting of a Huffman code, a convolutional code, an interleaver, and an Ungerboeck trellis code. The SCO system significantly outperforms the tandem system. Finally, using a facsimile image, we compare the image quality of an SCO code, an Ungerboeck code, and the tandem code, The SCO code yields the best reconstructed image quality at 4-5 dB channel SNR 相似文献
14.
基于不同信息获取方式的敌我识别系统 总被引:1,自引:1,他引:0
本文从宏观的角度出发,通过对目标敌我属性信息特点的分析,提出了多种针对不同敌我识别系统所采用的识别信息获取方式,并分析了不同系统体制的特点,指出了各自存在的问题及局限性,澄清了在敌我识别系统研究领域中的若干模糊概念,最后就不同的作战使用环境,讨论了各种识别系统的适用范围。 相似文献
15.
Ben-Jye Chang 《Wireless Personal Communications》2007,41(3):325-344
For achieving high transmission rate in mobile multimedia communications, 3G WCDMA systems adopt the Orthogonal Variable Spreading
Factor (OVSF) code tree to assign a single channelization code for each accepted connection. Based on the orthogonal characteristic
of an OVSF code tree, an allocated code blocks the channelization codes that are on the descendant branches and the ancestral
codes of the allocated code. Several researches have been proposed to overcome the code-blocking problem for maximizing system
utilization. By using both the code assignment and reassignment mechanisms, the system utilization and code blocking can be
improved. Nevertheless, the data rate of traffic classes in such single code assignment system should be powers of two of
the basic rate, which is impractical and wastes the system capacity when the required rate is not powers of two of the basic
rate. A good solution is to assign multiple codes to a new connection, but causes two drawbacks: high complexity of handling
multiple codes and high cost from using more number of rake combiners. Consequently, there is a trade-off between waste rate
and complexity of handling multiple codes assignments. In previous researches, high computation complexity of assigning multiple
codes for a connection and large number of reassignment codes suppressed the advantage of reducing waste rate. Therefore,
we propose an adaptive efficient partition algorithm with the Markov Decision Process (MDP) analysis approach to reduce the
large number of reassignment codes while improving waste rate. There are two main motivations in the proposed approach. First,
we propose an adaptive efficient partition algorithm to determine multiple codes based on the current state of the OVSF code
tree for the new incoming connection. Second, after determining the multiple codes, we adopt the MDP analysis to assign the
least-cost code for each determined code. Numerical results demonstrate that the proposed MDP approach yields the least number
of reassignments and the least number of codes per connection while reducing waste rate significantly, as compared to other
approaches. 相似文献
16.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1987,33(2):246-257
Petry's efficient and optimal variable to fixed-length source code for discrete memoryless sources was described by Schalkwijk. By extending this coding technique we are able to give an algorithm for Markov sources that is easy to implement. We can bound the loss of efficiency as a function of the code complexity and the mismatch between the source and the code. Rates arbitrarily close to the source entropy are shown to be achievable. In this sense the codes introduced are optimal. 相似文献
17.
Merli F.Z. Xiaodong Wang Vitetta G.M. 《Selected Areas in Communications, IEEE Journal on》2008,26(3):506-516
We derive a novel Bayesian algorithm for multiuser detection in the uplink of a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system employing stacked space-time block codes, such as the stacked Alamouti code with two transmit antennas, and a stacked quasi-orthogonal code with four transmit antennas. The proposed technique accomplishes joint estimation of the carrier frequency offset, phase noise, channel impulse response and data of each active user. Its derivation relies on the specific structure of the transmitted signal and on efficient Markov chain Monte Carlo (MCMC) methods. Simulation results evidence the robustness of the proposed algorithm in both uncoded and coded systems. 相似文献
18.
介绍了敌我识别(IFF)系统的组成和工作原理,分析了IFF系统和传统一次雷达的区别与联系,并提出了一种融合IFF系统与一次雷达的设计方法。 相似文献