Diversity Analysis of Symbol-by-Symbol Linear Equalizers

In frequency-selective channels linear receivers enjoy significantly-reduced complexity compared with maximum likelihood receivers at the cost of performance degradation which can be in the form of a loss of the inherent frequency diversity order or reduced coding gain. This paper demonstrates that the minimum mean-square error symbol-by-symbol linear equalizer incurs no diversity loss compared to the maximum likelihood receivers. In particular, for a channel with memory $\nu$, it achieves the full diversity order of ($\nu+1$) while the zero-forcing symbol-by-symbol linear equalizer always achieves a diversity order of one

Semiclassical Analysis of the Wigner 12j12j Symbol with One Small Angular Momentum

We derive an asymptotic formula for the Wigner $12j$ symbol, in the limit of one small and 11 large angular momenta. There are two kinds of asymptotic formulas for the $12j$ symbol with one small angular momentum. We present the first kind of formula in this paper. Our derivation relies on the techniques developed in the semiclassical analysis of the Wigner $9j$ symbol [L. Yu and R. G. Littlejohn, Phys. Rev. A 83, 052114 (2011)], where we used a gauge-invariant form of the multicomponent WKB wave-functions to derive asymptotic formulas for the $9j$ symbol with small and large angular momenta. When applying the same technique to the $12j$ symbol in this paper, we find that the spinor is diagonalized in the direction of an intermediate angular momentum. In addition, we find that the geometry of the derived asymptotic formula for the $12j$ symbol is expressed in terms of the vector diagram for a $9j$ symbol. This illustrates a general geometric connection between asymptotic limits of the various $3nj$ symbols. This work contributes the first known asymptotic formula for the $12j$ symbol to the quantum theory of angular momentum, and serves as a basis for finding asymptotic formulas for the Wigner $15j$ symbol with two small angular momenta.Comment: 15 pages, 14 figure

Graphic Symbol Recognition using Graph Based Signature and Bayesian Network Classifier

We present a new approach for recognition of complex graphic symbols in technical documents. Graphic symbol recognition is a well known challenge in the field of document image analysis and is at heart of most graphic recognition systems. Our method uses structural approach for symbol representation and statistical classifier for symbol recognition. In our system we represent symbols by their graph based signatures: a graphic symbol is vectorized and is converted to an attributed relational graph, which is used for computing a feature vector for the symbol. This signature corresponds to geometry and topology of the symbol. We learn a Bayesian network to encode joint probability distribution of symbol signatures and use it in a supervised learning scenario for graphic symbol recognition. We have evaluated our method on synthetically deformed and degraded images of pre-segmented 2D architectural and electronic symbols from GREC databases and have obtained encouraging recognition rates.Comment: 5 pages, 8 figures, Tenth International Conference on Document Analysis and Recognition (ICDAR), IEEE Computer Society, 2009, volume 10, 1325-132

On the capacity of channels with block memory

The capacity of channels with block memory is investigated. It is shown that, when the problem is modeled as a game-theoretic problem, the optimum coding and noise distributions when block memory is permitted are independent from symbol to symbol within a block. Optimal jamming strategies are also independent from symbol to symbol within a block

Maximum Distance Separable Codes for Symbol-Pair Read Channels

We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length \Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters