Monday, November 19, 2007

Getting Rid Of Cat Ginivites

Preface to the online publication




This is the material that forms part of a book I wrote with the title Fundamentals Digital Logic: Problems and Solutions . The book's rights in Mexico are registered with the Directorate General of Copyright under the Registration Number 09031981-005 Artwork with entry number 04289 numbered.

The book is being uploaded to the Internet, using the opening provided by Google and Blogger, so that these materials are available to all students, teachers, technicians and engineers from all English-speaking countries 24 hours Day mode permanent.

From the days when the book was written under the meteor technological advances there have been many things have changed. For one thing, the cost of individual transistors and diodes are required for the construction of something as basic as the binary adder made it almost mandatory to study techniques such as Karnaugh map to minimize the number of discrete components required which in a project which required hundreds if not thousands of these components represents significant savings. Today, with large-scale integration, the savings you can expect to get with a minimization of some 28 components about 22 components are minimal. The simplification of the required logic is no longer a priority, even in small projects it is desirable to reduce the space required for interconnection wiring. But this is not the only thing that has changed. Previously, once a system was being designed logic circuits, the only way to be absolutely sure about the operation of the components specified in the design was to build a prototype in a laboratory. Today, these buildings are obsolete, we can "build" the system in a simulated through specialized programs that can run on a desktop computer. Although nothing replaces the experience of going to a lab and start connecting power supplies, interface components, and apply energy to see how the building works, the power of simulation programs can predict whether the designed system will work as expected or if the design will fail for some detail overlooked. You no longer need to apply solder to connect and remove the solder to disconnect, simply press today only a few keys to "turn off" and return to "connect" anything on the computer monitor.

However, there are some things that have not changed, which probably will not change. Those things are the fundamental principles on which digital logic rests which are designed and built in pocket calculators, electronic clocks without mechanical components, medical systems to determine the blood pressure automatically, in short, everything which is beating in digital logic. It is these principles that the book was intended initially. And the same principles that are still running today.

In the United States, by act of law, the February 17, 2009 comes into force an ordinance which mandates the replacement of all traditional television signals to digital signals. The whole world up to a future as fully digitized, and the essential knowledge digital logic has grown from a sophisticated art for highly skilled technicians, high-wage to a real need for many whose lives are being changed dramatically by the information revolution that is itself the product of the increasing sophistication of digital circuits .

An innovation in publishing this book on the Internet is the addition of numerous references to websites where the reader can find more information about various topics. Previously, the only way to get more data on a particular topic was referring to a good library (something difficult in most countries speaking, taking into account the high cost of technical books and the financial constraints faced by the vast majority of public libraries in these countries) or purchase technical books containing the information sought, which was not a good option for people with low estimates limited or hard to obtain the desired books in their own countries, having to order such books abroad through a distributor with long waiting times are common in these cases. In the new era of Internet, it has come to an end, and the whole world has become a giant electronic library which shared expertise are no longer the exclusive property of the high income nations.

Placing the book on the Internet has been a considerable effort, because it has essentially required to write the book from the beginning, which has consumed an enormous amount of time. Other problems have required having to take into account the limited capacity of some operating systems and browsers to "print" on the screen of the monitor certain special typefaces are not universal. A primary example of this is the logical inversion operation which is represented so that a logical variable that has undergone a process of investment is represented by a horizontal line placed above the letter representing the variable being "denied", which allows you to write expressions such as Boolean algebra:


However, not all possible combinations of operating systems and Internet browsers have typographic technology sophisticated enough to allow writing on the screen of the monitor this type of symbology (horizontal lines placed above the letters), which has caused much of what is published on the internet related in some way with Boolean logic does not resort to the use of upper rod to denote variables or negated expressions. To solve this and help readers to be able to read everything related in some way with Boolean algebra and logic circuits that exclude the use of upper rod limited the use of apostrophes, in various parts of the book also to get a line above the letters that can be displayed by the latest combinations of operating systems and browsers, are also represented separately in various parts of the book expressions with variables "denied" with a different color, the color blue (the color is assistance from the author to his readers, not a convention that is followed universally), this also putting an apostrophe as an alternative typeface immediately after the letter that is being "denied" according to an accepted practice in many texts to denote the "logical negation" with apostrophes. Thus, the above expression will be represented here in its equivalent form as follows:

A + A '= 1

When they appear in this book in Internet terms with this type of notation (using apostrophes) , will be placed in square brackets immediately after the words appearing in a previous line complemented with a horizontal bar above, this in order to indicate that it is completely expressions equivalent but different typeface so represented. Below is an example of this:


A + B = A · B

[ __ (A + B) ' = A' · B ' __]

Here, the expression on the first line is equal to the expression in the second line. Both are completely equivalent.

Another problem inherent in the online publication of the book is that, unlike text form in which it can put many small details that still can be distinguished visually, many of these fine details can be easily lost in a color SVGA monitor because the vast majority of computer monitors has limited resolution capability. This can only be offset by the diagrams and figures larger. Unfortunately, to make the greatest figure, the host site (in this case, Blogger) automatically activates an attribute known as the "image resizing" which "compresses" the image size so that it can fit within the area visual page. Fortunately, the image original is not discarded, but can be obtained by merely "click" with the mouse within the image. In those cases in which it is highly desirable to carry out here the extension of the image in order to retrieve some visual data are lost during the compression process, the reader will recommend expanding the image with text green letter that tells you zoom . Here's an example that illustrates this point, which shows a basic computer built around the Zilog Z80 microprocessor:




If the reader attempts to obtain more details on this circuit, it may not succeed. However, if you click with the mouse within the image, Blogger will send a larger image. And if the reader does it again click with the mouse within the image, possibly get an extension even more (this depends on the browser being used, the size of monitor being used, and even the operating system). There is also an option in most modern browsers can open a separate window and independent to activate a link, which allows you to perform the zoom operation showing the enlarged image in a separate window, allowing easily switch between text and image.

is important to note that although not all images tells the reader to perform the procedure zoom, many of them can be seen with better resolution and clarity when performing the procedure.

There is another reason for carrying out the process of "image magnification. One advantage of online publications is that they allow something that simply is not possible in a printed text, including files animated gif format , which can sometimes highlight so impressive to a point of importance, which makes them a excellent teaching aid. The vast majority of these files animated gif , to be included within the pages of Blogger, do not show any animation, because it allows the page content. For example, the following cartoon may be displayed or not a completely static picture when seen within this page depending on the browser you are using (Mozilla Firefox, Internet Explorer, Google Chrome, Opera, etc.)




Also the next drawing is actually a cartoon may appear as a completely static image:




But if carried out the process of zoom in on each of the last two pictures, then to be abandoned temporarily to load each page file gif can witness the full animation, after which they can return to this page as it is customary in all browsers.

This work is to be released to the Web a few years ago was initially optimized for a 17 "monitor with a screen resolution of 1024x768 pixels, which became the de facto standard for older monitors the type of tube ray cathode ray (CRT) to display an image with an "aspect ratio" ( aspect ratio) of "four to three," or 4:3, this being the reason for the width of an image (measured horizontally) to their height (measured vertically). Soon appeared flat screen monitors, initially quite expensive, the cost came down to be replacing a lot of older monitors the type of cathode ray tube. These flat panel monitors allow a panoramic presentation of much greater width with which it would be possible to put large images in their original size without requiring the reader to zoom . However, is not possible to redo the work to maximize the availability of widescreen flat for the simple reason that in many English-speaking countries with limited budgets still depend on older monitors, and even if they do change to modern screen monitors flat bulk is likely to continue to use many of these computers, "oldies" to which are connected to retain older operating systems (Windows XP, Windows Millennium, etc.) do not guarantee that updates the capacity to absorb the flat-screen functionality. This addition to the submission of logs is not wide format guaranteed to all browsers used today. Thus, more for reasons of compatibility with the wide variety of systems used today in the English-speaking countries for reasons of taste, the work has been left intact as it first appeared.

Given the vast superiority of the Mozilla browser on the Internet Explorer browser, if there are problems for proper viewing of all materials contained in this book is strongly recommended to install Mozilla on the machine where these materials will be consulted, which does not produce conflicts with browsers already on the machine itself and instead give a verified top choice for this text.

is important to note that this author has spared no resources to include as many diagrams, on the educational provision of visual education is much more effective and more durable than merely symbolic teaching. Moreover, exploiting the fact that almost all monitors now used to connect to the Internet under almost any operating system are color monitor capable of displaying a wide range of bright colors, a large number of drawings of the book have added colorful generously to make the presentation more attractive to maintain focus and achieve the reader's attention, unlike the papers submitted for publication in professional journals in which customary to "seriousness" of the materials accepted for publication not only by reducing to an absolute minimum possible number of drawings and illustrative examples, but doing it all black and white, like a solemn mourning session.

Each of the issues resolved included in the book has a very specific educational purposes, either to introduce or expand a new idea, or provide some practice in a key concept, plus they are arranged in increasing order of difficulty , going from easiest to most difficult, which is why it is important to study them in the order they are posted. In several parts of the book, you incur details that may seem redundant to an extent that may seem almost ridiculous, as is the case with several problems related to Boolean algebra, where several parties will see an additional set of steps resolution that would possibly be eliminated by most book publishers, and certainly would not be admissible in a professional journal. However, the intention of this work is to make it accessible to the broadest audience possible, which includes people not necessarily be studying for a university degree and that even these materials will be studying self-taught, self-employed, without the benefit of the assistance of a competent teacher at his side who can be clarifying their doubts, why it was necessary to go into detail on things that otherwise should be very clear way for people with university degrees.

A great advantage of publishing a book on the Internet in contrast with the publication of the traditional paper book is the author of the book may receive requests from his readers (teachers, students, general public) requesting that a subject is discussed in more detail, clarity, or with better examples and visual aids. The author of this book is in happy to answer your readers anything that will broaden and enhance the educational value of this work. On the other hand, misspellings, typographical and human plan can be communicated to the author and can be corrected almost instantly, something not possible in the print edition of a book that barely and sporadically published a "misprint." The author of this book, readers appreciate the marking of any such error promising a prompt correction of it in as your time permits, as well as appreciate the remark of "dead links" of the Internet referred to in this work with to remove and possibly substitutes to replace them with alternates. This makes a book published online in a work "alive", unlike a printed book that is unable to interact with their readers. Finally, the best advantage of all is that the publication of a book on the internet not having to go through the sad process of review by the editors of the book, which in many cases mutilated and change both the original text at the end of the text published very little resembles the original intention of the author.

As another sign of the times, this "second edition" of the book is something that appeared in the original edition: the addresses of various Internet sites which can be downloaded (download) executable programs, most of them free, to assist students and technicians in the study, analysis and design of logic circuits.

For the book's publication on the Internet, have also included several supplements that were not part of the original work, starting with Supplement # 1 dealing in more detail on the families of electronic components which are implemented basic logic functions. The Supplement # 1 something must satisfy the curiosity of those who want to know what is going more deeply into those "black boxes" we have symbolized as basic logic functions or derivatives thereof. Although a technician who knows the basics of digital logic can not spread it very well without knowing what's inside those black boxes, and may be able not only to repair systems that use digital logic, but even up to make designs as a professional in many there is always curious about what is happening "inside." The exhibition's theme of logic families is presented in a qualitative, not quantitative way, since the latter would require us to go more in depth on issues such as the operation of bipolar transistors and effect transistors field Kirchofff laws, thermal effects, etc., and this book assumes that the average reader of this book introductory to the subject has no such knowledge. We also have the Supplement # 2 which is sovereign the pinnacle of the integration of basic logic functions on a large scale: the microprocessor, followed by Supplement # 3 describing how he works the microprocessor and Supplement # 4 is in fact a charge divided into two parts that have some relationship: the Supplement 4a: The 8086 microprocessor instructions and Supplement 4b: Microprocessor Programming that describes how it is out the development of programs for them to be executed by a microcomputer. There is no better way to get an idea on how to carry out the programming of a microprocessor to have seen a set of instructions of a typical microprocessor, and Intel 8086 microprocessor for its relative simplicity offers a good starting point for this. In addition to these supplements, we Supplement # 5 that describes how a microcomputer can communicate with the outside world when there is only one channel (or electrical cables) through which to transmit information. In addition to the supplements already mentioned, we have attached two supplements described as certain basic analog integrated circuits (as opposed to integrated circuits digital discussed in the book) often used in systems that often appear hybrids in which the design requires the integration of both digital electronics components such as analog electronics. These are the Supplement # 6 dealing with the operational amplifier better known as op-amp , and Supplement # 7 dealing with the timer 555, better known as 555 timer.

response to a request by a considerable amount of my readers who feel somewhat my fellow students or teachers, I have added an additional last minute, the Supplement # 8 that provides an introduction to ladder diagrams and the application of these diagrams in the programming of programmable logic controllers. This can be seen in some ways the point of entry into the areas of industrial automation, most notably the robotics or mechatronics .

For those college students who want to find in this book some information about the representation of sequential logic circuits using the theoretical model and the Moore machine model Mealy machine theorist, has included the Supplement # 9 with a brief discussion on these topics.

addition to the many numerous figures and diagrams which consists of original work, have been added in the figures and diagrams book freely available on the Internet to further enhance the clarity of the text. This profusion of images should serve as a substitute for the lack of a board with which the author of this book make clear to students normally issues a little more difficult to grasp. It has made every effort to keep the original spirit of the book, making changes only when it is a better explanation or adding more pictures and diagrams.

To save time and to have all the chapters of this book available that has an almost immediate, convenient and efficient alternative for those students or educational institutions with Internet connections is to go slow speed " keeping "in the computer hard disk (or a memory such as" flash drive USB) per page (complete) that is posted each chapter as you go down the materials. This is always possible in most modern browsers like Internet Explorer or Mozilla with the option of the menu line set to "File" (File) with an option to "Save Page Ace .." (Save the page as ...). Thus, the next time you need to refer to a chapter, rather than access the web page down slowly all the materials can directly access the page from the same hard disk or from memory "flash drive" (any mode Internet connection required to download additional content provided by Blogger to build the page) at a much faster, making this work in an "electronic book" in the fullest sense of the word.

Added an updated bibliography that can be used as reference material and documentation. It may be of interest to many readers to know that some of the books in literature can be downloaded free from the Internet to one or more sites. Libero

since this book with the hope that their materials and lessons can be of any use to those wishing to learn more about what are the essential foundations on which they are based computers that make it possible to extend the same to everyone Internet.


The Author
Armando Martinez Tellez

Is Surgery Requiedfor 8 Cm Renal Cyst On Kidney

Contents Foreword to the book

With the advent of microelectronics, modern man has been appearing before an endless series wonders considered impossible a few decades ago. The digital electronic clock has been moving the mechanical watch market and is considered a near future delete it completely. Electronic calculator has been perfected to such a degree that a pocket calculator can perform mathematical operations that the first computers of the war (WWII) could not carry out, in addition to occupying entire buildings. Satellite communications have become a practical reality. The tone-dial telephone that displaced the mechanical rotary phone, cell phone and the automated telephone service long distance previously required dedicated operator also appeared together. In industry, the plants which process is electronically controlled by computers are now an absolute necessity. There are countless examples that could fill volumes.

Current developments promise for the future products as amazing as the automatic medical diagnosis, car electronic computer-controlled electronic vision for the blind and machines with artificial intelligence, to name only a few.

All this has been the product of intense and dedicated work of many scientists with a great vision for the future. This explosion technological revolution created with the continued development of the integrated circuit has come to create a large demand for technicians and engineers familiar with a new branch of electronics, Digital Logic, which provides the theoretical basis for the design of everything cited above.

Unfortunately, are not enough experts in this field to meet the large demand there is of them in industrialized countries. The problem is even greater in developing nations. The lack of teaching materials unified, consistent with modern teaching techniques, has created a void difficult to fill that makes the study of this branch is still problematic for students in industrialized countries, who are constantly seeking to reconcile the abstract theories learned in school with the vast differences found in practice.

In an effort to fill this large void, comes out this work with the hope of facilitating technological advancement of all peoples of Latin America.

This book contains over 150 fully solved problems. The core of the book is precisely these problems solved. A technician who can learn either with the help of a tutor or a teacher or self to solve all the problems of the book will be able to get their hands on almost any system built using digital circuits. The use of schematic drawings many places this book above many books published to date. It is the firm opinion of the author, contrary to many classic textbooks often have a lot of problems at the end of each chapter and the solutions never provide or if they do these solutions are relegated to the back of the book merely to of a few selected issues, suggested that every problem in a book must always be accompanied by a solution, otherwise the solution of the same by the student without answers against which to verify their results quickly overrides the enthusiasm at the beginning of a new course, become monotonous and boring.

logical symbols used in this book are in accordance with the standards imposed by the ASA Y32.14-1962 specifications of the American Standard Graphic Symbols for Logic Diagrams (also known as military standard MIL-STD-806B), whose use is now adopted by the industry in general, not only in America but worldwide.

Prevented the most logical use of "negative", since this tends to create confusion even in the most experienced engineers and technicians. It has also been virtually eliminated in this work use advanced mathematics, since they have to unnecessarily increase the complexity of the matter. Is considered here that the use of Boolean algebra (which is relatively easy to learn compared to the classical algebra is taught in middle schools) is sufficient to analyze the behavior of logic circuits, which can be checked Through this work. Topics such as Venn diagrams, the union and intersection of sets, to name a few, have been completely avoided, and there is evidence that their use, although it provides another way to study the behavior of logic circuits have extremely limited use for practical analysis of the same in the field.

For the clarity with which describes the material contained herein is considered that this work will be useful not only for students of engineering and technological institutes and universities in Latin America eager to understand the basics of this new branch of electronics . For teachers of the matter is a source of review material and examples to develop in class. To the student is a source of information that may be useful for the rest of his life. For the practical engineer is an extremely varied and valuable collection of circuits used with great frequency in the industry. For the self-taught this work may be a necessity.

Cake Ideas For Gay Men



Table of Contents


Chapter 1: The Binary Numbering

Chapter 1: Issues Resolved

Chapter 2 : The three basic logic functions

Chapter 2: Issues resolved

Chapter 3: Boolean Algebra
Chapter
3A : Issues resolved

Chapter 3B: Issues resolved

Chapter 4: The Karnaugh Map

Chapter 4: Issues resolved

Chapter 5: The RS Flip-Flop. Memories. Multivibrators

Chapter 5: Issues resolved

Chapter 6: The JK Flip-Flop. Accountants
Chapter
6A : Issues resolved

Chapter 6B: Issues resolved

Chapter 7: Special Topics

Chapter 7: Issues resolved

Chapter 8 : multivalued logic

Chapter 8: Issues resolved

Supplement # 1: logic families

Supplement # 2: Microprocessor ( microcapacitor )

Supplement # 3: How the Microprocessor Works

Supplement # 4a: microcapacitor The Instructions of 8086

Supplement # 4b : Microprocessor Programming

Supplement # 5: Asynchronous Communications

Supplement # 6 : Operational Amplifier

Supplement # 7: 555 Timer

Supplement # 8: PLC. ladder diagrams

Supplement # 9: Moore machines. Mealy machines

Bibliography

Wax Treadmill Star Trac

1: The binary numbering



since man learned to use reason, found it necessary to have some way objects around him and, more particularly, those who had. The flourishing trade in ancient times aggravated the need using a numerical system accurate and easy to use.

Thus, the man began to count by tens (which is what we know today as the decimal system) influenced by the fact that he had ten fingers. As the numbers rose, each numerical unit received a different symbol (eg, 3, 4, 5 in Arabic numerals). After nine, he took the symbol representing the least amount of units (1) and add a zero, thus obtained the number ten. The operation began again until you get your count up to nineteen, after which it increased the figure to the left putting in a unit a zero to the right of it, repeating the process indefinitely. We can see that without the zero, would have required a different symbol for each number greater than nine (eg, the symbol A for ten, the symbol B for eleven, the symbol C for twelve, etc.).. Indeed, without zero, any number system is extremely complex and impractical (we can imagine the problems suffered by the Romans when in Rome numbering system tried to multiply a number by another, they tried something like XXIII multplicar instead LIV what for us is 23 by 54). Not for nothing has claimed the invention of zero as one of the most important advances in human history.

Our attention now turns to a philosophical problem. Suppose the man instead of having five fingers on each hand had had three. What would have been our way of telling?

A moment's reflection tells us that our number system in that case would not have been very different from the decimal system we know today. Having three fingers on each hand, our natural inclination would have been to have every six , in the same way that modern man with five fingers on each hand account of ten. When counting in sixes, numbering amount as follows:


We note that the number system based on six fingers, the base six number system , never use the symbol 6 , in the same manner as in the base ten number system (or decimal) there no special symbol to represent the number ten. We also note that the count up in the base six number system proceeds in a similar way to count up in the base ten number system. To get 5, take the symbol that represents the least amount of units (1) and add a zero, thus obtaining the following figure. The process is repeated indefinitely so similar to the process used in the decimal system. The number after 555, for example, would be 1000. Note that a collection of eight objects in the decimal system is represented by the number 8 while the base six number system is represented by the number 12 (this equivalence is represented symbolically as 8 10 6 = 12).

Oddly base six number system we like, we must remember that it we would not be so strange if we had three fingers on each hand.

Thus we see that the only reason why we have tens is because we have ten fingers on both hands. We also see that other systems are equally possible numerical not only the base six number system, but the base four number system, base seven number system, etc.

We can convert any number of our decimal base to a lower base (for example, a decimal number to its equivalent in three base system) by the method successive division. This method is carried out as follows:

(1) Divide the decimal number given from the base to which we turn to the issue, and highlights the residue obtained.

(2) The ratio obtained from the previous slice is split again between the base back to where we want to make the number, and highlights the residue thus obtained.

(3) The above procedure is repeated until no longer possible to continue dividing without obtaining a fraction with the decimal point. In reaching this stage, include the dividend and the residue obtained.

(4) The number of the smaller base is obtained by writing as the first digit of the dividend received in the last step above, and placing as the second digit (see right) obtained from the also the last step above.

(5) For the third digit, write to the right of the residue from the previous result of the penultimate division.

(6) The above step is repeated until who have exhausted all the digits.

To convert a number into a smaller base to decimal (for example, number seven in the base system to its equivalent in decimal), multiply the first digit of the lower base. The resulting product is added to the second digit and multiply again by the lower base. The procedure is continued until all the numbers, after which there will be the decimal number.

Of particular interest to us is the number system base two or binary .

If the man had had only one finger on each hand, then counting to go "up one at a time" in the system base two or binary system, and taking into account that just as in decimal or base ten system we are used there is no special symbol to represent the number ten either in the binary system there will be a special symbol to represent the number two, the binary count up "up" would proceed as follows:


The binary number 110 has been highlighted with a yellow background is that used to identify the symbol "6" in the habit of what we call a sixth object or a collection of six things. In a basket of apples, the object could be the sixth block, remains the same regardless of the symbols we use to identify it. The only thing that changes is our way of representing it, as we have seen is somewhat arbitrary. (This list of binary numbers has also been highlighted with cyan background, the binary number representing an eleventh object.) And so, in the binary system, perhaps by going to the market to buy some oranges we say to the put in charge of something like "please give me 101 oranges." And if this seems strange, you have to think that individuals of an alien civilization that they had seven fingers on each hand, giving a total of 14 fingers (With the numbering system you probably would base 14), our decimal counting system may seem very strange to them. It's all about perspective.

Why is so much interest for us to get into a numerical system as the binary system, as if we have enough problems with the decimal system?

trying to use electrical circuits to perform mathematical operations (or operations, control), we find that there are only two possible states that can be used to perform information processing. One is the state of on , which we can represent the number one (1 ). The other is the off , which we represent as zero ("0 ).

Imagine a row of five outbreaks, in which the first light (left) is off, the two foci following on, bulb off the fourth and fifth focus on. Representing the headlights on with a "1" and focuses each off with a "0" each, we obtain the following representation: 01101


This number represents the number 13 in the decimal system. Each digit binary number, on or off, is known as bit . A series of several bits in succession as shown above is commonly known as binary word or simply word. Thus, following the custom of the Arabs bequeathed Saracens in the binary numbering, as in the decimal numbering which goes under counting up the numbers of increasing magnitude for the units, tens, hundreds, etc. . they are written to the left, also in the base 2 numbering used to write binary numbers grow to the left, and in doing so the "bit" of lesser magnitude that is placed on the far right is known as the least significant bit (in English: Least Significant Bit or LSB ), while the "bit" of greater magnitude is placed on the left end and is known as the most significant bit (in English: Most Significant Bit or MSB ) .

Below is a table called table:


Using tables as it is possible to shorten the conversion of a number in binary to decimal and vice versa. For example, if you want to find the decimal equivalent of the word 10110, we note that:

10110 = 10000 + 100 + 10

= 16 + 4 + 2 =

22
Let's see this same from another point of view, from the standpoint of representing numbers using powers of two . The table above equivalence can be represented using powers of the number two (where by definition an exponentiation to the power of zero is taken as the unit):

2 0 = 1

2 1 = 2

2 2 = 2x2 = 4

2 3 = 2x2x2 = 8

2 4 = 2x2x2x2 = 16

2 5 = 2x2x2x2x2 = 32, etc. Taking

this in mind, we can build a table of powers of two as follows:


This table, based on the powers of the number two (where by definition the exponentiation to the power of zero is taken as equal to unit) is used as follows: Suppose we want to convert the decimal number 59 to its equivalent in binary. This number is greater than 32 but less than 64, so that the first amount that will be part of it will be 2.5 = 32. If we add the next lowest number of the table, 2.4 = 16, the cumulative amount will be 48, which shall not exceed the decimal number 59, so that we can add 2.4 to the cumulative sum. And if we add the next lowest number of the table, 2.3 = 8, the cumulative amount will be 56, which does not exceed the decimal number 59, so that we can add 2.3 to the cumulative sum. However, we can not add 2.2 = 4 because the cumulative sum is beyond the decimal number 59, so that ruled out 2.2 as possible component of the cumulative sum. Proceeding in this manner until all the table, we see that the decimal number 59 can be represented in powers of two as follows:

59 = 32 + 16 + 8 + 0 + 1 + 1 59 = 2

5 + 2 + 2 4 3 + 0 + 2 1 + 2 0

With this, the representation of the number 59 in both bases (decimal base and base 2) must immediately consult the table:

59 10 = (100000) 2 + (10000) 2 + (1000 ) 2 + (0) 2 + (10) 2 + (1) 2

59 10 = 111011 2

This result can be verified with the method of successive division.

For the reverse, ie convert a certain number based on their equivalent decimal system, we do so easily carried out by expanding the number of representation in the powers of base number in its orignal. For example, if we convert the binary number 101001 to the equivalent decimal system, the expansion on powers of two will take place as follows: 101001

2 = ( 1 ) 2 5 + ( 0 ) 2 4 + ( 1) 2 3 + ( 0 ) 2 2 + ( 0 ) 2 1 + (1 ) 2 0

101001 2 +0 = 32 + 8 + 0 + 0 + 1 2

101001 = 41 10

Now, we can add, subtract, multiply and divide in the binary system in the same way in which we conduct these operations in the decimal system.

there a special way to represent decimal numbers using the binary system, so that they will look a little more to the numbers we use (although not pure binary notation). Each decimal digit is represented by its equivalent separately, without performing any conversion. For example, the number 3497 is represented as follows:


This form of representation code is known as binary coded decimal BCD (English Binary Coded Decimal).

Now we will consider another philosophical dilemma slightly different problem with which we began this chapter: Suppose the man instead of having five fingers on each hand had been eight . What would have been our way of telling? (The case is not as hypothetical as you might think, some people are born carrying a genetic flaw that causes them something called polydactylism , which is a medical term to describe the presence of extra digits either in the hands or feet, and although might seem that there is some advantage in having a greater number of fingers on both hands or feet that the five we currently have, for some reason evolution has not favored a greater number of fingers).

Again, a moment's reflection tells us that our number system in that case would not have been very different from the decimal system we know today, except that we would be counting on sixteen sixteen . By having an abundance of fingers on both hands, most likely would have invented a unique symbol as the symbol A to represent in the number system base-16 what today we denote as ten to two symbols (10). To represent the equivalent of the decimal number 11 our twelfth finger could have represented another new symbol, the symbol B . Thus, we would have had a different symbol to represent each number up before reaching the number 16 (decimal). And when they reached what would be the equivalent of decimal number 16, would take the symbol that represents the least amount of units (1) and would add a zero, thus obtaining the following figure. The process is repeated indefinitely so similar to the process used in the decimal system. A count-up in the hexadecimal number system proceeds as follows:

_____ Base 10 Base 16

0 0 __________ __________
1 1 2
2 __________ __________
3 3
4 __________ __________ 4
5
5 6 6
__________ __________ 7
7 8 8
__________ __________ 9 9 10
A
__________ __________ B 11 12
C __________ __________
13 14
D E
__________ __________ 15 F
16 10
__________ __________ 17
11 18 12
__________ __________ 19 13 20
__________ __________ 14
21
15 22 16
__________ __________ 23
17 __________ 24 18 25
19 __________ __________
26
27 1A 1B
__________ __________ 28
1C 1D 29
__________ __________ 30
1E 1F 31 __________ 32
__________ 20


To highlight a number as a number that is based in the hexadecimal system, we use a letter h either end of the number or the beginning of the number or the number subscribed. So hexadecimal number 19 is coming highlighting one of the following representations: 19h



19 h

Strange as it may appear, this hexadecimal number system is widely used the area of \u200b\u200bcomputer science. The reason for its enormous usefulness lies in the fact that there is a simple relationship between the representations of a pure binary number system and its equivalent in hexadecimal when the binary number is a multiple of four bits :



aaaaa ___ Binary Hexadecimal

________ 0000 0 0001
________ 1
0010 ________ 2
0011 ________ 3
0100 ________ 4
0101 ________ 5
0110 ________ 6
7 0111 ________
1000 ________ 8
1001 ________ 9 1010
________ A
1011 ________ B
1100 ________ C
1101 ________
D 1110 E ________ ________
1111 F

which greatly simplifies the conversion of a numeric system to another. For example, if we find the hexadecimal equivalent of the following binary number: 11000101000001101000000101011000


all we have to do is "split" the number groups of four binary bits:

0000 0101 1100 0110 0001 1000 0101 1000

after which we can directly convert each individual group in its hexadecimal equivalent:

C 5 0 6 8 1 5 8

To convert a hexadecimal number to binary, simply apply the reverse procedure. If we convert the hexadecimal number AF37 to its binary equivalent, we do take into account that A = 1010, F = 1111 , and 3 = 0011 7 = 0111 . Thus, the hexadecimal number example is:

1010 1111 0011 0111

or abbreviated form (although slightly less clearly): 1010111100110111


Since it requires many bits to represent a number of moderate size, reading a 32-bit number stored in a register as follows:

1010 1111 0101 0111 0110 0001 0001 1011

is much faster and easier for humans to write or read:

AF57611B

shown that the binary number.

As in the decimal numbering exist and are managed with often negative numbers , preceded by a minus sign (-) position to the left thereof, in binary numbers are also handled frequently and negative numbers. However, in the binary numbering to distinguish a positive one negative number is not customary to do it with a minus sign (-). One way of carrying out some kind of distinction is predating the binary number with a " 0 " if the figure is positive (+) or with a " 1" if the figure is negative (-). If you reserve the first bit to the left to represent the sign of the binary number, then the seven remaining bits in a word bit of a "byte" are not sufficient to encode decimal numbers with sufficient precision, and in this case requires at least two bytes to represent decimal numbers to 32 000. Under the universal convention of the sign just given:

0 0000001 represents the decimal number 1

1 0000010 represents the decimal number -2

A disadvantage of this representation is that the binary numbers of different signs can not be added in the usual manner as is customary to do so since If we add the two previous binary will result 10000011, or -3, which is incorrect (the correct answer should be -1). Anyway, keep this performance until we find in later chapters one that will enable us to properly perform arithmetic operations on numbers of different signs in the binary system always getting the correct size with the correct sign. Anyway, what will not change is the use of the first bit denoting the sign reserving the quantity.

We talked about the use of binary numbers to be integers counting one by one in the base-2 system. It is possible that here there is some reader might wonder: Is it possible to also use the binary system for counting and measuring fractions, numbers less than unity, as we do in the decimal system? The answer is yes, and to achieve that we must introduce into the binary numbering the same trick we use to distinguish integers numbers less than unity: the point that in this case instead of the decimal point is the point binary.

A fraction represents a division. Like as in the decimal system, fractions in the binary system can be written with a numerator and a denominator separated by a horizontal bar:


In the decimal fractions can be written with a decimal point. Examples include:


Similarly, the fractions in the binary system can also be written using a point to it, but instead of talking about a decimal point we are talking about a binary point . Thus:


Put another way, to represent fractions in the binary system, the principle remains the same. Decimal symbols to fractional quantities are constructed based on tenths, hundredths (tenths of tenths), mills (tenths of tenths of tenths), thousandths, and so on. The binary symbols are constructed out of halves, halves of halves, halves of halves of halves, and so on. This allows us to build the following table:


and so on. Other fractions can be represented as combinations of these key issues on the table of equivalences. Thus:

.11 = 1 / 2 + 1 / 2 = 3 / 4

.101 = 1 / 2 + 1 / 3 = 5 / 3

can corroborate these findings are as follows, representing the fraction as the ratio of two binary integers:

.11 = 11/100 = 3 / 4

.101 = 101/100 = 5 / 3

addition binary numbering system, the system BCD, and hexadecimal system, there are other number systems, including some prominence is the octal system or base-8 system. For comparative purposes, the following is a list of the first ten numbers to its decimal equivalent, an octal, and binary equivalent:


The role of the octal system in the development of digital systems circuits based on binary has to do with the simple relationship between symbols and binary octal symbols. To better understand this relationship, examine the following symbols equal to amounts slightly larger:


For best viewing, each equivalent binary has been separated into groups of three digits (following an order from right to left ), which allows us to discover that each group of three digits correspond to the equivalent octal digit in the same position . Thus, a binary number as 10001001 can be separated into groups of three digits 10,001,001 , Which allows us to immediately determine an octal as 211. The binary number 10001001 equivalent to the decimal number 137, and we can verify that the octal number 211 also equals the decimal number by the usual tactic of assigning to each octal digit positional value in the decimal system: 211

8 = 2 (8 2) + 1 (8 1) + 1 (8 0 ) 211

8 = 2 ( 64) + 1 (8) + 1 (1) 211

8 = 128 + 8 + 1 = 137 10

The purpose of the octal number (as hexadecimal numbering) is a bridge between the decimal number system we is so familiar and least understood binary system. Decimal symbols are our daily means of arithmetic work, but the language of "ones" and "zeros" is the natural language with which the machines work. The disadvantage of binary numbers is that it requires a long series of "ones" and "zeros" to represent an amount in the decimal system can be represented more compactly as number 10001001 is equivalent to the decimal number 137. The advantage of using octal symbols is that they are convenient abbreviations of binary symbols, and using octal numbers rather than the more familiar decimal numbers represents a natural step to bridge the gap between a computer "human" used to work in the system decimal and machine.

Small Pieces Of Coran

1: Issues Resolved




Problem: Write a normal count of 20 objects using the base 4 number system.


Problem : How much is the decimal number 13 in base 6 number system?


The number 13 in decimal is the number 21 in base 6 system. Symbolically:

13 10 = 21 6

Problem: Convert the number 20 to base 4 system using the method of successive division.

Applying the method of successive division, we have:


The equivalence of the decimal number 20 to the corresponding 1104 in base 4 system can be represented as follows:

20 10 = 110 4

Note how to convert decimal number 20 to number 110 in base 4 system, we divide the number first (20) between the base (4) highlighting the first residue (0). The ratio of the first division (5) is again split between the base (4) adding adding the remainder of the second division (1) the residue of the first (0) to be shaping the issue. Since the second ratio (1) and can not be divided by 4, with the second ratio (1), the second residue (1) and the first residue (0) form the number 110 in base 4 number system. Problem

: Convert the number 19 to base 2 system using the method of successive division .

proceed the same way as in the previous problem:




Symbolically, we express the result as follows:

19 10 = 10011 2

problem: Convert the number 49 to base 3 system using the method of successive division and check the result by a table .



Symbolically, we express the result as follows:

49 10 = 1211 3

The complete table of equivalencies to reach the desired number, which has been highlighted in cyan Ascendant numbering decimal system is as follows:




is obviously much more comfortable even for fairly small numbers resort to the method of successive division to try to reach an equivalent in a numerical basis by constructing a table.

PROBLEM: Transformanndo decimal numbers 13 and 25 in its binary equivalent, add these numbers both in decimal and in binary, putting both resolutions next to each other in order to compare the similarities. After that, convert the binary response to its decimal equivalent using the table of powers of 2 to check the response of binary addition.

First take out the "decomposition" of the numbers 13 and 25 in the equivalent base 2 system:





then will be out the sum of the decimal numbers 13 and 25, together with the binary sum of the numbers 1101 and 11001:




The decimal sum, to add 25 and 13 in the manner in which we are accustomed , garnering a response from right to left, first say "5 plus 3 equals 8. In this case, as the partial sum does not exceed 10, not "we" a unit to be added to the tens. The next digit, we get saying "2 plus 1 equals 3." With this, we have the result shown above, which is 38. Let's see how it carried out the binary sum . To perform binary addition, we proceed in exactly the same way, starting from left to right say " a more equals a 10 " (remember that in the binary system, there is a symbol for the number 2). We note the zero down (as in yellow) and say "we scored zero and we a ." In the next column of digits, proceeding from left to right as well as we do in the decimal system, we say "zero more zero equals zero plus a we wore equals one. " We write this one to the left of zero had written earlier, with which we already have a cumulative result of "10" in yellow, proceeding to the next column of digits in where we say "zero more a equals one , and we did not have anything like the addition above, we scored it a . " We already have a cumulative response of "110." We go to the next column of digits in which we say: " a more equals a 10 , and as we did not have any of the previous addition, we scored and we zero one." Our cumulative response reads as "0110". Thus we come to the last column to the left, where we have only the "1" which we say "we have a plus a we brought from the previous addition is equal to 10 , and as there are no more digits to add, we note that 10 to conclude binary addition. " Thus, the result of the binary sum is equal to the binary number: 100110


To check our answer, the decimal equivalent of this number according to the table of powers of 2 turns out to be: 100110

2 = ( 1) 2 5 + ( 0 ) 2 4 + ( 0 ) 2 3 + (1 ) 2 2 + ( 1) 2 1 + ( 0) 2 0

100110 2 = 32 +0 + 0 + 4 + 2 + 0

100110 2 = 38 10

PROBLEM: Add the four numbers whose binary hexadecimal representations are 25h, 62h, and 52h 3Fh .

The four hexadecimal numbers, converted to binary representation, are:

25h = 0010 0101 = 62h



0110 0010 0011 1111
3Fh = 52h = 0101 0010

The sum of these four numbers shown below:


The result of the sum, 100011000 , also can be represented as its hexadecimal equivalent h 118 .

PROBLEM: Multiply the numbers 13 and 25 each in symbolism converting binary, binary numbers obtained by multiplying, and carrying out the conversion from the result to decimal symbolism.

The binary equivalent of decimal numbers 13 and 25 and were obtained in the previous problem, proving to be 1101 and 11001. With this, we carry out multiplication in a similar way as is done in the decimal system to which we are accustomed:


Note that conducting a purely binary multiplication is much easier than it seems to be first sight, since in fact only required to be carried out by multiplying successive additions according to the value that has each of the binary digit number that is chosen as a multiplier. If we increase the capacity of bits, we may be undertaking a range of really big numbers without much intellectual investment that we've done, and this multiplication is carried out at a speed electronics. Not for nothing more than a century, human inventors worked to build machines that could perform arithmetic operations such remarkable speeds!

Since the product of decimal numbers 13 and 25 is the number 325, we can check our answer obtained by converting the binary number to its decimal equivalent, which must also be 325. The procedure for this is shown below: 101000101

2 = ( 1 ) 2 8 + ( 0 ) 2 7 + (1 ) 2 6 + ( 0) 2 5 + ( 0 ) 2 4 + ( 0 ) 2 3 + (1 ) 2 2 + ( 0 ) 2 1 + (1 ) 2 0

101000101 2 = 256 + 64 + 0 + 0 + 0 + 0 + 4 + 0 + 1

2 101000101 = 325 10

PROBLEM: represent in BCD system the following numbers:
A) 50 123
B) 37
C) 4856
D) 102
E) 3971
F) 74
G) 95 437
The BCD representation system of numbers indicated below:



PROBLEM: A microcomputer has a capacity of 16 bits. What is the largest number that can be represented in this capacity in the same:
A) using the binary system, and
B) by using the BCD system? compare the difference between the two cases .

A) Using the binary system, the largest number that can be represented with 16 bits is: 1111111111111111


This binary number equivalent to decimal number:

2 16 - 1 = 65.536 65.535 = -1


B) using the BCD system, the largest number that can be represented with 16 bits is:

1001 1001 __ __ 1001 1001 __

9 _____ _____ 9 _____ 9 9

is, the number 9.999.

By using the BCD system instead of the binary system, we have a difference of 65.535 to 9.999 = 55.536. At other times when the costs to represent each digit was measured in terms of electronic and electromechanical relays bulbs instead of the tens of thousands of transistors microminiaturized we have today, this was considered a lamentable loss of capacity. Anyway, in our times there are many situations in which the use of the BCD is a need to provide more "human" that is understandable to ordinary people, whether on digital clocks, digital album art in ovens microwave, and digital multimeters used by technicians to measure voltages and currents. In these situations, the use of pure binary data would be almost indecipherable to humans, even the "natural language" of digital electronics.

PROBLEM: .10101 Convert the binary number to its equivalent in decimal.

Using the table of equivalence described in the text, we have:

.10101 = .10000 + .00100 + .00001

.10101 = 1 / 2 + 1 / 8 + 1 / 32

.10101 = 5 + 125 + 03 125

.10101 .65625 2 = 10

But we can get the same result as the other alternative, which is to express the binary number as a fraction of two binary integers after which he became both the numerator and denominator to an equivalent decimal and finally perform the division:

10 101 = 10101/100000


.10101 = (10000 + 100 + 1) / 100000

.10101 = (16 + 4 + 1) / 32

. 10 101 = 21/32

.10101 .65625 2 = 10

confirming the results obtained previously.

PROBLEM: 110,011 Convert the number from binary to decimal system.

To convert this binary number "mixed" having an integer part and a fractional part, just give each "1" binary value that corresponds to:

110 011 = 100 + 10 + 01 + 001

110,011 = 4 + 2 + 1 / 10 + 1 / 100

110,011 = 4 + 2 + 1 / 4 + 1 / 8

110,011 = 6 + .25 + .125

110,011 2 = 6,375 10

In the alternative form of solution, we express the number as a fraction of two binary integers after which converted both the numerator and denominator to its decimal equivalent performing the division:

110,011 = 110011/1000 = (100000 + 10000 + 10 + 11) / 1000

110011 = (32 +16 + 2 + 1) / 8

110 011 = 51 / 8

2 = 110011 6375 10
confirming
and the results obtained previously.

PROBLEM: Convert the following binary fractions to decimal equivalent, results were expressed as rational numbers (the ratio of two integers):

a) 011
b) .111
c) 1001
d) 1101
e) 10 001
f) 11 001

a) Using the conversion table, and proceed the same way in all cases:

.011 = .01 + .001 = 1 / 4 + 1 / 8 = 2 / 8 + 1 / 8 = 3 / 8

b)
.111 = .1 + .01 + .001 = 1 / 2 + 1 / 4 + 1 / 8 = 4 / 8 + 2 / 8 + 1 / 8 = 7 / 8

c) .1001
= .1 + .0001 = 1 / 2 + 1 / 16 = 8 / 16 + 1 / 16 = 9 / 16

d)
.1101 = .1 + .01 + .0001 = 1 / 2 + 1 / 4 + 1 / 16 = 8 / 16 + 4 / 16 + 1 / 16 = 13/16

e)
.10001 = .1 + .00001 = 1 / 2 + 1 / 32 = 16/32 + 1 / 32 = 17/32

f)
.11001 = .1 + .01 + .00001 = 1 / 2 + 1 / 4 + 1 / 32 = 16/32 + 8 / 32 + 1 / 32 = 25/32

PROBLEM: Represent the following decimal numbers to its binary equivalent, where necessary rounding to three significant figures.

a) 2 / 3
b) fifth
c) 15/16

a) First we out the division to make the number expressed as a decimal broken to:

2 / 3 = 0.6666666666 ...

Then we round the result to three significant figures:

2 / 3 = 667

To find the binary equivalent of the decimal fraction, we can carry out a sequence of successive subtractions referring to the table of equivalences which gives us the following series of steps:

.667-5 = 167 (A binary digit is equivalent .5 = 1 / 2 = .10000)

.167 to .125 = 042 (One digit is the binary equivalent of 125 = 00 100)

.042 - 03,125 = 01,075 (A digit binary equivalent is 03,125 = 00,001)

Consider well what you just made, referring to the table of equivalences we find that the fractional decimal number that corresponds directly with an exact binary equivalent that is the biggest of them all without exceeding the decimal number 667 is the number equivalent to .1 .5 binary. Noting this as a partial result and after carrying out the remainder of .5 decimal number 667, we have the number .167, which again consulted the table of equivalence to find the fractional decimal number that corresponds directly with exact binary equivalent is the largest all without exceeding the decimal number 167, which happens to be the number 0.125 is equivalent to 001 binary, noting this as a partial result. The answer is given by the sum of the partial results. This mechanical process can be repeated as often as we, approaching ever more closely to the original fractional decimal number.

So, the answer (about) is:

.10000 + .00100 + .00001 = .10101

b) 1 / 5 = 20

.2 to 125 = 075 (A digit equivalent binary is 125 = 00 100)

.075-0625 = 0125 (A binary digit is equivalent 00,010)

Since .03125 .0125 exceeds that, we can not subtract it from 0125, which we know that the next significant digit in the accumulation of partial results should be a "0." So the answer (about) should be:

.00100 + .00010 + .00000 = .00110

c) 15/16 = 938 (rounded to three significant figures)

.938-5 = 438 (A binary digit is equivalent .5 = 1 / 2 = .10000)

.438-25 = 188 (A digit binary equivalent is 25 = 01 000)

.188 to .125 = .063 (A digit binary equivalent is 125 = 00 100)

.063-0625 = 0005 (A digit equivalent binary is 0625 = 00 010)

The approximate answer is then:

.100000 + .01000 + .00100 + .00010 = .11110

PROBLEM: the following symbols Convert binary octal representation.

a) 10,110
b) 11 110
c) 11 011
d) 110 011
e) 111 000
f) 100 011
g) h
11,110,000) 11,001,100
i) 10,101,010

The solution procedure is straightforward, consisting of separate binary numbers in groups of three to do so from right to left:

a) 10110 = 10 110 = 26
b) 11110 = 11 110 = 36
c) 11 011 = 11 011 = 33
d) 110011 = 110 011 = 63
e) 111000 = 111 000 = 70
f) 100011 = 100 011 = 43
g) 11110000 = 11 110 000 = 360
h) 11001100 = 11 001 100 = 314
i ) 10101010 = 10101010 = 252

PROBLEM: multiply octal numbers 56 and 45, without leaving for anything in the octal system.

order to carry out the multiplication in the octal system, in which there is a symbol for our number "8", it should construct a "multiplication table" octal, which can easily be constructed by listing in count up all octal numbers from the one in front, and after that to jump to that list two at once, two by two to three times, two by two four times, two by two five times, and so on, and after that three at once, three at twice, three at three times, three by three four times, and so on, to be filling the boxes of the multiplication table of two by two, two and three, two by four, and so on. three for two, three by three, three four, etc., and so on, until you have the entire table, which turns out to be:


With octal multiplication table at hand, and bearing in mind the way in which it must carry octal out a sum, taking the smaller number (45) as the multiplier and the largest number (56) as the multiplicand as is customary in the usual multiplication, the operation procedure is as follows:



PROBLEM: Convert the following hexadecimal numbers to their equivalent octal system.

a) 3A7
b h) h 41FB
c) h 7C2E
d) D589A h
e) B0Ce5
h f) h
6FF23 Possibly the most
perform quick conversion is to directly convert each number to its binary equivalent hexadecimal (base-2) and after this grouping the binary digits in groups of threes (from right to left) after it carried out the conversion of each group octal system.

a) 3A7 h = 0011 1010 0111 2 = 001 110 100 111 = 1647 8

b) h = 41FB 0100 0001 1111 1011 2 = 0 100 000 111 111 011 = 40773 8

c) h = 7C2E 1100 0010 1110 0111 2 = 0 111 110 000 101 110 = 76056 8

d) D589A h = 1101 0101 1000 1001 1010 2 = 11 010 101 100 010 011 010 = 3,254,232 8

e) B0CE5 h = 1011 0000 1100 1110 0101 2 = 10 110 000 110 011 100 101 = 2606345 8

f) 6FF23 h = 0110 1111 1111 0010 0011 2 = 01 101 111 111 100 100 011 = 1577443 8