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

Jotaro Ikedo

dblp:37/2985 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 1Computer networks · 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.

Computer graphics and multimedia
1 paper
Audio and music processing · 100%
Computer networks
1 paper
Content delivery and video streaming · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing › speech coding
code-excited linear prediction
0.011995
Design of a Pitch Synchronous Innovation CELP Coder for Mobile Communications · IEEE J. Sel. Areas Commun. 1995
Audio and music processing
speech coding
0.011995
Design of a Pitch Synchronous Innovation CELP Coder for Mobile Communications · IEEE J. Sel. Areas Commun. 1995
Content delivery and video streaming › source coding
speech coding
0.011995
Design of a Pitch Synchronous Innovation CELP Coder for Mobile Communications · IEEE J. Sel. Areas Commun. 1995

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

linear predictive coding · 0.0codebook search · 0.0
YearPublicationVenuePosition
2004 Measuring the perceived importance of time- and frequency-divided speech blocks for transmitting over packet networks
abstract
This paper presents a way to calculate the perceived importance of speech segments as a single value criterion, using a linear regression model. Unlike the commonly used voice activity detection (VAD) algorithms, this method allows us to obtain a finer priority granularity of speech segments. This can be used in conjunction with frequency scalable speech coding techniques and IP QoS techniques to achieve efficient and qualitycontrolled voice transmission. A simple linear regression model is used to calculate the estimated mean opinion score (MOS) of the various cases of missing speech segments.
Akitoshi Kataoka, Yusuke Hiwasaki, Toru Morinaga, Jotaro Ikedo
INTERSPEECH4
1996 Dual-Pulse CS-CELP: a toll-quality low-complexity speech coder at 7.8 kbit/s
abstract
Low-cost highly-efficient speech coding is important for personal multimedia communications. In this paper we propose a new low-complexity speech coding method called "Dual-Pulse CS-CELP (DP-CS-CELP)" at 7.8 kbit/s. This method is based on ITU-T G.729. To reduce the complexity, we applied a new excitation model to the random code vectors and simplified the LPC coding, adaptive codebook search, perceptual weighting, and the other structures. The number of operations for this encoder is 3.80 MOPS, which achieves real-time speech coding and decoding on personal computers. Although the efficiency of this coder is a little lower than that of G.729, the MOS listening test showed that the subjective quality was equivalent to or a little better than that of G.726 (32-kbit/s ADPCM).
Hitoshi Ohmuro, Jotaro Ikedo, Takehiro Moriya, Akitoshi Kataoka, Shinji Hayashi, Kazunori Mano
ICASSP2
1995 Improved CS-CELP speech coding in a noisy environment using a trained sparse conjugate codebook
abstract
A high-quality 8-kbit/s speech coder based on conjugate structure CELP (CS-CELP) is proposed that uses a trained sparse conjugate codebook. The trained sparse conjugate codebook improves speech quality for noisy speech. This codebook consists of two sub-codebooks and each sub-codebook consists of a random component and a trained component. Each component has excitation vectors consisting of a few pulses. In the random component, pulse position and amplitude are determined randomly. The trained component is determined by training. Subjective tests (differential mean opinion score, DMOS and mean opinion score, MOS) indicated that this codebook improves speech quality compared with the conventional trained codebook for noisy speech. The MOS showed that the quality of improved CS-CELP is equivalent to that of the 32-kbit/s ADPCM for clean speech.
Akitoshi Kataoka, Sachiko Hosaka, Jotaro Ikedo, Takehiro Moriya, Shinji Hayashi
ICASSP3
1995 Design of a Pitch Synchronous Innovation CELP Coder for Mobile Communications
abstract
This paper describes the design of a speech coder called pitch synchronous innovation CELP (PSI-CELP) for low hit-rate mobile communications. PSI-CELP is based on CELP, but has more adaptive excitation structures. In voiced frames, instead of conventional random excitation vectors, PSI-CELP converts even the random excitation vectors to have pitch periodicity by repeating stored random vectors as well as by using an adaptive codebook, in silent, unvoiced, and transient frames, the coder stops using the adaptive codebook and switches to fixed random codebooks. The PSI-CELP coder also implements novel structures and techniques: an FIR-type perceptual weighting filter using unquantized LPC parameters, a random codebook with a conjugate structure trained to be robust against channel errors, codebook search with delayed decision, a gain quantization with sloped amplitude, and a moving average prediction coding of LSP parameters, Our speech coder is implemented by DSP chips. Its coded speech quality at 3.6 kb/s with 2.0 kb/s redundancy is comparable to that of the Japanese full-rate VSELP coder at 6.7 kb/s with 4.5 kb/s redundancy. The basic structure of this PSI-CELP coder has been chosen as the Japanese half-rate speech codec for digital cellular telecommunications.>
Kazunori Mano, Takehiro Moriya, Satoshi Miki, Hitoshi Ohmuro, Kazunaga Ikeda, Jotaro Ikedo
IEEE J. Sel. Areas Commun.6