By Topic

A Reciprocal-Orthogonal Parametric Transform and Its Fast Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Saad Bouguezel ; Laboratoire de Croissance et Caractérisation de Nouveaux Semiconducteurs, Département d'Electronique, Faculté de Technologie, Université Ferhat Abbas, Sétif, Algeria

In this letter, a reciprocal-orthogonal parametric transform and an efficient algorithm for its simple construction and fast computation are proposed. The algorithm is developed by introducing a recursive approach to decompose the transform matrix into a product of sparse matrices using the Kronecker product. It is shown that the structure of the resulting algorithm is very similar to that of the well-known Walsh-Hadamard transform, except for the multipliers introduced by the independent parameters. The transform has a large number of independent parameters that can be chosen arbitrarily from the complex plane. Thus, many interesting special cases can easily be obtained from the proposed transform. Moreover, we carry out a number of experiments to show that its independent parameters can successfully be used as an additional secret key for image encryption.

Published in:

IEEE Signal Processing Letters  (Volume:19 ,  Issue: 11 )