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

David K. Asano

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

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

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

Computer networks
3 papers
Physical-layer communications · 100%
Theoretical computer science
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.022002
Optimization of coded GMSK systems · IEEE Trans. Inf. Theory 2002
Phase smoothing functions for continuous phase modulation · IEEE Trans. Commun. 1994
Physical-layer communications › modulation › continuous phase modulation
GMSK
0.012002
Optimization of coded GMSK systems · IEEE Trans. Inf. Theory 2002
Coding theory
channel coding
0.012002
Optimization of coded GMSK systems · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes
convolutional codes
0.012002
Optimization of coded GMSK systems · IEEE Trans. Inf. Theory 2002
Physical-layer communications › modulation
coded modulation
0.011997
Serial unequal error-protection codes based on trellis-coded modulation · IEEE Trans. Commun. 1997
Physical-layer communications › modulation › coded modulation
trellis-coded modulation
0.011997
Serial unequal error-protection codes based on trellis-coded modulation · IEEE Trans. Commun. 1997
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.011997
Serial unequal error-protection codes based on trellis-coded modulation · IEEE Trans. Commun. 1997
Coding theory › error-correcting codes
unequal error protection
0.011997
Serial unequal error-protection codes based on trellis-coded modulation · IEEE Trans. Commun. 1997
Physical-layer communications › modulation
continuous phase modulation
0.011994
Phase smoothing functions for continuous phase modulation · IEEE Trans. Commun. 1994
Physical-layer communications
signal design
0.011994
Phase smoothing functions for continuous phase modulation · IEEE Trans. Commun. 1994

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

suboptimal demodulation · 0.1bandwidth tradeoff · 0.1
YearPublicationVenuePosition
2002 Optimization of coded GMSK systems
abstract
In this article, block and convolutional coding for Gaussian minimum shift keying (GMSK) in additive white Gaussian noise (AWGN) channels is investigated. The performance improvement that can be obtained without an increase in bandwidth is found for block and convolutional codes with various block lengths and constraint lengths, respectively, when a simple suboptimal demodulation scheme is used. For a fixed system transmission bandwidth, the tradeoff between the percentage of bandwidth to use for coding and the percentage to use for modulation is examined and optimized for various values of bandwidth.
David K. Asano, Subbarayan Pasupathy
IEEE Trans. Inf. Theory1
1997 Serial unequal error-protection codes based on trellis-coded modulation
abstract
Unequal error-protection (UEP) codes that are designed using trellis-coded modulation (TCM) are proposed for use with a single data stream consisting of information with two levels of importance. To achieve UEP, the proposed scheme encodes the data according to the importance of the information by switching between two codes which use different signal constellations. Using simple trellis codes, it is shown that the error rate of the important information is lower than the error rate for an equivalent equal error-protection scheme.
David K. Asano, Ryuji Kohno
IEEE Trans. Commun.1
1994 Phase smoothing functions for continuous phase modulation
abstract
In this paper, the problem of signal design for continuous phase modulation is examined. Using the performance measures of effective bandwidth and minimum distance, "optimal" signal shapes are calculated for various receiver observation intervals for full and partial response signalling. For the partial response case, the optimization could only be done for receiver observation interval of one symbol due to the difficulty of the optimization. Therefore, a family of signals based on previously calculated optimal signals is introduced. The tradeoffs that result between bandwidth and bit error rate are then compared as a function of the receiver observation interval and as a function of the memory length of the signalling scheme. Then, the signals introduced in this paper are compared to well known signals in terms of their effective bandwidth-minimum distance tradeoffs, power spectra and percent-in-band-power. The signals obtained by the optimization process are found to have good spectral properties in relation to well known signals.>
David K. Asano, Harry Leib, Subbarayan Pasupathy
IEEE Trans. Commun.1