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

Udar Mittal

dblp:50/4403 · DBLP profile ↗
← Back
12ranked-venue papers
8as first author
0since 2021 · last 2008
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 8 · 5 first-authorArtificial intelligence and machine learning · 4 · 3 first-authorTheory of computation · 2 · 2 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
2 papers
Coding theory · 71% Mathematical optimization · 14% Information theory · 9%
Computer graphics and multimedia
2 papers
Audio and music processing · 82% Image and video processing · 18%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
joint source-channel coding
0.122002
Hybrid digital-analog (HDA) joint source-channel codes for broadcasting and robust communications · IEEE Trans. Inf. Theory 2002
Duality theorems for joint source-channel coding · IEEE Trans. Inf. Theory 2000
Audio and music processing › speech coding
code-excited linear prediction
0.012002
A joint source-channel speech coder using hybrid digital-analog (HDA) modulation · IEEE Trans. Speech Audio Process. 2002
Audio and music processing
speech coding
0.012002
A joint source-channel speech coder using hybrid digital-analog (HDA) modulation · IEEE Trans. Speech Audio Process. 2002
Physical-layer communications › coding theory
joint source-channel coding
0.012002
A joint source-channel speech coder using hybrid digital-analog (HDA) modulation · IEEE Trans. Speech Audio Process. 2002
Coding theory › joint source-channel coding
hybrid digital-analog coding
0.012002
Hybrid digital-analog (HDA) joint source-channel codes for broadcasting and robust communications · IEEE Trans. Inf. Theory 2002
Coding theory › error protection
robust coding
0.012002
Hybrid digital-analog (HDA) joint source-channel codes for broadcasting and robust communications · IEEE Trans. Inf. Theory 2002
Image and video processing › subspace analysis › principal component analysis
karhunen-loeve transform
0.012000
Signal/noise KLT based approach for enhancing speech degraded by colored noise · IEEE Trans. Speech Audio Process. 2000
Audio and music processing › speech enhancement
noise reduction
0.012000
Signal/noise KLT based approach for enhancing speech degraded by colored noise · IEEE Trans. Speech Audio Process. 2000
Audio and music processing
speech enhancement
0.012000
Signal/noise KLT based approach for enhancing speech degraded by colored noise · IEEE Trans. Speech Audio Process. 2000
Mathematical optimization › constrained optimization › duality theory
duality theorem
0.012000
Duality theorems for joint source-channel coding · IEEE Trans. Inf. Theory 2000
Physical-layer communications
channel coding
0.012002
A joint source-channel speech coder using hybrid digital-analog (HDA) modulation · IEEE Trans. Speech Audio Process. 2002
Physical-layer communications › channel coding › error control coding › concatenated codes
turbo codes
0.012002
A joint source-channel speech coder using hybrid digital-analog (HDA) modulation · IEEE Trans. Speech Audio Process. 2002
Distributed computing theory
broadcast
0.012002
Hybrid digital-analog (HDA) joint source-channel codes for broadcasting and robust communications · IEEE Trans. Inf. Theory 2002
Information theory › communication channels › channel models › binary-input channel
binary symmetric channel
0.012000
Duality theorems for joint source-channel coding · IEEE Trans. Inf. Theory 2000

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

listening test · 0.1linear encoding · 0.1turbo codes · 0.0turbo code · 0.0matched tandem coding · 0.0distortion region analysis · 0.0spectral subtraction · 0.0signal subspace approach · 0.0random coding · 0.0karhunen-loeve transform · 0.0duality · 0.0
YearPublicationVenuePosition
2008 Higher layer coding of non-speech like signals using factorial pulse codebook
Udar Mittal, James P. Ashley, Jonathan Gibbs
INTERSPEECH1
2007 Closed Loop Dynamic Bit Allocation for Excitation Parameters in Analysis-by-Synthesis Speech Codec
abstract
A method for dynamically allocating bits for the adaptive and fixed codebook of an analysis-by-synthesis speech codec is proposed. The bit allocation is based on the closed loop weighted mean squared error. The different bit allocations identify various codebook configurations used by the adaptive and fixed codebooks of the codec. Unlike open loop approaches where the decision on a codebook configuration is made once per frame, in the closed loop approach the decision on which codebook configuration should be used is made in each subframe. A variable length code is used for coding the codebook configuration. The factorial packing codebook is used as the fixed codebook. The technique is a part of 8.5 kbps mode of EVRC-WB speech coding standard.
James P. Ashley, Udar Mittal
ICASSP (4)2
2007 Low Complexity Factorial Pulse Coding of MDCT Coefficients using Approximation of Combinatorial Functions
abstract
Factorial pulse coding, a method which is known to efficiently code an information signal using unit magnitude pulses, involves computation of combinatorial functions. These computations are highly complex as they require many multiply and divide operations on multi-precision numbers, especially when the length of a signal is large or many unit magnitude pulses are used for coding. In this paper, we propose a very low complexity method for approximation of these combinatorial functions. The approximate functions satisfy a property which preserves unique decode-ability of the factorial packing encoding/decoding algorithm. The low complexity computation enables use of factorial packing in encoding/decoding of 144 MDCT coefficients using 28 unit magnitude pulses for the audio coding mode of the EVRC-WB speech coding standard without affecting the number of bits required for coding.
Udar Mittal, James P. Ashley, Edgardo M. Cruz-Zeno
ICASSP (1)1
2005 A Technique of Multi-Tap Long Term Predictor (LTP) Filter Using Sub-Sample Resolution Delay
abstract
The method of a 1/sup st/ order long-term predictor (LTP) filter, using a sub-sample resolution delay, is extended to a multi-tap LTP filter, or, equivalently, the conventional integer-sample resolution multi-tap LTP filter is extended to use sub-sample resolution delay. Defining the delay with sub-sample resolution enables this novel multi-tap LTP filter to explicitly model delay values that have a fractional component. The filter coefficients, largely freed from implicitly modeling the effect of delays that have a fractional component, seek to maximize the prediction gain of the LTP filter by modeling the frequency dependent gain. This is in contrast to a conventional multitap LTP filter, which applies a single model to tackle the dual tasks of representing the non-integer valued delays and the frequency dependent gain. Experimental results are presented for narrowband and wideband speech. This technique is part of the 3GPP2 source-controlled variable-rate multimode wideband speech codec (VMR-WB) rate set 1 standard.
Mark A. Jasiuk, Tenkasi Ramabadran, Udar Mittal, James P. Ashley, Michael J. McLaughlin
ICASSP (1)3
2005 Joint Optimization of Excitation Parameters in Analysis-By-Synthesis Speech Coders Having Multi-Tap Long Term Predictor
abstract
Codebook searches in analysis-by-synthesis speech coders typically involve minimization of a perceptually weighted squared error signal. Minimization of the error over multiple codebooks is often done in a sequential manner, resulting in the choice of overall excitation parameters being sub-optimal. In this paper, we propose a joint excitation parameter optimization framework in which the associated complexity is slightly greater than the traditional sequential optimization, but with significant quality improvement. Moreover, the framework allows joint optimization to be easily incorporated into existing pulse codebook systems with little or no impact on the codebook search algorithms. This technique is part of the 3GPP2 source-controlled variable-rate multimode wideband speech codec (VMR-WB) rate set 1 standard.
Udar Mittal, James P. Ashley, Edgardo M. Cruz-Zeno, Mark A. Jasiuk
ICASSP (1)1
2003 Low complexity joint optimization of excitation parameters in analysis-by-synthesis speech coding
Udar Mittal, James P. Ashley, Edgardo M. Cruz-Zeno
INTERSPEECH1
2002 A joint source-channel speech coder using hybrid digital-analog (HDA) modulation
abstract
A joint source-channel coding system for transmitting speech on a bandlimited additive white Gaussian noise (AWGN) channel is presented. The proposed method uses a hybrid of digital and analog modulation techniques. The digital part of the system consists of a Federal Standard 1016 code-excited linear predictive (FS 1016 CELP) speech coder followed by a rate-3/5 parallel concatenated (turbo) error correcting code. The analog part, which transmits the quantization error due to the FS 1016 CELP coder, consists of a linear encoder and decoder. The advantage of the proposed system is that it achieves excellent rate-distortion/capacity performance that is common in digital systems while maintaining a "graceful degradation" characteristic that is common in analog systems. Comparisons are made with three purely digital systems and an analog system-with all systems operating at the same overall rate. A formal listening test shows that, at high channel SNR, the improved performance of the proposed hybrid system (versus the purely digital systems) is noticeable to the average listener. Finally, an informal listening test indicates that at low channel SNR (where the error correcting code breaks down) the decoded speech of the hybrid system is still intelligible.
Nam C. Phamdo, Udar Mittal
IEEE Trans. Speech Audio Process.2
2002 Hybrid digital-analog (HDA) joint source-channel codes for broadcasting and robust communications
abstract
We consider the problem of transmitting a band-limited Gaussian source on an additive band-limited Gaussian noise channel. The well-known "threshold effect" dictates that the more powerful a code is, the more sensitive it is to the exact knowledge of the channel noise. A code is said to be robust if it is asymptotically optimal for a wide range of channel noise. Thus, robust codes have a "graceful degradation" characteristic and are free of the threshold effect. It is demonstrated that robust codes exist whenever the source and channel bandwidths are equal. In the unequal-bandwidth case, a collection of nearly robust joint source-channel codes is constructed using a hybrid digital-analog (HDA) coding technique. For designing nearly robust codes, a matched tandem code whose channel encoder's output is partially/fully matched to its input is proposed and the existence of an asymptotically optimal matched tandem code is shown. The nearly robust codes achieve the Shannon limit (theoretically optimum distortion) and have a less severe threshold effect. Finally, for the case of two different noise conditions, the distortion regions of these codes are determined.
Udar Mittal, Nam C. Phamdo
IEEE Trans. Inf. Theory1
2000 Signal/noise KLT based approach for enhancing speech degraded by colored noise
abstract
A signal/noise KLT based approach for enhancing speech degraded by colored noise is proposed. The noisy speech frames are classified into speech-dominated frames and noise-dominated frames. In the speech-dominated frames, the signal KLT matrix is used and in the noise-dominated frames, the noise KLT matrix is used. The approach does not require noise whitening and hence works well even with narrowband noise. A two-dimensional objective measure which captures both the speech distortion and the noise shaping characteristics of the algorithm is proposed. This measure indicates that the proposed method performs better noise shaping than a modified version of the signal subspace approach proposed by Ephraim and Van Trees and the standard spectral subtraction method. Informal listening tests show that the proposed algorithm does not suffer from the problem of residual musical noise and performs better noise masking than the signal subspace approach.
Udar Mittal, Nam C. Phamdo
ICASSP1
2000 A CELP-based hybrid digital-analog (HDA) joint source-channel speech coder
abstract
A joint source-channel coding system for transmitting speech on a bandlimited additive white Gaussian noise (AWGN) channel is presented. The proposed method uses a hybrid of digital and analog modulation techniques. The digital part of the system consists of an FS-1016 CELP speech coder followed by a rate-3/5 parallel concatenated (turbo) error correcting code. The analog part, which transmits the quantization error due to the FS-1016 CELP coder consists of a linear encoder and decoder. The advantage of the proposed system is that it achieves excellent rate-distortion/capacity performance that is common in digital systems while maintaining a "graceful degradation" characteristic that is common in analog systems. Comparisons are made with three purely digital systems and two purely analog systems. A formal listening test shows that, at high channel SNR, the improved performance of the proposed hybrid system versus the purely digital systems is noticeable to the average listener.
Nam C. Phamdo, Udar Mittal
ICASSP2
2000 Signal/noise KLT based approach for enhancing speech degraded by colored noise
abstract
A signal/noise Karhunen-Loeve transform (KLT) based approach for enhancing speech degraded by colored noise is proposed. The noisy speech frames are classified into speech-dominated frames and noise-dominated frames. In the speech-dominated frames, the signal KLT matrix is used and in the noise dominated frames, the noise KLT matrix is used. The approach does not require noise whitening and hence works well even with narrowband noise. A two-dimensional objective measure which captures both the speech distortion and the noise shaping characteristics of the algorithm is proposed. This measure indicates that the proposed method performs better noise shaping than a modified form of the signal subspace approach proposed by Ephraim and Van Trees (1995) and the standard spectral subtraction method. Informal listening tests show that the proposed algorithm does not suffer from the problem of residual musical noise and performs better noise masking than the signal subspace approach.
Udar Mittal, Nam C. Phamdo
IEEE Trans. Speech Audio Process.1
2000 Duality theorems for joint source-channel coding
abstract
We consider joint source-channel coding for a memoryless Gaussian source and an additive white Gaussian noise (AWGN) channel. For a given code defined by an encoder-decoder pair (/spl alpha/, /spl beta/), its dual code is obtained by interchanging the encoder and decoder: (/spl beta/, /spl alpha/). It is shown that if a code (/spl alpha/, /spl beta/) is optimal at rate p channel uses per source sample and if it satisfies a certain uniform continuity condition, then its dual code (/spl beta/, /spl alpha/) is optimal for rate 1//spl rho/ channel uses per source sample. Further, it is demonstrated that there is a code which is optimal but its dual code is not optimal. Finally, using random coding, we show that there is an optimal code which has an optimal dual. The duality concept is also presented for the cases of (i) binary memoryless equiprobable source and binary-symmetric channel (BSC), and (ii) colored Gaussian source and additive colored Gaussian noise (ACGN) channel.
Udar Mittal, Nam C. Phamdo
IEEE Trans. Inf. Theory1