Application of convolutional error correcting codes in ultrawideband M-ary PPM signaling

The interference issues related to ultrawideband (UWB) radio pose tight restrictions on the maximum data rate of UWB radio telecommunication systems. A possible solution is to reduce the required signal to interference ratio (SIR) that gives satisfactory performance to the UWB system. In this letter, we propose coded M-ary UWB radio communication systems. Two classes of convolutional codes, namely, low-rate superorthogonal codes and high-rate punctured codes are considered for this purpose. Simulation results on the bit error rate of the proposed system indicates that the system is capable to work in lower SIR's and therefore supports higher data transmission rates in a real interference environment compared to the previously proposed UWB communication systems.     

From Poldhu to the Italian station of Coltano: Marconi and the first years of transcontinental wireless

This paper presents the evolution of low-frequency, high-power transcontinental transmission, starting from the first successful transatlantic link from Poldhu up to the Italian transcontinental station of Coltano. The trend toward higher and higher transmitting power, and the dead end into which wireless was heading if it were not for research in the higher frequency ranges, are pointed out.     

Reducible rank codes and their applications to cryptography

We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.     

Graph-theoretic construction of low-density parity-check codes

This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.     

A multiwinding modeling method for high frequency transformers and inductors

This paper presents a method to obtain an electric model for transformers and inductors, including both frequency and geometry effects in the windings, which can be linked with existing core models. One-dimensional distributions for magnetic and electric fields are assumed, and from Maxwell's equations an equivalent electric circuit is easily obtained. This equivalent circuit has been included in analog simulators (Spice, AnalogWorkBench, Saber ...), and comparisons between measured and simulated results are shown, both in time domain and in AC sweep, which verify the model accuracy. The model described in this paper allows designers to deal with key issues in the design of high-frequency magnetic components (copper losses, leakage inductance, skin and proximity effects) by using analog simulators, which are usually more familiar to them than finite-element analysis tools.     

On the convergence of the inverses of Toeplitz matrices and its applications

Many issues in signal processing involve the inverses of Toeplitz matrices. One widely used technique is to replace Toeplitz matrices with their associated circulant matrices, based on the well-known fact that Toeplitz matrices asymptotically converge to their associated circulant matrices in the weak sense. This often leads to considerable simplification. However, it is well known that such a weak convergence cannot be strengthened into strong convergence. It is this fact that severely limits the usefulness of the close relation between Toeplitz matrices and circulant matrices. Observing that communication receiver design often needs to seek optimality in regard to a data sequence transmitted within finite duration, we define the finite-term strong convergence regarding two families of matrices. We present a condition under which the inverses of a Toeplitz matrix converges in the strong sense to a circulant matrix for finite-term quadratic forms. This builds a critical link in the application of the convergence theorems for the inverses of Toeplitz matrices since the weak convergence generally finds its usefulness in issues associated with minimum mean squared error and the finite-term strong convergence is useful in issues associated with the maximum-likelihood or maximum a posteriori principles.     

伊朗卡尔黑水利枢纽

伊朗卡尔黑多目标水利枢纽，首台机组于2002年9月投运。介绍了工程历史，并从导流系统遂洪道、渗漏控制和惟幕灌浆等方面介绍了工程的技术要求。