1-5hit |
Abdellah KADDAI Mohammed HALIMI
In this paper an algebraic trellis vector quantization (ATVQ) that introduces algebraic codebooks into trellis coded vector quantization (TCVQ) structure is presented. Low encoding complexity and minimum memory storage requirements are achieved using the proposed approach. It exploits advantages of both the TCVQ and the algebraic codebooks to know the delayed decision, the codebook widening, the low computational complexity and the no storage of codebook. This novel vector quantization scheme is used to encode the wideband speech line spectral frequencies (LSF) parameters. Experimental results on wideband speech have shown that ATVQ yields the same performance as the traditional split vector quantization (SVQ) and the TCVQ in terms of spectral distortion (SD). It can achieve a transparent quality at 47 bits/frame with a considerable reduction of memory storage and computation complexity when compared to SVQ and TCVQ.
Sangwon KANG Yongwon SHIN Changyong SON Thomas R. FISCHER
A fast encoding technique is described for vector quantization (VQ) of line spectral frequency parameters. A reduction in VQ encoding complexity is achieved by using a preliminary test that reduces the necessary codebook search range. The test is performed based on two criteria. One criterion uses the distance between a specific single element of the input vector and the corresponding element of the codevectors in the codebook. The other criterion makes use of the ordering property of LSF parameters. The fast encoding technique is implemented in the enhanced variable rate codec (EVRC) encoding algorithm. Simulation results show that the average searching range of the codebook can be reduced by 44.50% for the EVRC without degradation of spectral distortion (SD).
Phu Chien NGUYEN Takao OCHI Masato AKAGI
This paper presents a method of temporal decomposition (TD) for line spectral frequency (LSF) parameters, called "Modified Restricted Temporal Decomposition" (MRTD), and its application to low rate speech coding. The LSF parameters have not been used for TD due to the stability problems in the linear predictive coding (LPC) model. To overcome this deficiency, a refinement process is applied to the event vectors in the proposed TD method to preserve their LSF ordering property. Meanwhile, the restricted second order TD model, where only two adjacent event functions can overlap and all event functions at any time sum up to one, is utilized to reduce the computational cost of TD. In addition, based on the geometric interpretation of TD the MRTD method enforces a new property on the event functions, named the "well-shapedness" property, to model the temporal structure of speech more effectively. This paper also proposes a method for speech coding at rates around 1.2 kbps based on STRAIGHT, a high quality speech analysis-synthesis method, using MRTD. In this speech coding method, MRTD based vector quantization is used for encoding spectral information of speech. Subjective test results indicate that the speech quality of the proposed speech coding method is close to that of the 4.8 kbps FS-1016 CELP coder.
Young-Han CHOE Dong-Ik LEE Sadatoshi KUMAGAI
Basic structural characteristics, which are useful in modular synthesis based on strongly connected state machines, of SMA/LBFC nets are discussed in this paper. A more convincing and direct proof of the equivalence of two structural characterization of the class of Petri nets is given. This proof will give clearer view of the structural characteristics of LBFC/SMA nets. On the other hand, however, the structural characteristics are not practically amenable in application to modular synthesis of SMA nets from a given set of SCSM's since all possible SCSM's should be examined for the verification of the given conditions. The later half of this paper is devoted into strengthening the results, i. e. , in composition of an SMA net from a given set of SCSM's the condition is also satisfied in any SCSM generated by composition.
Kiyoshi SHIMOKOSHI Yoshikatsu SHIRAISHI
Recently as one of attractive applications in the B-ISDN era, LAN/MAN interconnection through an ATM network has been coming up because burstiness of LAN/MAN data traffic is applicable to distinctive features of cell based ATM network. In order to overcome a difference of the connection mode, i.e., CL packet transfer of LAN/MAN and CO cell transfer of ATM network, a number of interworking and bandwidth allocation mechanisms have been proposed. These methods, however, indicate both merits and drawbacks concerning with CL data transfer quality, network resource efficiency and processing overhead in IWU/CLS and the network, and have been mostly evaluated only for a single IWU model. This paper aims at showing the most appropriate method of LAN/MAN interworking for IWU-IWU or IWU-CLSF connection. In the paper, some interworking issues including a general qualitative assessment are clarified. We then evaluate the selected five interworking methods based on Bandwidth Renegotiation (BR) and VC Establishment (VCE), which are combined with Traffic Enforcement Functions (TEFs) based on policing mechanisms and Cell Loss Control (CLC) scheme. By transient and stationary simulation approach for a single IWU and an IWU-CLS connection model, the most applicable method is indicated as a case study from view points of the communication quality, effective use of the bandwidth and processing load.