Recent studies show that equalizers with different equalization delays achieve different performances. The best performed equalizer is not necessarily the one with 0-delay, and often not the case when the channel is non-minimum-phase. In this paper, a blind channel equalization algorithm is presented, by which equalizers with all possible equalization delays can be calculated simultaneously fro...

In this contribution, we address the comparison of Subspace (SS), Linear Prediction (LP) and Constant Modulus (CM) identi caton/equalization algorithms in terms of robustness to loss of Fractionally-Spaced channel disparity. We show that SS procedure leads to an inconsistent channel estimation. Investigating a left-inverse channel estimation, we show that LP results in the estimation of the so-...

In 2009, Heninger and Shacham presented an algorithm using the Hensel's lemma for reconstructing the prime factors of the modulus N = r1r2. This algorithm computes the prime factors of N in polynomial time, with high probability, assuming that a fraction greater than or equal to 59% random bits of its primes r1 and r2 is given. In this paper, we present the analysis of Hensel's lemma for a mult...

A MASH digital delta–sigma modulator (DDSM) is analyzed mathematically. It incorporates first-order error feedback modulators (EFM) which include prime modulus quantizers to guarantee a minimum sequence length . The purpose of this analysis is to calculate the exact sequence length of the aforementioned MASH DDSM. We show that the sequence length for an th-order member of this modulator family ...

We propose a simple class of nonrenormalizable models of gauge mediated dynamical supersymmetry breaking. The models do not have gauge singlet fields. The Standard Model gauge group is embedded in the global symmetry of the SUSY breaking sector. At the renormalizable level the models possess a set of classical flat directions. Only one of those flat directions is unlifted by quantum effects, an...

We discuss prospects for stabilizing the volume modulus of N = 1 supersymmetric type IIB orientifold compactifications using only perturbative corrections to the Kähler potential. Concretely, we consider the known string loop corrections and tree-level α corrections. They break the no-scale structure of the potential, which otherwise prohibits stabilizing the volume modulus. We argue that when ...

be an integral function, A,, being a strictly increasing sequence of nonnegative integers. We shall use the notations M (r) =max f (z) , m(r)=min if (z) 1, Izl=r IzI=r μ (r) = max j an rn, n = 0, 1, 2, . . . describing M (r) as the maximum modulus, m (r) as the minimum modulus and μ (r) as the maximum term of f (z) . The present paper is a development of a remark by Pólya (Math . Zeit., 29 (192...

the aim of this study was to explore the minimum amount of urea formaldehyde (uf) resin content and optimum particleboard density while maintaining boards’ quality to reduce production costs. board density at three levels (520, 620 and 720 kg m-3) and resin content (6, 7 and 8%) were variable parameters. stepwise multivariate linear regression models were used to evaluate the influence of board...

The constant modulus algorithm (CMA) is an e ective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, e ects of noise and channel conditions are investigated. For the class of channels with arbitary nite impulse responses, an analytical description of locations of constant modulus receivers and an upper bound of their mean squared errors (MSE) are der...

The set S(g, n) of all stochastic matrices of order n whose directed graph has girth g is considered. For any g and n, a lower bound is provided on the modulus of a subdominant eigenvalue of such a matrix in terms of g and n, and for the cases g = 1, 2, 3 the minimum possible modulus of a subdominant eigenvalue for a matrix in S(g, n) is computed. A class of examples for the case g = 4 is inves...