共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
为了有效保证安全播出,本文提出电视采用缝隙天线备份,调频采用单偶极子天线备份进行同塔备份的解决方案,同时介绍了方案具体实施的过程,并对方案投入使用后的效果进行了分析。 相似文献
3.
分析银行系统现有DDN/FR网络线路的现状和存在的故障隐患,指出建立全面、可靠的网络备份是十分必要的,提出同网主端备份和异网备份二种备份方案。 相似文献
4.
本文按照海底光缆通信系统对光发射机的长寿命要求,提出了一种 LD 冗余——多个激光器冷备份自动切换的电路方案。并对无备份和有一个、两个、三个冷备份时的寿命可靠度分别进行了估算,认为最后一种方案是可行的。 相似文献
5.
黄鹏 《电信工程技术与标准化》2015,28(4):75-80
分析了目前分布式NAT444部署方案的网络架构、业务流程、溯源流程和安全备份机制,提出了几种安全备份方案,并且对各种方案的实现原理和优劣性等进行分析,以便在今后的实际工程设计和部署中能够提供参考. 相似文献
6.
本文就音频工作站网络系统的安全问题介绍了两种解决方案,一种是采用Octopus控制软件的全面备份方案,一种是针对资金不足和全面方案实施前的情况提出的廉价应急备份方案,为解决音频工作站网络系统的安全问题提供了一个新的思路。 相似文献
7.
分析了珠海数字电视前端系统N+1热备份的不足,提出了针对重点节目的1+1热备份方案,并且结合实施过程中遇到的问题,对1+1热备份方案进行了改进。 相似文献
8.
本文通过分析DX-600中波发射机风机控制器的工作原理,提出了用ABB变频器作为备份的方案,并介绍了备份变频器的接线和编程方法。 相似文献
9.
本通过对DDN、FR业务中用户电路实施备份的必要性的阐述,以及对用户电路故障点的分析,提出了实用、可行的备份方案(主要针对由ALCATEL公司设备组建的DDN、FR网络)。 相似文献
10.
11.
工业以太网冗余技术分析 总被引:3,自引:0,他引:3
为了满足工业以太网对网络的可靠性要求,减少因网络故障造成的损失,网络冗余容错技术的提出增加了网络的可靠性和稳定性。文中介绍了网络冗余技术国内外研究的总体情况,讨论了多种网络冗余解决方案,包括生成树协议、快速生成树协议、环网冗余协议和分布式冗余网络协议,以及其他的网络冗余技术,着重讨论了分布式冗余网络协议,’最后对多种网络冗余解决方案进行了比较,特别指出了它们的局限性。 相似文献
12.
13.
光纤通道拓扑结构冗余方法研究 总被引:1,自引:1,他引:0
对于采用光纤通道(FC)互连的航空电子系统,在FC3种基本拓扑结构的基础上,分别给出了FC组合拓扑结构和由多个FC交换机组成的FC交换式网络的通信模型。针对航空电子系统的分布式网络模型,给出了基于任务的可靠性分析方法。根据航空电子系统容错功能和提高可靠性的需要,提出了FC的3种基本冗余结构:双环结构、双交换机结构和交换机仲裁环冗余结构,专门针对FC交换式网络提出了两种冗余结构:基本路径冗余和全网络冗余,专门针对FC组合拓扑结构提出了桥端口冗余结构;通过基于任务的可靠性分析,对各种容错拓扑结构进行了比较。对FC各种冗余拓扑结构的研究对于航空电子系统设计阶段的容错设计和冗余结构设计都将起到一定作用。 相似文献
14.
15.
16.
The effect of adding standby redundancy at the system and component levels is studied. Compared with parallel redundancy, standby redundancy is both easier to implement and more essential in the study of maintenance policies. However, standby redundancy at the component level is not always better than that at the system level, whereas it is always better for parallel redundancy. It is shown that for a series (parallel) system, standby redundancy is more effective at the component (system) level. A simple proof is given 相似文献
17.
针对目标波达方向(DOA)估计的子空间类算法工程实现上的问题,提出了一种次最小冗余线阵的目标DOA估计方法。该方法应用孔径合成理论和最小冗余线阵理论,在保证阵列孔径等价的前提下,从工程应用的实际问题出发,对次最小冗余线阵的阵元配置进行研究。在分析MUSIC及MMUSIC算法的基础上,对次最小冗余线阵进行仿真。通过与相同孔径的均匀线阵和最小冗余线阵对比表明,次最小冗余线阵与相同孔径的均匀线阵性能相仿,并有更小的计算复杂度,比最小冗余线阵有更大的阵元灵活性,可以解决一般最小冗余线阵不能解决的相干信源的DOA估计问题。 相似文献
18.
Drmota M. Szpankowski W. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(11):2686-2707
Recent years have seen a resurgence of interest in redundancy of lossless coding. The redundancy (regret) of universal fixed-to-variable length coding for a class of sources determines by how much the actual code length exceeds the optimal (ideal over the class) code length. In a minimax scenario one finds the best code for the worst source either in the worst case (called also maximal minimax) or on average. We first study the worst case minimax redundancy over a class of stationary ergodic sources and replace Shtarkov's bound by an exact formula. Among others, we prove that a generalized Shannon code minimizes the worst case redundancy, derive asymptotically its redundancy, and establish some general properties. This allows us to obtain precise redundancy for memoryless, Markov, and renewal sources. For example, we present the exact constant of the redundancy for memoryless and Markov sources by showing that the integer nature of coding contributes log(logm/(m-1))/logm+o(1) where m is the size of the alphabet. Then we deal with the average minimax redundancy and regret. Our approach here is orthogonal to most recent research in this area since we aspire to show that asymptotically the average minimax redundancy is equivalent to the worst case minimax redundancy for some classes of sources. After formulating some general bounds relating these two redundancies, we prove our assertion for memoryless and Markov sources. Nevertheless, we provide evidence that maximal redundancy of renewal processes does not have the same leading term as the average minimax redundancy (however, our general results show that maximal and average regrets are asymptotically equivalent). 相似文献
19.
Nishimura Y. Hamada M. Hidaka H. Ozaki H. Fujishima K. 《Solid-State Circuits, IEEE Journal of》1989,24(1):43-49
To realize an efficient redundancy test using the multibit test (MBT) mode, a redundancy flag on a memory LSI tester and an effective redundancy technique which cooperates with the MBT mode have been introduced. This simple redundancy architecture needs only the RFLG (512 bits for the 1 M×1-bit DRAM) as a hardware option on a memory LSI tester. The program development time for the redundancy test has been shortened. Throughput improvement of six to ten times has been achieved in the actual 1-Mb DRAM redundancy test 相似文献
20.
Etzion T. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(11):4867-4879
The stopping redundancy of the code is an important parameter which arises from analyzing the performance of a linear code under iterative decoding on a binary erasure channel. In this paper, we will consider the stopping redundancy of Reed-Muller codes and related codes. Let R(lscr,m) be the Reed-Muller code of length 2m and order lscr. Schwartz and Vardy gave a recursive construction of parity-check matrices for the Reed-Muller codes, and asked whether the number of rows in those parity-check matrices is the stopping redundancy of the codes. We prove that the stopping redundancy of R(m-2,m), which is also the extended Hamming code of length 2m, is 2m-1 and thus show that the recursive bound is tight in this case. We prove that the stopping redundancy of the simplex code equals its redundancy. Several constructions of codes for which the stopping redundancy equals the redundancy are discussed. We prove an upper bound on the stopping redundancy of R(1,m). This bound is better than the known recursive bound and thus gives a negative answer to the question of Schwartz and Vardy 相似文献