Digital logic design : a rigorous approach / Guy Even, Tel Aviv University, Israel, Moti Medina, Tel Aviv University, Israel.
نوع المادة : نصاللغة: الإنجليزية Cambridge, UK: Cambridge University Press, 2019وصف:xx, 348 pages : illustrations ; 26 cmنوع المحتوى:- text
- unmediated
- volume
- 9781108708036
- TK7868.L6 E94 2019
نوع المادة | المكتبة الحالية | رقم الطلب | رقم النسخة | حالة | تاريخ الإستحقاق | الباركود | |
---|---|---|---|---|---|---|---|
كتاب | UAE Federation Library | مكتبة اتحاد الإمارات General Collection | المجموعات العامة | TK7868.L6 E94 2019 (إستعراض الرف(يفتح أدناه)) | C.1 | Library Use Only | داخل المكتبة فقط | 30020000066486 | ||
كتاب | UAE Federation Library | مكتبة اتحاد الإمارات General Collection | المجموعات العامة | TK7868.L6 E94 2019 (إستعراض الرف(يفتح أدناه)) | C.2 | المتاح | 30020000066485 |
Browsing UAE Federation Library | مكتبة اتحاد الإمارات shelves, Shelving location: General Collection | المجموعات العامة إغلاق مستعرض الرف(يخفي مستعرض الرف)
TK7868.D5 T58 2012 The hands-on XBee lab manual : experiments that teach you XBee wirelesss communications / | TK7868.D5 T58 2012 The hands-on XBee lab manual : experiments that teach you XBee wirelesss communications / | TK7868.L6 E94 2019 Digital logic design : a rigorous approach / | TK7868.L6 E94 2019 Digital logic design : a rigorous approach / | TK7868.L6 Y36 2004 Demystifying chipmaking / | TK7868.P6 B343 2008 Switch-mode power supplies : SPICE simulations and practical designs / | TK7870 A44 1995 دوائر التحكم باستخدام الميكروبروسسور |
Includes bibliographical references (page 343) and index.
"Chapter 1 Sets and Functions This chapter introduces two major notions: sets and functions. We are all familiar with real functions, for example f(x} = 2x + 1 and g(x} = sin(x). Here the approach is somewhat different. The first difference is that we do not limit the discussion to the set of real numbers. Instead, we consider arbitrary sets, and are mostly interested in sets that contain only a finite number of elements. The second difference is that we do not define a 'rule" for assigning a value for each x. Instead, a function is simply a list of pairs (x,y), where y denotes the value of the function when the argument equals x. The definition of functions relies on the definitions of sets and relations over sets. That is why we need to define various operations over sets such as: union, intersection, complement, and Cartesian product. The focus of this book is Boolean functions. Boolean functions are a special family of functions. Their arguments and values are finite sequences of zero and ones (also called bits). In this chapter we show how to represent a Boolean function by a truth table and multiplication tables. Other representations presented later in the book are: Boolean formulas and combinational circuits"-- Provided by publisher.