Transform domain technique for windowing the DCT and DST

Sherlock, Barry G.; Kakad, Y. P.

doi:10.1016/s0016-0032(01)00058-8

Cited by 8 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computation of running ODCT and ODST based on independent update algorithm is expected to provide certain advantages over simultaneous update algorithm proposed by Murthy and Swamy [2], and Sherlock and Kakad [6] for EDCT/EDST. The comparison is done on the basis of total number of operations (multiplications and additions) used for the computation of transform coefficients for rpoint updated data.…”

Section: Performance Analysismentioning

confidence: 99%

“…Update algorithm initially developed was limited to onepoint update at a time [3,4]. Later algorithms for r-point, 1 ≤ r ≤ N −1, and update for DCT, and DST were developed [5,6] but all these algorithms needed simultaneous update of DCT and DST coefficients, that is, to compute the updated DCT coefficients, the DST coefficients need to be calculated simultaneously and vice versa. Thereafter, independent update algorithms were developed in [5] based on secondorder shift properties of DCT and DST coefficients, these algorithms were limited to one-point update for even discrete cosine transform (EDCT) and even discrete sine transform (EDST).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Algorithm for ODCT Computation of a Running Data Sequence

Akhter

Karwal²,

Jain³

2012

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

Fast windowed update algorithms capable of independently updating the odd discrete cosine transform (ODCT) and odd discrete sine transform (ODST) of a running data sequence are analytically developed. In this algorithm, to compute the ODCT coefficients of a real-time sequence, we do not require the ODST coefficients. Similarly, the ODST coefficients of the shifted sequence can be calculated without using ODCT coefficients. The running input data sequence is sampled using a rectangular window. However, this idea can be easily extended for other windows. The update algorithm derived herein can be used to compute the transform coefficients of the shifted sequence as new data points are available. The complexity of developed algorithm isO(N). The validity of algorithm is tested by MATLAB simulations.

show abstract

Section: Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Improved Algorithm for ODCT Computation of a Running Data Sequence

Akhter

Karwal²,

Jain³

2012

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

show abstract

“…Even though fast ways (Britanak & Rao 2002;Chau & Siu 2003;Sherlock & Kakad 2002), all of them can also be used to make a structure to save processing time for the generation of the same discrete time speech signal. Various windows can be directly used in the transform domain for the discrete cosine transform in order to minimize the edge effects caused by implicit symmetries in the transform domain that are not replicated in the real world data (Britanak 2003).…”

Section: Date Of Submissionmentioning

confidence: 99%

ASM Sci. J., Vol. 1, No. 2, 2007

Liki

2007

ASMScJ

View full text Add to dashboard Cite

We are in an era where information and communications technology (ICT) pervades every sphere of our lives and ithas an impact on every sphere of knowledge and technology and their advancement and acquisition. Hence it is notsurprising that ICT related issues dominate the pages of the second issue of the ASM Science Journal. The articles showthat computational techniques, procedures, modelling, simulations, and statistical analyses are effectively employed tosolve a myriad of scientific problems related to communication of sound, vehicle seat assembly line, analysis of speechsignal generation and colour coding.In addition, this issue carries a review on the future direction of agriculture in sustaining productivity without degradingthe environment.Related to agriculture are the food security issue and the current food crisis. This leads us to the question: How do weput ICT to better use, interweaving it into relevant scientific research, policy prescriptions and implementation plans, thusproviding solutions, in large or small part, to the current food crisis? This crisis stems not only from a lack of supply butalso, inter alia, from inefficient distribution, inequitable ownership of land, and, recently, elements of speculative trading.How can ICT contribute to solving these problems in a scenario where agriculture is becoming less resource-intensiveand more knowledge-intensive against a backdrop of the need to induce agriculture and agriculture-related activities togenerate more income, create more jobs and, of course, produce more food? The world community at large will be wellserved by an ICT community that extends its focus to these questions.Also found in the pages of this issue is a report on the education programme associated with the national Angkasawan(astronaut) project. The education programme, led by the Academy of Sciences Malaysia, was carefully conceived and wellco-ordinated, spanning a few years and involving many teachers, academics and space scientists who prepared the lessonplans for schools. Unfortunately its execution was far from ideal.Had the full aspirations and objectives of the programme been met, much of the negative perception on the scientific aspectsof the Angkasawan project could have been averted. The plan called for the media, public and students to be systematicallyand consistently educated and informed of the substantive scientific elements of the activities the Angkasawan carried outat the International Space Station. A million school children were targetted, all of them directly engaged in the classroomat the cognitive level under the supervision of teachers, which would have ensured that the Angkasawan project had anoptimal impact on the country, both in the short- and long-term. The final number of school children who eventuallymanaged to get directly involved with the project through the education programme remains to be tallied.We are also proud to profile the winners of the 2006 Mahathir Science Award. Not least for the fact that they are homegrown researchers, solving a problem of immense gravity under challenging circumstances. Perhaps their success storycould lead to the establishment of a national disease crisis centre of sorts, something the Academy has always advocatedand Tun Mahathir himself has referred to on several occasions.A journal is only as good as those who contribute to it. And ASM is definitely not shortof supporters, particularly from the local research organisations. The bigquestion is how do we sustain our efforts to produce a journal worthy ofeventually being included in the ranks of other world class journals? Toachieve this we need nothing less than a scientific community heaven-benton continuously striving to produce the best research results on Earth.

show abstract

“…The recursive implementation for the computation of DCT and DST are presented and their recursive structure is also presented for their simultaneous computation [11]. An algorithm is developed to apply various windows in the transform domain for DCT and DST [12]. A new recursive algorithm for the DST contains a derived very regular structure [13] and a DCT is implemented to realize the input data bit serially [14].…”

Section: Introductionmentioning

confidence: 99%

Comparative evaluation of transform domain speech compression techniques

Arif

Anand

2012

2012 International Conference on Communication, Information &Amp; Computing Technology (ICCICT)

View full text Add to dashboard Cite

In this paper, a comparison is made among the peiformance of transform domain techniques with respect to various performance parameters of speech signal. The speech signal is taken from the International Phonetic Alphabet data base in the category of a Narrative of the French language and then the computation of compression ratio is carried out by setting appropriate threshold values in all the transform domain techniques. After that, the other speech signal parameters such as mean square error, signal 0 noise ratio, peak signal to noise ratio and normalized root mean square error are computed at the decoder end. The results shown indicate that the peiformance of the discrete sine transform is better than the discrete cosine transform and fast Fourier transform in terms of compression ratio and other computed speech signal parameters.

show abstract

Transform domain technique for windowing the DCT and DST

Cited by 8 publications

References 12 publications

Improved Algorithm for ODCT Computation of a Running Data Sequence

Improved Algorithm for ODCT Computation of a Running Data Sequence

ASM Sci. J., Vol. 1, No. 2, 2007

Comparative evaluation of transform domain speech compression techniques

Contact Info

Product

Resources

About