Results 1  10
of
22
Matched spectralnulls codes for partial response channels
 IEEE Trans. Inform. Theory
, 1991
"... AbstractA new family of codes is described that improve the reliability of digital communication over noisy, partialresponse channels. The codes are intended for use on channels where the input alphabet size is limited. These channels arise in the context of digital data recording and certain data ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
AbstractA new family of codes is described that improve the reliability of digital communication over noisy, partialresponse channels. The codes are intended for use on channels where the input alphabet size is limited. These channels arise in the context of digital data recording and certain data transmission applications. The codescalled matchedspectralnull codessatisfy the property that the frequencies at which the code power spectral density vanishes correspond precisely to the frequencies at which the channel transfer function is zero. It is shown that matchedspectralnul1 sequences provide a distance gain on the order of 3 dB and higher for a broad class of partialresponse channels, including many of those of primary interest in practical applications. The embodiment of the matchedspectralnull coded partialresponse system incorporates a slidingblock code and a Viterbi detector based upon a reducedcomplexity trellis structure, both derived from canonical diagrams that characterize spectralnull sequences. The detectors are shown to achieve the same asymptotic average performance as maximumlikelihood sequencedetectors, and the slidingblock codes exclude quasicatastrophic trellis sequences in order to reduce the required path memory length and improve “worstcase ” detector performance. Several examples are described in detail. Index TermsSpectralnull codes, partialresponse channels.
A New Algorithm for Multiplication in Finite Fields
 IEEE Transactions on Computers
, 1989
"... by ..."
Design Of RNS Frequency Sampling Filter Banks
 ICASSP, Session DSP1P
, 1997
"... Frequency sampling filters (FSF) are of interest to the designers of multirate filter banks due to their intrinsic loworder, complexity, and linear phase behavior. Fast FSFs residing in smaller packages will be required to support future highbandwidth, mobile image and signal processing application ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Frequency sampling filters (FSF) are of interest to the designers of multirate filter banks due to their intrinsic loworder, complexity, and linear phase behavior. Fast FSFs residing in smaller packages will be required to support future highbandwidth, mobile image and signal processing applications. Since FSF designs rely on the exact annihilation of selected poleszeros, a new facilitating technology is required which is fast, compact, and numerically exact. Exact FSF polezero annihilation is guaranteed by implementing polynomial filters over an integer ring in the residue arithmetic system (RNS). The design methodology is evaluated as an ASIC. Based on an FPGA technology, at least an 86% complexity reduction can be achieved with even greater advantages gained as a custom VLSI. An RNSbased FSF implementation of an eight channel cochlea filter bank is presented which demonstrates both the performance and packaging advantages of the new FSF paradigm. . 1. INTRODUCTION A classical f...
Some Primality Testing Algorithms
 Notices of the AMS
, 1993
"... We describe the primality testing algorithms in use in some popular computer algebra systems, and give some examples where they break down in practice. 1 Introduction In recent years, fast primality testing algorithms have been a popular subject of research and some of the modern methods are now i ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We describe the primality testing algorithms in use in some popular computer algebra systems, and give some examples where they break down in practice. 1 Introduction In recent years, fast primality testing algorithms have been a popular subject of research and some of the modern methods are now incorporated in computer algebra systems (CAS) as standard. In this review I give some details of the implementations of these algorithms and a number of examples where the algorithms prove inadequate. The algebra systems reviewed are Mathematica, Maple V, Axiom and Pari/GP. The versions we were able to use were Mathematica 2.1 for Sparc, copyright dates 19881992; Maple V Release 2, copyright dates 19811993; Axiom Release 1.2 (version of February 18, 1993); Pari/GP 1.37.3 (Sparc version, dated November 23, 1992). The tests were performed on Sparc workstations. Primality testing is a large and growing area of research. For further reading and comprehensive bibliographies, the interested re...
Fast BlumBlumShub Sequence Generation Using Montgomery Multiplication
 In IEEE Proceedings of Computers and Digital Techniques
, 2000
"... VLSI modules are proposed for fast, e#cient generation of highthroughput BlumBlumShub (BBS) and BBSlike sequences using Montgomery Multiplication, where postprocessing associated with Montgomery's algorithm can be eliminated. 2 1 Introduction Public key cryptosystems ensure secrecy between c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
VLSI modules are proposed for fast, e#cient generation of highthroughput BlumBlumShub (BBS) and BBSlike sequences using Montgomery Multiplication, where postprocessing associated with Montgomery's algorithm can be eliminated. 2 1 Introduction Public key cryptosystems ensure secrecy between communicating parties without the need to distribute secret keys. The most famous public key cryptosystem is that devised by Rivest, Shamir, and Adleman (RSA) [1]. Another lesserknown public key cryptosystem is the Quadratic Residue Cipher (QRC) introduced by Blum, Blum, and Shub [2], which relies on the ease of squaring an integer, mod n, as compared to the intractability of finding the square root of a number, mod n when n is large. As with RSA the valid recipient publishes the prime factors of n, where n = pq and p and q are strong primes. The sender scrambles his message with a bit sequence (BlumBlumShub Sequence, BBS) comprised of the concatenation of the least significant bits of a s...
Multifrequency Phase Unwrapping from Noisy Data: Adaptive Local Maximum Likelihood Approach
"... Abstract. The paper introduces a new approach to absolute phase estimation from frequency diverse wrapped observations. We adopt a discontinuity preserving nonparametric regression technique, where the phase is reconstructed based on a local maximum likelihood criterion. It is shown that this criter ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The paper introduces a new approach to absolute phase estimation from frequency diverse wrapped observations. We adopt a discontinuity preserving nonparametric regression technique, where the phase is reconstructed based on a local maximum likelihood criterion. It is shown that this criterion, applied to the multifrequency data, besides filtering the noise, yields a 2πQperiodic solution, where Q>1 is an integer. The filtering algorithm is based on local polynomial (LPA) approximation for the design of nonlinear filters (estimators) and the adaptation of these filters to the unknown spatially smoothness of the absolute phase. Depending on the value of Q and of the original phase range, we may obtain complete or partial phase unwrapping. In the latter case, we apply the recently introduced robust (in the sense of discontinuity preserving) PUMA unwrapping algorithm [1]. Simulations give evidence that the proposed method yields stateoftheart performance, enabling phase unwrapping in extraordinary difficult situations when all other algorithms fail.
Fast and Precise Computations of Discrete Fourier Transforms using Cyclotomic Integers
 In Proc. ACM Symp. Theory of Comp
, 1997
"... Many applications of fast fourier transforms (FFT's), such as computertomography, geophysical signal processing, high resolution imaging radars, and prediction filters, require high precision output. The usual method of fixed point computation of FFT's of vectors of length 2 ` leads to an average ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Many applications of fast fourier transforms (FFT's), such as computertomography, geophysical signal processing, high resolution imaging radars, and prediction filters, require high precision output. The usual method of fixed point computation of FFT's of vectors of length 2 ` leads to an average loss of `=2 bits of precision. This phenomenon, often referred to as computational noise, causes major problems for arithmetic units with limited precision which are often used for real time applications. Several researchers have noted that calculation of FFT's with algebraic integers avoids computational noise entirely, see, e.g., [3]. We will show that complex numbers can be approximated accurately by cyclotomic integers, and combine this idea with Chinese remaindering strategies in the cyclotomic integers to, roughly, give a O(b 1+ffl L log(L)) algorithm to compute bbit precision FFT's of length L. The first part of the paper will describe the FFT strategy, assuming good approximation...
Frequency Sampling Filters With Algebraic Integers
"... Algebraic integers have been proven beneficial to DFT and nonrecursive FIR filter designs [2, 4] since algebraic integers can be dense in C , resulting in short word width, high speed designs. This paper uses another property of algebraic integers: algebraic integers can produceexact pole zero cance ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Algebraic integers have been proven beneficial to DFT and nonrecursive FIR filter designs [2, 4] since algebraic integers can be dense in C , resulting in short word width, high speed designs. This paper uses another property of algebraic integers: algebraic integers can produceexact pole zero cancellation pairs that are used in recursive FIR, frequency sampling filter designs. 1. INTRODUCTION An element of C is an algebraic integer if it is a zero of a monic polynomial in F [x] where F is one of the fields Z, Z M , or Z p [1, p. 269]. M is taken to be composite and p is assumed to be prime. If R is a commutative ring with unity and p(x) is an irreducible polynomial in R[x] then the quotient ring R[x]=hp(x)i is a field. Therefore, for nonzero N in such a field, N \Gamma1 exists. For frequency sampling filters (FSFs), if p(x) is monic then the ring properties of Z M=hp(x)i are sufficient and used in the remainder of the paper. Now, p(x) will be selected so that algebraic integers c...
UnusualLength NumberTheoretic Transforms Using Recursive Extensions of Rader's Algorithm
, 1995
"... A novel decomposition of NTT blocklengths is proposed using repeated applications of Rader's algorithm to reduce the problem to that of realising a single smalllength NTT. An e#cient implementation of this smalllength NTT is achieved by an initial basis conversion of the data, so that the new basi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A novel decomposition of NTT blocklengths is proposed using repeated applications of Rader's algorithm to reduce the problem to that of realising a single smalllength NTT. An e#cient implementation of this smalllength NTT is achieved by an initial basis conversion of the data, so that the new basis corresponds to the kernel of the smalllength NTT. Multiplication by powers of the kernel become rotations and all arithmetic is e#ciently performed within the new basis. More generally, this extension of Rader's algorithm is suitable for NTT or DFT applications where an e#cient implementation of a particular smalllength NTT/DFT module exists. 1 Introduction The NumberTheoretic Transform (NTT) has been suggested as an alternative to the DFT for computing cyclic convolution [14, 9] and is suitable for inclusion within signal processing, errorcorrection and residue number systems. E#cient architectures are possible for Fermat and Mersenne Transforms [8, 9, 1], where multiplication within ...
Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues
, 707
"... Abstract—This paper focuses on the design of multiplierless decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design of constituent decimation filters in a general multistage decimation architecture. The basic ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—This paper focuses on the design of multiplierless decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design of constituent decimation filters in a general multistage decimation architecture. The basic building blocks embedded in the proposed filters belong, for a simple reason, to the class of cyclotomic polynomials (CPs): the first 104 CPs have a ztransfer function whose coefficients are simply {−1, 0,+1}. On the other hand, the paper provides a bunch of useful techniques, most of which stemming from some key properties of CPs, for designing the proposed filters in a variety of architectures. Both recursive and nonrecursive architectures are discussed by focusing on a specific decimation filter obtained as a result of the optimization algorithm. Design guidelines are provided with the aim to simplify the design of the constituent decimation filters in the multistage chain. Index Terms—A/D converter, CIC, cyclotomic, comb, decimation, decimation filter, multistage, polynomial,