Digital communication system

A digital communication system is reported for parallel operation of 16 or more transceiver units with the use of only four interconnecting wires. A remote synchronization circuit produces unit address control words sequentially in data frames of 16 words. Means are provided in each transceiver unit to decode calling signals and to transmit calling and data signals. The transceivers communicate with each other over one data line. The synchronization unit communicates the address control information to the transceiver units over an address line and further provides the timing information over a clock line. A reference voltage level or ground line completes the interconnecting four wire hookup

Synchronization of a WDM Packet-Switched Slotted Ring

In this paper, we present two different strategies of slot synchronization in wavelength-division-multiplexing (WDM) packet-switched slotted-ring networks. Emphasis is given to the architecture behind the WDM Optical Network Demonstrator over Rings (WONDER) project, which is based on tunable transmitters and fixed receivers. The WONDER experimental prototype is currently being developed at the laboratories of Politecnico di Torino. In the former strategy, a slotsynchronization signal is transmitted by the master station on a dedicated control wavelength; in the latter, slave nodes achieve slot synchronization aligning on data packets that are received from the master. The performance of both synchronization strategies, particularly in terms of packet-collision probability, was evaluated by simulation. The technique based on transmitting a timing signal on a dedicated control wavelength achieves better performance, although it is more expensive due to the need for an additional wavelength. However, the technique based on aligning data packets that are received from the master, despite attaining lower timing stability, still deserves further study, particularly if limiting the number of wavelengths and receivers is a major requirement. Some experimental results, which were measured on the WONDER prototype, are also shown. Measurement results, together with theoretical findings, demonstrate the good synchronization performance of the prototype

New Blind Block Synchronization for Transceivers Using Redundant Precoders

This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding (ZP) and cyclic prefix (CP) systems, are considered in this paper. In particular, the block synchronization problem in CP systems is a broader version of timing synchronization problem in the popular orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithms exploit the rank deficiency property of the matrix composed of received blocks when the block synchronization is perfect and use a parameter called repetition index which can be chosen as any positive integer. Theoretical results suggest advantages in blind block synchronization performances when using a large repetition index. Furthermore, unlike previously reported algorithms, which require a large amount of received data, the proposed methods, with properly chosen repetition indices, guarantee correct block synchronization in absence of noise using only two received blocks in ZP systems and three in CP systems. Computer simulations are conducted to evaluate the performances of the proposed algorithms and compare them with previously reported algorithms. Simulation results not only verify the capability of the proposed algorithms to work with limited received data but also show significant improvements in the block synchronization error rate performance of the proposed algorithms over previously reported algorithms

Timing synchronization for cooperative wireless communications

In this work the effect of perfect and imperfect synchronization on the performance of single-link and cooperative communication is investigated. A feedforward non- data-aided near maximum likelihood (NDA-NML) timing estimator which is effective for an additive white Gaussian noise (AWGN) channel and also for a flat-fading channel, is developed. The Cramer Rao bound (CRB) and modified Cramer Rao bound (MCRB) for the estimator for a single-link transmission over an AWGN channel is derived. A closed form expression for the probability distribution of the timing estimator is also derived. The bit-error-rate (BER) degradation of the NDA-NML timing estimator with raised cosine pulse shaping for static timing errors over an AWGN channel is characterized. A closed form expression is derived for the conditional bit error probability (BEP) with static timing errors of binary phase shift keying modulation over a Rayleigh fading channel using rectangular pulse shaping. The NDA-NML timing estimator is applied to a cooperative communication system with a source, a relay and a destination. A CRB for the estimator for asymptotically low signal-to-noise-ratio case is derived. The timing complexity of the NDA-NML estimator is derived and compared with a feedforward correlation based data-aided maximum likelihood (DA-ML) estimator. The BER performance of this system operating with a detect-and-forward relaying is studied, where the symbol timings are estimated independently for each channel. A feedforward data and channel aided maximum likelihood (DCA-ML) symbol timing estimator for cooperative communication operating over flat fading channels is then developed. For more severe fading the DCA-ML estimator performs better than the NDA- NML estimator and the DA-ML estimator. The performance gains of the DCA-ML estimator over that of the DA-ML estimator become more significant in cooperative transmission than in single-link node-to-node transmission. The NDA-NML symbol timing estimator is applied to three-node cooperative communication in fast flat-fading conditions with various signal constellations. It is found that timing errors have significant effect on performance in fast flat-fading channels. The lower complexity NDA-NML estimator performs well for larger signal constellations in fast fading, when compared to DA-ML estimator. The application of cooperative techniques for saving transmit power is discussed along with the related performance analysis with timing synchronization errors. It is found that power allocations at the source and relay nodes for transmissions, and the related timing errors at the relay and the destination nodes, have considerable effect on the BER performance for power constrained cooperative communication. The performance of multi-node multi-relay decode-and-forward cooperative com- munication system, of various architectures, operating under different fading con- ditions, with timing synchronization and various combining methods, is presented. Switch-and-stay combining and switch-and-examine combining are proposed for multi-node cooperative communication. Apart from the proposed two combining methods equal gain combining, maximal ratio combining and selection combining are also used. It is demonstrated that synchronization error has significant effect on performance in cooperative communication with a range of system architectures, and it is also demonstrated that performance degradation due to synchronization error increases with increasing diversity. It is demonstrated that decode-and- forward relaying strategy with timing synchronization, using a very simple coding scheme, performs better than detect-and-forward relaying with timing synchronization. Analytical expressions are derived for BEP with static and dynamic timing synchronization errors over Rayleigh fading channels using rectangular pulse shaping for amplify-and-forward and detect-and-forward cooperative communications. Moment generating function (MGF) based approach is utilized to find the analytical expressions. It is found that timing synchronization errors have an antagonistic effect on the BEP performance of cooperative communication. With the relay intelligence of knowing whether symbols are detected correctly or not, detect- and-forward cooperative communication performs better than the low complexity amplify-and-forward cooperative communication

Synchronization of the CMS Cathode Strip Chambers

The synchronization of the trigger and data acquisition systems for the Cathode Strip Chambers (CSCs) in the Compact Muon Solenoid (CMS) detector at CERN is described. The CSC trigger system is designed to trigger CMS on muons with high efficiency (~99% per chamber) and is able to accurately identify its 25ns proton bunch crossing. To date, asynchronous cosmic ray data have been used to define the protocol and to refine timing algorithms, allowing synchronization to be realized within and between chambers to within ±10 ns. Final synchronization of the CSCs requires timing parameters to be accurate to 2 ns. This goal will be readily achieved from the cosmic ray baseline using data taken with the synchronous beam structure of the Large Hadron Collider

How Similar Are European Business Cycles?

In this paper, we focus on how European economic integration has affected the synchronization and the magnitude of business cycles among participating countries. We measure, based on bandpass filtered data, the characteristics of European business cycles analyzing to what extent they have become more similar over time. We also consider the role of other factors such as differences in fiscal and monetary policy, border effects, and trade intensity. Our main finding is that European business cycles are highly synchronized, although we also find that synchronization was higher during periods with highly flexible exchange rates. In addition we find a positive tradeoff between timing and magnitude such that more synchronization coincides with larger relative magnitude. These results raise concern about the consequences of a common monetary policy within EMU.business cycles; symmetry and co{movement of cycles; magnitude of cycles; economic integration; monetary union

Non-data-aided frequency offset and symbol timing estimation for binary CPM: performance bounds

The use of (spectrally efficient) CPM modulations may lead to a serious performance degradation of the classical non-data-aided (NDA) frequency and timing estimators due to the presence of self noise. The actual performance of these estimators is usually much worse than that predicted by the classical modified Cramer-Rao bound. We apply some well known results in the field of signal processing to these two important problems of synchronization. In particular we propose and explain the meaning of the unconditional CRB in the synchronization task. Simulation results for MSK and GMSK, along with the performance of some classical and previously proposed synchronizers, show that the proposed bound (along with the MCRB) is useful for a better prediction of the ultimate performance of the NDA estimators.Peer ReviewedPostprint (published version