Authors: Astola, Jaakko
Astola, Pekka
Stanković, Radomir 
Tabus, Ioan
Title: Algebraic and Combinatorial Methods for Reducing the Number of Variables of Partially Defined Discrete Functions
Journal: Proceedings of The International Symposium on Multiple-Valued Logic
First page: 167
Last page: 172
Conference: 47th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2017; Novi Sad; Serbia; 22 May 2017 through 24 May 2017
Issue Date: 30-Jun-2017
ISBN: 978-1-509-05495-4
ISSN: 0195-623X
DOI: 10.1109/ISMVL.2017.23
Applications of pattern recognition, design of faulttolerant systems and communications have key problems that arenaturally described by partially defined (incompletely defined)discrete functions. Such partially defined functions arising frompractical demands usually have a large number of variables andso their direct implementations require complex systems. Thusit is important to have at hand an efficient method to reducethe number of their variables. Here we review recent results tolinearly decompose a discrete function using a transform thatcan be efficiently implemented as a Galois field deconvolution. We also study the question: What are the general bounds for thedimension of the range space for an arbitrary linear transformto reduce a partially defined discrete function? We derive abound for the dimension of the range for arbitrary lineartransformation. We also estimate how good linear decompositioncan be obtained by the use of random transformations and showthat with a randomly generated transform we can reach theabove discussed bound.
Keywords: index generation function | linear decomposition | partially defined function
Publisher: IEEE

Show full item record


checked on Jun 12, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.