A new algorithm for the generation ofk-AryM sequences

A new algorithm for generatingk-aryM sequences is given. In the algorithm a new method is used that the main cycle is extended by joining to it a subset of cycles instead of the classical one in which the main cycle is extended by joining to it one cycle. The algorithm reduces the times of choosing bridging states and accelerates the speed of joining cycles.     

产生k元M序列的一种新算法

本文给出了生成k元M序列的一种新的算法.该算法不再采用主圈并一个圈的经典并圈法,而是利用了主圈并一组共轭圈的新的并圈方法.这样减少了选择桥状态的次数,进而加快了并圈速度.     

Comparative study of two CPU router time management algorithms in cellular IP networks

Providing good quality of service (QoS) in cellular IP networks is an important requirement for performance improvement of the cellular IP network. Resource reservation is one of the methods used in achieving this goal and is proven to be effective. The main resources to be reserved in a cellular IP network are bandwidth, buffer and central processing unit (CPU) cycles. Router CPU cycle is the time taken by the router to process the packet of the flow before forwarding it to the next router (hop). This paper proposes a model for CPU cycle optimization of routers for real‐time flows in a cellular IP network. The model applies both genetic algorithm (GA) and particle swarm optimization (PSO) as soft computing tools to optimize the CPU cycles and reduces the flow processing time at each router in the route taken by a flow. Simulation experiments illustrate a comparative study of the model.     

Kademlia中启发式入网机制研究

抖动是制约DHT网络发展和应用的关键问题之一,该文从抖动处理的角度,研究了Kademlia的快速启动入网机制。在分析原入网算法缺陷的基础上,提出一种启发式入网算法。该算法通过改变新节点充实路由表的方式,在保证路由表较优构造的同时,大幅缩减了入网过程中节点传递的消息量。理论分析与仿真实验表明,该算法能够有效降低节点入网过程的时、空开销,增强系统对抖动的恢复能力和稳定性。     

Shannon小波包分解自适应Gabor滤波器设计及其在纹理分割中的应用

本文首先研究了Ｇａｂｏｒ滤波器进行确定性纹理分割时纹理结构与Ｇａｂｏｒ函数的关系，提出了利用在频域中具有紧支集的Ｓｈａｎｎｏｎ小波包分解检测纹理的主频；最后，提出了基于小波包分解自适应Ｇａｂｏｒ函数与纹理图像卷积，就可以在纹理的连续处产生良好的阶跃边缘，并通过实验验证了该算法的有效性及其对噪声的鲁棒性。     

An Algorithm for Evaluating Overall Reliability of Special Tree-Networks

The overall reliability of networks composed of trees, cycles and semi-cycles is determined using a computer algorithm. An n-node cycle contains n nodes and links forming a single loop; an n-node semi-cycle has more than one loop, but reduces to a cycle upon the removal of one link. The algorithm identifies all cycles and semi-cycles and determines iteratively the overall reliability using a simple formula and Bayesian decomposition.     

IIR array processing based fast adaptive null steering algorithm using shift-invariant subarrays

This paper presents and investigates a fast adaptive null steering system employing infinite impulse response (IIR) array processing. The new algorithm is of considerable interest in communications where the desired signal is weak compared with the interfering signals or where the desired signal can be easily separated out. With the proposed algorithm, the nulls of the array system are repetitively updated one by one in a cyclical manner through a sequence of adjustment cycles. In each adjustment cycle, a particular null is updated by using the least mean square (LMS) algorithm and the update of each particular null will not affect other null positions. The proposed method is very effective and useful in the sense that it will result in a nearly flat gain in the antenna pattern, except zero gains at the null directions. Moreover, as will be demonstrated later from both analysis and simulation results, the convergence behavior of the new algorithm is significantly faster than the linearly constrained minimum variance (LCMV) method and is almost independent of the external noise environment.     

基于循环相关的扩展空间解相关算法及其模式检测中的应用

针对空域扩展空间解相关(spatial extended spatial decorrelation;SESD)算法对参数选择鲁棒性差的缺点,使用一维循环相关操作代替原二维平移相关操作,提出了一种基于循环相关的扩展空间解相关(extended spatial decorrelation based- on cycle correlation;ESDBCC)算法。在无噪和有噪环境下,研究了SESD算法与ESDBCC算法对参数选择的鲁棒性,结果表明ESDBCC算法有以下两个显著优点:1)与二维平移相关操作相比,一维循环相关操作更适合计算机计算,从而降低了计算量;2)在有噪和无噪环境下,ESDBCC算法对参数选择的鲁棒性都要明显好于SESD算法。     

Self‐Replenishing Dual Structured Superhydrophobic Coatings Prepared by Drop‐Casting of an All‐In‐One Dispersion

Robust dual structured superhydrophobic coatings which replenish spontaneously their surface chemical composition on new multi‐scale structured surfaces, recreated upon damage, are described. The surface repair occurs at room temperature, via intrinsic elements of the coatings, all covalently bonded. These coatings can be prepared from all‐in‐one dispersions by a simple drop‐cast method, with different thicknesses and on various substrates. The critical factors to optimize the self‐replenishment are described and three main design principles are postulated. The superhydrofobicity of the coatings is maintained even after 500 abrasion cycles. The principles reported can be extended towards self‐healing other surface‐dependent functionalities, that is, anti‐bacteria, anti‐fouling, or drag‐reduction, which will maintain high performance levels all through their life‐cycle with low cost and energy demand for maintenance and surface repair.     

Network restoration under a single link or node failure using Preconfigured Virtual Cycles

This paper presents a design algorithm for networks with a restoration mechanism that provides failure-independent, end-to-end path protection to a set of given demands under a single link or node failure with a focus on optical networks. The restoration routes are provided on preconfigured cycles, where each of the demands is assigned a single restoration route and specific restoration wavelengths on a segment of one cycle (splitting is not allowed). The number of reserved restoration wavelengths may vary from one link to the next on a cycle; hence, we refer to these cycles as Preconfigured Virtual Cycles (PVCs). The network design algorithm consists of three major parts. The first part generates a large number of candidate PVCs. Our algorithm allows assignment of certain demands that have common failure scenarios to the same PVC. The second part selects a set of PVCs from among the candidates, attempting to minimize the total reserved restoration cost while ensuring that each demand is assigned to one PVC. This is achieved by solving a set covering problem followed by elimination of duplicate assignments. The third part resolves conflicts of wavelength assignments.     

PRACTICAL ALGORITHMS FOR TORNADO CODES

Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect, two algorithms are introduced： （1） while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; （2） in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.     

基于循环谱特性的扩展二元相移键控解调算法

介绍了扩展二元相移键控调制(Extended BPSK调制,以下简称EBPSK调制)信号模型及其二阶循环谱特性。对平稳信号匹配滤波进行拓展的基础上,提出了一种新的基于循环谱特性的EBPSK解调算法,由此给出基于该解调算法的EBPSK接收机框图,并对该解调算法性能进行了分析,最后进行了仿真验证。理论分析及仿真结果表明:基于循环谱特性的EBPSK解调算法利用噪声与EBPSK信号在循环频率域上的差别,能够有效分离在频域和时域都重叠的噪声和EBPSK信号,为EB-PSK调制的实用化提供一种有价值的参考。     

Research of P2P overlay in heteromerous network

Most of the existing overlays are designed for only one network. This paper analyses the characteristic of heteromerous network and proposes a tree structure overlay for it. We classify the nodes into two types: common node and hybrid node. We design new routing table and new algorithms for node (especially for hybrid node) joining, leaving and searching. The simulation result shows that the overlay is well suit for heteromerous network. The algorithm is convergent in large-scale situation.     

Optical quorum cycles for efficient communication

Many optical networks face heterogeneous communication requests requiring topologies to be efficient and fault tolerant. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. We show efficiency and distributed control can also be accomplished in optical network routing by applying the same established quorum set theory. Cycle-based optical network routing, whether using SONET rings or p-cycles, provides the sufficient reliability in the network. Light-trails forming a cycle allow broadcasts within a cycle to be used for efficient multicasts. Cyclic quorum sets also have all pairs of nodes occurring in one or more quorums, so efficient, arbitrary unicast communication can occur between any two nodes. Efficient broadcasts to all network nodes are possible by a node broadcasting to all quorum cycles to which it belongs (\(O(\sqrt{N})\)). In this paper, we propose applying the distributed efficiency of the quorum sets to routing optical cycles based on light-trails. With this new method of topology construction, unicast and multicast communication requests do not need to be known or even modeled a priori. Additionally, in the presence of network link faults, greater than 99 % average coverage enables the continued operation of nearly all arbitrary unicast and multicast requests in the network. Finally, to further improve the fault coverage, an augmentation to the ECBRA cycle finding algorithm is proposed.     

基于梯度的分簇式路由协议

针对大多数无线传感器网络路由协议在分簇过程中仅考虑能量作为权值的不足,在EAMCT-G协议的基础上进行改进,不仅考虑了节点的剩余能量,还考虑了节点的邻居节点个数以及与周围节点之间距离的均值,这些量的综合作为选取簇头的权值标准。该协议中同时还引入了梯度的思想,保证了节点在进行数据传送时具有方向性和针对性,还提出了基于该协议的路由算法。通过NS2实验仿真分析,该协议在端到端的延时、丢包率、网络吞吐量以及生存期都有所改善。     

一种新型的OFDM系统频率同步方案

提出了一种正交频分复用(OFDM)系统的频率同步方案。该方案包含一个细同步算法和一个粗同步算法。细同步算法是对MOOSE算法的改进,使其频率捕获范围扩大一倍;粗同步算法通过对特殊的长训练序列进行频域相关运算,来估计大范围的频率偏移,它与改进的细同步算法相结合,能够纠正达到半个系统带宽的频偏。仿真表明这是一种准确而可靠的频率同步方案。     

Lee distance,Gray codes,and the torus

The torus is a topology that is the basis for the communication network of several multicomputers in use today. This paper briefly explores several topological characteristics of a generalized torus network using concepts from Coding theory and Graph theory. From Coding theory, the Lee distance metric and Gray codes are extended to mixed radix numbers. Lee distance is used to state the number and length of disjoint paths between two nodes in a torus. In addition, a function mapping a sequence of mixed radix numbers to a mixed radix Gray code sequence is described; and, provided at least one radix is even, this sequence is used to embed in the torus a cycle of any even length, including a Hamiltonian cycle. The torus is defined both as a cross product of cycles and using Lee distance. The graph-theoretic definition of a torus leads to a simple single node broadcasting algorithm, which is described in the last section. This revised version was published online in June 2006 with corrections to the Cover Date.     

Duty cycle allocation to maximize network lifetime of wireless sensor networks with delay constraints

In wireless sensor networks, the routing control overhead could be large because multiple relays are involved in the routing operation. In order to mitigate this problem, a promising solution is to use tier‐based anycast protocols. The main shortcoming of these protocols is that they can consume a much greater amount of energy as compared with other competing protocols using deterministic routing. In this paper, we analyze, in depth, a tier‐based anycast protocol and develop a new technique of improving network lifetime. Our solution is guided by our analytic framework that consists of subtiering and a new forwarding protocol called ‘scheduling controlled anycast protocol’. We formulate the problem for finding an optimal duty cycle for each tier with a delay constraint as a minimax optimization problem and find its solution, which we show is unique. From the analytical results, we find that the network lifetime can be significantly extended by allocating a different duty cycle adaptively for each tier under a delay constraint. Through simulations, we verify that our duty cycle control algorithm enhances the network lifetime by approximately 70% in comparison with an optimal homogeneous duty cycle allocation. Copyright © 2012 John Wiley & Sons, Ltd.     

利用ACE值构造QC-LDPC码

为进一步提升中短码长下准循环低密度奇偶校验(Quasi-cyclic Low-density Parity-check,QC-LDPC) 码的纠错性能,提出了一种综合短环数目和环连通性的QC-LDPC码构造方法。首先,采用Golomb规则构造QC-LDPC码,对基矩阵中的部分元素进行替换预处理,初步降低短环数目;其次,采用所提的利用近似环外信息度（Approximate Cycle Extrinsic message degree,ACE）的消环掩模算法来优化QC-LDPC码,使得掩模后的校验矩阵具有较大的ACE平均值,最终完成QC-LDPC码的构造。该构造方法简单、通用性强,在短环数目和连通性间进行了平衡。与只考虑减少短环数目、增大围长等方法相比,该方法构造的QC-LDPC码有更加优异的纠错性能。     

Selective avoidance of cycles in irregular LDPC code construction

This letter explains the effect of graph connectivity on error-floor performance of low-density parity-check (LDPC) codes under message-passing decoding. A new metric, called extrinsic message degree (EMD), measures cycle connectivity in bipartite graphs of LDPC codes. Using an easily computed estimate of EMD, we propose a Viterbi-like algorithm that selectively avoids small cycle clusters that are isolated from the rest of the graph. This algorithm is different from conventional girth conditioning by emphasizing the connectivity as well as the length of cycles. The algorithm yields codes with error floors that are orders of magnitude below those of random codes with very small degradation in capacity-approaching capability.