Seungyeob Baek - IEEE Xplore Author Profile

Scheduled Maintenance on Monday 1/13/2025

Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.

IEEE.org
IEEE Xplore
IEEE SA
IEEE Spectrum
More Sites

- Donate
- Personal Sign In

Access provided by:

MIT Libraries

Access provided by:

MIT Libraries

ADVANCED SEARCH

Author details

Seungyeob Baek

Also published under: Seung-Yeob Baek, S. Y. Baek

Publications

7

Citations

105

Publications by Year

19912021

Co-Authors:

Y. S. BaeSang-Hyun ChoYoungjae ChoYoung-Ho ChoiDong-Ho Choi

Show All Co-Authors (35)

Seungyeob Baek

Also published under: Seung-Yeob Baek, S. Y. Baek

Affiliation

Samsung Electronics, Hwasung, Korea

Publication Topics

Quantization Noise,
Total Power Consumption,
7nm FinFET,
Additive Noise,
Analog Domain,
Analog-to-digital Converter,
Approximate Multipliers,
Bit Error Rate,
Building Blocks,
Clock Generator,
Clock Period,
Continuous-time Delta-sigma

Biography

Seung-Yeob Baek received the B.S. degree from the University of Seoul, Seoul, South Korea, in 2008, and the M.S. degree from the Korea Advanced Institute of Science and Technology, Daejeon, South Korea, in 2012.,In 2012, he joined Samsung Electronics Inc., Hwasung, South Korea. He was involved in the designing of the data converters. He is currently involved in the foundry solution team. His current research interests include data converters and mixed-signal circuit design.(Based on document published on 19 December 2017).

Publications

7

Citations

105

Publications by Year

19912021

Co-Authors:

Y. S. Bae
Sang-Hyun Cho
Youngjae Cho
Young-Ho Choi
Dong-Ho Choi

Show All Co-Authors (35)

Author's Published Works

Search History

Showing 1-13 of 13 results

Conferences (13)

Sort

Filter Results

Show

Subscribed Content

Open Access Only

Range
Single Year
Tamás Waldhauser(9)
Miguel Couceiro(7)
Erkko Lehtonen(4)
Tam´s Waldhauser(3)
Karsten Schölzel(2)
Bolyai Institute, University of Szeged, Szeged, Hungary(8)
Mathematics Research Unit, University of Luxembourg, Luxembourg, Luxembourg(2)
Faculty of Science, Technology and Communication, University of Luxembourg, Luxembourg, Luxembourg(2)
LAMSADE, Université Paris Dauphine, Paris, France(1)
Bolyai Institute, University of Szeged Aradi vértanúk tere 1, Szeged, Hungary(1)
2011 41st IEEE International Symposium on Multiple-Valued Logic(3)
2012 IEEE 42nd International Symposium on Multiple-Valued Logic(2)
2013 IEEE 43rd International Symposium on Multiple-Valued Logic(2)
2014 IEEE 44th International Symposium on Multiple-Valued Logic(2)
2015 IEEE International Symposium on Multiple-Valued Logic(1)
IEEE(13)
Tuusula, Finland(3)
Bremen, Germany(2)
Toyama, Japan(2)
Victoria, BC, Canada(2)
Dallas, TX, USA(1)
Boolean Function(6)
Functional Class(5)
Finite Set(4)
Identification Of Variables(4)
Set Of Functions(4)

Select All on Page

Sort By

Results

On the Number of Fixed Points of the Reed-Muller-Fourier Transform

Tamás Waldhauser

2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL)

Year: 2018 | Conference Paper |

HTML

In their paper at ISMVL 2017, C. Moraga, R.S. Stankovic, M. Stankovic and S. Stojkovic presented a conjecture for the number of fixed points (i.e., eigenfunctions with eigenvalue 1) of the Reed-Muller-Fourier transform of n-variable functions on a p-element domain. We prove this conjecture for n = 1, as well as for arbitrary n with odd p. In addition, we determine the number of eigenfunctions with...Show More

On the Number of Fixed Points of the Reed-Muller-Fourier Transform

Tamás Waldhauser

2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL)

Year: 2018 | Conference Paper |

Posets of Minors of Functions in Multiple-Valued Logic

Erkko Lehtonen;Tamás Waldhauser

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)

Year: 2017 | Conference Paper |

Cited by: Papers (1)

HTML

We study the structure of the partially ordered set of minors of an arbitrary function of several variables. We give an abstract characterization of such "minor posets" in terms of colorings of partition lattices, and we also present infinite families of examples as well as constructions that can be used to build new minor posets.Show More

Posets of Minors of Functions in Multiple-Valued Logic

Erkko Lehtonen;Tamás Waldhauser

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)

Year: 2017 | Conference Paper |

Lazy Clones and Essentially Minimal Groupoids

Hajime Machida;Tamás Waldhauser

2015 IEEE International Symposium on Multiple-Valued Logic

Year: 2015 | Conference Paper |

Cited by: Papers (1)

HTML

We determine idempotent lazy operations and binary lazy operations, and apply the latter to characterize groupies with an essentially minimal clone of a certain type.Show More

Lazy Clones and Essentially Minimal Groupoids

Hajime Machida;Tamás Waldhauser

2015 IEEE International Symposium on Multiple-Valued Logic

Year: 2015 | Conference Paper |

Maximal and Minimal Closed Classes in Multiple-Valued Logic

Tamás Waldhauser

2014 IEEE 44th International Symposium on Multiple-Valued Logic

Year: 2014 | Conference Paper |

HTML

We consider classes of operations in multiple-valued logic that are closed under composition as well as under permutation of variables, identification of variables (diagonalization) and introduction of inessential variables (cylindrification). Such closed classes on a given finite set form a complete lattice that includes the lattice of clones as the principal filter above the trivial clone. We de...Show More

Maximal and Minimal Closed Classes in Multiple-Valued Logic

Tamás Waldhauser

2014 IEEE 44th International Symposium on Multiple-Valued Logic

Year: 2014 | Conference Paper |

Relation Graphs and Partial Clones on a 2-Element Set

Miguel Couceiro;Lucien Haddad;Karsten Schölzel;Tamás Waldhauser

2014 IEEE 44th International Symposium on Multiple-Valued Logic

Year: 2014 | Conference Paper |

Cited by: Papers (1)

HTML

In a recent paper, the authors show that the sublattice of partial clones that preserve the relation {(0,0),(0,1),(1,0)} is of continuum cardinality on 2. In this paper we give an alternative proof to this result by making use of a representation of relations derived from {(0,0),(0,1),(1,0)} in terms of certain types of graphs. As a by-product, this tool brings some light into the understanding of...Show More

Relation Graphs and Partial Clones on a 2-Element Set

Miguel Couceiro;Lucien Haddad;Karsten Schölzel;Tamás Waldhauser

2014 IEEE 44th International Symposium on Multiple-Valued Logic

Year: 2014 | Conference Paper |

On the Semigroup of Equational Classes of Finite Functions

Jorge Almeida;Miguel Couceiro;Tamás Waldhauser

2013 IEEE 43rd International Symposium on Multiple-Valued Logic

Year: 2013 | Conference Paper |

Cited by: Papers (1)

HTML

We consider the set of equtional classes of finite functions endowed with the operation of class composition. Thus defined, this set gains a semigroup structure. This paper is a contribution to the understanding of this semigroup. We present several interesting properties of this semigroup. In particular, we show that it constitutes a topological semigroup that is profinite.Show More

On the Semigroup of Equational Classes of Finite Functions

Jorge Almeida;Miguel Couceiro;Tamás Waldhauser

2013 IEEE 43rd International Symposium on Multiple-Valued Logic

Year: 2013 | Conference Paper |

A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones

Miguel Couceiro;Lucien Haddad;Karsten Schölzel;Tamás Waldhauser

2013 IEEE 43rd International Symposium on Multiple-Valued Logic

Year: 2013 | Conference Paper |

Cited by: Papers (3)

HTML

The following natural problem, first considered by D. Lau, has been tackled by several authors recently: Let C be a total clone on 2 := {0, 1}. Describe the interval I(C) of all partial clones on 2 whose total component is C. We establish some results in this direction and combine them with previous ones to show the following dichotomy result: For every total clone C on 2, the set I(C) is either f...Show More

A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones

Miguel Couceiro;Lucien Haddad;Karsten Schölzel;Tamás Waldhauser

2013 IEEE 43rd International Symposium on Multiple-Valued Logic

Year: 2013 | Conference Paper |

Hierarchies of Local Monotonicities and Lattice Derivatives for Boolean and Pseudo-Boolean Functions

Miguel Couceiro;Jean-Luc Marichal;Tamás Waldhauser

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Year: 2012 | Conference Paper |

HTML

In this paper we report recent results concerning local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if each of its partial derivatives keeps the same sign on tuples which differ on less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonic ties for pseudo-Boolean (Bool...Show More

Hierarchies of Local Monotonicities and Lattice Derivatives for Boolean and Pseudo-Boolean Functions

Miguel Couceiro;Jean-Luc Marichal;Tamás Waldhauser

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Year: 2012 | Conference Paper |

GAP vs. PAG

Miguel Couceiro;Erkko Lehtonen;Tamás Waldhauser

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Year: 2012 | Conference Paper |

HTML

We propose a parametrized version of arity gap. The parametrized arity gap gap(f, ℓ) of a function f: An → B measures the minimum decrease in the number of essential variables of f when ℓ consecutive identifications of pairs of essential variables are performed. We determine gap(f, ℓ) for an arbitrary function f and a positive integer ℓ. We also propose other variants of arity gap and discuss furt...Show More

GAP vs. PAG

Miguel Couceiro;Erkko Lehtonen;Tamás Waldhauser

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Year: 2012 | Conference Paper |

On Composition-Closed Classes of Boolean Functions

Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

HTML

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification (diagonalization) of variables and under introduction of inessential variables (cylindrification), but they do not necessarily contain projections. Thus the lattice formed by t...Show More

On Composition-Closed Classes of Boolean Functions

Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

On Equational Definability of Function Classes

Miguel Couceiro;Erkko Lehtonen;Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

HTML

We propose a notion of functional equation for functions of a fixed arity, which is based on a pair of clones. We present necessary conditions for a class of functions to be definable by such equations, and show that for certain choices of clones these conditions are also sufficient.Show More

On Equational Definability of Function Classes

Miguel Couceiro;Erkko Lehtonen;Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

A Survey on the Arity Gap

Miguel Couceiro;Erkko Lehtonen;Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

Cited by: Papers (5)

HTML

The arity gap of a function of several variables is defined as the minimum decrease in the number of essential variables when essential variables of the function are identified. We present a brief survey on the research done on the arity gap, from the first studies of this notion up to recent developments.Show More

A Survey on the Arity Gap

Miguel Couceiro;Erkko Lehtonen;Tam´s Waldhauser

2011 41st IEEE International Symposium on Multiple-Valued Logic

Year: 2011 | Conference Paper |

Majority and Other Polynomials in Minimal Clones

Hajime Machida;Tamas Waldhauser

38th International Symposium on Multiple Valued Logic (ismvl 2008)

Year: 2008 | Conference Paper |

Cited by: Papers (4)

HTML

A minimal clone is an atom of the lattice of clones. A minimal function is, briefly saying, a function which generates a minimal clone. For a prime power k we consider the base set with k elements as a finite field GF(k). We present binary idempotent minimal polynomials and ternary majority minimal polynomials over GF(3) and generalize them to minimal polynomials over GF(k) for any prime power k g...Show More

Majority and Other Polynomials in Minimal Clones

Hajime Machida;Tamas Waldhauser

38th International Symposium on Multiple Valued Logic (ismvl 2008)

Year: 2008 | Conference Paper |

IEEE Personal Account

Change username/password

Purchase Details

Payment Options
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

Follow

About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap | IEEE Privacy Policy

A public charity, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2025 IEEE - All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

About IEEE Xplore
Contact Us
Help
Accessibility
Terms of Use
Nondiscrimination Policy
Sitemap
Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Test Whats new message.