By Topic

Information Theory, IEEE Transactions on

Issue 3 • Date July 1967

Filter Results

Displaying Results 1 - 25 of 29
  • Asymptotic performance and complexity of a coding scheme for memoryless channels

    Publication Year: 1967, Page(s):356 - 359
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (561 KB)

    The purpose of this paper is to show that decoding complexity need not grow exponentially with the code block length at rates close to channel capacity and also to show the expediency of the approach of imbedding codes in each other. It is demonstrated that it is possible to communicate over a memoryless channel of capacity C at any rate View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A partial ordering of discrete, memoryless channels

    Publication Year: 1967, Page(s):360 - 365
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB)

    This paper is concerned with the structure of a partial ordering of discrete, memoryless communication channels. These are identified with equivalence classes of stochastic matrices into which the set of all stochastic matrices is partitioned by a relation of matrix inclusion. The relation carries over to channels and induces a partial ordering on them, having the property that if View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reinforced prefixed comma-free codes

    Publication Year: 1967, Page(s):366 - 371
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (871 KB)

    Signal flow graph methods are applied to the problem of counting the number of allowable code words for certain classes of prefixed comma-free codes. This method can be applied whenever the distance between the prefix and other A -tuples in the code word is a prescribed function of the position of the A -tuple. Such codes ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical theory of reverberation and similar first-order scattered fields--I: Waveforms and the general process

    Publication Year: 1967, Page(s):372 - 392
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3514 KB)

    A theory of reverberation and related first-order scattered fields is developed, based on the assumption of weak inhomogeneities (i.e., primary scattering only), and a consequent representation in terms of Poisson point processes in space and time. Both surface and volume reverberation are included, separately and together, for general geometries, source and receiver at the same and different loca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical theory of reverberation and similar first-order scattered fields--II: Moments, spectra and special distributions

    Publication Year: 1967, Page(s):393 - 414
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3432 KB)

    In Part I a general, first-order scattering model for reverberation has been constructed, from which the characteristic aperture and medium operators have been obtained for general geometries, signals, and arrays. Here, in Part II, the second-order statistics (intensities, covariances, and spectra) of such reverberation processes are determined in detail. In addition to the fluctuation, or purely ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of an M -ary orthogonal communication system using stationary stochastic signals

    Publication Year: 1967, Page(s):414 - 422
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB)

    This paper considers the performance of a communication system which transmits for T seconds the real part of a sample function of one of M stationary complex Gaussian processes whose spectral densities are all frequency translations of the function S_{\xi} (f) . At the receiver white G... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymmetric signal design for the coherent Gaussian channel

    Publication Year: 1967, Page(s):422 - 431
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1248 KB)

    Signal design theory is concerned with the problem of determining transmitter signal waveforms such that the probability of correct reception (or some other appropriate measure of communication efficiency) is maximized. The selection of signals must be performed under specified constraints of signal power and bandwidth and channel noise disturbance. In this paper three cases are treated for the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New calculation methods for echo-ranging ambiguity

    Publication Year: 1967, Page(s):432 - 441
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1417 KB)

    In correlation echo ranging the ambiguity, or square of the signal autocorrelation envelope, is important, and two new approaches are presented that speed up general ambiguity calculations. Some signals such as linear FM can be represented by lines in a frequency-time plot, and for two such lines the cross ambiguity is associated with the point of crossing and depends on the angle of crossing. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A projection method for signal detection in colored Gaussian noise

    Publication Year: 1967, Page(s):441 - 447
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1135 KB)

    The problem of the detection of known signals in colored Gaussian noise is usually studied through infinite-series representations for the signals and noise. In particular, the Karhunen-Loève (K-L) expansion is often used for this purpose. Such infinite-series methods, while elegant, often introduce mathematical complications because they raise questions of convergence, interchange of orders ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of optimum radar waveforms for clutter rejection

    Publication Year: 1967, Page(s):454 - 463
    Cited by:  Papers (77)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1639 KB)

    The problem to be considered in this paper is that of designing radar signals and receivers that are optimum for detecting a point target masked by a background of clutter returns and thermal noise. The problem of choosing an optimum signal when no constraints are placed on the type of signals allowed is discussed briefly, but the remainder of the paper is restricted to signals and receiver impuls... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chernoff bound for channels with infinite memory

    Publication Year: 1967, Page(s):463 - 467
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    The problem of Chernoff bounding is analyzed for symmetric channels with input alphabet of arbitrary finite size or erasure channels with no crossover errors whose memory may be described in terms of the noise sequences by an infinite ergodic irreducible aperiodic Markov chain. Necessary and sufficient conditions are described which guarantee the existence of an exponential upper bound to the prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of arbitrary and symmetric channels on the basis of capacity

    Publication Year: 1967, Page(s):467 - 470
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (466 KB)

    This paper concerns itseff with certain upper and lower bounds on the capacity of arbitrary discrete, memoryless channels. A given channel is related to an n -ary symmetric channel through a series of operations on the channel matrix, none of which can increase capacity. The bounds are then obtained from the known formula for capacity of a symmetric channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distortionless data transmission with minimum peak voltage

    Publication Year: 1967, Page(s):470 - 477
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1213 KB)

    Knowing that the tails of the ideal \sin \pi t/ \pi t pulse represent a divergent series, the problem is stated of finding distortionless bandlimited waves which give rise to a minimum of the worst peaks of voltage that can appear on the channel in unit-height binary transmission. The optimization problem is then solved for all sampling rates up to View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a class of linear time-varying filters

    Publication Year: 1967, Page(s):477 - 481
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (738 KB)

    This paper is devoted to a special class of linear time-varying filters, members of which are commonly employed in practice. It is shown that some of these filters share a number of desirable properties with linear stationary systems, the most important of which is the preservation of wide sense stationarity of stochastic inputs. An application to the problem of transmitting a continuous signal ov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On probability distributions for filtered white noise

    Publication Year: 1967, Page(s):481 - 484
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    When white noise generated by an underlying Poisson process is filtered by any member of a large class of stable (not necessarily linear nor stationary) filters, the first-order probability distributions of the filter output is infinitely divisible. The Kolmogorov canonical form for the characteristic function is displayed and related to the parameters of the white noise and of the filter. In cert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential recognition using a nonparametric ranking procedure

    Publication Year: 1967, Page(s):484 - 492
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1427 KB)

    In the problems of statistical pattern recognition, it has become increasingly known that there are many applications in which parametric assumptions regarding the pattern statistics are not justified. This paper treats a nonparametric design of a sequential recognition machine which uses the optimum property of Wald's sequential probability ratio test (SPRT). For the case of binary classification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networks of Gaussian channels with applications to feedback systems

    Publication Year: 1967, Page(s):493 - 501
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1431 KB)

    This paper discusses networks (directed graphs) having one input node, one output node, and an arbitrary number of intermediate nodes, whose branches are noisy communications channels, in which the input to each channel appears at its output corrupted by additive Gaussian noise. Each branch is labeled by a non-negative real parameter which specified how noisy it is. A branch originating at a node ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear transformations of random processes

    Publication Year: 1967, Page(s):502 - 505
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB)

    This paper provides a general method of calculating the mean-square bandwidth (and other spectral moments) of an arbitrary zero-memory nonlinear transformation of a stationary random process. The method is valid when the original process is an arbitrary combination of other random processes. It can be used to determine the mean-square bandwidth (or the spectral moments) of the transformed process ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information rates in sampling and quantization

    Publication Year: 1967, Page(s):506 - 511
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A computer-aided analysis of a digital communications system has been conducted. Salient results compare the performance of approximately optimum PCM systems with the rate-distortion function, under the assumptions of Gaussian inputs and mean-square-error distortion measure. The calculated distortion is greater than the theoretical minimum by two or three decibels in most cases. The results presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlation function bounds for aperiodic signals (Corresp.)

    Publication Year: 1967, Page(s):517 - 518
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB)

    A basic signal design problem which arises in the construction of aperiodic signals with good correlation properties is how small can the peak value of the cross-correlation function be when the signals occupy approximately the same frequency spectra. The authors are not aware of any published results on this problem prior to Anderson's work (in preparation). He derives a lower bound on the maximu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the generalized Karhunen-Loeve expansion (Corresp.)

    Publication Year: 1967, Page(s):518 - 520
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    In a recent paper Watanabe (1965) has established two useful theorems concerning the optimum properties of the Karhunen-Loeve expansion for the random functions of a stochastic process. The resulting coordinate system (Karhunen-Loeve system) was found to be optimum in the sense of i) minimizing the mean-square error committed by approximating the expansion of an infinite series by a finite number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic behavior of the approximations for the probability of error and the entropy of a stationary random process

    Publication Year: 1967, Page(s): 520
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Let {Yn} be a stationary random process where each Y value takes values in a finite set B. Then define Hn and en so that H is the entropy of {Yn} and e is the probability of error in predicting Y0 from the infinite past. The purpose of this correspondence is to give an example which shows that {Hn - H} and {en - e} are no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of N-orthogonal codes (Corresp.)

    Publication Year: 1967, Page(s):521 - 522
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB)

    In a recent paper Reed and Scholtz (ibid., vol. IT-12, pp. 388-395, July 1966) analyze the error probabilities encountered in using N-orthogonal codes over a white Gaussian channel. In this correspondence the authors derive simple upper and lower bounds on these probabilities and discuss some of the implications of these bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimum coincidence procedure in presence of a fluctuating target

    Publication Year: 1967, Page(s):522 - 524
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Signal Detection Theory' (Hancock, J. C., and Wintz, P. A.; 1966)

    Publication Year: 1967, Page(s):526 - 527
    Request permission for commercial reuse | PDF file iconPDF (367 KB)
    Freely Available from IEEE

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
Frank R. Kschischang

Department of Electrical and Computer Engineering