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

Irving R. Smith

dblp:271/1891 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1982
—ORCID · none

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

Computer networks · 2 · 2 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.

Computer networks
1 paper
Physical-layer communications · 67% Cellular and mobile networks · 33%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 50% Image and video coding · 50%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › interference
adjacent channel interference
0.011982
Tradeoff Between Processing Gain and Interference Immunity in Co-Site Multichannel Spread-Spectrum Communications · IEEE Trans. Commun. 1982
Cellular and mobile networks
interference management
0.011982
Tradeoff Between Processing Gain and Interference Immunity in Co-Site Multichannel Spread-Spectrum Communications · IEEE Trans. Commun. 1982
Physical-layer communications
spread spectrum
0.011982
Tradeoff Between Processing Gain and Interference Immunity in Co-Site Multichannel Spread-Spectrum Communications · IEEE Trans. Commun. 1982
Image and video coding
bandwidth compression
0.011972
Compression of Transmission Bandwidth Requirements for a Certain Class of Band-Limited Functions · IEEE Trans. Commun. 1972
Multimedia systems and quality of experience › multimedia communication
facsimile transmission
0.011972
Compression of Transmission Bandwidth Requirements for a Certain Class of Band-Limited Functions · IEEE Trans. Commun. 1972
Coding theory › source coding
bandwidth reduction
0.011972
Compression of Transmission Bandwidth Requirements for a Certain Class of Band-Limited Functions · IEEE Trans. Commun. 1972
Coding theory
source coding
0.011972
Compression of Transmission Bandwidth Requirements for a Certain Class of Band-Limited Functions · IEEE Trans. Commun. 1972

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

frequency hopping · 0.0fourier transform · 0.0analog signal rooting · 0.0PN spreading · 0.0
YearPublicationVenuePosition
1982 Tradeoff Between Processing Gain and Interference Immunity in Co-Site Multichannel Spread-Spectrum Communications
abstract
Multiple single channel spread-spectrum radio communications simultaneously transmitted and received at a small station, aircraft, or ship are subject to mutual interference. Wide-band PN and/or FH radios which occupy a large fraction of the available frequency band are more difficult to protect from adjacent channel interference than conventional narrow-band radios. This paper describes the interference susceptibility of various spread-spectrum radios, identifies potential solutions, and determines the tradeoff of processing gain that must be made to achieve immunity from co-site interference.
Irving R. Smith
IEEE Trans. Commun.1
1972 Compression of Transmission Bandwidth Requirements for a Certain Class of Band-Limited Functions
abstract
A study of source-encoding techniques that afford a reduction of data-transmission rates is made with particular emphasis on the compression of transmission bandwidth requirements of band-limited functions. The feasibility of bandwidth compression through analog signal rooting is investigated. It is found that theNth roots of elements of a certain class of entire functions of exponential type possess contour integrals resembling Fourier transforms, the Cauchy principal values of which are compactly supported on an interval oneNth the size of that of the original function. Exploring this theoretical result it is found that synthetic roots can be generated, which closely approximate theNth roots of a certain class of band-limited signals and possess spectra that are essentially confined to a bandwidth oneNth that of the signal subjected to the rooting operation. A source-encoding algorithm based on this principle is developed that allows the compression of data-transmission requirements for a certain class of band-limited signals. The utility of this algorithm is illustrated by a digital computer simulation of a facsimile telegraphy system. The scanning and recovery of several alphanumeric character images is simulated. Recognizable replicas of the original pattern are retrieved after 6-to-1 bandwidth compression.
Irving R. Smith, Donald L. Schilling
IEEE Trans. Commun.1