广电网络业务发展的分析

以促进广电网络发展为纲,分析广电主要的3项增值业务:付费频道,高清互动,宽带业务。从实际出发,分析现状并为其正确定位,对其发展方向及业务增长方式题出建议,指出广电未来以电视业务宽带业务为主线的盈利格局。     

基于高频声音信号的商家信息推广系统

提出利用声音为传输媒介并利用人耳听觉特性,将所要传送的资讯,埋藏在高频音讯中,并实际应用在行动装置上,让店家可以使用扬声器不停的播放声音信号,使消费者靠近店家即可收到该店家的消费资讯.在传送端使用18 kHz左右的音频,配合RS code,preamble encoder和PSK传递信号,并在接收端使用preamble detection,PLL,RS decoder解出信号,让整个系统最后实现在iOS装置上,实验结果证实系统可以成功传递商家信息.     

农村广播电视数字流媒体播出前端建设

介绍农村广播电视流媒体播出前端的构建,流媒体播出前端系统硬件和软件的功能及实施过程。     

基于FM广播的无源探测系统干扰抑制研究

基于FM广播的无源探测系统,因为其抗隐身、反侦察、生存能力强和可靠性高等特点,成为现有探测技术的一种有效补充,备受各国重视。在实际工程应用中,经常受到临近城市间的同频或临频电台信号干扰,严重削弱了该体制雷达的性能,限制了其应用。针对这种情况,分析了干扰电台信号对系统的干扰原理,给出了抑制这种干扰的自适应算法。对实际信号的仿真结果表明,该方法有效地抑制了电台干扰信号,检测到干扰抑制前系统无法检测到的目标。     

提高蓝牙广播性能的自适应分组选择策略

分析了蓝牙2.0+EDR新规范π/4-DQPSK与8DPSK调制方式在加性高斯白噪声信道(AWGN)下的比特错误率与平均接收信噪比的关系,推导了ACL数据分组的广播重传概率与平均接收信噪比的函数表达式,提出了蓝牙2.0+EDR广播数据分组在加性高斯白噪声信道下的自适应分组选择策略,即通过在不同的信噪比下选择不同的分组类型进行传输以得到最少的广播重传次数和最大的传输吞吐量。仿真结果为在不同信道条件下取得最好的广播效果提供了参考。     

利用地理网格簇增强定向扩散协议

定向扩散协议是一种用于无线传感器网络的数据分发协议.在定向扩散中,兴趣和探测数据采用泛洪的方法在网络中散布,这将引起广播风暴导致网络能量的大量消耗.在网络中通过形成簇结构可以缓解广播风暴问题,每个节点利用本身的地理位置信息自组织形成虚拟地理网格簇,簇中仅有一个节点负责兴趣和探测数据的广播.模拟试验表明,这种方法有效地降低了网络的能量消耗.     

A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks

A new single channel, time division multiple access (TDMA)-based broadcast scheduling protocol, termed the Five-Phase Reservation Protocol (FPRP), is presented for mobile ad hoc networks. The protocol jointly and simultaneously performs the tasks of channel access and node broadcast scheduling. The protocol allows nodes to make reservations within TDMA broadcast schedules. It employs a contention-based mechanism with which nodes compete with each other to acquire TDMA slots. The FPRP is free of the hidden terminal problem, and is designed such that reservations can be made quickly and efficiently with negligible probability of conflict. It is fully-distributed and parallel (a reservation is made through a localized conversation between nodes in a 2-hop neighborhood), and is thus scalable. A multihop ALOHA policy is developed to support the FPRP. This policy uses a multihop, pseudo-Bayesian algorithm to calculate contention probabilities and enable faster convergence of the reservation procedure. The performance of the protocol, measured in terms of scheduling quality, scheduling overhead and robustness in the presence of nodal mobility, has been studied via simulations. The results showed that the protocol works very well in all three aspects. Some future work and applications are also discussed.     

一种多功能频率测量系统

运用信号检测、控制与信息存储技术,用8位AVR单片机实现信号源的频率测试与电机控制。根据所测信号频率,采用PWM波实时调节电机的转速,实现光圈的开度控制。系统中PC机与AVR单片机间采用RS232串口进行数据通信．系统具有密码验证功能,满足安全要求。首先AVR单片机通过I^2C总线读取存储器中的密码信息,然后将其与PC机传来的密码数据进行比较。如果密码正确,则启动系统。设计语音播报功能,采用凌阳SPCE061单片机进行语音处理。系统以C语言编程,可读性较好,可移植性强．实验表明系统设计合理可靠,满足设计要求。     

Capacity Region of a Class of Gaussian Cognitive Degraded Broadcast Channel

This paper studies the cognitive broadcast channel in which the primary user com- municates to the primary receiver, while the secondary user has noncausal knowledge of the primary radio＇s codeword and expects to communicate to two secondary receivers. Comparing with the existing cognitive radio channel which considers only one secondary receiver, cognitive broadcast channel studies the case that there are multiple secondary receivers. To this end, we investigate the fundamental limits of the performance of the Gaussian cognitive broadcast channel from the information theoretic perspective. Specifically, we derive the capacity region of the Gaussian cognitive degraded broadcast channel with weak interference.     

On optimal scheduling for time-constrained services in multi-channel data dissemination systems

We study the problem of disseminating data of time-constrained services through multiple broadcast channels. By time-constrained services, we mean those services whose data must reach clients before a certain constrained time. Otherwise, the data would become useless or substantially less valuable to the clients. We first explore the difficulties of solving the problem and derive the theoretical minimum number of channels required for the task. Then, we propose a transformation-based data allocation (TDA) algorithm that guarantees to fulfill the task (i.e., all requested data reach the clients within the constrained time) by using the minimum number of channels. Finally, we analyze the computation complexity and prove the validity and optimality of the TDA algorithm.