Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lewis E. Franks

dblp:11/10846 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
6 papers
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Integrated circuit design · 79% Cloud and datacenter computing · 21%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal processing for communications › filter design
digital filter design
0.011985
Realization of Finite Impulse Response Filters Using Coefficients +1, 0, and -1 · IEEE Trans. Commun. 1985
Physical-layer communications
signal processing for communications
0.011985
Realization of Finite Impulse Response Filters Using Coefficients +1, 0, and -1 · IEEE Trans. Commun. 1985
Integrated circuit design › digital signal processing circuits
digital filter implementation
0.011985
Realization of Finite Impulse Response Filters Using Coefficients +1, 0, and -1 · IEEE Trans. Commun. 1985
Physical-layer communications › digital signal processing
digital filter
0.011984
On the Design of FIR Filters with Powers-of-Two Coefficients · IEEE Trans. Commun. 1984
Physical-layer communications › digital signal processing › linear filtering
FIR filters
0.011984
On the Design of FIR Filters with Powers-of-Two Coefficients · IEEE Trans. Commun. 1984
Physical-layer communications › modulation › pulse modulation
pulse amplitude modulation
0.021980
Joint Carrier Phase and Symbol Timing Recovery for PAM Systems · IEEE Trans. Commun. 1980
Statistical Properties of Timing Jitter in a PAM Timing Recovery Scheme · IEEE Trans. Commun. 1974
Physical-layer communications › synchronization
timing recovery
0.021980
Carrier and Bit Synchronization in Data Communication-A Tutorial Review · IEEE Trans. Commun. 1980
Statistical Properties of Timing Jitter in a PAM Timing Recovery Scheme · IEEE Trans. Commun. 1974
Physical-layer communications › synchronization › carrier recovery
carrier phase estimation
0.011980
Carrier and Bit Synchronization in Data Communication-A Tutorial Review · IEEE Trans. Commun. 1980
Physical-layer communications › synchronization
carrier synchronization
0.011980
Carrier and Bit Synchronization in Data Communication-A Tutorial Review · IEEE Trans. Commun. 1980
Physical-layer communications
modulation
0.011980
Joint Carrier Phase and Symbol Timing Recovery for PAM Systems · IEEE Trans. Commun. 1980
Physical-layer communications
synchronization
0.011980
Joint Carrier Phase and Symbol Timing Recovery for PAM Systems · IEEE Trans. Commun. 1980
Cloud and datacenter computing › resource provisioning
dynamic resource provisioning
0.011984
On the Design of FIR Filters with Powers-of-Two Coefficients · IEEE Trans. Commun. 1984
Physical-layer communications › synchronization › timing error
timing jitter
0.011974
Statistical Properties of Timing Jitter in a PAM Timing Recovery Scheme · IEEE Trans. Commun. 1974
Physical-layer communications › transmission design
digital data transmission
0.011980
Carrier and Bit Synchronization in Data Communication-A Tutorial Review · IEEE Trans. Commun. 1980

Methods — techniques the papers use, named apart from their topics

dynamic programming · 0.0coefficient selection algorithm · 0.0SNR criterion · 0.0maximum likelihood estimation · 0.0statistical analysis · 0.0pseudo-maximum-likelihood estimation · 0.0translation series representation · 0.0harmonic series representation · 0.0
YearPublicationVenuePosition
1991 Implementation of recursive filters using highly quantized periodically time-varying coefficients
abstract
A multiplierless realization of IIR (infinite impulse response) filters is proposed. It is achieve by cascading biquad units (second-order filters), and each biquad unit is realized by a periodically time-varying state-space (PTV-SS) structure, preceded and followed by a first-order interpolator (hold circuit) and a decimator (down-sampler), respectively. The coefficients of the PTV-SS structure are powers of two, so that multiplications are performed by shift operations. Design examples show that the resulting frequency response closely matches that of the target filter with infinite-precision coefficients.>
Sachin P. Ghanekar, Sawasd Tantaratana, Lewis E. Franks
ICASSP3
1988 A new digital recursive filter structure based on delta modulation encoding
abstract
It is pointed out that conventional digital filters, in which signal samples and filter coefficients are represented by 8- to 16-bit words, have some advantages for VLSI implementation due to the high hardware complexity of multibit multipliers. Incremental digital filters, based on delta modulation (DM) encoding, having emerged as a promising alternative to the conventional approach, because highly modular 'multiplier-free' structures can be built using incremental methods. A multiplier-free biquad filter structure is proposed which is suitable for VLSI implementation with low roundoff noise and low limit cycle operations.>
Halil Padir, Lewis E. Franks
ICASSP2
1985 Realization of Finite Impulse Response Filters Using Coefficients +1, 0, and -1
abstract
New classes of nonrecursive linear digital filters are proposed as alternatives to conventional methods for digital signal processing devices. In fact, the traditional approach, where signal samples are represented by 8-15 bit words, can be very expensive to implement due to the complexity of multibit multipliers and adders. Filter structures consisting of a transversal filter with tap coefficients restricted to - 1, 0, or + 1 and cascaded with simple recursive sections are proposed. Using a mean square error criterion, dynamic programming methods to select optimum sets of coefficient values for the taps are presented and evaluated. It is shown that these structures lend themselves to very simple hardware implementations and offer a valid alternative to the conventional filtering approach. Designs for several example filters are presented, and their implementation complexity is examined.
Nevio Benvenuto, Lewis E. Franks, Francis S. Hill Jr.
IEEE Trans. Commun.2
1984 On the Design of FIR Filters with Powers-of-Two Coefficients
abstract
FIR filters with powers-of-two coefficients are attractive for cost-effective implementations. The performance of one such structure, the difference routing digital filter [8], is discussed. Using an SNR criterion, an optimal algorithm to select the value of the filter coefficients is presented. Results indicate that a 2-3 dB improvement in the SNR can be obtained with this new approach. In addition, the study gives some insight into the relationship between the filter sampling rate, the number of coefficients, and the size of the coefficient alphabet. In particular, it is seen that a tradeoff between the filter sampling rate and the size of the coefficient alphabet exists.
Nevio Benvenuto, Lewis E. Franks, Francis S. Hill Jr.
IEEE Trans. Commun.2
1980 Carrier and Bit Synchronization in Data Communication-A Tutorial Review
abstract
This paper examines the problems of carrier phase estimation and symbol timing estimation for carrier-type synchronous digital data signals, with tutorial objectives foremost. Carrier phase recovery for suppressed-carrier versions of double sideband (DSB), vestigial sideband (VSB), and quadrature amplitude modulation (QAM) signal formats is considered first. Then the problem of symbol timing recovery for a baseband pulse-amplitude modulation (PAM) signal is examined. Timing recovery circuits based on elementary statistical properties are discussed as well as timing recovery based on maximum-likelihood estimation theory. A relatively simple approach to evaluation of timing recovery circuit performance in terms of rms jitter of the timing parameters is presented.
Lewis E. Franks
IEEE Trans. Commun.1
1980 Joint Carrier Phase and Symbol Timing Recovery for PAM Systems
abstract
The detection of pulse amplitude modulation (PAM) carrier signals requires accurate symbol timing and carrier phase references. In most cases, it is desired to estimate these parameters directly from measurements on the received data signal. This paper adds to and unifies the theory of maximum likelihood [ML] estimation as applied to PAM timing and phase recovery. Several different estimation strategies are considered. Data-aided [DA] estimators are found which assume the transmitted data symbols are known at the receiver. Nondata-aided [NDA] estimators are found which require only knowledge of the statistics of the transmitted data symbols. Structures for estimation of symbol timing, carrier phase, and joint estimation of timing and phase are presented. The estimators are evaluated on the basis of their error variances. Relatively simple approximate expressions for these error variances are presented. These expressions allow the comparison of the effects of excess bandwidth, different modulation schemes, DA versus NDA recovery, and joint estimation versus estimation of only one parameter. A practical implementation of the ML estimator, termed a pseudo-maximum likelihood (PML) estimator, is proposed and analyzed. The performance of the PML estimator is shown to include a noise-independent, data-dependent jitter which dominates in many cases of practical interest.
Martin H. Meyers, Lewis E. Franks
IEEE Trans. Commun.2
1975 Characterization of cyclostationary random signal processes
abstract
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 periodically with time. In this paper we examine two methods for representing nonstationary processes that reveal the special properties possessed by CS processes. These representations are the harmonic series representation (HSR) and the translation series representation (TSR). We show that the HSR is particularly appropriate for characterizing the structural properties of CS processes and that the TSR provides natural models for many types of communication signal formats. The advantages gained by modeling signals as CS processes rather than stationary processes is illustrated by consideration of the optimum filtering problem. We present general solutions for filters that minimize mean-square error for continuous-waveform estimation, and we discuss several specific examples for the particular case of additive noise. These examples demonstrate improvement in performance over that of filter designs based on stationary models for the signal processes.
William A. Gardner, Lewis E. Franks
IEEE Trans. Inf. Theory2
1974 Statistical Properties of Timing Jitter in a PAM Timing Recovery Scheme
abstract
A new technique is presented for evaluating the performance of a popular type of timing recovery circuit for baseband synchronous pulse amplitude modulation (PAM) data signals. The timing circuit consists of a square-law device followed by a narrowband filter tuned to the pulse repetition frequency along with provision for reshaping the pulses entering the timing path (prefiltering). The output of the timing circuit is a nearly sinusoidal timing wave whose zero crossings indicate the appropriate sampling instants for demodulation of the PAM signal. For a random data sequence, the timing wave exhibits phase fluctuations which are strongly dependent on the pulse shapes entering the timing path and the passband shape of the narrow-band filter. Expressions for rms phase fluctuation in the timing wave as a function of the prefiltering and postfiltering characteristics of the filters preceding and following the square-law device are presented. These expressions have a form which is especially suitable for studying the case where the baseband PAM signal is band-limited to frequencies less than the pulse repetition frequency. A condition on prefiltering and postfiltering which gives error-free timing recovery is presented. Results obtained from some specific examples serve to illustrate several aspects of the timing recovery problem.
Lewis E. Franks, J. P. Bubrouski
IEEE Trans. Commun.1
1972 Principles of Communication Systems
Lewis E. Franks
IEEE Trans. Commun.1