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.

Knut C. Aas

dblp:68/692 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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.

Theoretical computer science
1 paper
Coding theory · 60% Information theory · 40%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › filtering
filter banks
0.011996
Minimum mean-squared error transform coding and subband coding · IEEE Trans. Inf. Theory 1996
Information theory › estimation theory › mean-square estimation
minimum mean-square error
0.011996
Minimum mean-squared error transform coding and subband coding · IEEE Trans. Inf. Theory 1996
Coding theory
source coding
0.011996
Minimum mean-squared error transform coding and subband coding · IEEE Trans. Inf. Theory 1996
Coding theory › source coding › transform coding
subband coding
0.011996
Minimum mean-squared error transform coding and subband coding · IEEE Trans. Inf. Theory 1996
Coding theory › source coding
transform coding
0.011996
Minimum mean-squared error transform coding and subband coding · IEEE Trans. Inf. Theory 1996

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

singular value decomposition · 0.0power spectrum analysis · 0.0eigenvalue decomposition · 0.0
YearPublicationVenuePosition
1996 Minimum mean-squared error transform coding and subband coding
abstract
Knowledge of the power spectrum of a stationary random sequence can be used for quantizing the signal efficiently and with minimum mean-squared error. A multichannel filter is used to transform the random sequence into an intermediate set of variables that are quantized using independent scalar quantizers, and then inverse-filtered, producing a quantized version of the original sequence. Equal word-length and optimal word-length quantization at high bit rates is considered. An analytical solution for the filter that minimizes the mean-squared quantization error is obtained in terms of its singular value decomposition. The performance is characterized by a set of invariants termed second-order modes, which are derived from the eigenvalue decomposition of the matrix-valued power spectrum. A more general rank-reduced model is used for decreasing distortion by introducing bias. The results are specialized to the case when the vector-valued time series is obtained from a scalar random sequence, which gives rise to a filter bank model for quantization. The asymptotic performance of such a subband coder is derived and shown to coincide with the asymptotic bound for transform coding. Quantization employing a single scalar pre- and postfilter, traditional transform coding using a square linear transformation, and subband coding in filter banks, arise as special cases of the structure analyzed here.
Knut C. Aas, Clifford T. Mullis
IEEE Trans. Inf. Theory1