메뉴 건너뛰기




Volumn 5, Issue , 2003, Pages 3619-3623

Low complexity channel error mitigation for distributed speech recognition over wireless channels

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; NETWORK PROTOCOLS; SPEECH RECOGNITION; VECTOR QUANTIZATION;

EID: 0038648975     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 0038782368 scopus 로고    scopus 로고
    • Distributed speech recognition; front-end feature extraction algorithm; compression algorithms
    • April
    • Distributed speech recognition; front-end feature extraction algorithm; compression algorithms, ETSI Standard 201 108 v1.1.2, April 2000.
    • (2000) ETSI Standard 201 108 V1.1.2
  • 2
    • 0038782367 scopus 로고    scopus 로고
    • Enabling new speech driven services for mobile devices: An overview of the ETSI standards activities for distributed speech recognition front-ends
    • San Jose, USA
    • D. Pierce, "Enabling new speech driven services for mobile devices: An overview of the ETSI standards activities for distributed speech recognition front-ends," in AVIOS 2000: The Speech Applications Conference, San Jose, USA, 2000.
    • (2000) AVIOS 2000: The Speech Applications Conference
    • Pierce, D.1
  • 4
    • 85009096663 scopus 로고    scopus 로고
    • Graceful degradation of speech recognition performance over lossy packet networks
    • Aalborg, Denmark, Sept.
    • E. A. Riskin, C. Boulis, S. Otterson, and M. Ostendorf, "Graceful degradation of speech recognition performance over lossy packet networks," in Proc. of EUROSPEECH-2001, Aalborg, Denmark, Sept. 2001, pp. 2715-2718.
    • (2001) Proc. of EUROSPEECH-2001 , pp. 2715-2718
    • Riskin, E.A.1    Boulis, C.2    Otterson, S.3    Ostendorf, M.4
  • 6
    • 85009061060 scopus 로고    scopus 로고
    • Joint channel decoding - Viterbi recognition for wireless applications
    • Aalborg, Denmark, Sept.
    • A. Bernard and A. Alwan, "Joint channel decoding - Viterbi recognition for wireless applications," in Proc. of EUROSPEECH-2001, Aalborg, Denmark, Sept. 2001, pp. 2703-2706.
    • (2001) Proc. of EUROSPEECH-2001 , pp. 2703-2706
    • Bernard, A.1    Alwan, A.2
  • 7
    • 85009089779 scopus 로고    scopus 로고
    • MMSE-based channel error mitigation for distributed speech recognition
    • Aalborg, Denmark, Sept.
    • A. M. Peinado, V. Sánchez, J. C. Segura, and J. L. Pérez-Córdoba, "MMSE-based channel error mitigation for distributed speech recognition," in Proc. of EUROSPEECH-2001, Aalborg, Denmark, Sept. 2001, pp. 2707-2710.
    • (2001) Proc. of EUROSPEECH-2001 , pp. 2707-2710
    • Peinado, A.M.1    Sánchez, V.2    Segura, J.C.3    Pérez-Córdoba, J.L.4
  • 8
    • 0038105303 scopus 로고    scopus 로고
    • HMM-based channel error mitigation and its application to distributed speech recognition
    • submitted for publication
    • A. M. Peinado, V. Sánchez, J. L. Pérez-Cordoba, and A. de la Torre, "HMM-based channel error mitigation and its application to distributed speech recognition," Speech Communication, submitted for publication.
    • Speech Communication
    • Peinado, A.M.1    Sánchez, V.2    Pérez-Cordoba, J.L.3    De la Torre, A.4
  • 9
    • 0029254498 scopus 로고
    • The performance of Reed-Solomon codes on a bursty-noise channel
    • Feb./Mar./Apr.
    • W. J. Ebel and W. H. Tranter, "The performance of Reed-Solomon codes on a bursty-noise channel," IEEE Transactions on Communications, vol. 43, pp. 298-306, Feb./Mar./Apr. 1995.
    • (1995) IEEE Transactions on Communications , vol.43 , pp. 298-306
    • Ebel, W.J.1    Tranter, W.H.2
  • 10
    • 0034447066 scopus 로고    scopus 로고
    • Source optimized channel codes (SOCCs) for parameter protection
    • Sorrento, Italy, June
    • S. Heinen and P. Vary, "Source optimized channel codes (SOCCs) for parameter protection," in Proc. IEEE Int. Symp. on Information Theory, Sorrento, Italy, June 2000, pp. 265-271.
    • (2000) Proc. IEEE Int. Symp. on Information Theory , pp. 265-271
    • Heinen, S.1    Vary, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.