Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Volume 30 Issue 2 • March 1984

Filter Results

Displaying Results 1 - 25 of 50
  • Guest Editorial by Odile M. Macchi, Member IEEE

    Publication Year: 1984, Page(s):131 - 133
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (348 KB)
    Freely Available from IEEE
  • The2rth mean convergence of adaptive filters with stationary dependent random variables

    Publication Year: 1984, Page(s):134 - 140
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The2rth mean convergence of an adaptive filtering algorithmC_{n+ 1} = C_{n} - a_{n}(C_{n}^{T} X_{n} - \alpha_{n}) X_{n}is studied, where\alpha_{n}'s andX_{n}'s are useful random signals and observation vectors, respectively, and\{ a_{n} \}is a sequence of positive numbers decreasing to zero. In this work, we suppose that the sequence\{(\a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of a Kushner and Clark lemma to general classes of stochastic algorithms

    Publication Year: 1984, Page(s):140 - 151
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1483 KB)

    Two general classes of stochastic algorithms are considered, including algorithms considered by Ljung as well as algorithms of the form<tex>\theta_{n+1} = \theta_{n} - \gamma_{n+1} V_{n+1}(\theta_{n}, Z)</tex>, where<tex>Z</tex>is a stationary ergodic process. It is shown how one can apply a lemma of Kushner and Clark to obtain properties of these algorithms. This is done b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of stochastic gradient algorithms for linear regression problems

    Publication Year: 1984, Page(s):151 - 160
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1303 KB)

    Parameter estimation problems that can be formulated as linear regressions are quite common in many applications. Recursive (on-line, sequential) estimation of such parameters can be performed using the recursive least squares (RLS) algorithm or a stochastic gradient version of this algorithm. In this paper the convergence properties of the gradient algorithm are analyzed under the assumption that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence analysis of self-adaptive equalizers

    Publication Year: 1984, Page(s):161 - 176
    Cited by:  Papers (119)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2479 KB)

    A theoretical analysis of self-adaptive equalization for data-transmission is carried out starting from known convergence results for the corresponding trained adaptive filter. The development relies on a suitable ergodicity model for the sequence of observations at the output of the transmission channel. Thanks to the boundedness of the decision function used for data recovery, it can be proved t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weak convergence and asymptotic properties of adaptive filters with constant gains

    Publication Year: 1984, Page(s):177 - 182
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (705 KB)

    The basic adaptive filtering algorithm<tex>X_{n+1}^{\epsilon} = X_{n}^{\epsilon} - \epsilon Y_{n}(Y_{n}^{'}X_{n}^{\epsilon} - \psi_{n})</tex>is analyzed using the theory of weak convergence. Apart from some very special cases, the analysis is hard when done for each fixed<tex>\epsilon &gt; 0</tex>. But the weak convergence techniques are set up to provide much informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Persistence of excitation conditions and the convergence of adaptive schemes

    Publication Year: 1984, Page(s):183 - 191
    Cited by:  Papers (75)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1675 KB)

    In the study of the behavior of adaptive filtering algorithms, persistence of excitation of the input process arises as a sufficient condition for convergence and, perhaps more importantly, for convergence rate of the parameter estimates. In this paper the underlying nature of the persistence requirement is presented and discussed, relating its normal specification in terms of moment conditions wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive filtering with binary reinforcement

    Publication Year: 1984, Page(s):191 - 199
    Cited by:  Papers (110)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1521 KB)

    Recently there has been increased interest in high speed adaptive filtering where the usual stochastic gradient or least mean-square (LMS) algorithm is replaced with the simpler algorithm where adaptation is guided only by the polarity of the error signal. In this paper the convergence of this binary reinforcement (BR) algorithm is proved under the usual independence assumption, and the surprising... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filter-order selection in adaptive maximum likelihood estimation

    Publication Year: 1984, Page(s):199 - 210
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1678 KB)

    The choice of the number of parameters is an important problem in adaptive filtering. In the general ground of maximum likelihood (ML) parameter estimation, Aka├»ke criterion has proved to be a very useful tool. Significant results and the importance of the Kullback information measure as the implicit measure of distance associated with ML estimation are discussed. Application of these results to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the statistical efficiency of the LMS algorithm with nonstationary inputs

    Publication Year: 1984, Page(s):211 - 221
    Cited by:  Papers (118)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    A fundamental relationship exists between the quality of an adaptive solution and the amount of data used in obtaining it. Quality is defined here in terms of "misadjustment," the ratio of the excess mean square error (mse) in an adaptive solution to the minimum possible mse. The higher the misadjustment, the lower the quality is. The quality of the exact least squares solution is compared with th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least-squares adaptive lattice and transversal filters: A unified geometric theory

    Publication Year: 1984, Page(s):222 - 236
    Cited by:  Papers (93)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2182 KB)

    A unified theory is presented to characterize least-squares adaptive filters, in either lattice or transversal-filter form, for nonstationary processes. The derivations are based upon a geometric formulation of least-squares estimation and on the concept of displacement rank. A few basic geometric relations are shown to underlie the various algorithms. Insights into the fundamental concepts that u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive IIR filtering: Current results and open issues

    Publication Year: 1984, Page(s):237 - 250
    Cited by:  Papers (185)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2320 KB)

    A tutorial-style framework is presented for understanding the current status of adaptive infinite-impulse-response (IIR) filters. The paper begins with a detailed discussion of the difference equation models that are useful as adaptive IIR filters. The particular form of the resulting prediction error generic to adaptive IIR filters is highlighted and the structures of provable convergent adaptive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feedback system approach to adaptive filtering

    Publication Year: 1984, Page(s):251 - 262
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1771 KB)

    A survey of a design approach through an equivalent feedback representation (EFR) is presented for adaptive filters. Several results for stability analysis in a deterministic environment and for convergence analysis in a stochastic environment are discussed. These results can be straightforwardly applied to various adaptive filters configurations. Current trends in using EFR for designing adaptive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive linear procedures under general conditions

    Publication Year: 1984, Page(s):262 - 267
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (703 KB)

    Under mild conditions on the observation processes the almost sure convergence properties of linear stochastic approximation are summarized for least squares and for some of its applications: adaptive filtering, echo cancellation, detection of binary data in Gaussian noise, identification, and linear classification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of bias on the linear canceller

    Publication Year: 1984, Page(s):268 - 274
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (859 KB)

    The linear canceller has been shown to be effective in mitigating intersymbol interference in the presence of slope distortion. However, even moderate amounts of bias can affect the stability and performance of the canceller. We infer the eigenvalues associated with the autocorrelation matrix of the jointly adaptive infinitely long linear canceller structure with the aid of a theorem on asymptotic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The least mean fourth (LMF) adaptive algorithm and its family

    Publication Year: 1984, Page(s):275 - 283
    Cited by:  Papers (321)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1291 KB)

    New steepest descent algorithms for adaptive filtering and have been devised which allow error minimization in the mean fourth and mean sixth, etc., sense. During adaptation, the weights undergo exponential relaxation toward their optimal solutions. Time constants have been derived, and surprisingly they turn out to be proportional to the time constants that would have been obtained if the steepes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and performance evaluation of an adaptive notch filter

    Publication Year: 1984, Page(s):283 - 295
    Cited by:  Papers (57)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1880 KB)

    An adaptive notch filter is derived by using a general prediction error framework. The proposed infinite impulse response filler has a special structure that guarantees the desired transfer characteristics. The filter coefficients are updated by a version of the recursive maximum likelihood algorithm. The convergence properties of the algorithm and its asymptotic behavior are discussed, and its pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified product codes

    Publication Year: 1984, Page(s):299 - 306
    Cited by:  Papers (17)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1145 KB)

    By modifying product codes, a new coding scheme and its decoding method are proposed. Compared to a product code<tex>A</tex>, the first stage code<tex>A_{1}</tex>of the new code<tex>A_{M}</tex>is constructed in the same way as that of the code<tex>A</tex>except that it has at least one subcode, while the second stage codes<tex>A_{2}^{(j)}</t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of enumerative and adaptive codes

    Publication Year: 1984, Page(s):306 - 315
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1651 KB)

    The problem of noiselessly encoding a message when prior statistics are known is considered. The close relationship of arithmetic and enumerative coding for this problem is shown by computing explicit arithmetic coding probabilities for various enumerative coding examples. This enables a comparison to be made of the coding efficiency of Markov models and enumerative codes as well as a new coding s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Wiener- Kolmogorov theory

    Publication Year: 1984, Page(s):316 - 327
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2089 KB)

    A minimax formulation is considered for the problem of designing robust linear causal estimators of linear functions of discrete-time wide-sense stationary signals when knowledge of the signal and/or noise spectra is inexact. The solution is given (under mild regularity conditions) in terms of a least favorable pair of spectra, thus reducing the minimax problem to a direct maximization problem whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On minimax robustness: A general approach and applications

    Publication Year: 1984, Page(s):328 - 340
    Cited by:  Papers (127)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2261 KB)

    The minimax approach to the design of systems that are robust with respect to modeling uncertainties is studied using a game theoretic formulation in which the performance functional and the sets of modeling uncertainties and admissible design policies are arbitrary. The existence and characterization of minimax robust solutions that form saddle points are discussed through various methods that ta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two results on the asymptotic performance of quantizers

    Publication Year: 1984, Page(s):341 - 348
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1009 KB)

    A necessary and sufficient condition is presented for the normalized asymptotic<tex>r</tex>th power distortion of a mismatched multidimensional quantizer to converge to a certain optimum constant known as Bennett's integral. The dimensionality of our results is allowed to approach infinity in order to make some universal source coding comparisons to quantization theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-rate encoding of individual sequences with side information

    Publication Year: 1984, Page(s):348 - 352
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    For every infinite sequence<tex>x</tex>and a given side-information sequence<tex>y</tex>, we define a quality<tex>H(x|y)</tex>called the finite-state conditional complexity of<tex>x</tex>given<tex>y</tex>. It is shown that<tex>H(x|y)</tex>is the smallest asymptotically attainable fixed-rate at which<tex>x</tex>can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular curves and codes with a polynomial construction

    Publication Year: 1984, Page(s):353 - 355
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB)

    In this paper we study<tex>q</tex>-ary codes arising from modular curves<tex>X_{0}(11l)</tex>over GF<tex>(p^{2})</tex>and some binary codes attached to them. All these codes have a polynomial construction and have "good" asymptotic parameters: for certain values of the parameters the<tex>q</tex>-ary codes with<tex>q = p^{2} \geq 49</tex>a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packings ofR^nby certain error spheres

    Publication Year: 1984, Page(s):356 - 363
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    Golomb in 1969 defined error metrics for codes and their corresponding "error spheres." Among the error spheres are the cross and semicross. The cross is defined as follows. Letkandnbe positive integers. The(k, n)-cross in Euclideann-spaceR^{n}consists of2kn + 1unit cubes: a central cube together with2narms of length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu