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

Donald R. Martin

dblp:134/5165 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

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

Computer networks · 2Theory of computation · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
source coding
0.011979
Universal source coding of finite alphabet sources via composition classes · IEEE Trans. Inf. Theory 1979
Coding theory › source coding
universal coding
0.011979
Universal source coding of finite alphabet sources via composition classes · IEEE Trans. Inf. Theory 1979
Physical-layer communications › synchronization
bit synchronization
0.011978
Microprocessor Bit Synchronizer for Shuttle Payload Communications · IEEE Trans. Commun. 1978
Physical-layer communications
synchronization
0.011978
Microprocessor Bit Synchronizer for Shuttle Payload Communications · IEEE Trans. Commun. 1978
Coding theory › source coding
rate-distortion theory
0.011979
Universal source coding of finite alphabet sources via composition classes · IEEE Trans. Inf. Theory 1979
Coding theory › source coding › source modeling
stationary sources
0.011979
Universal source coding of finite alphabet sources via composition classes · IEEE Trans. Inf. Theory 1979

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

microprogrammed control · 0.0matched filtering · 0.0code construction · 0.0
YearPublicationVenuePosition
2002 A multi-carrier base station receiver using a delta-sigma oversampling A/D converter
abstract
This paper presents the results of work at TRW in developing a multi-carrier receiver for cellular base station applications. Replacing existing single carrier receivers with a multi-carrier receiver has the potential to significantly increase the capacity of existing mobile phone networks and reduce the cost per carrier. Implementation of a multi-carrier receiver has been limited by the large dynamic range requirements for GSM/EDGE and WCDMA standards, with the GSM 900 MHz band presenting the greatest challenge. TRW is leveraging several proprietary technologies that enable and facilitate this development, including the latest product in a series of high performance analog-to-digital converters (ADCs). The stressing requirements for very high dynamic range (up to 108 dB SNR), wide bandwidth, and high linearity are met by employing a delta-sigma ADC that redefines the state-of-the-art. TRW's world-class InP process is used to fabricate devices capable of the high level of oversampling needed to satisfy the demanding performance values. We describe the receiver architecture and present preliminary test results from our first engineering model, demonstrating the practicality of a multi-carrier receiver for cellular base stations.
K. B. Weber, William Skones, R. Harnden, C. Talbott, M. Keller, Donald R. Martin, M. Kintis, I. Robinson
ICC7
1979 Universal source coding of finite alphabet sources via composition classes
abstract
The universal source coding theorem for stationary sources states that, by using a preselected code with sufficiently large block length, any stationary source can be encoded arbitrarily close to the optimum performance theoretically attainable for the source. The code construction typically used to prove this theorem offers no performance guarantees for nonstationary sources. A code construction (based on composition classes) is described which is shown to be universal for stationary sources. In addition, this code construction guarantees that the distortion for any block in the sequence will not exceed a maximum value determined by its composition.
Donald R. Martin
IEEE Trans. Inf. Theory1
1978 Microprocessor Bit Synchronizer for Shuttle Payload Communications
abstract
An example of the growing influence of the microprocessor in communications is illustrated in this description of the payload bit synchronizer and other related payload signal processing functions for the Space Shuttle. Stored in firmware the microprogrammed control at 2.56 M-instructions/s accomplishes bit synchronization, matched filter detection, NRZ-Lconversion and frame synchronization for some thirty combinations of PCM formats and data rates.
Sam W. Houston, Donald R. Martin, Larry R. Stine
IEEE Trans. Commun.2