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

Timothy J. Healy

dblp:98/5484 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none

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

Computer networks · 2 · 1 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Physical-layer communications · 79% Wireless networking · 21%
Theoretical computer science
3 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
code-division multiple access
0.011985
Coding and Decoding for Code Division Multiple User Communication Systems · IEEE Trans. Commun. 1985
Physical-layer communications › signal detection
multiuser detection
0.011985
Coding and Decoding for Code Division Multiple User Communication Systems · IEEE Trans. Commun. 1985
Physical-layer communications
spread spectrum
0.011985
Coding and Decoding for Code Division Multiple User Communication Systems · IEEE Trans. Commun. 1985
Coding theory
error-correcting codes
0.011985
Coding and Decoding for Code Division Multiple User Communication Systems · IEEE Trans. Commun. 1985
Wireless networking › random access
ALOHA
0.011980
Packet Radio Performance Over Slow Rayleigh Fading Channels · IEEE Trans. Commun. 1980
Wireless networking
packet radio network
0.011980
Packet Radio Performance Over Slow Rayleigh Fading Channels · IEEE Trans. Commun. 1980
Physical-layer communications › spread spectrum
frequency hopping
0.011985
Coding and Decoding for Code Division Multiple User Communication Systems · IEEE Trans. Commun. 1985
Physical-layer communications
fading channels
0.011980
Packet Radio Performance Over Slow Rayleigh Fading Channels · IEEE Trans. Commun. 1980
Physical-layer communications › modulation
frequency-shift keying
0.011980
Packet Radio Performance Over Slow Rayleigh Fading Channels · IEEE Trans. Commun. 1980
Physical-layer communications › fading channels
rayleigh fading
0.011980
Packet Radio Performance Over Slow Rayleigh Fading Channels · IEEE Trans. Commun. 1980
Coding theory › sequences › pseudorandom sequences
feedback shift register sequences
0.011969
Evaluation of the Amplitude Distribution of Quasi-Gaussian Signals Obtained From Pseudorandom Noise · IEEE Trans. Computers 1969

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

multiuser decoding · 0.0throughput analysis · 0.0delay analysis · 0.0statistical analysis · 0.0
YearPublicationVenuePosition
1985 Coding and Decoding for Code Division Multiple User Communication Systems
abstract
A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.
Timothy J. Healy
IEEE Trans. Commun.1
1981 Advanced Automaton For Space Missions
Robert A. Freitas Jr., Timothy J. Healy, James E. Long
IJCAI2
1980 Packet Radio Performance Over Slow Rayleigh Fading Channels
abstract
Expressions for the throughput and average packet delay for a Pure-ALOHA single-hop packet radio system operating in slow Rayleigh fading are derived. For noncoherent frequency-shift-keying (NCFSK), an exact closed form expression is presented. For coherent phase-shift-keying (CPSK) an excellent approximation for large packet sizes is derived. This approximation technique is valid in general for other modulation schemes and for other fading channel statistical characterizations. The packet length which maximizes the useful data throughput in slow Rayleigh fading is found. The results of this investigation indicate that a packet radio system can be designed with a modest link margin for fading and achieve identical throughput performance over a nonfading channel and a fading channel with only a small increase in average packet delay for the fading channel.
Timothy J. Healy
IEEE Trans. Commun.2
1969 Evaluation of the Amplitude Distribution of Quasi-Gaussian Signals Obtained From Pseudorandom Noise
abstract
A method is presented for finding the amplitude distribution of the sum of the contents of more than n stages of a feedback shift register connected with feedback over n stages. The analysis illustrates the causes of the skew distributions observed in practice. Some theoretical results are presented.
John L. Douce, Timothy J. Healy
IEEE Trans. Computers2