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

Satoshi Ujita

dblp:29/3745 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Theory 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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coded modulation
modulation codes
0.011993
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › coded modulation
multilevel coding
0.011993
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
multistage decoding
0.011993
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis · IEEE Trans. Inf. Theory 1993

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

union bound analysis · 0.0soft-decision decoding · 0.0
YearPublicationVenuePosition
1993 Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis
abstract
Multistage decoding of multilevel block multilevel phase-shift keying (M-PSK) modulation codes for the additive white Gaussian noise (AWGN) channel is investigated. Several types of multistage decoding, including a suboptimum soft-decision decoding scheme, are devised and analyzed. Upper bounds on the probability of an incorrect decoding of a code are derived for the proposed multistage decoding schemes. Error probabilities of some specific multilevel block 8-PSK modulation codes are evaluated and simulated. The computation and simulation results for these codes show that with multistage decoding, significant coding gains can be achieved with large reduction in decoding complexity. In one example, it is shown that the difference in performance between the proposed suboptimum multistage soft-decision decoding and the single-stage optimum decoding is small, only a fraction of a dB loss in SNR at the block error probability of 10/sup -6/.>
Toyoo Takata, Satoshi Ujita, Tadao Kasami, Shu Lin 0001
IEEE Trans. Inf. Theory2