IEEE Transactions on Information Theory

Filter Results

Displaying Results 1 - 25 of 31
• Our reviewers

Publication Year: 1975, Page(s):2 - 3
Cited by:  Papers (1)
| PDF (647 KB)
• Characterization of cyclostationary random signal processes

Publication Year: 1975, Page(s):4 - 14
Cited by:  Papers (266)
| | PDF (1754 KB)

Many communication and control systems employ signal formats that involve some form of periodic processing operation. Signals produced by samplers, scanners, multiplexors, and modulators are familiar examples. Often these signals are appropriately modeled by random processes that are cyclostationary (CS), i.e., processes with statistical parameters, such as mean and autocorrelation, that fluctuate... View full abstract»

• An RKHS approach to detection and estimation problems--II: Gaussian signal detection

Publication Year: 1975, Page(s):15 - 23
Cited by:  Papers (20)
| | PDF (1373 KB)

The theory of reproducing kernel Hilbert spaces is used to obtain a simple but formal expression for the likelihood ratio (LR) for discriminating between two Gaussian processes with unequal covariances, and to develop a test by which the formal expression can be checked for validity. This LR formula can be evaluated by working separately with each covariance, thus reducing the calculations for the... View full abstract»

• Adaptive linear estimation for stationary M-dependent processes

Publication Year: 1975, Page(s):23 - 31
Cited by:  Papers (45)
| | PDF (1244 KB)

In recent years adaptive linear estimation based upon the gradient-following algorithm has been proposed in a wide range of applications. However, little analysis on the convergence of the estimation has appeared when the elements of the data sequence are dependent. This paper presents such an analysis under the assumptions of stationarity and<tex>M</tex>-dependence (all data sets sepa... View full abstract»

• The estimation of the gradient of a density function, with applications in pattern recognition

Publication Year: 1975, Page(s):32 - 40
Cited by:  Papers (1274)  |  Patents (9)
| | PDF (1175 KB)

Nonparametric density gradient estimation using a generalized kernel approach is investigated. Conditions on the kernel functions are derived to guarantee asymptotic unbiasedness, consistency, and uniform consistency of the estimates. The results are generalized to obtain a simple mcan-shift estimate that can be extended in a<tex>k</tex>-nearest-neighbor approach. Applications of gradi... View full abstract»

• A finite-memory deterministic algorithm for the symmetric hypothesis testing problem

Publication Year: 1975, Page(s):40 - 44
Cited by:  Papers (5)
| | PDF (666 KB)

A class of irreducible deterministic finite-memory algorithms for the symmetric hypothesis testing problem is studied. It is shown how members of this class can be constructed to give a steady-state probability of error that decreases asymptotically faster in the number of states than the best previously known deterministic algorithm. View full abstract»

• Necessary and sufficient memory size for m-hypothesis testing

Publication Year: 1975, Page(s):44 - 46
Cited by:  Papers (20)
| | PDF (422 KB)

Let<tex>X_1,X_2, \cdots</tex>be a sequence of independent identically distributed Bernoulli random variables with Pr<tex>\{X_i = 1 \} = p</tex>. Consider the<tex>m</tex>-hypothesis test<tex>H_1 : p &lt; p_1, H_2 : p_1 &lt; p &lt; p_ 2, \cdots</tex>versus<tex>H_m: p_{m-1} &lt; p &lt; p_m</tex>. It is shown that, for a t... View full abstract»

• Performance bound for maximum-likelihood reception of digital data

Publication Year: 1975, Page(s):47 - 50
Cited by:  Papers (42)
| | PDF (511 KB)

Maximum-likelihood sequence estimation (MLSE) of data sequences is considered as an approach to increasing data rates over band-limited channels, such as exist in analog telephone facilities. Analytical prediction of the efficacy of MLSE for specific channels had been viewed as intractable until Forney gave a formula for an asymptotic upper bound on the probability of symbol error<tex>p</... View full abstract»

• Automatic equalization using a successive overrelaxation iterative technique

Publication Year: 1975, Page(s):51 - 58
Cited by:  Papers (4)  |  Patents (1)
| | PDF (1037 KB)

The successive overrelaxation iterative technique is used as the algorithm for the iterative adjustment of transversal equalizer tap gains during a training period using isolated pulses for the minimization of the mean-square error. For certain channel models, substantial improvement is demonstrated in the rate of convergence over the commonly used gradient techniques. Numerical simulations indica... View full abstract»

• Evaluation of rate-distortion functions for a class of independent identically distributed sources under an absolute-magnitude criterion

Publication Year: 1975, Page(s):59 - 64
Cited by:  Papers (19)
| | PDF (902 KB)

The explicit evaluation of the rate-distortion function<tex>R(D)</tex>for continnous-amplitude sources when it is strictly greater than its Shannon lower bound has been previously considered a formidable task. This is the case for independent identically distributed (i.i.d.) Gaussian sources under an absolute-magnitude distortion criterion. In this paper, we provide a method that yield... View full abstract»

• On a class of alternating cyclic convolutional codes

Publication Year: 1975, Page(s):64 - 69
Cited by:  Papers (10)
| | PDF (890 KB)

The class of alternating cyclic maximum-length sequence convolutional codes is defined, and all optimal codes are constructed for<tex>(n,k) = View full abstract»

• Algebraic generalization of BCH-Goppa-Helgert codes

Publication Year: 1975, Page(s):70 - 79
Cited by:  Papers (20)
| | PDF (1640 KB)

Based on the Mattsom-Solomon polynomial, a class of algebraic linear error-correcting codes is proposed, which includes the Bose-Chaudhuri-Hocquenghen (BCH) codes, Goppa codes, and Srivastava codes as subclasses. Several constructive bounds on the minimum distance of these codes are derived and are shown to be achievable using either Berlekamp's iterative decoding algorithm or Goppa's method based... View full abstract»

• Aperiodic correlation constraints on large binary sequence sets

Publication Year: 1975, Page(s):79 - 84
Cited by:  Papers (8)
| | PDF (868 KB)

The existence of binary sequences with specific aperiodic autocorrelation and cross correlation properties is investigated. Relationships are determined among the size of a sequence set, the length of the sequences n, the maximum autocorrelation sidelobe magnitude<tex>\alpha</tex>, and the maximum cross correlation magnitude<tex>\beta</tex>. The principal result is the proo... View full abstract»

• Recursive filtering for two-dimensional random fields (Corresp.)

Publication Year: 1975, Page(s):84 - 86
Cited by:  Papers (8)
| | PDF (401 KB)

A class of recursive filtering problems for random fields with a two-dimensional parameter is considered. After a brief introduction of two-parameter stochastic calculus, a class of Markovian random fields generated by stochastic integral equations is defined and considered. It is then shown that the problem of estimating such a Markovian field in additive white Gaussian noise can be reduced to a ... View full abstract»

• Sample functions of a Gaussian process cannot be recovered from their zero crossings (Corresp.)

Publication Year: 1975, Page(s):86 - 87
Cited by:  Papers (6)
| | PDF (316 KB)

The types of ambiguities that preclude the possibility of recovering the sample functions of a Gaussian process from their zero-crossings are illustrated by a simple example. View full abstract»

• Parameter estimation in Poisson processes (Corresp.)

Publication Year: 1975, Page(s):87 - 90
Cited by:  Papers (7)
| | PDF (584 KB)

Accuracy achievable in estimation of an unknown parameter<tex>\theta</tex>is considered when the intensity function of an observed Poisson process is given as<tex>\alpha + \beta f(t - \theta)</tex>, where<tex>\alpha</tex>and<tex>\beta</tex>are known positive constants and<tex>f</tex>is a step function or a rectangular pulse. View full abstract»

• Improved Lower Bounds on Signal Parameter Estimation

Publication Year: 1975, Page(s):90 - 93
Cited by:  Papers (115)
| | PDF (503 KB)

An improved technique for bounding the mean-square error of signal parameter estimates is presented. The resulting bounds are independent of the bias and stronger than previously known bounds. View full abstract»

• Bayes estimation with asymmetrical cost functions (Corresp.)

Publication Year: 1975, Page(s):93 - 95
Cited by:  Papers (1)
| | PDF (445 KB)

It is known that under certain restrictions on the posterior density and assigned cost function, the Bayes estimate of a random parameter is the conditional mean. The restrictions on the cost function are that it must be a symmetric convex upward function of the difference between the parameter and the estimate. In this correspondence, asymmetrical cost functions of the following form are examined... View full abstract»

• Some integrals involving theQ_Mfunction (Corresp.)

Publication Year: 1975, Page(s):95 - 96
Cited by:  Papers (193)  |  Patents (1)
| | PDF (191 KB)

Some integrals are presented that can be expressed in terms of theQ_Mfunction, which is defined as $$Q_M(a,b) = \int_b^{\infty} dx x(x/a)^{M-1} \exp (- \frac{x^2 + a^2}{2}) I_{M-1}(ax),$$ whereI_{M-1}is the modified Bessel function of orderM-1. Some integrals of theQ_Mfunction are also evaluated. View full abstract»

• Correction to 'A Statistical Theory of Reverberation and Similar First-Order Scattered Fields-Part III, Waveform and Fields-Part IV. Statistical Models'

Publication Year: 1975, Page(s):97 - 99
Cited by:  Papers (6)
| | PDF (428 KB)

The treatment in the above papers^1concerning the effects of a nonvanishing velocity gradient on the waveform and statistical properties of a scattered field and the resulting received reverberation return is modified to include possible focusing phenomena. These, in turn, can become quite pronounced in the neighborhood of caustics and foci in various practical situations vis-á-vis the ... View full abstract»

• Sharper lower bounds for discrimination information in terms of variation (Corresp.)

Publication Year: 1975, Page(s):99 - 100
Cited by:  Papers (16)
| | PDF (295 KB)

The lower bound for discrimination information in terms of variation, derived recently by Kullback [7] for the distribution-free case, is sharpened. Furthermore, under a restriction, a lower bound is derived that is sharper than all other existing bounds. View full abstract»

• The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)

Publication Year: 1975, Page(s):100 - 102
Cited by:  Papers (118)
| | PDF (446 KB)

The capacity of a single-input single-output discrete memoryless channel is not increased by the use of a noiseless feedback link. It is shown, by example, that this is not the case for a multiple-access discrete memoryless channel. That is, it is shown that the capacity region for such a channel is enlarged if a noiseless feedback link is utilized. View full abstract»

• Kraft inequality for decoding with respect to non-balanced distortion measures (Corresp.)

Publication Year: 1975, Page(s):102 - 104
Cited by:  Papers (1)
| | PDF (400 KB)

Campbell has given a generalized Kraft inequality and related results for decoding with respect to a fidelity criterion. His results are, however, restricted to "row-balanced" distortion matrices for finite-alphabet sources. We generalize these results to any distortion matrix. View full abstract»

• Constructing codes with ordered codeword lengths (Corresp.)

Publication Year: 1975, Page(s):105 - 106
Cited by:  Papers (3)
| | PDF (319 KB)

An algorithm is described where given the letter probabilities for a memoryless message source that emits<tex>N</tex>letters, only<tex>O(N^2)</tex>steps are required--rather than the previously reported<tex>O(N^3)</tex>steps---to construct a code with the minimum average codeword length permitted by the constraint that codeword lengths be monotonically increasin... View full abstract»

• Maximalq-nary linear codes with large minimum distance (Corresp.)

Publication Year: 1975, Page(s):106 - 110
Cited by:  Papers (10)  |  Patents (2)
| | PDF (573 KB)

This correspondence presents a complete solution to the problem of constructing maximalq-nary codes, for any word lengthnand minimum distancedin the regionqd \geq (q - 1)n. Several interesting results regarding the interdependence of these codes are developed, which reveal the unique structure of the code spaces of the regionqd \geq (q - 1)n. ... View full abstract»

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