feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_BV010540278
    Format: 113 S. : graph. Darst.
    ISBN: 3-446-18493-7
    Language: German
    Subjects: Chemistry/Pharmacy , Natural Sciences , Physics , General works
    RVK:
    RVK:
    RVK:
    RVK:
    RVK:
    RVK:
    Keywords: Ingenieur ; Vortragstechnik ; Vortragstechnik ; Naturwissenschaftler ; Ratgeber ; Ratgeber ; Ratgeber
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almafu_9959327561202883
    Format: 1 online resource (xxiii, 236 pages) : , illustrations
    ISBN: 0471694630 , 9780471694632 , 9780471745433 , 047174543X , 9780471745426 , 0471745421 , 9781601193766 , 1601193769
    Content: Discover applications of Fourier analysis on finite non-Abelian groups The majority of publications in spectral techniques consider Fourier transform on Abelian groups. However, non-Abelian groups provide notable advantages in efficient implementations of spectral methods. Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design examines aspects of Fourier analysis on finite non-Abelian groups and discusses different methods used to determine compact representations for discrete functions providing for their efficient realizations and related.
    Note: Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design; Preface; 0.1 Relationships among the chapters.; Acknowledgments; Contents; List of Figures; List of Tables; Acronyms; 1 Signals and Their Mathematical Models; 1.1 Systems; 1.2 Signals; 1.3 Mathematical Models of Signals References; References; 2 Fourier Analysis; 2.1 Representations of Groups; 2.1.1 Complete reducibility; 2.2 Fourier Transform on Finite Groups; 2.1 Group operation of S3.; 2.2 The unitary irreducible representations of S3 over C.; 2.3 The group characters of S3 over C. , 2.3 Properties of the Fourier transform2.4 The set Rw(i, j) (x) of S3 over C.; 2.5 Unitary irreducible representations of S3 over GF(11).; 2.6 The group characters of S3 over GF(11).; 2.7 The set Rw(i, j) (x) of S3 over GF(11).; 2.4 Matrix interpretation of the Fourier transform on finite non-Abelian groups; 2.5 Fast Fourier transform on finite non-Abelian groups References; 2.8 Group operation for the quaternion group Q2.; 2.9 Irreducible unitary representations of Q2 over C.; 2.1 FFT on the quaternion group Q2.; 2.2 Flow-graph for FFT algorithm for the inverse Fourier transform on Q8. , 2.10 The discrete Walsh functions wal(i, x).2.3 FFT on the dyadic group of order 8.; References; 3 Matrix Interpretation of the FFT; 3.1 Matrix interpretation of FFT on finite non-Abelian groups; 3.2 Illustrative examples; 3.1 Summary of differences between the FFT on finite Abelian and finite non-Abelian groups.; 3.2 Group operation of G2×8.; 3.3 Unitary irreducible representations of G2×8 over C.; 3.1 Structure of the flow-graph of the FFT on the group G2×8.; 3.2 Structure of the flow-graph for FFT on the group G32. , 3.3 Structure of the flow-graph for FFT on the group G32 through a part of fast Walsh transform. 3.4 Structure of the flow-graph for FFT on the group G32 using FFT on Q2.; 3.4 The unitary irreducible representations of G6×6 over GF(11).; 3.5 Structure of the flow-graph for FFT on the group G6×6.; 3.5 The group operation of G3×6.; 3.6 The unitary irreducible representations of G3×6 over C.; 3.6 Structure of the flow-graph for FFT on the group G3×6.; 3.7 Structure of the flow-graph for FFT on G24.; 3.3 Complexity of the FFT; 3.8 Structure of the flow-graph for FFT on S3. , 3.9 Structure of the flow-graph for FFT on G24 with FFT on S3.3.3.1 Complexity of calculations of the FFT; 3.10 Number of operations in FFT.; 3.7 Complexity of the FFT.; 3.8 Comparisons of domain groups.; 3.9 FFT for random functions.; 3.10 Comparison of the FFT for random functions.; 3.11 Time requirements.; 3.12 Memory requirements.; 3.3.2 Remarks on programming implementation of FFT; 3.4 FFT through decision diagrams; 3.4.1 Decision diagrams; 3.4.2 FFT on finite non-Abelian groups through DDs; 3.13 MTDD for f in Example 3.6.; 3.14 BDD for f in Example 3.7.
    Additional Edition: Print version: Stanković, Radomir S. Fourier analysis on finite groups with applications in signal processing and system design. Piscataway, NJ : IEEE Press ; Hoboken, N.J. : Wiley-Interscience, ©2005 ISBN 0471694630
    Language: English
    Keywords: Electronic books. ; Electronic books. ; Electronic books. ; Electronic books.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    b3kat_BV040491711
    Format: XXIII, 236 S. , graph. Darst.
    ISBN: 0471694630 , 9780471694632
    Additional Edition: Erscheint auch als Online-Ausgabe Fourier analysis on finite groups with applications in signal processing and system design
    Language: English
    Subjects: Engineering
    RVK:
    RVK:
    Keywords: Signalverarbeitung ; Harmonische Analyse ; Gruppentheorie
    URL: Cover
    Author information: Stanković, Radomir S. 1952-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV040252757
    Format: Getr. Zählung , graph. Darst.
    Note: Sammlung von Aufsatzkopien
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    b3kat_BV042725102
    Format: 1 Online-Ressource (XXXVI, 431 p)
    ISBN: 9783642356414
    Series Statement: Studies in Fuzziness and Soft Computing 298
    Additional Edition: Erscheint auch als Druckausgabe ISBN 978-3-642-35640-7
    Language: English
    Author information: Seising, Rudolf 1961-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    edocfu_9959327561202883
    Format: 1 online resource (xxiii, 236 pages) : , illustrations
    ISBN: 0471694630 , 9780471694632 , 9780471745433 , 047174543X , 9780471745426 , 0471745421 , 9781601193766 , 1601193769
    Content: Discover applications of Fourier analysis on finite non-Abelian groups The majority of publications in spectral techniques consider Fourier transform on Abelian groups. However, non-Abelian groups provide notable advantages in efficient implementations of spectral methods. Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design examines aspects of Fourier analysis on finite non-Abelian groups and discusses different methods used to determine compact representations for discrete functions providing for their efficient realizations and related.
    Note: Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design; Preface; 0.1 Relationships among the chapters.; Acknowledgments; Contents; List of Figures; List of Tables; Acronyms; 1 Signals and Their Mathematical Models; 1.1 Systems; 1.2 Signals; 1.3 Mathematical Models of Signals References; References; 2 Fourier Analysis; 2.1 Representations of Groups; 2.1.1 Complete reducibility; 2.2 Fourier Transform on Finite Groups; 2.1 Group operation of S3.; 2.2 The unitary irreducible representations of S3 over C.; 2.3 The group characters of S3 over C. , 2.3 Properties of the Fourier transform2.4 The set Rw(i, j) (x) of S3 over C.; 2.5 Unitary irreducible representations of S3 over GF(11).; 2.6 The group characters of S3 over GF(11).; 2.7 The set Rw(i, j) (x) of S3 over GF(11).; 2.4 Matrix interpretation of the Fourier transform on finite non-Abelian groups; 2.5 Fast Fourier transform on finite non-Abelian groups References; 2.8 Group operation for the quaternion group Q2.; 2.9 Irreducible unitary representations of Q2 over C.; 2.1 FFT on the quaternion group Q2.; 2.2 Flow-graph for FFT algorithm for the inverse Fourier transform on Q8. , 2.10 The discrete Walsh functions wal(i, x).2.3 FFT on the dyadic group of order 8.; References; 3 Matrix Interpretation of the FFT; 3.1 Matrix interpretation of FFT on finite non-Abelian groups; 3.2 Illustrative examples; 3.1 Summary of differences between the FFT on finite Abelian and finite non-Abelian groups.; 3.2 Group operation of G2×8.; 3.3 Unitary irreducible representations of G2×8 over C.; 3.1 Structure of the flow-graph of the FFT on the group G2×8.; 3.2 Structure of the flow-graph for FFT on the group G32. , 3.3 Structure of the flow-graph for FFT on the group G32 through a part of fast Walsh transform. 3.4 Structure of the flow-graph for FFT on the group G32 using FFT on Q2.; 3.4 The unitary irreducible representations of G6×6 over GF(11).; 3.5 Structure of the flow-graph for FFT on the group G6×6.; 3.5 The group operation of G3×6.; 3.6 The unitary irreducible representations of G3×6 over C.; 3.6 Structure of the flow-graph for FFT on the group G3×6.; 3.7 Structure of the flow-graph for FFT on G24.; 3.3 Complexity of the FFT; 3.8 Structure of the flow-graph for FFT on S3. , 3.9 Structure of the flow-graph for FFT on G24 with FFT on S3.3.3.1 Complexity of calculations of the FFT; 3.10 Number of operations in FFT.; 3.7 Complexity of the FFT.; 3.8 Comparisons of domain groups.; 3.9 FFT for random functions.; 3.10 Comparison of the FFT for random functions.; 3.11 Time requirements.; 3.12 Memory requirements.; 3.3.2 Remarks on programming implementation of FFT; 3.4 FFT through decision diagrams; 3.4.1 Decision diagrams; 3.4.2 FFT on finite non-Abelian groups through DDs; 3.13 MTDD for f in Example 3.6.; 3.14 BDD for f in Example 3.7.
    Additional Edition: Print version: Stanković, Radomir S. Fourier analysis on finite groups with applications in signal processing and system design. Piscataway, NJ : IEEE Press ; Hoboken, N.J. : Wiley-Interscience, ©2005 ISBN 0471694630
    Language: English
    Keywords: Electronic books. ; Electronic books.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Cham : Springer International Publishing | Cham : Imprint: Springer
    UID:
    gbv_1823896677
    Format: 1 Online-Ressource(XIII, 154 p.)
    Edition: 1st ed. 2012.
    ISBN: 9783031798528
    Series Statement: Synthesis Lectures on Digital Circuits & Systems
    Content: Multiple-Valued Logic Functions -- Functional Expressions for Multiple-Valued Functions -- Spectral Representations of Multiple-Valued Functions -- Decision Diagrams for Multiple-Valued Functions -- Fast Calculation Algorithms.
    Content: Compared to binary switching functions, the multiple-valued functions (MV) offer more compact representations of the information content of signals modeled by logic functions and, therefore, their use fits very well in the general settings of data compression attempts and approaches. The first task in dealing with such signals is to provide mathematical methods for their representation in a way that will make their application in practice feasible. Representation of Multiple-Valued Logic Functions is aimed at providing an accessible introduction to these mathematical techniques that are necessary for application of related implementation methods and tools. This book presents in a uniform way different representations of multiple-valued logic functions, including functional expressions, spectral representations on finite Abelian groups, and their graphical counterparts (various related decision diagrams). Three-valued, or ternary functions, are traditionally used as the first extension from the binary case. They have a good feature that the ratio between the number of bits and the number of different values that can be encoded with the specified number of bits is favourable for ternary functions. Four-valued functions, also called quaternary functions, are particularly attractive, since in practical realization within today prevalent binary circuits environment, they may be easy coded by binary values and realized with two-stable state circuits. At the same time, there is much more considerable advent in design of four-valued logic circuits than for other $p$-valued functions. Therefore, this book is written using a hands-on approach such that after introducing the general and necessarily abstract background theory, the presentation is based on a large number of examples for ternary and quaternary functions that should provide an intuitive understanding of various representation methods and the interconnections among them. Table of Contents: Multiple-Valued Logic Functions / Functional Expressions for Multiple-Valued Functions / Spectral Representations of Multiple-Valued Functions / Decision Diagrams for Multiple-Valued Functions / Fast Calculation Algorithms.
    Additional Edition: ISBN 9783031798511
    Additional Edition: ISBN 9783031798535
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031798511
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031798535
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    gbv_728925001
    Format: 1 Online-Ressource (xiii, 154 Seiten) , Illustrationen
    Edition: Also available in print
    ISBN: 9781608459438
    Series Statement: Synthesis lectures on digital circuits and systems #37
    Content: Compared to binary switching functions, the multiple-valued functions (MV) offer more compact representations of the information content of signals modeled by logic functions and, therefore, their use fits very well in the general settings of data compression attempts and approaches. The first task in dealing with such signals is to provide mathematical methods for their representation in a way that will make their application in practice feasible
    Content: 2. Functional expressions for multiple-valued functions -- 2.1 Functional expressions -- 2.2 Generalizations to multiple-valued functions -- 2.3 Sum-of-product expressions -- 2.4 Galois field expressions -- 2.5 Fixed-polarity GF-expressions -- 2.6 Efficiency of representations -- 2.7 Arithmetic expressions for multiple-valued functions -- 2.8 Haar-like expressions for multiple-valued functions -- 2.9 Sparse representations from covering codes --
    Content: 3. Spectral representations of multiple-valued functions -- 3.1 Fourier representations of logic functions -- 3.2 Construction of group characters -- 3.3 Haar series for multiple-valued logic functions --
    Content: 4. Decision diagrams for multiple-valued functions -- 4.1 Decision trees and decision diagrams -- 4.2 Reduction rules -- 4.3 Multiple-place decision diagrams -- 4.4 Reduction of decision trees -- 4.5 Functional decision diagrams for MV functions -- 4.6 Reed-Muller-Fourier decision diagrams -- 4.7 Vilenkin-Chrestenson decision diagrams -- 4.8 Haar spectral transform decision diagrams -- 4.9 Edge-valued decision diagrams -- 4.10 Construction of EVDDs -- 4.11 Construction of transforms from decision diagrams --
    Content: 5. Fast calculation algorithms -- 5.1 Illustrative examples of FFT-like algorithms -- Bibliography -- Authors' biographies -- Index
    Content: Acknowledgments -- 1. Multiple-valued logic functions -- 1.1 Tabular representations -- 1.2 Cubes -- 1.3 Encoding of variables -- 1.4 Other representations -- 1.5 Algebraic structures for multiple-valued functions -- 1.6 Functions with various properties --
    Note: Abstract freely available; full-text restricted to subscribers or individual document purchasers , Includes bibliographical references (p. 127-150) and index , Part of: Synthesis digital library of engineering and computer science , Series from website , 2. Functional expressions for multiple-valued functions -- 2.1 Functional expressions -- 2.2 Generalizations to multiple-valued functions -- 2.3 Sum-of-product expressions -- 2.4 Galois field expressions -- 2.5 Fixed-polarity GF-expressions -- 2.6 Efficiency of representations -- 2.7 Arithmetic expressions for multiple-valued functions -- 2.8 Haar-like expressions for multiple-valued functions -- 2.9 Sparse representations from covering codes , 3. Spectral representations of multiple-valued functions -- 3.1 Fourier representations of logic functions -- 3.2 Construction of group characters -- 3.3 Haar series for multiple-valued logic functions , 4. Decision diagrams for multiple-valued functions -- 4.1 Decision trees and decision diagrams -- 4.2 Reduction rules -- 4.3 Multiple-place decision diagrams -- 4.4 Reduction of decision trees -- 4.5 Functional decision diagrams for MV functions -- 4.6 Reed-Muller-Fourier decision diagrams -- 4.7 Vilenkin-Chrestenson decision diagrams -- 4.8 Haar spectral transform decision diagrams -- 4.9 Edge-valued decision diagrams -- 4.10 Construction of EVDDs -- 4.11 Construction of transforms from decision diagrams , 5. Fast calculation algorithms -- 5.1 Illustrative examples of FFT-like algorithms -- Bibliography -- Authors' biographies -- Index. , Acknowledgments -- 1. Multiple-valued logic functions -- 1.1 Tabular representations -- 1.2 Cubes -- 1.3 Encoding of variables -- 1.4 Other representations -- 1.5 Algebraic structures for multiple-valued functions -- 1.6 Functions with various properties , Also available in print. , System requirements: Adobe Acrobat Reader. , Mode of access: World Wide Web.
    Additional Edition: ISBN 9781608459421
    Additional Edition: Erscheint auch als Druck-Ausgabe Representations of Multiple-Valued Logic Functions
    Language: English
    Author information: Astola, Jaakko 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    almahu_9949744359502882
    Format: XIX, 272 p. 27 illus., 22 illus. in color. , online resource.
    Edition: 1st ed. 2024.
    ISBN: 9783031506505
    Series Statement: Synthesis Lectures on Engineering, Science, and Technology,
    Content: This book discusses in a uniform way binary, ternary, and quaternary bent functions, while most of the existing books on bent functions refer to just binary bent functions. The authors describe the differences between binary and multiple-valued cases and the construction methods for bent functions are focused on the application of two types of permutation matrices. These matrices are derived from a class of differential operators on finite groups and Fast Fourier transform algorithms, respectively. The approach presented is based on the observation that given certain bent functions, many other bent functions can be constructed by manipulating them. Permutations are possible manipulations that are easy to implement. These permutations perform spectral invariant operations which ensure that they preserve bentness.
    Note: Basic Concepts and Notations -- Gibbs Derivatives on Finite Abelian Groups -- Gibbs Characterization of Binary Bent Functions -- Gibbs Characterisation of Ternary Bent Functions -- Gibbs Characterization of a Class of Quaternary Bent Functions -- Matrix-valued Binary Bent Functions -- Matrix-valued Ternary Bent Functions -- Construction of Bent Functions by FFT-like Permutation Matrices -- Construction of Ternary Bent Functions Trough Matrix Representations.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783031506499
    Additional Edition: Printed edition: ISBN 9783031506512
    Additional Edition: Printed edition: ISBN 9783031506529
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages