• Title/Summary/Keyword: algorithmic complexity

Search Result 21, Processing Time 0.017 seconds

A Candidate Codec Algorithm on Superwideband Extension to ITU-T G.711.1 and G.722 (ITU-T G.711.1 및 G.722 슈퍼와이드밴드 확장 후보 코덱 알고리즘)

  • Sung, Jong-Mo;Kim, Hyun-Woo;Kim, Do-Young;Lee, Byung-Sun;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.5
    • /
    • pp.62-73
    • /
    • 2010
  • In this paper we proposed a candidate algorithm on G.711.1 and G.722 superwideband extension codec which is under standardization by ITU-T. The proposed codec not only provides an interoperable bitstream with ITU-T G.711.1 and G.722, but also encodes a superwideband signal with a bandwidth of 50-14,000 Hz using superwideband extension layer. The candidate codec consists of a core layer to provide an interoperability with conventional wideband codecs and superwideband extension layer using linear prediction-based sinusoidal coding. The proposed extension codec operates on 5ms frame and provides four superwideband bitrates of 64, 80, 96, and 112 kbit/s depending on the core codec. Since the resulting bitstream has an embedded structure, it can be converted into core bitstream by simple truncation without transcoding. The proposed codec has a short algorithmic delay and low complexity and passed the qualification test of G.711.1 and G.722 superwideband extension codec performed by ITU-T.