Lee D. Davisson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 43 from 43

1994

Analysis of SCCL as a PN-code tracking loopKwang-Cheng Chen, Lee D. Davisson. tcom, 42(11):2942-2946, 1994. [doi]

On the loop noise bandwidth of SCCLKwang-Cheng Chen, Lee D. Davisson. tcom, 42(11):2938-2941, 1994. [doi]

1992

Analysis of a new bit tracking loop-SCCLKwang-Cheng Chen, Lee D. Davisson. tcom, 40(1):199-209, 1992. [doi]

1990

On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless ChannelsChein-I Chang, Simon C. Fan, Lee D. Davisson. iandc, 86(1):1-13, May 1990.

Two iterative algorithms for finding minimax solutionsChein-I Chang, Lee D. Davisson. TIT, 36(1):126-140, 1990.

1989

A counterpart of Remez's algorithms in statistical decision theory: Chang-Davisson's algorithmsChein-I Chang, Lee D. Davisson. icassp 1989: 1345-1348 [doi]

1988

On calculating the capacity of an infinite-input finite (infinite)-output channelChein-I Chang, Lee D. Davisson. TIT, 34(5):1004-1010, 1988.

Fast single-element PN acquisition for the TDRSS MA systemLee D. Davisson, Paul G. Flikkema. tcom, 36(11):1226-1235, 1988. [doi]

Detection of baseband signals using a delta modulatorPaul G. Flikkema, Lee D. Davisson. TIT, 34(3):537-543, 1988.

1983

Minimax noiseless universal coding for Markov sourcesLee D. Davisson. TIT, 29(2):211-214, 1983.

1981

Review of Principles of Digital Communications and Coding (A. J. Viterbi and J. K. Omura, 1979)Lee D. Davisson. TIT, 27(5):670, 1981.

The error exponent for the noiseless encoding of finite ergodic Markov sourcesLee D. Davisson, Giuseppe Longo, Andrea Sgarro. TIT, 27(4):431-437, 1981.

Efficient universal noiseless source codesLee D. Davisson, Robert J. McEliece, Michael B. Pursley, Mark S. Wallace. TIT, 27(3):269-279, 1981.

1980

A source matching approach to finding minimax codesLee D. Davisson, Alberto Leon-Garcia. TIT, 26(2):166-174, 1980. [doi]

An improved decision-directed detector (Corresp.)Dimitri Kazakos, Lee D. Davisson. TIT, 26(1):113-116, 1980. [doi]

1979

New results on coding of stationary nonergodic sourcesAlberto Leon-Garcia, Lee D. Davisson, David L. Neuhoff. TIT, 25(2):137-144, 1979. [doi]

1976

Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraintMichael B. Pursley, Lee D. Davisson. TIT, 22(3):324-337, 1976. [doi]

1975

On the response of an RC filter-hard limiter- RC filter detector to nonzero-mean white Gaussian noise (Corresp.)Lee D. Davisson, Panayota Papantoni-Kazakos. TIT, 21(3):338-341, 1975. [doi]

A direct proof of the coding theorem for discrete sources with memoryLee D. Davisson, Michael B. Pursley. TIT, 21(3):310-317, 1975. [doi]

Quantizer MismatchRobert M. Gray, Lee D. Davisson. tcom, 23(4):439-443, 1975. [doi]

Adaptive linear estimation for stationary M-dependent processesJae-kyoon Kim, Lee D. Davisson. TIT, 21(1):23-31, 1975. [doi]

Fixed rate universal block source coding with a fidelity criterionDavid L. Neuhoff, Robert M. Gray, Lee D. Davisson. TIT, 21(5):511-523, 1975. [doi]

1974

Review of 'Foundations of the Theory of Learning Systems' (Tsypkin, Ya. Z.; 1973)Lee D. Davisson. TIT, 20(5):693, 1974. [doi]

Source coding theorems without the ergodic assumptionRobert M. Gray, Lee D. Davisson. TIT, 20(4):502-516, 1974. [doi]

The ergodic decomposition of stationary discrete random processesRobert M. Gray, Lee D. Davisson. TIT, 20(5):625-636, 1974. [doi]

1973

On the distribution and moments of RC -filtered hard-limited RC -filtered white noiseLee D. Davisson, Panayota Papantoni-Kazakos. TIT, 19(4):411-414, 1973. [doi]

Universal noiseless codingLee D. Davisson. TIT, 19(6):783-795, 1973. [doi]

1972

Comments on 'An Algorithm for Source Coding'Lee D. Davisson. TIT, 18(6):827, 1972. [doi]

Rate Distortion Theory: A Mathematical Basis for Data CompressionLee D. Davisson. tcom, 20(6):1202, 1972. [doi]

On the Performance of Digital Communication Systems With Bandpass Limiters-Part II: Two-Link SystemLee D. Davisson, Laurence B. Milstein. tcom, 20(5):975-980, 1972. [doi]

On the Performance of Digital Communication Systems with Bandpass Limiters-Part I: One-Link SystemLee D. Davisson, Laurence B. Milstein. tcom, 20(5):972-975, 1972. [doi]

1971

Two theorems on minimax equalization (Corresp.)Lee D. Davisson. TIT, 17(3):353-355, 1971. [doi]

1970

The effects of dependence on nonparametric detectionLee D. Davisson, Edward A. Feustel, James W. Modestino. TIT, 16(1):32-41, 1970. [doi]

Steady-state error in adaptive mean-square minimizationLee D. Davisson. TIT, 16(4):382-385, 1970. [doi]

Analysis of a decision-directed receiver with unknown priorsLee D. Davisson, Stuart C. Schwartz. TIT, 16(3):270-276, 1970. [doi]

Convergence probability bounds for stochastic approximationLee D. Davisson. TIT, 16(6):680-685, 1970. [doi]

1968

Data compression using straight line interpolationLee D. Davisson. TIT, 14(3):390-394, 1968. [doi]

On the Efficacy of Mixed Locally-Most-Powerful One- and Two-Sample Rank Tests (Corresp.)Edward A. Feustel, Lee D. Davisson. TIT, 14(5):776-778, 1968. [doi]

1967

An approximate theory of prediction for data compressionLee D. Davisson. TIT, 13(2):274-278, 1967. [doi]

The asymptotic relative efficiency of mixed statistical testsEdward A. Feustel, Lee D. Davisson. TIT, 13(2):247-255, 1967. [doi]

1966

A theory of adaptive filteringLee D. Davisson. TIT, 12(2):97-102, 1966. [doi]

1965

The prediction error of stationary Gaussian time series of unknown covarianceLee D. Davisson. TIT, 11(4):527-532, 1965. [doi]

Sufficient conditions for the regularity and nonregularity of random processes (Corresp.)Lee D. Davisson. TIT, 11(4):591, 1965. [doi]

Sign in or sign up to see more results.

runs on WebDSL