Theoretical analysis of a MAP based blind frame synchronizer

We have recently proposed in [1] a blind frame synchronization method based on a Maximum A Posteriori (MAP) approach. In this letter, we study the properties of this method and show that this synchronization technique is well suitable for codes having a sparse parity check matrix, such as Low-Density Parity-Check (LDPC) codes. We also find the probability distributions involved in our synchronization criterion and expand the analytical expression of the probability of false synchronization. Through computer simulations we validate our theoretical results and show that this synchronization technique has excellent performance when applied to LDPC codes. We also show that this method outperforms another approach of blind frame synchronization that computes hard values of the syndrome instead of its Log-Likelihood Ratios (LLR).     

Measurement Scheme for One‐Way Delay Variation with Detection and Removal of Clock Skew

One‐way delay variation (OWDV) has become increasingly of interest to researchers as a way to evaluate network state and service quality, especially for real‐time and streaming services such as voice‐over‐Internet‐protocol (VoIP) and video. Many schemes for OWDV measurement require clock synchronization through the global‐positioning system (GPS) or network time protocol. In clock‐synchronized approaches, the accuracy of OWDV measurement depends on the accuracy of the clock synchronization. GPS provides highly accurate clock synchronization. However, the deployment of GPS on legacy network equipment might be slow and costly. This paper proposes a method for measuring OWDV that dispenses with clock synchronization. The clock synchronization problem is mainly caused by clock skew. The proposed approach is based on the measurement of inter‐packet delay and accumulated OWDV. This paper shows the performance of the proposed scheme via simulations and through experiments in a VoIP network. The presented simulation and measurement results indicate that clock skew can be efficiently measured and removed and that OWDV can be measured without requiring clock synchronization.     

PTP技术分析与应用

在通信系统全网IP化的大背景下,分组网络作为统一承载网将面临新的同步需求问题。传统的同步技术精度较低,无法满足新应用对高精度同步的需求。IEEE 1588标准精密时间同步协议(PTP)的提出,成为一种有效解决高精度同步问题的方案。首先分析了PTP技术的同步原理,接着通过综合比较当今几种常用的同步技术的特点得出PTP技术的优势,最后提出了应用方案,并分析了实施过程和部署灵活性。PTP技术可方便灵活地应用于分组网络中,同步精度可达亚微秒级,将成为GPS的有效替代。     

利用LLR提高链路自适应准确性的满分集度网络编码策略

错误传播严重影响无线网络编码系统的分集阶数。针对此问题,本文设计了一种基于对数似然比的链路自适应智能网络编码策略,利用似然比代替背景噪声的统计特征参数,以提高中继的适应准确性。在等效信源-中继-信道虚拟模型下,利用接收信号的似然比计算信道后验条件误比特率,在此基础上换算得到等效接收信噪比,以此为依据对中继功率进行动态调整。通过理论分析证明了本方案能够获得满分集度。仿真结果表明,本方案能有效避免错误传播,保证系统获得满分集阶数,且性能优于现有链路自适应方案。      

Shadow prices for LLR and ALBA

Shadow prices are calculated for least loaded routing (LLR) and aggregated least busy alternative (ALBA) routing in circuit-switched networks for the blocking probability obtained from fixed point algorithms. Numerical results are presented for the calculation of these shadow prices in small networks. As an application of these shadow prices, we also formulate a constrained optimization problem to calculate the sum capacity of LLR and ALBA for a given network. Comparison of the sum capacities indicate that the optimization using shadow prices results in a significant improvement. This provides evidence that matching capacity distribution to traffic is important even when adaptive routing schemes such as LLR and ALBA are used in the network. We also calculate upper bounds on the sum capacity which serve to indicate how well the optimized LLR and ALBA perform. The numerical results also confirm that with a small number of states the capacity of ALBA approaches that of LLR     

Blind frame synchronization for error correcting codes having a sparse parity check matrix

We present in this letter a blind frame synchronization method based on a Maximum A Posteriori probability (MAP) approach. Applied to coded communication systems, this method is based on the calculation of the Log-likelihood Ratios (LLR) of the syndrome obtained according to the parity check matrix of the code. After presenting the proposed method, we compare it to an existing blind synchronization method previously introduced. Simulation results show that the proposed method outperforms the existing one and presents good performance when applied to codes having a sparse parity check matrix such as Low Density Parity Check (LDPC) codes and convolutional codes.     

Mobile positioning using wireless networks: possibilities and fundamental limitations based on available wireless network measurements

Positioning in wireless networks is mainly used for safety, gaming, and commercial services. It is expected to increase in popularity when emergency call services become mandatory as well as with the advent of more advanced location-based services and mobile gaming. In this article, we discuss and illustrate the possibilities and fundamental limitations associated with mobile positioning based on available wireless network measurements. The possibilities include a sensor fusion approach and model-based filtering, while the fundamental limitations provide hard bounds on the accuracy of position estimates, given the information in the measurements in the most favorable situation. The focus of this article is to illustrate the relation between performance requirements, such as those stated by the Federal Communications Commission (FCC), and the available measurements. Specific issues on accuracy limitation in each measurement, such as synchronization and multipath problems, are briefly commented upon. A geometrical example, as well as a realistic example adopted from a cell planning tool, are used for illustration.     

Performance Analysis of SyncML Server System Using Stochastic Petri Nets

Synchronization Markup Language (SyncML) is a specification of a common data synchronization framework for synchronizing data on networked devices. SyncML is designed for use between mobile devices that are intermittently connected to a network and network services that are continuously available on the network. We have designed and developed a data synchronization system based on the SyncML protocol and evaluated the throughput of the system using the stochastic Petri nets package (SPNP) and analyzed the relationship between the arrival rate and the system resources. Using this model, we evaluate various performance measures in different situations, and we estimate the relationship between the arrival rate and the system resources. From the results, we can estimate the optimal amount of resources due to the arrival rate before deploying the developed system.     

Robust Synchronization of Absolute and Difference Clocks Over Networks

We present a detailed re-examination of the problem of inexpensive yet accurate clock synchronization for networked devices. Based on an empirically validated, parsimonious abstraction of the CPU oscillator as a timing source, accessible via the TSC register in popular PC architectures, we build on the key observation that the measurement of time differences, and absolute time, requires separate clocks, both at a conceptual level and practically, with distinct algorithmic, robustness, and accuracy characteristics. Combined with round-trip time based filtering of network delays between the host and the remote time server, we define robust algorithms for the synchronization of the absolute and difference TSCclocks over a network. We demonstrate the effectiveness of the principles, and algorithms using months of real data collected using multiple servers. We give detailed performance results for a full implementation running live and unsupervised under numerous scenarios, which show very high reliability, and accuracy approaching fundamental limits due to host system noise. Our synchronization algorithms are inherently robust to many factors including packet loss, server outages, route changes, and network congestion.     

Performance evaluation of a network synchronization technique forCDMA cellular communications

For code-division multiple-access (CDMA) cellular communications synchronous operation offers significant advantages over asynchronous operation. This feature has been already included in second-generation systems, such as the CdmaOne based on the IS-95 standard. Nonetheless, synchronous operation does not seem to be assessed as a basic system option for third-generation systems. This is mainly due to the contrasted choice of having global positioning system (GPS) receivers located at any of the base transceiver stations (BTSs) to perform station synchronization. However, the existing CdmaOne interface permits time transfer between the various BTSs and a simple time difference measurement technique can provide an internal, network-based means for time synchronization of base stations clocks. This paper considers a previously proposed approach based on the pilot strength measurements message delivered by every mobile station (MS), combined with round trip delay measurements that BTSs perform on the MS transmissions. We consider some possible algorithms to reduce time misalignments, and continuously phase-lock the clocks at different BTSs. Having developed an appropriate analytical/simulation approach, in the environment of a CDMA network, the paper evaluates and compares the performance of two suitable centralized architecture configurations, i.e., master-slave synchronization (MSS) and mutual synchronization (MUS). Both network architectures turn out to be applicable and provide suitable timing performance. Finally, the paper provides a preliminary discussion on some related issues, such as GPS avoidance, synchronization of BTSs inside buildings, tunnels, and subways and hybrid MSS/MUS synchronization network architectures     

Network classless time protocol based on clock offset optimization

Time synchronization is critical in distributed environments. A variety of network protocols, middleware and business applications rely on proper time synchronization across the computational infrastructure and depend on the clock accuracy. The Network Time Protocol (NTP) is the current widely accepted standard for synchronizing clocks over the Internet. NTP uses a hierarchical scheme in order to synchronize the clocks in the network. In this paper we present a novel non-hierarchical peer-to-peer approach for time synchronization termed CTP-Classless Time Protocol. This approach exploits convex optimization theory in order to evaluate the impact of each clock offset on the overall objective function. We define the clock offset problem as an optimization problem and derive its optimal solution. Based on the solution we develop a distributed protocol that can be implemented over a communication network, prove its convergence to the optimal clock offsets and show its properties. For compatibility, CTP may use the packet format and number of measurements used by NTP. We also present methodology and numerical results for evaluating and comparing the accuracy of time synchronization schemes. We show that the CTP outperforms hierarchical schemes such as NTP in the sense of clock accuracy with respect to a universal clock.     

机动定位平台间时间同步系统的误差分析与控制

高精度双向时间同步是分布式机动无源定位系统的一项关键技术。结合机动平台的特点,对基于伪码相位测量的双向时间同步系统的误差来源和影响误差的因素进行了分析,并针对其中一些引起误差的主要因素给出了控制误差的有效方法。仿真和实测表明,最终可以在机动平台间实现0.2 ns左右的时间同步精度。     

Efficient statistical parallel interference cancellation for DS-CDMA in Rayleigh fading channels

We present a reduced-complexity parallel interference cancellation (PIC) technique, in which PIC is performed only on "unreliable" bits (blocks). We term our technique statistical PIC (STPIC), since the decision to employ PIC for any user signal is based upon received signal statistics. Here we propose two different methods: one is bitwise (instantaneous) STPIC (ISTPIC), in which IC is performed only on the bits whose absolute log likelihood ratio (LLR) is below a pre-selected threshold; the other method is block STPIC (BSTPIC), in which IC is performed only on the blocks whose average signal-to-noise-plus-interference ratio (SNIR) is below a pre-selected threshold. Both LLR and SNIR statistics reduce to quantities simple to obtain. We show that STPIC can achieve performance equivalent to conventional full PIC (FPIC) and other partial PIC techniques in flat Rayleigh fading channels, but with reduced computational complexity. We also show our proposed ISTPIC can achieve performance better than FPIC in good channel conditions (e.g., AWGN), still with reduced computational complexity. The ISTPIC performance gain over conventional FPIC is larger in conditions of larger loading factor where efficient IC techniques are more likely to be needed     

SDH网的同步层功能

本文从原子结构的角度,对ＳＤＨ网的两个同步层;网络同步层和同步分配层功能进行定义,同时也对与之相关的传送层的部分功能进行定义。     

一种基于多天线簇的新型LTE室内定位系统

随着移动互联网业务的迅速发展,位置服务需求越来越多样化,定位技术也变得越来越重要.LTE(long term evolution)室内蜂窝网络可以解决GPS(global positioning system)信号无法进入室内的问题,从而提供高精度的位置服务.LTE室内定位需要不同基站之间进行精确同步,这给室内网络部署带来了新的挑战.针对上述问题,提出了一种基于多天线簇的LTE新型无线定位系统,通过上行探测参考信号(sounding referencesignal,SRS)获取信号到达时间差(time difference of arrival,TDOA).该方法不需要簇间同步,可有效降低网络部署难度.其次,针对此系统设计了一种新的TDOA定位算法,可支持灵活的天线簇配置.最后,通过仿真及实验验证了该定位系统及算法的有效性,实验结果表明可实现米级室内定位精度.     

Media Synchronization and QoS Packet Scheduling Algorithms for Wireless Systems

Wireless multimedia synchronization is concerned with distributed multimedia packets such as video, audio, text and graphics being played-out onto the mobile clients via a base station (BS) that services the mobile client with the multimedia packets. Our focus is on improving the Quality of Service (QoS) of the mobile client's on-time-arrival of distributed multimedia packets through network multimedia synchronization. We describe a media synchronization scheme for wireless networks, and we investigate the multimedia packet scheduling algorithms at the base station to accomplish our goal. In this paper, we extend the media synchronization algorithm by investigating four packet scheduling algorithms: First-In-First-Out (FIFO), Highest-Priority-First (PQ), Weighted Fair-Queuing (WFQ) and Round-Robin (RR). We analyze the effect of the four packet scheduling algorithms in terms of multimedia packet delivery time and the delay between concurrent multimedia data streams. We show that the play-out of multimedia units on the mobile clients by the base station plays an important role in enhancing the mobile client's quality of service in terms of intra-stream synchronization and inter-stream synchronization. Our results show that the Round-Robin (RR) packet scheduling algorithm is, by far, the best of the four packet scheduling algorithms in terms of mobile client buffer usage. We analyze the four packet scheduling algorithms and make a correlation between play-out of multimedia packets, by the base station, onto the mobile clients and wireless network multimedia synchronization. We clarify the meaning of buffer usage, buffer overflow, buffer underflow, message complexity and multimedia packet delay in terms of synchronization between distributed multimedia servers, base stations and mobile clients.     

发展我国数字数据网的总体技术设想

数字数据网(DDN)是基于光纤数字电路,通过引入复用、交叉连接节点构成的,主要为满足非话音业务需要的传输网络。利用日益发展的数字电路,采用DDN技术,是目前满足那些要求传输时延短、通过量大的数据业务的一种较好的办法。本文扼要地介绍了发展我国DDN的总体技术设想,包括网络结构、网络业务、网络同步和网络管理控制。     

基于频偏估计的无线传感器网络时间同步算法

针对无线传感器网络经典同步算法稳定性较差,时钟相偏和频偏联合校正算法存在高开销等问题,提出一种基于频偏估计的无线传感器网络时间同步算法（CSMS算法）。CSMS算法采用低开销相偏和频偏估计方法,提高了成对节点的同步精度和稳定性;结合分层和广播监听构建了同步策略,能够保证算法的稳定性和同步精度,实现了与邻居节点及根节点的同步,同时优化了同步总开销。实验结果表明,CSMS算法能够有效地平衡同步能耗、同步精度及同步稳定性。     

Research on nanosecond time synchronization technology for 5G base station based on GNSS neighborhood similarity

For precision positioning requirements in the LTE-A/5G service developed by the 3GPP,the nanosecond precision time synchronization technology based on global navigation satellite system (GNSS) for 5G base station was studied which broke through the current GNSS receiver’s hundred nanosecond timing accuracy.By analyzing the characteristics of neighborhood similarity of GNSS errors and combining the characteristics of time synchronization requirements of 5G base stations,a nanosecond precision time synchronization theory and related receiver algorithms for 5G base stations was proposed which based on the principle of neighborhood similarity of GNSS signals.The specific characteristics of the time synchronization technology under regional and wide-area conditions were studied.The simulation and experimental results show that compared with the current time synchronization accuracy within hundred nanosecond rang of base stations,the proposed method can achieve precision time synchronization within 3 ns between the regional base stations,and support 5G base station meter-level precision location based service(LBS) and other advanced incremental services.     

无线自组网同步实现方案的研究

无线自组网是一种无中心、全分布式的无线分组网络。同所有的分布式系统一样,网络各节点的时钟同步是Ad Hoc网络技术研究中的一个重要问题。本文针对在Ad Hoc网络中实现高精度的时钟同步提出了解决方案,将PTP协议（Precise Time Protocol）引入到Ad Hoc网络中,并在FPGA开发板上加以验证。在本文的设计中使用了软件和硬件相结合的实现方案,充分利用了软件的灵活性和硬件的快速性等特点,实现了PTP节点应有的功能,并且通过硬件获取时间戳使同步精度大大提高。