This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded...

Hardware simulation offers the potential of improving execution speed by orders of magnitude over workstationor PC-based simulation. We describe a hardware Gaussian noise generator based on the Wallace method used as a key component in a hardware simulation system. The output of the noise generator accurately models a true Gaussian Probability Density Function (PDF) even at very high σ values. ...

Abstract—We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a codecheckable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two c...

in this article our objective is to obtain steady state characteristics of shunt, series, and separately excited dc motors coupled with a centrifugal water pump supplied through a step-up, step-down, and cuk converter from photovoltaic generator. we assume that there are no storage batteries and, of course, the system must operate on maximum utilization i.e. maximum water must be pumped. it is ...

We present a new probabilistic modelling framework based on the recent notion of normal factor graph (NFG). We show that the proposed NFG models and their transformations unify some existing models such as factor graphs, convolutional factor graphs, and cumulative distribution networks. The two subclasses of the NFG models, namely the constrained and generative models, exhibit a duality in thei...

We present a semantics-based technique for analysing probabilistic properties of imperative programs. This consists in a probabilistic version of classical data flow analysis. We apply this technique to pWhile programs, i.e programs written in a probabilistic version of a simple While language. As a first step we introduce a syntax based definition of a linear operator semantics (LOS) which is ...

We study the complexity of black-box constructions of linearstretch pseudorandom generators starting from a 1-bit stretch oracle generator G. We show that there is no construction which makes nonadaptive queries to G and then just outputs bits of the answers. The result extends to constructions that both work in the non-uniform setting and are only black-box in the primitive G (not the proof of...

The effect of the built-in supersymmetric quantum mechanical language on the spectrum of the (1+1)-Dirac equation, with position-dependent mass (PDM) and complexified Lorentz scalar interactions, is re-emphasized. The signature of the ”quasi-parity” on the Dirac particles’ spectra is also studied. A ”quasi-free” Dirac particle with PDM via an inversely linear plus linear model, a Dirac particle...

The effect of the built-in supersymmetric quantum mechanical language on the spectrum of the (1+1)-Dirac equation, with position-dependent mass (PDM) and complexified Lorentz scalar interactions, is re-emphasized. The signature of the ”quasi-parity” on the Dirac particles’ spectra is also studied. A Dirac particle with PDM and complexified scalar interactions of the form S (z) = S (x− ib) (an i...