Cart (Loading....) | Create Account
Close category search window
 

A Method for the Generation and Processing of Dyadic Indexed Data

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
$31 $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)
Besslich, P.W. ; Department of Electrical Engineering, University of Bremen

The elements of an array of 2n data are indexed so that adjacent elements have Hamming distance 1. Based on this indexing a class of invertible fast in-place transformations is developed. The transform coefficients depend on the Hamming distance between the indexes of input data. A class of similar transformations exists in the Walsh-Hadamard domain. Three transform operations are discussed in detail: dyadic shift transform, a subsuming and averaging transformation and a weighting operation. Applications of the method are in the processing of Boolean and fuzzy switching functions, image analysis, etc.

Published in:

Computers, IEEE Transactions on  (Volume:C-32 ,  Issue: 5 )

Date of Publication:

May 1983

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.