The Design of a Complete Segmented Display Unit for Arabic Alphanumeric Characters

Size: px
Start display at page:

Download "The Design of a Complete Segmented Display Unit for Arabic Alphanumeric Characters"

Transcription

1 The Design of a Complete Segmented Display Unit for Arabic Alphanumeric Characters MOHAMMAD OSIUR RAHMAN 1, MUBASHSHARUL ISLAM SHAFIQUE 2, EDGAR SCAVINO 3, HASSAN BASRI 3 1 Department of Computer Science and Engineering University of Chittagong, Chittagong-4331 BANGLADESH 2 Jodrey School of Computer Science Acadia University, NS, B4P 2R6 CANADA 3 Faculty of Engineering Universiti Kebangsaan Malaysia MALAYSIA Abstract: - There are four forms for most of the Arabic characters- initial, medial, final and isolated. This paper presents the design of a complete display unit for Arabic alphanumeric characters. The word complete signifies that the proposed display unit can represent all forms of entire Arabic alphabets as well as Arabic numerals. The first segmented display unit for Arabic characters in the world covered only the isolated form and did not follow any base line to display a sequence of characters. This work extends the capability to represent all the forms of Arabic characters and follows a base line to represent a sequence of characters. Here a grid structure of 25 non-overlapping segments has been discovered. There can be 109 alphanumeric characters (at least 99 characters such as isolated form- 30, final form-29, medial form- 21, initial form- 20; and 10 numerals) to be displayed and 7-bit input is used to represent each character. After analyzing appropriate segments to be activated for every character, respective logic functions of all segments have been derived to display the entire set of Arabic alphanumeric characters. Key-Words: - Display Unit, Dot Matrices, Karnaugh map, LED (Light Emitting Diode), 7-Segment display. 1 Introduction Segmented representation is used in lieu of the dot matrices representation for alphanumeric characters of different languages. Due to concerns of cost, power loss and design complexity, the segmented representation becomes more popular over the dot matrices. There are many display units for English and Bangla alphanumeric characters. There are three common formats of LED displays for English. For displaying only numerals and hexadecimal letters, simple 7-segment displays [1, 2] are used. To display numbers and the entire alphabetic, 18- segments display [1, 2] or 5 7 dot-matrix displays [1, 2] can be used. 26-segment [3], and 31-segment [4, 5] models are proposed for Bengali Alphabetic characters, Bengali characters, and Bengali composite letters respectively. For Arabic, there are three segmented display units only for numerals shown in [6, 7] and the first 18-segment display unit only for the initial form of Arabic characters is proposed in [8]. No complete segmented display has been developed so far for Arabic alphanumeric characters. At present, Arabic alphabetic characters are represented by using dot matrices, so the cost of the display unit increases due to the storage space, the large number of dots, the power loss and design complexity [3-8]. In this proposed segmented display system only 25 segments are used, which saves considerable amount of storage space and production costs. 2 Design Philosophy of the Proposed Arabic Display Unit There are 30 characters (including Lam-Alif) and 10 numerals in Arabic language. Writing in Arabic is unicase, i.e., it does not have the concepts of upper and lower case letters but the shape of these letters change as a function of their usage. Based on the context, a basic character can have up to four different forms: initial, medial, final and isolated [9]. Motivation for the proposed 25-segment display unit came from the 18-segment display proposed by Rahman et al. [8], which is shown in Fig.1(a). But this grid ISBN: ISSN:

2 structure supports only the isolated form of the Arabic characters and numerals. Hence, it cannot be used to display initial, medial or final forms of the Arabic characters. Besides, it lacks a common base line for all characters. As a result, it creates vertical displacement between successive characters if we try to display a sequence of isolated characters. After modification to the previous 18-segment grid structure, we propose a new grid structure consisting of 25 segments shown in Figure 1(b). For simplicity reasons, each of the 25 segments is referred to by means of a letter of the Roman alphabet. Every form of all Arabic characters and numerals can be displayed by using this new grid structure. Characters generated from this display unit strictly maintain common base line. So, using this unit we can construct Arabic words, which so far was impossible by the previous 18-segment display. There can be 109 distinct alphanumeric character shapes (10 numerals and at least 99 character shapes such as isolated form- 30, final form-29, medial form- 21, initial form- 20) to be displayed and so 7-bit input is used to run the driving circuit. Individual pattern of this input corresponds to a unique character form and activates necessary segment(s) for displaying it (Fig.2). After analyzing which segments will be activated for which character, appropriate logic function for each segment has been derived in order to represent each Arabic alphanumeric character. 3 Methodology of Characterization for Arabic Characters Display quality, power consumption, cost of design complexity, memory usage and applicability are the most decisive factors for designing any display unit [10]. Display quality of the alphanumeric characters means basic shape and beauty of the individual character, which is the main concern for any display unit because low display quality leads to damages and user rejection. At the same time, the number of segments has direct impact on power consumption and cost of memory and design complexity. Thus to design this display unit, we have used minimum number of segments while ensuring the unique shape and beauty of all 109 characters. As writing in Arabic is cursive, we have used four different techniques for four forms of Arabic characters. For the isolated form, it has been observed that some characters can be represented in various ways by using different combinations of segments. We used a minimum number of segments that can provide the quality display for the characters. Here the gap between neighbor characters needs not to be considered. For example, to represent the isolated form of Lam,(ل) we used {a,d,o,s} in lieu of {b,g,k,q,r}. (a) (b) Figure 1. (a)the Model of 18 segments for Arabic Alphabetic Characters, (b)the Model of 25 segments for Complete Arabic Alphanumeric Characters In the case of initial forms, there are two major aspects for consideration display quality and the gap between the target initial character and its left neighbor character. If we want to provide a quality appearance for a sequence of characters, we have to reduce the gap between the target character and its left neighbor character. So, to represent the an initial character, we took the segments from the left side of the grid structure as far as possible and try to extend the character by taking maximum number of segments from left side of the base line for reducing the gap with its left neighbor. Such as for initial form of Ain,(ع) {e,k,q} is chosen instead of {i,g,k,l,q}. ISBN: ISSN:

3 For the medial form, three major issues are addresseddisplay quality and two gaps between the target character and both left and right neighbors. So, to represent the target character we choose minimum number of segments and try to extend the character by taking maximum number of segments from both left and right side of the base line for reducing the gap with its left and right neighbor characters. Such as in lieu of {g,k,l,y}, {g,k,l,m,q,y} is used to represent the.(ب) medial form of Ba 7-bit input (A,B,C,D, E,F,G) Driving Circuit 25 segments (a,b,..x,y) Figure 2. Overall block diagram of the complete Arabic display driver system. For the final form, we considered two major issues display quality and the gap between the target character and its right neighbor. To represent the target character we choose the segments from the right side of the grid structure as far as possible and try to extend the character by taking maximum numbers of segments from right side of the base line in order to reduce the gap between the target character and its right neighbor. Such as to display the final form of Alif,(ا) {b,g,l,m } is chosen in lieu of {a,d,k,l,m}. 4 Characterization of Arabic Alphanumeric Characters by Using the Proposed Segmented Display Unit All Arabic alphanumeric characters along with their four forms can be represented by using different combinations of non-overlapping 25 segments: a, b, c, d, e, f, g, h, i, j, k,l, m, n, o, p q, r, s, t, u, v, w, x, and y. The structure of non-overlapping segments is already shown in Fig.1(b). Table 1 presents partial Arabic alphanumeric characters as a sample generated by using this display unit. We get the truth table for Arabic alphanumeric characters from Table 1, which is shown in Table 2. In Table 2, each index value corresponds to decimal equivalent of respective 7-bit input pattern, which also precedes every character in Table 1. The truth table yields us Boolean function for each of the 25 segments. K-map minimization software [11] is used to minimize them. The minimized Boolean functions are shown in Table 4. To list all Arabic alphanumeric characters in their four forms, we use the following notation: Character Name, Basic Symbol {(segments used to represent isolated form), (segments used to represent final form), (segments used to represent medial form), (segments used to represent initial form)} If any particular form is absent for a character, NULL is used instead of segment list. For example, by using the above notation four forms of Ghain (غ) are listed as follows: Ghain, غ {(e,k,n,t,v),(e,g,k,l,m,n,t,v), (h,i,j,k,l,m,q,w), (e,k,q,u)} Here, the isolated form of Ghain (غ) is represented by e, k, n, t, and v segments; the final form of Ghain (غ) is represented by e, g, k, l, m, n, t, and v segments; the medial form of Ghain (غ) is represented by h, i, j, k, l, m, q, and w segments; the initial form of Ghain (غ) is represented by e, k, q, and u segments. In this way, all Arabic alphanumeric characters are represented. Some characters are shown in Table 3 as samples. Some minimized Boolean functions for segments out of 25 are shown in Table 4 as sample. 6 Conclusions The paper emphasized on a successful display of four forms of Arabic alphanumeric characters through proposed 25-segment display unit. The strength of this design is that it is capable of writing consecutive characters to form Arabic strings. The display structure is designed without any intersection of the constituent segments. Moreover it follows the same base line for all characters, which is a must to write Arabic words. From now onwards, the proposed design may be used rather than dot matrices to represent Arabic alphanumeric characters, which is more efficient, cost effective and consumes less storage. In future, attempts will be made to include the display of punctuation and special characters of Arabic Language and Urdu alphanumeric characters along with the present system. ISBN: ISSN:

4 Table 1. Representation of Arabic Alphanumeric Characters by Using Proposed 25-Segment Display Unit Serial Letter Name Isolated Form Final Form Medial Form Initial Form Number 1 Alif 2 Tha / Sa 3 Kha 4 Zai / Za 5 Sheen 6 Dad / Dwad 7 Zhoa 8 Ghain 9 Fa 10 Kaf 11 Ya ISBN: ISSN:

5 Table 2. Table for Arabic Alphanumeric Characters Using 25-segments Display Index Shape a No b c d e f g h i j k l m n o p q r s t u v w x y ISBN: ISSN:

6 Table 3. Arabic alphanumeric characters in their References: four forms [1] Cook B.M. and White N.H., Computer Serial Structural components of Four Forms of Peripherals, 3 rd Edition, United Kingdom, pp. No. Arabic Alphanumeric Characters 43-45, Alif, ا {(a,d), (b,g,l,m), (NULL),(NULL)} [2] Hall D.V., Microprocessor and Interfacing: 2. Tha/Sa,ث{(j,k,l,q,r,u,v,w),(j,k,l,m,q,r,u,v,w), Programming and Hardware, 2 nd Edition, Tata (g,k,l,m,q,u,v,w),(g,k,q,u,v,w)} McGraw-Hill Publishing Co. Ltd., New Delhi, 3. Kha, خ {(k,n,p,t,u), (k,l,m,n,p,t,u), 2003, pp. 4, 267. (f,h,k,l,m,q,v), (f,h,k,l,q,v)} [3] Rahman M.O., and Kabir S.M.L., Designing 4. Zai/Za, ز {(g,n,v), (g,l,m,n,v), (NULL), (NULL)} 26-Segments Display for Bangla Characters, 5. Sheen,ش{(d,g,j,k,l,o,s,u,v,w),(d,g,j,k,l,m,o,s,u, Asian Journal of Information Technology, v,w), (d,g,j,k,l,m,q,u,v,w), (d,g,j,k,l,q,u,v,w)} Vol.3 No.8, pp , Dad/Dwad,ض{(d,e,i,j,k,l,o,s,v),(d,e,i,j,k,l,m,o, [4] Mahmud S., Arefin A.S. and Khan M.I., A s,v), (d,e,i,j,k,l,m,q,v), (d,e,i,j,k,l,q,v)} New Approach for Displaying All Bengali 7. Zhoa, ظ {(a,d,e,i,j,k,l,q,v), (a,d,e,i,j,k,l,m,q,v), Characters, Asian Journal of Information (NULL), (NULL)} Technology, vol.4 No.2, pp , Ghain, غ {(e,k,n,t,v),(e,g,k,l,m,n,t,v), [ 5] Chowdhury M.S., A Segmented Display (h,i,j,k,l,m,q,w), (e,k,q,u)} system for Bengali Composite Letters, The 9. Fa, ف {(e,g,k,n,s,u), (e,g,k,l,m,n,s,u), Chittagong University Journal of Science, vol. (e,g,k,l,m,q,u), (e,g,k,q,u)} 29(2), pp , Kaf, ك {(a,d,o,p,q,r,s), (a,d,k,l,m,o,p,q,r,s), [6] Rahman M.O., Azim M.A., Chowdhury (c,i,j,k,l,m,q), (c,i,j,k,l,q)} M.S., Islam M.N., Different Segment 11. Ya, ي {(e,k,n,s,x,y), (f,h,k,m,n,s,x,y), displays for Bangla, English and Arabic digits, in Proceedings of the 6 Dhaka, pp , [7] A.K.M. Khaled Ahsan Talukder and Kaushik Roy, Development of 16- Table 4. Simplified Boolean Functions For segment Multilingual Display Driver, in Segments Name of Proceedings of ICEECE, Dhaka, pp.27-31, Segments Simplified Boolean Functions [8] Rahman M.O., Billah M.M., and a = (A B C D G F E + A B CG FE + a Chowdhury M.C., Designing Display Unit A BC G FE + A BCGF E + ABC GF E + AB CGF E ); for Arabic Alphabetic Characters, in b = (A B C DG F E + A BCD GF E + Proceedings of M²USIC, Malaysia, TS3Ab ABC GF ); 5, pp.17-20, [9] Available at: c c = (A BCD GF E + AB C GF E ); d = (A B C D G F E + AB C DFE + hy.html d A BCGF E + ABC GF E + AB CGF E + [10]Rahman M.O. and Ahmed S., Comparative A B G FE + A BC G F + A BC FE + Study on Different Proposed Segmented A BD FE + CG FE + AG FE ); Display Units for Bangla Numerals, Asian v v = (ABC G F E + AB CG F E + Journal of Information Technology, vol. 4, No. AB C G F E + AB CG FE + A B CGF E 1, pp , B C G FE + A C G FE + BCG FE + [11] Karnaugh Map Minimizer v0.4, Available: A BC GF ); W w = (ABC D G E + A BCG E + ABC G F + AB G F E + AB C G E ); X y x = (ABCDGF E + A B CG F E + ABCG F E + A B C GFE + A B D GFE ); y= (ABCDGF E + A B C G F E + A BC G F E + A B GFE ); ISBN: ISSN:

Digital Logic (2) Boolean Algebra

Digital Logic (2) Boolean Algebra Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh

More information

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit

More information

Combinational Digital Design. Laboratory Manual. Experiment #6. Simplification using Karnaugh Map

Combinational Digital Design. Laboratory Manual. Experiment #6. Simplification using Karnaugh Map The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2013 Khaleel I. Shaheen Combinational Digital Design Laboratory Manual Experiment #6 Simplification

More information

Designing a 36 Segment Display for Bengali Compound Character

Designing a 36 Segment Display for Bengali Compound Character 8 IJCSNS International Journal of Computer Science and Netork Securit, VOL. No., March Designing a Segment Displa for Bengali Compound Character Md. Shahnur ad Chodhur, Ms Sultana kter and Md man Ullah

More information

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept

More information

MODULE- 07 : FLUIDICS AND FLUID LOGIC

MODULE- 07 : FLUIDICS AND FLUID LOGIC MODULE- 07 : FLUIDICS AND FLUID LOGIC LECTURE- 26 : INTRODUCTION TO FLUID LOGIC INTRODUCTION Fluidics (also known as Fluidic logic) is the use of a fluid or compressible medium to perform analog or digital

More information

Digital Systems and Information Part II

Digital Systems and Information Part II Digital Systems and Information Part II Overview Arithmetic Operations General Remarks Unsigned and Signed Binary Operations Number representation using Decimal Codes BCD code and Seven-Segment Code Text

More information

Number System conversions

Number System conversions Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number

More information

Introduction to Karnaugh Maps

Introduction to Karnaugh Maps Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for

More information

Chapter 3 Combinational Logic Design

Chapter 3 Combinational Logic Design Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts

More information

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1 Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates

More information

Karnaugh Maps Objectives

Karnaugh Maps Objectives Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between

More information

CHAPTER 7. Exercises 17/ / /2 2 0

CHAPTER 7. Exercises 17/ / /2 2 0 CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2

More information

Karnaugh Map & Boolean Expression Simplification

Karnaugh Map & Boolean Expression Simplification Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.

More information

Cs302 Quiz for MID TERM Exam Solved

Cs302 Quiz for MID TERM Exam Solved Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices

More information

CHAPTER 7. Solutions for Exercises

CHAPTER 7. Solutions for Exercises CHAPTER 7 Solutions for Exercises E7.1 (a) For the whole part we have: Quotient Remainders 23/2 11 1 11/2 5 1 5/2 2 1 2/2 1 0 1/2 0 1 Reading the remainders in reverse order we obtain: 23 10 = 10111 2

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Combinatorial Circuit Analysis and Synthesis

Introduction to Digital Logic Missouri S&T University CPE 2210 Combinatorial Circuit Analysis and Synthesis Introduction to Digital Logic Missouri S&T University CPE 2210 Combinatorial Circuit Analysis and Synthesis Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science

More information

COMPUTER SCIENCE TRIPOS

COMPUTER SCIENCE TRIPOS CST.2014.2.1 COMPUTER SCIENCE TRIPOS Part IA Tuesday 3 June 2014 1.30 to 4.30 pm COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit

More information

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Boolean Logic Prof. James L. Frankel Harvard University Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Logic Levels Logic 0 Also called GND Low Off False Logic

More information

Chap 2. Combinational Logic Circuits

Chap 2. Combinational Logic Circuits Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization

More information

Sample Test Paper - I

Sample Test Paper - I Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:

More information

Chapter 7 Logic Circuits

Chapter 7 Logic Circuits Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active

More information

DE58/DC58 LOGIC DESIGN DEC 2014

DE58/DC58 LOGIC DESIGN DEC 2014 Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5

More information

Advanced Boolean Logic and Applications to Control Systems

Advanced Boolean Logic and Applications to Control Systems Advanced Boolean Logic and Applications to Control Systems Course No: E0-0 Credit: PDH Jeffrey Cwalinski, P.E. Continuing Education and Development, Inc. 9 Greyridge Farm Court Stony Point, NY 0980 P:

More information

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr. Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational

More information

Combinational Logic. By : Ali Mustafa

Combinational Logic. By : Ali Mustafa Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output

More information

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential

More information

CS/COE0447: Computer Organization and Assembly Language

CS/COE0447: Computer Organization and Assembly Language CS/COE0447: Computer Organization and Assembly Language Logic Design Introduction (Brief?) Appendix B: The Basics of Logic Design Dept. of Computer Science Logic design? Digital hardware is implemented

More information

CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha. BCD Codes

CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha. BCD Codes CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha BCD Codes Q. Give representation of the decimal number 853 in each of the following codes. (a) 8421 code (c) 84(-2)(-1) code (b) Excess-three

More information

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

UNIT 4 MINTERM AND MAXTERM EXPANSIONS UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and

More information

Optimizations and Tradeoffs. Combinational Logic Optimization

Optimizations and Tradeoffs. Combinational Logic Optimization Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming

More information

Unit 3 Session - 9 Data-Processing Circuits

Unit 3 Session - 9 Data-Processing Circuits Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction

More information

EEE130 Digital Electronics I Lecture #4

EEE130 Digital Electronics I Lecture #4 EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean

More information

Philadelphia University Student Name: Student Number:

Philadelphia University Student Name: Student Number: Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018

More information

Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد

Save from:   cs. Logic design 1 st Class أستاذ المادة: د. عماد Save from: www.uotiq.org/dep cs Logic design 1 st Class أستاذ المادة: د. عماد استاذة المادة: م.م ميساء Contents Lectured One: Number system operation 1- Decimal numbers. 2- Binary numbers. 3- Octal numbers.

More information

Lecture 3: Boolean Algebra

Lecture 3: Boolean Algebra Lecture 3: Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University Overview

More information

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions? Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation

More information

IT T35 Digital system desigm y - ii /s - iii

IT T35 Digital system desigm y - ii /s - iii UNIT - II Combinational Logic Adders subtractors code converters binary parallel adder decimal adder magnitude comparator encoders decoders multiplexers demultiplexers-binarymultiplier Parity generator

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal

More information

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION

More information

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name

More information

Number Theory: Representations of Integers

Number Theory: Representations of Integers Instructions: In-class exercises are meant to introduce you to a new topic and provide some practice with the new topic. Work in a team of up to 4 people to complete this exercise. You can work simultaneously

More information

REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions.

REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions. Bulletin of the Marathwada Mathematical Society Vol.5, No.1, June 2004, Pages 35-44 REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions. S.R. Joshi 3, Accharya

More information

Laboratory II. Exploring Digital Logic

Laboratory II. Exploring Digital Logic Laboratory II Exploring Digital Logic Abstract Few devices in the world are as ubiquitous as the seven-segment display. This device, which was invented in the 1960 s, can be found everywhere from digital

More information

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common

More information

Unit 2 Session - 6 Combinational Logic Circuits

Unit 2 Session - 6 Combinational Logic Circuits Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums

More information

Binary logic consists of binary variables and logical operations. The variables are

Binary logic consists of binary variables and logical operations. The variables are 1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two

More information

Digital Logic Appendix A

Digital Logic Appendix A Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry

More information

Review for Test 1 : Ch1 5

Review for Test 1 : Ch1 5 Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8

More information

Boolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra

Boolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming

More information

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits. CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!

More information

Digital Design through Pi

Digital Design through Pi 1 Digital Design through Pi G V V Sharma Contents 1 Display Control through Hardware 1 1.1 Components......... 1 1.2 Software Setup........ 1 1.3 Powering the Display.... 1 1.4 Controlling the Display...

More information

EC-121 Digital Logic Design

EC-121 Digital Logic Design EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What

More information

MODULAR CIRCUITS CHAPTER 7

MODULAR CIRCUITS CHAPTER 7 CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Subtractors

Introduction to Digital Logic Missouri S&T University CPE 2210 Subtractors Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu

More information

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational

More information

Digital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1

Digital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1 Digital Systems Digital systems have such a prominent role in everyday life The digital age The technology around us is ubiquitous, that is we don t even notice it anymore Digital systems are used in:

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan

More information

/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal

More information

Digital Design through Arduino

Digital Design through Arduino 1 Digital Design through Arduino G V V Sharma Contents 1 Display Control through Hardware 1 1.1 Components......... 1 1.2 Powering the Display.... 1 1.3 Controlling the Display... 2 2 Display Control through

More information

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.

More information

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final

More information

Introduction to Language Theory and Compilation: Exercises. Session 2: Regular expressions

Introduction to Language Theory and Compilation: Exercises. Session 2: Regular expressions Introduction to Language Theory and Compilation: Exercises Session 2: Regular expressions Regular expressions (RE) Finite automata are an equivalent formalism to regular languages (for each regular language,

More information

MM74C912 6-Digit BCD Display Controller Driver MM74C917 6-Digit Hex Display Controller Driver

MM74C912 6-Digit BCD Display Controller Driver MM74C917 6-Digit Hex Display Controller Driver MM74C912 6-Digit BCD Display Controller Driver MM74C917 6-Digit Hex Display Controller Driver General Description The MM74C912 MM74C917 display controllers are interface elements with memory that drive

More information

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011 Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the

More information

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS Unit : I - V Unit : I Overview Fundamentals of Computers Characteristics of Computers Computer Language Operating Systems Generation of Computers 2 Definition of

More information

Boolean Algebra, Gates and Circuits

Boolean Algebra, Gates and Circuits Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von

More information

Multiplexers Decoders ROMs (LUTs) Page 1

Multiplexers Decoders ROMs (LUTs) Page 1 Multiplexers Decoders ROMs (LUTs) Page A Problem Statement Design a circuit which will select between two inputs (A and B) and pass the selected one to the output (Q). The desired circuit is called a multiplexer

More information

Lecture 22 Chapters 3 Logic Circuits Part 1

Lecture 22 Chapters 3 Logic Circuits Part 1 Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture

More information

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table. The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

Sample Marking Scheme

Sample Marking Scheme Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2008 Midterm Examination # 1 B Wednesday, November 5, 2008 Sample Marking Scheme Duration of examination:

More information

Why digital? Overview. Number Systems. Binary to Decimal conversion

Why digital? Overview. Number Systems. Binary to Decimal conversion Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not

More information

Minimization techniques

Minimization techniques Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation

More information

1 Boolean Algebra Simplification

1 Boolean Algebra Simplification cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.

More information

DIGITAL LOGIC CIRCUITS

DIGITAL LOGIC CIRCUITS DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,

More information

Exam for Physics 4051, October 31, 2008

Exam for Physics 4051, October 31, 2008 Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Boolean Algebra

Introduction to Digital Logic Missouri S&T University CPE 2210 Boolean Algebra Introduction to Digital Logic Missouri S&T University CPE 2210 Boolean Algebra Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and

More information

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology

More information

Fundamentals of Digital Design

Fundamentals of Digital Design Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric

More information

How do regular expressions work? CMSC 330: Organization of Programming Languages

How do regular expressions work? CMSC 330: Organization of Programming Languages How do regular expressions work? CMSC 330: Organization of Programming Languages Regular Expressions and Finite Automata What we ve learned What regular expressions are What they can express, and cannot

More information

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only) CSE140 HW1 Solution (100 Points) 1 Introduction The purpose of this assignment is three-fold. First, it aims to help you practice the application of Boolean Algebra theorems to transform and reduce Boolean

More information

MM74C912 6-Digit BCD Display Controller/Driver

MM74C912 6-Digit BCD Display Controller/Driver 6-Digit BCD Display Controller/Driver General Description The display controllers are interface elements, with memory, that drive a 6-digit, 8-segment LED display. The display controllers receive data

More information

CHAPTER III BOOLEAN ALGEBRA

CHAPTER III BOOLEAN ALGEBRA CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.

More information

12/31/2010. Digital Operations and Computations Course Notes. 01-Number Systems Text: Unit 1. Overview. What is a Digital System?

12/31/2010. Digital Operations and Computations Course Notes. 01-Number Systems Text: Unit 1. Overview. What is a Digital System? Digital Operations and Computations Course Notes 0-Number Systems Text: Unit Winter 20 Professor H. Louie Department of Electrical & Computer Engineering Seattle University ECEGR/ISSC 20 Digital Operations

More information

ENG2410 Digital Design Combinational Logic Circuits

ENG2410 Digital Design Combinational Logic Circuits ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single

More information

Karnaugh Maps for Combinatorial Logic CS 64: Computer Organization and Design Logic Lecture #12

Karnaugh Maps for Combinatorial Logic CS 64: Computer Organization and Design Logic Lecture #12 Karnaugh Maps for Combinatorial Logic CS 64: Computer Organization and Design Logic Lecture #2 Ziad Matni Dept. of Computer Science, UCSB Administrative Re: Midterm Exam #2 On Thursday! Everything from

More information

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable

More information

ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2

ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office: 3802

More information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes

More information

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of

More information

1 Computing System 2. 2 Data Representation Number Systems 22

1 Computing System 2. 2 Data Representation Number Systems 22 Chapter 4: Computing System & Data Representation Christian Jacob 1 Computing System 2 1.1 Abacus 3 2 Data Representation 19 3 Number Systems 22 3.1 Important Number Systems for Computers 24 3.2 Decimal

More information

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html

More information

SAMPLE ANSWERS MARKER COPY

SAMPLE ANSWERS MARKER COPY Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination:

More information

Slides for Lecture 16

Slides for Lecture 16 Slides for Lecture 6 ENEL 353: Digital Circuits Fall 203 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 6 October, 203 ENEL 353 F3 Section

More information

Lecture (02) NAND and NOR Gates

Lecture (02) NAND and NOR Gates Lecture (02) NAND and NOR Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II NAND gates and NOR gates In this section we will define NAND and NOR gates. Logic

More information

Boolean Algebra and logic gates

Boolean Algebra and logic gates Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l Boolean

More information

of Digital Electronics

of Digital Electronics 26 Digital Electronics 729 Digital Electronics 26.1 Analog and Digital Signals 26.3 Binary Number System 26.5 Decimal to Binary Conversion 26.7 Octal Number System 26.9 Binary-Coded Decimal Code (BCD Code)

More information

Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc.

Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc. Finite State Machines Introduction Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc. Such devices form

More information