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

João B. Bezerra

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

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

Theory 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
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 50% Automata and formal languages · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal processing for communications › spectral analysis
signal spectrum analysis
0.011986
Spectral analysis of Q -ary digital signals encoded by P -ary convolutional codes · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes
convolutional codes
0.011986
Spectral analysis of Q -ary digital signals encoded by P -ary convolutional codes · IEEE Trans. Inf. Theory 1986
Automata and formal languages › finite automata › sequential machines
mealy machine
0.011986
Spectral analysis of Q -ary digital signals encoded by P -ary convolutional codes · IEEE Trans. Inf. Theory 1986
YearPublicationVenuePosition
1986 Spectral analysis of Q -ary digital signals encoded by P -ary convolutional codes
abstract
A method for spectral calculation ofq-ary digital signals encoded byp-ary convolutional codes is developed. We have assumed a parallel encoding process such that for a code with ratek/nand constraint lengthm, the encoder can be modeled as a Mealy machine ofkinputs,noutputs, and(m - 1) kq-ary memory cells. From this model and from the generator matrix of the code, the characterizing matrices of the Mealy machine are found in a straightforward way. Two assumptions are made on the statistics of the input signal. 1) The input sequence is a wide-sense stationary vector process of dimensionk. 2) The input vectors are statistically independent. With these assumptions and from the characterizing matrices of the Mealy machine, the method developed by Cariolaro and Tronca can be readily used. The continuous and discrete components of the spectrum of the coded signal are expressed in matrix form, which is particularly appropriate for computer programming.
João B. Bezerra, Dalton Soares Arantes
IEEE Trans. Inf. Theory1