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

Frank Norden

dblp:63/5588 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 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 graphics and multimedia
2 papers
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing
speech coding
0.122007
Memory-Based Vector Quantization of LSF Parameters by a Power Series Approximation · IEEE Trans. Speech Audio Process. 2007
Time evolution in LPC spectrum coding · IEEE Trans. Speech Audio Process. 2004
Audio and music processing › speech coding
line spectral frequency quantization
0.112007
Memory-Based Vector Quantization of LSF Parameters by a Power Series Approximation · IEEE Trans. Speech Audio Process. 2007
Audio and music processing › speech coding
linear predictive coding
0.012004
Time evolution in LPC spectrum coding · IEEE Trans. Speech Audio Process. 2004

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

safety-net quantization · 0.1predictive vector quantization · 0.1finite-state vector quantization · 0.1source-filter model · 0.0
YearPublicationVenuePosition
2007 Memory-Based Vector Quantization of LSF Parameters by a Power Series Approximation
abstract
In this paper, memory-based quantization is studied in detail. We propose a new framework, power series quantization (PSQ), for memory-based quantization. With linear spectral frequency (LSF) quantization as the application, several common memory-based quantization methods (FSVQ, predictive VQ, VPQ, safety-net, etc.) are analyzed and compared with the proposed method, and it is shown that the proposed method performs better than all other tested methods. The proposed PSQ method is fully general, in that it can simulate all other memory-based quantizers if it is allowed unlimited complexity
Thomas Eriksson, Frank Norden
IEEE Trans. Speech Audio Process.2
2004 Time evolution in LPC spectrum coding
abstract
Many current speech coders use a source-filter model in which the signal is decomposed on a frame-wise basis into an excitation component and a filter component. The filter component is then parameterized and coded by a separate spectrum encoder. The performance of such spectrum encoders is often evaluated in terms of a spectral distortion measure that treats each frame independently. Doing this therefore neglects the time evolution of quantization errors. In this paper, we focus on the time evolution of spectrum vectors in speech spectrum coding. We show that the human auditory system prefers a slowly evolving spectrum quantization noise, resulting in smooth spectrum trajectories. This result is the basis for a new distortion criterion for spectrum coding which introduces interframe memory into the standard spectral distortion measure, thereby having the ability to penalize a poor spectrum evolution. Further, a number of coding schemes for explicit spectrum evolution control are evaluated, and we show gains in the order of 2-4 bits, compared to schemes with no evolution control.
Frank Norden, Thomas Eriksson
IEEE Trans. Speech Audio Process.1