IEEE Transactions on Information Theory

Volume 17 Issue 3 • May 1971

Filter Results

Displaying Results 1 - 25 of 29
  • Bounds on subjective performance measures for source encoding systems

    Publication Year: 1971, Page(s):224 - 231
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1305 KB)

    Quantizing noise is present whenever analog information is encoded into digital form suitable as an input to any digital system such as a computer or digital transmission line. The subjective impairment caused by this noise is frequently measured by the ratio of signal power to frequency-weighted quantizing noise power<tex>S/N_Y</tex>. An upper bound on<tex>S/N_Y</tex>is fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An alternative approach to the linear causal least-square filtering theory

    Publication Year: 1971, Page(s):232 - 240
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1253 KB)

    We present in this paper an alternative approach to the discrete-and-continuous-time, linear, causal, least-square filtering of wide-sense stationary random processes. Various new and simplified solutions for the optimum filter and the minimum-mean-square error (MMSE) are given in a unified manner by using Hilbert-space techniques. Particular emphasis is placed on the closed-form solution obtained... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of quantum estimation theory to analog communication over quantum channels

    Publication Year: 1971, Page(s):240 - 246
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Recent inquiries into optical communication have raised questions as to the validity of classical detection and estimation theory for weak light fields. Helstrom [1] proposed that the axioms of quantum mechanics be incorporated into a quantum approach to optical estimation and detection. In this paper, we discuss two important results, the quantum equivalent of the minimum-mean-square-error (MMSE)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal design for fast-fading Gaussian channels

    Publication Year: 1971, Page(s):247 - 256
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1050 KB)

    The design of signals for digital communication over fast-fading Gaussian channels is considered; the emphasis is on nonorthogonal signaling schemes. A discrete channel model is used. Necessary and sufficient conditions on the transmitted signals are found that make the Bayes receiver independent of the channel parameters. By using a geometric interpretation of the resultant receiver a heuristic d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal multiplexing of sampled signals on noisy channels

    Publication Year: 1971, Page(s):257 - 262
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (778 KB)

    This paper deals with the joint optimization of transmitting and receiving filters in multiplex transmission of pulse-amplitude-modulated (PAM) signals. A mean-square-error criterion is used. The signal processes are assumed to be mutually uncorrelated and with equal power spectral densities. Transfer matrix functions for the transmitting and for the receiving filters are used as an expedient tool... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized inverse approach to clustering, feature selecting, and classification

    Publication Year: 1971, Page(s):262 - 269
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (807 KB)

    This paper gives a unified approach to designing a data analyzer that performs cluster-seeking, feature selection, and categorizer design under a weighted least-square performance criterion. The cost of misrecognitions is preserved throughout the process, It can be used as a fast procedure to evaluate the discriminatory capability of sensors and/or preprocessors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Repetitive signaling using a noisy feedback channel

    Publication Year: 1971, Page(s):269 - 278
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1117 KB)

    Several feedback coding schemes considered recently are repetitive signaling schemes. The sender retransmits the message, if necessary, on the basis of information received over the feedback channel. This paper considers a repetitive signaling scheme in which the user's estimate of the transmitted message is sent over the feedback channel to the sender with high energy if the user is uncertain of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential signalling under a peak power constraint

    Publication Year: 1971, Page(s):278 - 282
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (726 KB)

    The error exponent for sequential signaling over the additive-Gaussian-white-noise channel subject to a peak power constraint is derived. This exponent is maximum under the assumption that information is transmitted in blocks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback

    Publication Year: 1971, Page(s):283 - 287
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    A class of simple feedback strategies is developed. The fixed-length codewords can be described by an interesting sequence of trees. The decoder scans the received block in the reverse direction, starting at the most recent bit. As this scan progresses, a certain pair of characteristic bit patterns are replaced by the digits 0 or 1, respectively. For certain values of the information rate<tex&g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of binary sequences with controllable complexity

    Publication Year: 1971, Page(s):288 - 296
    Cited by:  Papers (40)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (986 KB)

    Complexity of a binary sequence is measured by the amount of the sequence required to define the remainder. It is shown that, while maximum length<tex>(L = 2^r - 1)</tex>sequences from<tex>r</tex>-stage linear logic feedback generators have minimum complexity, it is a simple matter to use such sequences as bases for deriving other more complex sequences of the same length. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and synthesis of polynomials and sequences over<tex>GF(2)</tex>

    Publication Year: 1971, Page(s):297 - 303
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    The analysis and synthesis of polynomials and sequences over<tex>GF(2)</tex>has received considerable attention in recent years with the increasing use of PN sequences. In this paper a new approach to the problem is presented in which the polynomial coefficients and the sequence digits are derived in terms of the values assumed by a special class of polynomials, called "cyclonomials," ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes based on inaccurate source probabilities

    Publication Year: 1971, Page(s):304 - 314
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1656 KB)

    Information theory obtains efficient codes by encoding messages in large blocks. The code design requires block probabilities that are often hard to measure accurately. This paper studies the effect of inaccuracies in the block probabilities and gives coding procedures that anticipate some of the worst errors. For an efficient code, the mean number<tex>d</tex>of digits per letter must ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group codes for phase- and amplitude-modulated signals on a Gaussian channel

    Publication Year: 1971, Page(s):315 - 321
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (874 KB)

    A group code is a set of vectors, generated by a group of orthogonal matrices transforming a starting vector. Ingemarsson [5] has shown that, if the group is commutative, the code is equivalent to a set of phase-modulated signals. Codes generated by noncommutative groups have been described by Slepian [9]. In this paper another class of codes generated by noncommutative groups is described. This c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On majority-logic decoding for duals of primitive polynomial codes

    Publication Year: 1971, Page(s):322 - 331
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1106 KB)

    The class of polynomial codes introduced by Kasami et al. has considerable inherent algebraic and geometric structure. It has been shown that this class of codes and their dual codes contain many important classes of cyclic codes as subclasses, such as BCH codes, Reed-Solomon codes, generalized Reed-Muller codes, projective geometry codes, and Euclidean geometry codes. The purpose of this paper is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On majority-logic decoding of finite geometry codes

    Publication Year: 1971, Page(s):332 - 336
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB)

    In this paper, an improved decoding algorithm for codes that are constructed from finite geometries is introduced. The application of this decoding algorithm to Euclidean geometry (EG) and projective geometry (PG) codes is further discussed. It is shown that these codes can be orthogonalized in less than or equal to three steps. Thus, these codes are majority-logic decodable in no more than three ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision-directed decoder for a binary symmetric channel with unknown crossover probability

    Publication Year: 1971, Page(s):336 - 343
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB)

    We consider a suboptimum decision-directed block decoder for a binary symmetric channel that makes use of past decoding decisions to update its estimate of the channel's initially unknown crossover probability. The decoder has a threshold list decoding rule that uses the current estimated crossover probability. The estimate is updated by means of a stochastic approximation algorithm. It is shown t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conversion of sequency-limited signals into frequency-limited signals and vice versa (Corresp.)

    Publication Year: 1971, Page(s):343 - 344
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (267 KB)

    Sequency-limited signals, consisting of a superposition of Walsh functions, and frequency-limited signals, consisting of a superposition of sine-cosine functions, can readily be converted from one form to the other without wasting either frequency or sequency bandwidth. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suppression of radar clutter and multipath effects for wide-band signals (Corresp.)

    Publication Year: 1971, Page(s):344 - 346
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Methods for narrow-band clutter suppression are examined to determine their applicability to wide-band signal analysis. Algorithms amenable to wide-band theory are established, and a simple example is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection probabilities for a rank statistic (Corresp.)

    Publication Year: 1971, Page(s):346 - 349
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (518 KB)

    Two statistics<tex>r = [x_{(n)} - x_{(n-1)}]/[x_{(n-1)} - x_{(1)}]</tex>and<tex>u = x_{(n)}</tex>, where<tex>x_{(i)}</tex>is the<tex>i</tex>th largest order statistic of a sample of size<tex>n</tex>, are studied to determine whether a preassigned false-alarm probability can be achieved in signal detection and to determine their probabilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "On the detection of a sudden change in system parameters" by Prabhu, K.P.S.

    Publication Year: 1971, Page(s): 349
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (142 KB)

    A recent correspondence presented a solution to the problem of detecting a sudden change in system parameters on the basis of noisy observations made on the system. The purpose of this correspondence is to show that the proposed solution reduces to the ad hoc "continuous test" proposed by Newbold and Ho. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's reply to Comments on 'On the Detection of a Sudden Change in System Parameters'

    Publication Year: 1971, Page(s): 349
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold learning and Brownian motion (Corresp.)

    Publication Year: 1971, Page(s):350 - 352
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB)

    An approach to the analysis of threshold learning suggested by the classical theory of Brownian motion is presented. In particular, it is shown how a nonlinear Langevin equation represents the motion of the threshold of a trainable signal detector, and how a Fokker-Planck diffusion equation yields an estimate of the shape of the probability density of the threshold. Our results are applicable to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure of optimum receiving filters in data transmission systems (Corresp.)

    Publication Year: 1971, Page(s):352 - 353
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB)

    It has been observed by several authors that a number of different optimum receiving filters (corresponding to different criteria of goodness) for sampled-data transmission systems can be factored as a product of a matched filter and a periodic filter with the period equal to the sampling frequency. By a simple argument it is shown in this correspondence that any reasonable criterion of goodness w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two theorems on minimax equalization (Corresp.)

    Publication Year: 1971, Page(s):353 - 355
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Intersymbol interference degrades the performance of digital communication systems: A practical method of reducing this type of distortion is provided by transversal filter equalization at the receiver. Lucky has shown that, if the unequalized peak distortion is less than 100 percent, then the<tex>N</tex>filter tap gains minimize the equalized peak distortion if the intersymbol interfe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some optimal type<tex>B_1</tex>convolutional codes (Corresp.)

    Publication Year: 1971, Page(s):355 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB)

    An algorithm has been devised to find type<tex>B_1</tex>optimal convolutional codes. All type<tex>B_1</tex>optimal 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