In this paper, the mapping between discrete cosine transform of types VI and VII (DCT-VI/VII) of even length
N and (2N – 1)-point one dimensional discrete Fourier transform (1D-DFT) is presented. The technique used in
this paper is the mapping between the real-valued data sequence to an intermediate sequence used as an input to
DFT
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric G X × X × X ® R+ d : where X = r(v /W) =
{(d(v,v1),d(v,v2 ),...,d(v,v ) / v V (G))} k Î , denoted d G and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if d G
numbers of pendant edges are added to the non-basis vertices.
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ³ 2, n ³ 1. We
prove that, the m-shadow graphs for paths, complete bipartite graphs and symmetric product between
paths and null graphs are odd graceful. In addition, we show that, the m-splitting graphs for paths, stars
and symmetric product between paths and null graphs are odd graceful. Finally, we present some examples
to illustrate the proposed theories.
A function f is called a graceful labelling of a graph G with q edges if f is an injection
from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the
label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo
N graceful (where N is a positive integer) if there is a function φ from the vertex set of G to
{0, 1,N, (N + 1), 2N, (2N + 1), . . . ,N(q − 1),N(q − 1) + 1} in such a way that (i) φ is 1 − 1 (ii)
φ induces a bijection φ_ from the edge set of G to {1,N + 1, 2N + 1, . . . ,N(q − 1) + 1} where
φ_(uv)=|φ(u) − φ(v)| . In this paper we prove that the every regular bamboo tree and coconut tree
are one modulo N graceful for all positive integers N .
A robust blind and secure watermarking scheme using positive semi definite ma...ijcsit
In the last decade the need for new and robust watermarking schemes has been increased because of the
large illegal possession by not respecting the intellectual property rights in the multimedia in the internet.
In this paper we introduce a novel blind robust watermarking scheme which exploits the positive circulant
matrices in frequency domain which is the SVD, Different applications such as copyright protection,
control and illicit distributions have been given. Simulation results indicate that the proposed method is
robust against attacks as common digital processing: compression, blurring, dithering, printing and
scanning, etc. and subterfuge attacks (collusion and forgery) also geometric distortions and
transformations. Furthermore, good results of NC (normalized correlation) and PSNR (Peak signal-tonoise
ratio) have been achieved while comparing with recent state of the art watermarking algorithms.
Steganographic Scheme Based on Message-Cover matchingIJECEIAES
Steganography is one of the techniques that enter into the field of information security, it is the art of dissimulating data into digital files in an imperceptible way that does not arise the suspicion. In this paper, a steganographic method based on the FaberSchauder discrete wavelet transform is proposed. The embedding of the secret data is performed in Least Significant Bit (LSB) of the integer part of the wavelet coefficients. The secret message is decomposed into pairs of bits, then each pair is transformed into another based on a permutation that allows to obtain the most matches possible between the message and the LSB of the coefficients. To assess the performance of the proposed method, experiments were carried out on a large set of images, and a comparison to prior works is accomplished. Results show a good level of imperceptibility and a good trade-off imperceptibility-capacity compared to literature.
Time of arrival based localization in wireless sensor networks a non linear ...sipij
In this paper, we aim to obtain the location information of a sensor node deployed in a Wireless Sensor Network (WSN). Here, Time of Arrival based localization technique is considered. We calculate the position information of an unknown sensor node using the non- linear techniques. The performances of the techniques are compared with the Cramer Rao Lower bound (CRLB). Non-linear Least Squares and the Maximum Likelihood are the non-linear techniques that have been used to estimate the position of the unknown sensor node. Each of these non-linear techniques are iterative approaches, namely, Newton
Raphson estimate, Gauss Newton Estimate and the Steepest Descent estimate for comparison. Based on the
results of the simulation, the approaches have been compared. From the simulation study, Localization
based on Maximum Likelihood approach is having higher localization accuracy.
ON THE COVERING RADIUS OF CODES OVER Z4 WITH CHINESE EUCLIDEAN WEIGHTijitjournal
In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z4 with respect to chinese euclidean distance. We also determine the covering radius of various Repetition codes, Simplex codes Type α and Type β and give bounds on the covering radius for MacDonald codes of both types over Z4
Connect-the-Dots in a Graph and Buffon's Needle on a Chessboard: Two Problems...Vladimir Kulyukin
We study two theoretical problems that arise naturally in the application domain of assisted
navigation. Connect-the-dots in a graph is a graph-theoretical problem with application to
robot indoor localization. Buffon’s needle on a chessboard is a problem in geometric probability
with application to the design of RFID-enabled surface for robot-assisted navigation.
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric G X × X × X ® R+ d : where X = r(v /W) =
{(d(v,v1),d(v,v2 ),...,d(v,v ) / v V (G))} k Î , denoted d G and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if d G
numbers of pendant edges are added to the non-basis vertices.
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ³ 2, n ³ 1. We
prove that, the m-shadow graphs for paths, complete bipartite graphs and symmetric product between
paths and null graphs are odd graceful. In addition, we show that, the m-splitting graphs for paths, stars
and symmetric product between paths and null graphs are odd graceful. Finally, we present some examples
to illustrate the proposed theories.
A function f is called a graceful labelling of a graph G with q edges if f is an injection
from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the
label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo
N graceful (where N is a positive integer) if there is a function φ from the vertex set of G to
{0, 1,N, (N + 1), 2N, (2N + 1), . . . ,N(q − 1),N(q − 1) + 1} in such a way that (i) φ is 1 − 1 (ii)
φ induces a bijection φ_ from the edge set of G to {1,N + 1, 2N + 1, . . . ,N(q − 1) + 1} where
φ_(uv)=|φ(u) − φ(v)| . In this paper we prove that the every regular bamboo tree and coconut tree
are one modulo N graceful for all positive integers N .
A robust blind and secure watermarking scheme using positive semi definite ma...ijcsit
In the last decade the need for new and robust watermarking schemes has been increased because of the
large illegal possession by not respecting the intellectual property rights in the multimedia in the internet.
In this paper we introduce a novel blind robust watermarking scheme which exploits the positive circulant
matrices in frequency domain which is the SVD, Different applications such as copyright protection,
control and illicit distributions have been given. Simulation results indicate that the proposed method is
robust against attacks as common digital processing: compression, blurring, dithering, printing and
scanning, etc. and subterfuge attacks (collusion and forgery) also geometric distortions and
transformations. Furthermore, good results of NC (normalized correlation) and PSNR (Peak signal-tonoise
ratio) have been achieved while comparing with recent state of the art watermarking algorithms.
Steganographic Scheme Based on Message-Cover matchingIJECEIAES
Steganography is one of the techniques that enter into the field of information security, it is the art of dissimulating data into digital files in an imperceptible way that does not arise the suspicion. In this paper, a steganographic method based on the FaberSchauder discrete wavelet transform is proposed. The embedding of the secret data is performed in Least Significant Bit (LSB) of the integer part of the wavelet coefficients. The secret message is decomposed into pairs of bits, then each pair is transformed into another based on a permutation that allows to obtain the most matches possible between the message and the LSB of the coefficients. To assess the performance of the proposed method, experiments were carried out on a large set of images, and a comparison to prior works is accomplished. Results show a good level of imperceptibility and a good trade-off imperceptibility-capacity compared to literature.
Time of arrival based localization in wireless sensor networks a non linear ...sipij
In this paper, we aim to obtain the location information of a sensor node deployed in a Wireless Sensor Network (WSN). Here, Time of Arrival based localization technique is considered. We calculate the position information of an unknown sensor node using the non- linear techniques. The performances of the techniques are compared with the Cramer Rao Lower bound (CRLB). Non-linear Least Squares and the Maximum Likelihood are the non-linear techniques that have been used to estimate the position of the unknown sensor node. Each of these non-linear techniques are iterative approaches, namely, Newton
Raphson estimate, Gauss Newton Estimate and the Steepest Descent estimate for comparison. Based on the
results of the simulation, the approaches have been compared. From the simulation study, Localization
based on Maximum Likelihood approach is having higher localization accuracy.
ON THE COVERING RADIUS OF CODES OVER Z4 WITH CHINESE EUCLIDEAN WEIGHTijitjournal
In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z4 with respect to chinese euclidean distance. We also determine the covering radius of various Repetition codes, Simplex codes Type α and Type β and give bounds on the covering radius for MacDonald codes of both types over Z4
Connect-the-Dots in a Graph and Buffon's Needle on a Chessboard: Two Problems...Vladimir Kulyukin
We study two theoretical problems that arise naturally in the application domain of assisted
navigation. Connect-the-dots in a graph is a graph-theoretical problem with application to
robot indoor localization. Buffon’s needle on a chessboard is a problem in geometric probability
with application to the design of RFID-enabled surface for robot-assisted navigation.
Decreasing of quantity of radiation de fects inijcsa
Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction
heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However
manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of
heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing
of radiation defects to decrease quantity of radiation defects.
Finding Neighbors in Images Represented By Quadtreeiosrjce
In this paper, we propose an algorithm for neighbors finding in images represented by quadtree data
structure. We first present a scheme for addressing image pixels that takes into account the order defined on a
quadtree blocks. We study various properties of this method, and then we develop a formula that establishes
links between quadtree blocks. Based on these results, we present an efficient algorithm that generates the list of
location codes of all possible neighbors, in all directions, for a given block of the quadtree.
Multi-linear algebra and different tensor formats with applications Alexander Litvinenko
A short overview of well-known tensor formats, elliptic PDE with uncertain coefficients, some academic examples of separable functions, post-processing in tensor format
Design and Implementation of Variable Radius Sphere Decoding Algorithmcsandit
Sphere Decoding (SD) algorithm is an implement deco
ding algorithm based on Zero Forcing
(ZF) algorithm in the real number field. The classi
cal SD algorithm is famous for its
outstanding Bit Error Rate (BER) performance and de
coding strategy. The algorithm gets its
maximum likelihood solution by recursive shrinking
the searching radius gradually. However, it
is too complicated to use the method of shrinking t
he searching radius in ground
communication system. This paper proposed a Variabl
e Radius Sphere Decoding (VR-SD)
algorithm based on ZF algorithm in order to simplif
y the complex searching steps. We prove the
advantages of VR-SD algorithm by analyzing from the
derivation of mathematical formulas and
the simulation of the BER performance between SD an
d VR-SD algorithm.
Radix-2 Algorithms for realization of Type-II Discrete Sine Transform and Typ...IJERA Editor
In this paper, radix-2 algorithms for computation of type-II discrete sine transform (DST-II) and type-IV
discrete sine transform (DST-IV), each of length 2 ( 2,3,.....)
m
N m , are presented. The odd-indexed
output components of DST-II can be realized using simple recursive relations. The recursive algorithms are
appropriate for VLSI implementation. The DST-IV of length N can be computed from type-II discrete cosine
transform (DCT-II) and DST-II sequences, each of length N/2.
Radix-2 Algorithms for realization of Type-II Discrete Sine Transform and Typ...IJERA Editor
In this paper, radix-2 algorithms for computation of type-II discrete sine transform (DST-II) and type-IV
discrete sine transform (DST-IV), each of length 2 ( 2,3,.....)
m
N m , are presented. The odd-indexed
output components of DST-II can be realized using simple recursive relations. The recursive algorithms are
appropriate for VLSI implementation. The DST-IV of length N can be computed from type-II discrete cosine
transform (DCT-II) and DST-II sequences, each of length N/2.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Decreasing of quantity of radiation de fects inijcsa
Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction
heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However
manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of
heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing
of radiation defects to decrease quantity of radiation defects.
Finding Neighbors in Images Represented By Quadtreeiosrjce
In this paper, we propose an algorithm for neighbors finding in images represented by quadtree data
structure. We first present a scheme for addressing image pixels that takes into account the order defined on a
quadtree blocks. We study various properties of this method, and then we develop a formula that establishes
links between quadtree blocks. Based on these results, we present an efficient algorithm that generates the list of
location codes of all possible neighbors, in all directions, for a given block of the quadtree.
Multi-linear algebra and different tensor formats with applications Alexander Litvinenko
A short overview of well-known tensor formats, elliptic PDE with uncertain coefficients, some academic examples of separable functions, post-processing in tensor format
Design and Implementation of Variable Radius Sphere Decoding Algorithmcsandit
Sphere Decoding (SD) algorithm is an implement deco
ding algorithm based on Zero Forcing
(ZF) algorithm in the real number field. The classi
cal SD algorithm is famous for its
outstanding Bit Error Rate (BER) performance and de
coding strategy. The algorithm gets its
maximum likelihood solution by recursive shrinking
the searching radius gradually. However, it
is too complicated to use the method of shrinking t
he searching radius in ground
communication system. This paper proposed a Variabl
e Radius Sphere Decoding (VR-SD)
algorithm based on ZF algorithm in order to simplif
y the complex searching steps. We prove the
advantages of VR-SD algorithm by analyzing from the
derivation of mathematical formulas and
the simulation of the BER performance between SD an
d VR-SD algorithm.
Radix-2 Algorithms for realization of Type-II Discrete Sine Transform and Typ...IJERA Editor
In this paper, radix-2 algorithms for computation of type-II discrete sine transform (DST-II) and type-IV
discrete sine transform (DST-IV), each of length 2 ( 2,3,.....)
m
N m , are presented. The odd-indexed
output components of DST-II can be realized using simple recursive relations. The recursive algorithms are
appropriate for VLSI implementation. The DST-IV of length N can be computed from type-II discrete cosine
transform (DCT-II) and DST-II sequences, each of length N/2.
Radix-2 Algorithms for realization of Type-II Discrete Sine Transform and Typ...IJERA Editor
In this paper, radix-2 algorithms for computation of type-II discrete sine transform (DST-II) and type-IV
discrete sine transform (DST-IV), each of length 2 ( 2,3,.....)
m
N m , are presented. The odd-indexed
output components of DST-II can be realized using simple recursive relations. The recursive algorithms are
appropriate for VLSI implementation. The DST-IV of length N can be computed from type-II discrete cosine
transform (DCT-II) and DST-II sequences, each of length N/2.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley...IJERA Editor
In this paper, a relation for finding type-II discrete sine transform (DST) from type-I discrete Hartley transform (DHT) has been derived. The transform length N is taken as even. Using this relation, the (N - 1) output components of DST can be realized from DHT. The DHT is one of the transforms used for converting data in time domain into frequency domain using only real values.
Radix-3 Algorithm for Realization of Type-II Discrete Sine TransformIJERA Editor
In this paper, radix-3 algorithm for computation of type-II discrete sine transform (DST-II) of length N =
3푚 (푚 = 1,2, … . ) is presented. The DST-II of length N can be realized from three DST-II sequences, each of
length N/3. A block diagram of for computation of the radix-3 DST-II algorithm is given. Signal flow graph for
DST-II of length 푁 = 32 is shown to clarify the proposed algorithm.
Radix-3 Algorithm for Realization of Type-II Discrete Sine TransformIJERA Editor
In this paper, radix-3 algorithm for computation of type-II discrete sine transform (DST-II) of length N =
3𝑚 (𝑚 = 1,2, … . ) is presented. The DST-II of length N can be realized from three DST-II sequences, each of
length N/3. A block diagram of for computation of the radix-3 DST-II algorithm is given. Signal flow graph for
DST-II of length 𝑁 = 32 is shown to clarify the proposed algorithm.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
In this paper, a novel architecture of RNS based 1D Lifting Integer Wavelet Transform (IWT) has been introduced. Advantage of Residue Number System (RNS) based Lifting Scheme over RNS based Filter Bank and non-binary IWT has been discussed. The performance of traditional predicts and updates stage of binary Lifting Scheme (LS) for Discrete Wavelet Transform (DWT) generates huge carry propagation
delay, power and complexity. As a result non binary number system is becoming popular in the field of Digital Signal Processing (DSP) due to its efficient performance. In this paper also a new fixed number ROM based RNS division circuit has been proposed. The proposed architecture has been validated on Xilinx Vertex5 FPGA platform and the corresponding result and reports are shown in here.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Text file encryption using fft technique in lab view 8.6eSAT Journals
Abstract Encryption has always been a very important part of military communications. Here we deal with digital transmission technique. Digital transmission is always much more efficient than analog transmission, and it is much easier for digital encryption techniques to achieve a very high degree of security. Of course, this type of technique is still not quite compatible with today’s technical environment, i.e. most of the telephone systems are still analog instead of digital; most practical digitizers still require a relatively high bit rate which cannot be transmitted via standard analog telephone channels; and low bit rate speech digitizers still imply relatively high complexity and poor quality. Digital transmission adopts “Scrambling” technique. Scrambling methods are considered as important methods that provide the communication systems a specified degree of security, depending on the used technique to implement the scrambling method. There are many traditional scrambling methods used in single dimension such as time or frequency domain scrambling. Index Terms: Encryptor, Decryptor, Fast Fourier transforms (FFT)
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-IIijeei-iaes
The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...IJERA Editor
Conventional distributed arithmetic (DA) is popular in field programmable gate array (FPGA) design, and it
features on-chip ROM to achieve high speed and regularity. In this paper, we describe high speed area efficient
1-D discrete wavelet transform (DWT) using 9/7 filter based new efficient distributed arithmetic (NEDA)
Technique. Being area efficient architecture free of ROM, multiplication, and subtraction, NEDA can also
expose the redundancy existing in the adder array consisting of entries of 0 and 1. This architecture supports any
size of image pixel value and any level of decomposition. The parallel structure has 100% hardware utilization
efficiency.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
6th International Conference on Machine Learning & Applications (CMLA 2024)
Mapping between Discrete Cosine Transform of Type-VI/VII and Discrete Fourier Transform
1. M.N.Murty. Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 4, (Part - 3) April 2016, pp.60-62
www.ijera.com 60|P a g e
Mapping between Discrete Cosine Transform of Type-VI/VII and
Discrete Fourier Transform
M.N.Murty1
and H.Panda2
1
(Visiting Faculty, Department Of Physics, Sri Sathya Sai Institute Of Higher Learning, Prasanthi Nilayam –
515134, Andhra Pradesh, India)
2
(Department Of Physics, S.K.C.G. Autonomous College, Paralakhemundi -761200, Odisha, India)
ABSTRACT
In this paper, the mapping between discrete cosine transform of types VI and VII (DCT-VI/VII) of even length
N and (2N – 1)-point one dimensional discrete Fourier transform (1D-DFT) is presented. The technique used in
this paper is the mapping between the real-valued data sequence to an intermediate sequence used as an input to
DFT.
Keywords – Discrete Fourier transform, discrete cosine transform, discrete sine transform, mapping.
I. INTRODUCTION
Discrete transforms play a significant role
in digital signal processing. Discrete cosine
transform (DCT) and discrete sine transform
(DST) are used as key functions in many signal and
image processing applications. There are eight
types of DCT and DST. Of these, the DCT-II,
DST-II, DCT-IV, and DST-IV have gained
popularity. The DCT and DST transform of types I,
II, III and IV, form a group of so-called “even”
sinusoidal transforms. Much less known is group of
so-called “odd” sinusoidal transforms: DCT and
DST of types V, VI, VII and VIII.
The original definition of the DCT
introduced by Ahmed et al. in 1974 [1] was one-
dimensional (1-D) and suitable for 1-D digital
signal processing. The DCT has found wide
applications in speech and image processing as
well as telecommunication signal processing for the
purpose of data compression, feature extraction,
image reconstruction, and filtering. Thus, many
algorithms and VLSI architectures for the fast
computation of DCT have been proposed [2]-[7].
Among those algorithms [6] and [7] are believed to
be most efficient two-dimensional DCT algorithms
in the sense of minimizing any measure of
computational complexity. DCT of types I, II, III
and IV are extensively used in coding image, video,
speech and audio. The so-called “odd-type” DCTs
of types V, VI, VII and VIII, however, have not
been widely used for purposes of coding image,
video, speech and audio data.
Among all the discrete transforms, the
discrete Fourier transform (DFT) is the most
popular transform, and it is mainly due to its
usefulness in very large number of applications in
different areas of science and technology. The DFT
plays a key role in various digital signal processing
and image processing applications [8,9]. Not only it
is frequently encountered in many different
applications, but also it is computation-intensive.
Recently DST of types VI and VII have
surfaced as useful tool in image and video coding.
Fast algorithms for computing DST-VII of lengths
4 and 8 have been proposed [10] and these
algorithms are currently under consideration for
inclusion in ISO/IEC/ITU-T High Efficiency Video
Coding (HEVC) standard.
In this paper, the mapping between DCT-
VI/VII of even length N and (2N – 1) -point DFT
has been established. The procedure used in this
paper is the mapping between the real-valued data
sequence to an intermediate sequence used as an
input to DFT. This mapping technique may find
application in image and video coding.
The rest of the paper is organized as
follows. The proposed mapping between DCT-VII
and DFT is presented in Section-II. Section-III
establishes the mapping between DCT-VI and
DFT. Conclusion is given in Section-IV
II. MAPPING BETWEEN DCT-VII
AND DFT
The 1-D DFT of input sequence { xn ; n =
0,1,2,....,N-1} is defined by
21
0
j k nN
N
k n
n
exY
0,1, 2, ..., 1for k N (1)
Where 1j
The DCT of type-VII is defined as
1
0
( 2 1)
0,1, 2 , ..., 1
2 1
N
V II
k n
n
k n
C O S fo r k N
N
xX
(2)
The scale factors have been omitted in (1) and (2).
From (1), the real component of DST is written as
RESEARCH ARTICLE OPEN ACCESS
2. M.N.Murty. Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 4, (Part - 3) April 2016, pp.60-62
www.ijera.com 61|P a g e
1
0
2
N
k n
n
k n
R C O S
N
xY
(3)
Replacing k by 2 1k and N by( 2 1)N , (3)
can be written as
2 ( 1 )
2 1
0
2 ( 2 1)
2 1
N
k n
n
k n
R C O S
N
xY
(4)
For N even or odd, (4) can be expressed as
1
2 1 2 1
1
2 (2 1)
2 1
N
k o n N n
n
k n
R C O S
N
x x xY
(5)
For mapping between DCT-VII and DFT, define
2 1
0
1, 2, ..., 1
o
n N n
fo r n N
x
x x
(6)
Substituting (6) in (5), we obtain
1
2 1
1
2 (2 1)
2 2 1
N
k
n
n
R k n
C O S
N
Y
x
(7)
Since from (6) 0
ox , (7) can be written as
1
2 1
0
2 (2 1)
2 2 1
N
k
n
n
R k n
C O S
N
Y
x
(8)
Taking N as even, (8) can be expressed as
1 1
2 2
2 1
2
0 0
(2 1)2
(2 1) 2 2
2 2 1 2 1
N N
k
Nn n
n n
N
k n
R k n
COS COS
N N
Y
x x
(9)
Define another sequence u2n and uN+2n given by
2
2
2
0,1, 2, ..., 1
2
0,1, 2, ..., 1
2
n n
N n N n
N
fo r n
N
fo r n
x u
x u
(10)
Substituting (10) in (9), we get
1 1
2 2
2 1
2 2
0 0
(2 1) 2 (2 1)( 2 )
2 2 1 2 1
N N
k
n N n
n n
R k n k N n
COS COS
N N
Y
u u
(11)
For even N , the DCT-VII defined in (2) can be
expressed as
1 1
2 2
2
0 0
(2 1)
(2 1) 2
2 1 2 1
N N
V II
Nk n n
n n
N
k n
k n
C O S C O S
N N
x xX
(12)
The above expression shows that the RHS of the
real part of 1D-DFT given by (11) is in the form of
DCT-VII. Hence,
2 1
2
V IIk
k
R Y
X
(13)
The above expression shows the mapping between
DCT-VII and DFT.
III. MAPPING BETWEEN DCT-VI AND
DFT
The DCT of type-VI for input sequence
{xn ; n = 0,1,2,....,N-1} is defined by
1
0
( 2 1)
0,1, 2, ..., 1
2 1
N
V I
k n
n
k n
C O S fo r k N
N
xX
(14)
The scale factor has been omitted in (14).
Replacing N by 2 1N in (3), we obtain
2 ( 1 )
0
2
2 1
N
k n
n
k n
R C O S
N
xY
(15)
For N even or odd, (15) can be written as
1
2 1
1
2
2 1
N
k o n N n
n
k n
R C O S
N
x x xY
(16)
For mapping between DCT-VI and DFT, define
2 1
0
1, 2, ..., 1
o
n N n
fo r n N
x
x x
(17)
Substituting (17) in (16), we get
1
0
2
2 2 1
N
k
n
n
R k n
C O S
N
Y
x
(18)
For even N , define another sequence
( 1 )
0,1, 2, ..., 1n N n
fo r n Nvx
(19)
3. M.N.Murty. Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 4, (Part - 3) April 2016, pp.60-62
www.ijera.com 62|P a g e
Substituting (19) in RHS of (18), we get
1
0
( 2 1)
2 2 1
N
k
n
n
R k n
C O S
N
Y
v
(20)
Since the RHS of the above expression is in the
form of DCT-VI defined by (14), we have
2
V Ik
k
R Y
X
(21)
As the LHS of (21) represents the real part of DFT,
the mapping between DCT-VI and DFT is
established by this equation.
IV. CONCLUSION
In this paper, the mapping between DCT-
VI/VII of even length N and (2N – 1) -point DFT
has been established using an intermediate
sequence. The performance DST can be compared
to that of DCT and therefore, DST may be
considered as a viable alternative to DCT. Recently
DST of types VI and VII have surfaced as useful
tool in image and video coding. Fast algorithms for
computing DST-VII of lengths 4 and 8 have been
proposed [10] and these algorithms are currently
under consideration for inclusion in ISO/IEC/ITU-
T High Efficiency Video Coding (HEVC) standard.
Like DST-VI/VII, the proposed mapping technique
for DCT-VI/VII may find application in image and
video coding.
REFERENCES
[1]. N. Ahmed, T.Natarajan, and K.R.Rao,
Discrete cosine transform, IEEE Trans.
Comput., vol. C-23, 1974, 90-93.
[2]. R.K.Rao and P.Yip, Discrete cosine
transform: algorithm, advantages, and
applications (New York: Academic,
1990).
[3]. M.J.Narasimha and A.M.Peterson, On the
computation of the discrete cosine
transform, IEEE Trans. Communications,
vol.COM-26, no.6, June 1978, 934-936.
[4]. H.S.Hou, A fast recursive algorithms for
computing the discrete cosine transform,
IEEE Trans. Acoust., Speech, Signal
Processing, vol. ASSP-35(10), Oct.1987,
1455-1461.
[5]. PeiZong Lee and Fang-Yu Huang,
Reconstructed recursive DCT and DST
algorithms, IEEE Trans. Signal
Processing, vol.42, no.7, Jul.1994, 1600-
1609.
[6]. P.Duhamel and C.Guillemot, Polynomial
transform computation of 2-D DCT, in
Proc. ICASSP’90, Apr.1990, 1515-1518.
[7]. E.Feig and S.Winograd, Fast algorithms
for the discrete cosine transform, IEEE
Trans. Signal Processing, vol.40, no.9,
Sept.1992, 2174-2193.
[8]. R.N.Bracewell, The Fourier transform and
its applications, 3rd
edition (New York:
McGraw-Hill, 2000).
[9]. J.G.Proakis and D.G.Manolakis, Digital
signal processing: principles, algorithms
and applications (Prentice-Hall, 1996).
[10]. Ravi K. Chivukula and Yuriy A. Reznik,
Fast computing of cosine and sine
transforms of types VI and VII,
Proceedings of the SPIE, vol.8135, 2011.