7,877 research outputs found

    One- and two-level filter-bank convolvers

    Get PDF
    In a recent paper, it was shown in detail that in the case of orthonormal and biorthogonal filter banks we can convolve two signals by directly convolving the subband signals and combining the results. In this paper, we further generalize the result. We also derive the statistical coding gain for the generalized subband convolver. As an application, we derive a novel low sensitivity structure for FIR filters from the convolution theorem. We define and derive a deterministic coding gain of the subband convolver over direct convolution for a fixed wordlength implementation. This gain serves as a figure of merit for the low sensitivity structure. Several numerical examples are included to demonstrate the usefulness of these ideas. By using the generalized polyphase representation, we show that the subband convolvers, linear periodically time varying systems, and digital block filtering can be viewed in a unified manner. Furthermore, the scheme called IFIR filtering is shown to be a special case of the convolver

    Factorability of lossless time-varying filters and filter banks

    Get PDF
    We study the factorability of linear time-varying (LTV) lossless filters and filter banks. We give a complete characterization of all, degree-one lossless LTV systems and show that all degree-one lossless systems can be decomposed into a time-dependent unitary matrix followed by a lossless dyadic-based LTV system. The lossless dyadic-based system has several properties that make it useful in the factorization of lossless LTV systems. The traditional lapped orthogonal transform (LOT) is also generalized to the LTV case. We identify two classes of TVLOTs, namely, the invertible inverse lossless (IIL) and noninvertible inverse lossless (NIL) TVLOTs. The minimum number of delays required to implement a TVLOT is shown to be a nondecreasing function of time, and it is a constant if and only if the TVLOT is IIL. We also show that all IIL TVLOTs can be factorized uniquely into the proposed degree-one lossless building block. The factorization is minimal in terms of the delay elements. For NIL TVLOTs, there are factorable and unfactorable examples. Both necessary and sufficient conditions for the factorability of lossless LTV systems are given. We also introduce the concept of strong eternal reachability (SER) and strong eternal observability (SEO) of LTV systems. The SER and SEO of an implementation of LTV systems imply the minimality of the structure. Using these concepts, we are able to show that the cascade structure for a factorable IIL LTV system is minimal. That implies that if a IIL LTV system is factorable in terms of the lossless dyadic-based building blocks, the factorization is minimal in terms of delays as well as the number of building blocks. We also prove the BIBO stability of the LTV normalized IIR lattice

    Embedded minimal surfaces

    Full text link
    The study of embedded minimal surfaces in \RR^3 is a classical problem, dating to the mid 1700's, and many people have made key contributions. We will survey a few recent advances, focusing on joint work with Tobias H. Colding of MIT and Courant, and taking the opportunity to focus on results that have not been highlighted elsewhere.Comment: To appear in proceedings of Madrid ICM200

    New results on multidimensional Chinese remainder theorem

    Get PDF
    The Chinese remainder theorem (CRT) [McClellan and Rader 1979] has been well known for applications in fast DFT computations and computer arithmetic. Guessoum and Mersereau [1986] first made headway in extending the CRT to multidimensional (MD) nonseparable systems and showing its usefulness. The present letter generalize the result and present a more general form. This more general MDCRT is an exact counterpart of 1DCRT

    A new orthogonalization procedure with an extremal property

    Get PDF
    Various methods of constructing an orthonomal set out of a given set of linearly independent vectors are discussed. Particular attention is paid to the Gram-Schmidt and the Schweinler-Wigner orthogonalization procedures. A new orthogonalization procedure which, like the Schweinler- Wigner procedure, is democratic and is endowed with an extremal property is suggested.Comment: 7 pages, latex, no figures, To appear in J. Phys

    The Effect of Magnetic Variability on Stellar Angular Momentum Loss II: The Sun, 61 Cygni A, ϵ\epsilon Eridani, ξ\xi Bootis A and τ\tau Bootis A

    Get PDF
    The magnetic fields of low-mass stars are observed to be variable on decadal timescales, ranging in behaviour from cyclic to stochastic. The changing strength and geometry of the magnetic field should modify the efficiency of angular momentum loss by stellar winds, but this has not been well quantified. In Finley et al. (2018) we investigated the variability of the Sun, and calculated the time-varying angular momentum loss rate in the solar wind. In this work, we focus on four low-mass stars that have all had their surface magnetic fields mapped for multiple epochs. Using mass loss rates determined from astrospheric Lyman-α\alpha absorption, in conjunction with scaling relations from the MHD simulations of Finley & Matt (2018), we calculate the torque applied to each star by their magnetised stellar winds. The variability of the braking torque can be significant. For example, the largest torque for ϵ\epsilon Eri is twice its decadal averaged value. This variation is comparable to that observed in the solar wind, when sparsely sampled. On average, the torques in our sample range from 0.5-1.5 times their average value. We compare these results to the torques of Matt et al. (2015), which use observed stellar rotation rates to infer the long-time averaged torque on stars. We find that our stellar wind torques are systematically lower than the long-time average values, by a factor of ~3-30. Stellar wind variability appears unable to resolve this discrepancy, implying that there remain some problems with observed wind parameters, stellar wind models, or the long-term evolution models, which have yet to be understood.Comment: 15 pages + 8 figures, accepted for publication to Ap

    Spacetime Defects: von K\'arm\'an vortex street like configurations

    Get PDF
    A special arrangement of spinning strings with dislocations similar to a von K\'arm\'an vortex street is studied. We numerically solve the geodesic equations for the special case of a test particle moving along twoinfinite rows of pure dislocations and also discuss the case of pure spinning defects.Comment: 9 pages, 2figures, CQG in pres

    Discrete multitone modulation with principal component filter banks

    Get PDF
    Discrete multitone (DMT) modulation is an attractive method for communication over a nonflat channel with possibly colored noise. The uniform discrete Fourier transform (DFT) filter bank and cosine modulated filter bank have in the past been used in this system because of low complexity. We show in this paper that principal component filter banks (PCFB) which are known to be optimal for data compression and denoising applications, are also optimal for a number of criteria in DMT modulation communication. For example, the PCFB of the effective channel noise power spectrum (noise psd weighted by the inverse of the channel gain) is optimal for DMT modulation in the sense of maximizing bit rate for fixed power and error probabilities. We also establish an optimality property of the PCFB when scalar prefilters and postfilters are used around the channel. The difference between the PCFB and a traditional filter bank such as the brickwall filter bank or DFT filter bank is significant for effective power spectra which depart considerably from monotonicity. The twisted pair channel with its bridged taps, next and fext noises, and AM interference, therefore appears to be a good candidate for the application of a PCFB. This is demonstrated with the help of numerical results for the case of the ADSL channel
    corecore