Let m and n be integers, 2 ≤ m ≤ n. An m by n array consists of mn cells, arranged in m rows and n columns, and each cell contains exactly one symbol. A transversal of an array consists of m cells, one from each row and no two from the same column. A latin transversal is a transversal in which no symbol appears more than once. We investigte L(m, n), the largest integer such that if each symbol ...

Digital Signal Processors with complex arithmetic capability (DSP-C) are useful for various applications. In this paper, we propose a method for the effective implementation of specific circuits with real coefficients on DSP-C. DSPC has special hardware such as a complex multiplier so that a complex calculation can be performed with only one instruction. First, we show that nodes with two real ...

Linear least squares estimation techniques can be used to enhance suppression of narrowband interference in direct-sequence spread-spectrum systems. Nonlinear techniques for this purpose have also been investigated recently. Here, we derive maximum-llkelihood receivers for direct-sequence Signal in Gaussian interference with known second order characteristics. It is shown that if the receiver u...

1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....

Analog Integrated Circuit Design Techniques for High-Speed Signal Processing in Communications Systems. (December 2006) David HernandezGarduno, B.S., Universidad Iberoamericana Chair of Advisory Committee: Dr. Jose Silva-Martinez This work presents design techniques for the implementation of high-speed analog integrated circuits for wireless and wireline communications systems. Limitations com...

AbstructThis paper presents two classes of adaptive blind algorithms based on secondand higher order statistics. The first class contains fast recursive algorithms whose cost functions involve second and thirdor fourth-order cumulants. These algorithms are stochastic gradient-based but have structures similar to the fast transversal filters (FTF) algorithms. The second class is composed of two ...

1.0 Introduction This paper deals with the convergence of adaptive FIR filters used for multichannel active noise control (ANC) systems [1]. In a recent paper [2], recursive least-squares (RLS) algorithms and fast-transversal-filter (FTF) algorithms were introduced for multichannel ANC. It was reported that these algorithms can greatly improve the convergence speed of ANC systems, compared to a...

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a pre...

In passive sonar, adaptive algorithms can be used to cancel strong sinusoidal self-interferences. In order to correctly recover low-power target signals during the early stages of processing, these adaptive algorithms must provide fast convergence and, at the same time, narrow notches at the frequencies of the sinusoids. In this respect, the gradient adaptive lattice (GAL) algorithm is a very a...