线性调频的脉冲压缩雷达视频信号仿真

利用数字方法实现线性调频的脉冲压缩雷达视频目标模拟信号具有诸多优点：信号模拟的精度高，灵活性好，幅度、相位补偿方便，可以模拟复杂情况，系统结构简单，可靠性高，可扩展性强。详细介绍了基于FPGA设计线性调频的脉冲压缩雷达视频目标模拟信号的原理、结构、具体实现以及简要的性能分析。结果表明该方案性能良好，具有现实可实现性。     

On Finding the Multicast Protection Tree Considering SRLG in WDM Optical Networks

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm –multicast with SRLG sharing (MSS)– to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.     

基于AT89C2051的单户可视对讲门铃室内分机的设计

本文介绍一种基于单片机AT89C2501的单户可视对讲门铃室内分机的工作原理及软、硬件的设计与实现方法。     

经济实用的DSP电源解决方案

笔者介绍了两种低纹波的DSP电源解决方案:一为采用MAX1793和大电流EMI静噪滤波器NFM41P;二为改进的去耦p型滤波电路和大电流EMI静噪滤波器NFM41P。并对方案的特点及其实现进行了详细的解析。试验结果表明:所述方案的纹波小,仅100 mV左右;成本低,仅几十元;适用范围广,通过改变MAX1793芯片的输出电压,可将本方案移植到TI的C5000,C6000系列,且还可用于其他的脱机工作系统。     

组播通信的访问控制和密钥管理

IP组播是一种高效的多目标传输机制.随着网络的发展,组播在网络的应用占据着越来越重要的地位,其应用不断扩展,技术日益成熟.目前,组播作为一个崭新的学术研究领域,在组播路由算法、流量控制、可靠传输等方面的研究已有很多成果,而对于组播安全问题的研究特别是组播通信密钥的研究还很不成熟.本文通过研究绀播通信安全进行深入的研究,对比各种密钥管理方法,研究了可扩展的密钥管理方法.该密钥管理体系采用分层管理结构,采用子管理中心对各个子域进行管理,不仅可以高效地处理组播组成员动态加入和退出,同时,大大减少了密钥管理中心的负担.使该方法可以应用于大型、动态的组播系统.此外,该方法根据现有的网络和组播系统的要求,提出了控制中心由计算机组进行统一调度管理,避免了单点故障的问题,增加了系统的鲁棒性.     

一种支持QoS的拓扑自适应动态组播路由算法

YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开，同时为接收方提供多个可选择的组播接入路径，以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长，可扩展性不好等问题。本文在分析这些算法的基础上，提出改进的支持QoS的动态组播路由算法，即拓扑自适应动态组播路由（Topology Adaptive Dynamic Multicast Routing，TADMR）算法。该算法避免了以往算法中大部分盲目的路径搜索，并使结点加入时延不再受限于固定的等待时钟，而与网络拓扑相自适应。性能分析和仿真结果表明，该算法具有较低的控制信令开销和结点加入时延，适用于各种网络规模和群组规模，具有良好的可扩展性。     

数据增值业务在DVB中的实现

首先对DVB标准作了简单介绍，然后讨论了在数字电视系统中实现增值业务，最后给出了一个实例。     

用TMS320C6201实现H.263编译码系统

介绍了用TMS320C6201实现视频压缩编码标准H.263的编译码系统,并以编码系统为例,给出其硬件设计及软件的优化处理方法.     

基于MFQ的补丁优先算法的研究与实现

目前采用的视频流调度算法，没有充分利用补丁流满足服务率高而占用系统资源少的优势，系统效率较低．为了提高效率，提出了一种基于MFQ的补丁优先算法，并给出了该算法的系统流程。通过对实验结果的比较，该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性．     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.