El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada, es descrito con el siguiente código VHDL:
Realizar los siguientes desarrollos:
a) Usando mapas de karnaught y agrupamiento de minterms, simplicar la expresión booleana al mínimo (15p).
b) Utilizando puertas lógicas, graficar el circuito que represente a la ecuación simplificada en el literal anterior (15p).
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
Digital systems:
Design of a Burglar Alarm using Simple Combinational Logic.
FPGA design verified on BASYS experimenter board utilizing Verilog programming language in Xilinx design suite.
The document describes Katrina Little's design of a multi-function gate that can perform the logic functions of AND, OR, NOR, and NAND. The gate uses two data inputs (A and B) and two operation selection lines (X and Y) to determine which function to perform. Katrina presents the design methodology including truth tables, a Karnaugh map to simplify the function, and a Verilog implementation. She then outlines a test plan to simulate the design in a schematic capture tool and verify the physical implementation on a BASYS1 FPGA board matches the expected output.
This document contains a 10 question quiz on analog and digital electronics concepts like registers, counters, and boolean logic. It covers topics such as the output of shift registers after clock pulses, the state of ring counters after clock pulses, decoding outputs from counters, realizing boolean expressions with logic gates, and plotting the outputs of flip flop circuits.
The document discusses Boolean algebra and its applications in switching theory and logic design. It defines the basic postulates of Boolean algebra including associativity, commutativity, distributivity, identity, and complement. It also discusses Boolean functions, canonical forms, Karnaugh maps, and the Quine-McCluskey method for minimizing Boolean functions.
THIS PPT IS PRESENTED TO PROF. RAVITESH MISHRA FROM EC FINAL YEAR STUDENTS MADE FROM RAZAVI,DESIGN OF ANALOG CMOS INTEGRATED CIRCUITS ON DATAPATH SUBSYSTEM-MULTIPLICATION
This document contains a list of 21 MATLAB and Scilab problems related to signals and systems. The problems cover topics like generating standard signals, plotting functions, finding signal properties, solving differential equations, and manipulating discrete-time signals. Solving these problems helps learn how to represent and analyze continuous-time and discrete-time signals using MATLAB and Scilab.
Digital systems:
Design of a Burglar Alarm using Simple Combinational Logic.
FPGA design verified on BASYS experimenter board utilizing Verilog programming language in Xilinx design suite.
The document describes Katrina Little's design of a multi-function gate that can perform the logic functions of AND, OR, NOR, and NAND. The gate uses two data inputs (A and B) and two operation selection lines (X and Y) to determine which function to perform. Katrina presents the design methodology including truth tables, a Karnaugh map to simplify the function, and a Verilog implementation. She then outlines a test plan to simulate the design in a schematic capture tool and verify the physical implementation on a BASYS1 FPGA board matches the expected output.
This document contains a 10 question quiz on analog and digital electronics concepts like registers, counters, and boolean logic. It covers topics such as the output of shift registers after clock pulses, the state of ring counters after clock pulses, decoding outputs from counters, realizing boolean expressions with logic gates, and plotting the outputs of flip flop circuits.
The document discusses Boolean algebra and its applications in switching theory and logic design. It defines the basic postulates of Boolean algebra including associativity, commutativity, distributivity, identity, and complement. It also discusses Boolean functions, canonical forms, Karnaugh maps, and the Quine-McCluskey method for minimizing Boolean functions.
THIS PPT IS PRESENTED TO PROF. RAVITESH MISHRA FROM EC FINAL YEAR STUDENTS MADE FROM RAZAVI,DESIGN OF ANALOG CMOS INTEGRATED CIRCUITS ON DATAPATH SUBSYSTEM-MULTIPLICATION
This document contains a list of 21 MATLAB and Scilab problems related to signals and systems. The problems cover topics like generating standard signals, plotting functions, finding signal properties, solving differential equations, and manipulating discrete-time signals. Solving these problems helps learn how to represent and analyze continuous-time and discrete-time signals using MATLAB and Scilab.
This document outlines the syllabus for the subject Digital Principles and System Design. It contains 5 units that cover topics such as Boolean algebra, logic gates, combinational logic, sequential logic, asynchronous sequential logic, memory and programmable logic. The objectives of the course are to understand logic simplification methods, design combinational and sequential logic circuits using HDL, understand various types of memory and programmable devices. The syllabus allocates 45 periods to cover all the units in depth. Relevant textbooks and references are also provided.
Digital logic circuits important question and answers for 5 unitsLekashri Subramanian
This document provides information about digital logic circuits and binary operations. It includes definitions of key terms like registers, register transfer, binary logic, logic gates, and parity bits. It also covers operations like subtraction using 2's and 1's complements, and reducing Boolean expressions using De Morgan's theorems, duality properties, and canonical forms.
Lec11 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- De...Hsien-Hsin Sean Lee, Ph.D.
This document discusses different types of decoders and encoders used in digital logic circuits. It begins by explaining 1-to-2 line, N-to-M line, and 2-to-4 line decoders. It then describes decoders with enables and how to implement logic functions using decoders. The document also covers BCD-to-7 segment decoders and designing the outputs individually. Finally, it summarizes M-to-N line encoders and provides examples of 4-to-2 and 8-to-3 encoders as well as priority encoders.
This document provides an overview of digital logic circuits. It begins with an introduction to logic gates and Boolean algebra. Common logic gates like AND, OR, NOT are explained with their truth tables. Boolean algebra identities and theorems like De Morgan's theorem are listed as useful tools for simplifying logic functions. Karnaugh maps are introduced as a method to simplify Boolean functions into sum of products form. The document discusses various logic circuit design techniques including implementing logic functions from their truth tables or Karnaugh maps using logic gates.
The document discusses combinational logic circuits. It describes combinational logic design procedures including specification, formulation, optimization, technology mapping, and verification. It also discusses analysis procedures for logic diagrams, including labeling gate outputs and determining Boolean functions. Additional topics covered include half adders, full adders, binary adders, decoders, encoders, multiplexers, priority encoders, and binary-coded decimal to seven-segment displays. Diagrams and truth tables are provided for various logic gates and circuits.
Chapter 5The proessor status and the FLAGS registerswarda aziz
solution manual to COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE CHAPTER 5.
If you find any mistake in the manual please share with me ... it will be appreciated
The document discusses minterms, maxterms, and their representation using shorthand notation in digital logic. It also covers the steps to obtain the shorthand notation for minterms and maxterms. Standard forms such as SOP and POS are introduced along with methods to simplify boolean functions into canonical forms using Karnaugh maps. The implementation of boolean functions using NAND and NOR gates is also described through examples.
Lec13 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Sh...Hsien-Hsin Sean Lee, Ph.D.
This lecture discusses building blocks for combinational logic, specifically shifters and multipliers. It introduces basic shifting operations including left/right shifts and logical/arithmetic shifts. It then describes implementations of 4-bit logical and arithmetic shifters using multiplexers. Barrel shifters that can shift multiple bits simultaneously are also covered. For multiplication, it explains unsigned and signed binary multiplication through examples. Implementations of 2-bit, 4-bit and carry-save multipliers are shown using full adders as building blocks.
The document contains questions from a switching theory and logic design exam. It asks students to answer any five of eight questions. The questions cover topics like:
1. Complements and duals of Boolean functions
2. Implementing logic circuits with PLA and K-maps
3. Sequential circuits like counters, flip-flops and state machines
4. Codes like binary, gray and hamming codes
5. Arithmetic operations using binary numbers
Lec12 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Ad...Hsien-Hsin Sean Lee, Ph.D.
This document summarizes key concepts in combinational logic building blocks including adders, subtractors, and parity checkers. It describes half adders, full adders, ripple carry adders, carry lookahead adders, subtraction using 2's complement, and even parity generation and detection. The document discusses issues like carry propagation delay in ripple carry adders and improved delay in carry lookahead adders. It also covers overflow/underflow detection in signed arithmetic and examples of parity error detection.
This document discusses register transfer language and microoperations in a central processing unit. It describes how data is transferred between registers and memory through bus and memory transfers. It also explains different types of microoperations including arithmetic operations like addition and subtraction, logic operations, and shift operations. Diagrams and tables are provided to illustrate register transfer, bus structure, arithmetic circuits, logic functions, and the function of an arithmetic logic shift unit.
Synchronous loadable up and down counter is a very important block in any complex digital system design. It is not just used for counting, it is also used for phase signal generation, clock division and for initiation of a process.
This document summarizes the contents of the CS110 lecture on modeling computation. It discusses solving quadratic equations, including calculating discriminants and square roots. It provides sample code for solving quadratic equations and multiplying polynomials. It also presents an algorithm for designing a communication pattern such that all people can share information in log2n steps.
This presentation discusses digital search trees (DST), including their definition, structure, applications, and how to perform insertion, search, and deletion operations. A DST is a binary tree that stores only binary data, with nodes placed in the left subtree if their key begins with 0 and the right subtree if it begins with 1. The presentation provides examples of building a DST and searching/deleting keys within it. DST operations are simpler than with binary search trees but require keys be of fixed length. The tree has applications in areas like IP routing and packet classification.
This document provides an overview of register transfer and microoperations in computer architecture. It discusses register transfer language, register transfer, bus and memory transfers, and different types of microoperations including arithmetic, logic, and shift operations. Diagrams and examples are provided to illustrate concepts like register transfer, bus structure, arithmetic circuits, logic functions, and shift operations. The document is intended to teach fundamental concepts related to the low-level implementation of operations in a computer's central processing unit.
Transistors can be used as switches in logic circuits to perform operations like AND, OR, and XOR.
AND logic returns 1 only if both inputs are 1. OR logic returns 1 if either or both inputs are 1.
XOR (exclusive OR) returns 1 if only one input is 1, but not both.
Binary numbers use a base-2 system of 0 and 1 to represent values, with place values increasing in powers of two from right to left. Decimal numbers can be converted to binary by repeatedly dividing the number by two and noting the remainders.
The document contains 24 sample questions for an AM paper. The questions cover topics related to binary, logic, computing hardware, algorithms and data structures. They include multiple choice questions testing knowledge of binary representations, logic expressions, computer architecture concepts like cache memory and pipelining, and algorithms involving queues, trees and arrays.
The document discusses combinational logic and summarizes the design procedure for combinational logic circuits. It then describes half adders, full adders, decoders, and other common combinational logic circuits such as magnitude comparators. Circuits are designed for half adders, full adders, decimal adders, decoders, and other logic functions using Boolean algebra and logic gates.
This document outlines the syllabus for the subject Digital Principles and System Design. It contains 5 units that cover topics such as Boolean algebra, logic gates, combinational logic, sequential logic, asynchronous sequential logic, memory and programmable logic. The objectives of the course are to understand logic simplification methods, design combinational and sequential logic circuits using HDL, understand various types of memory and programmable devices. The syllabus allocates 45 periods to cover all the units in depth. Relevant textbooks and references are also provided.
Digital logic circuits important question and answers for 5 unitsLekashri Subramanian
This document provides information about digital logic circuits and binary operations. It includes definitions of key terms like registers, register transfer, binary logic, logic gates, and parity bits. It also covers operations like subtraction using 2's and 1's complements, and reducing Boolean expressions using De Morgan's theorems, duality properties, and canonical forms.
Lec11 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- De...Hsien-Hsin Sean Lee, Ph.D.
This document discusses different types of decoders and encoders used in digital logic circuits. It begins by explaining 1-to-2 line, N-to-M line, and 2-to-4 line decoders. It then describes decoders with enables and how to implement logic functions using decoders. The document also covers BCD-to-7 segment decoders and designing the outputs individually. Finally, it summarizes M-to-N line encoders and provides examples of 4-to-2 and 8-to-3 encoders as well as priority encoders.
This document provides an overview of digital logic circuits. It begins with an introduction to logic gates and Boolean algebra. Common logic gates like AND, OR, NOT are explained with their truth tables. Boolean algebra identities and theorems like De Morgan's theorem are listed as useful tools for simplifying logic functions. Karnaugh maps are introduced as a method to simplify Boolean functions into sum of products form. The document discusses various logic circuit design techniques including implementing logic functions from their truth tables or Karnaugh maps using logic gates.
The document discusses combinational logic circuits. It describes combinational logic design procedures including specification, formulation, optimization, technology mapping, and verification. It also discusses analysis procedures for logic diagrams, including labeling gate outputs and determining Boolean functions. Additional topics covered include half adders, full adders, binary adders, decoders, encoders, multiplexers, priority encoders, and binary-coded decimal to seven-segment displays. Diagrams and truth tables are provided for various logic gates and circuits.
Chapter 5The proessor status and the FLAGS registerswarda aziz
solution manual to COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE CHAPTER 5.
If you find any mistake in the manual please share with me ... it will be appreciated
The document discusses minterms, maxterms, and their representation using shorthand notation in digital logic. It also covers the steps to obtain the shorthand notation for minterms and maxterms. Standard forms such as SOP and POS are introduced along with methods to simplify boolean functions into canonical forms using Karnaugh maps. The implementation of boolean functions using NAND and NOR gates is also described through examples.
Lec13 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Sh...Hsien-Hsin Sean Lee, Ph.D.
This lecture discusses building blocks for combinational logic, specifically shifters and multipliers. It introduces basic shifting operations including left/right shifts and logical/arithmetic shifts. It then describes implementations of 4-bit logical and arithmetic shifters using multiplexers. Barrel shifters that can shift multiple bits simultaneously are also covered. For multiplication, it explains unsigned and signed binary multiplication through examples. Implementations of 2-bit, 4-bit and carry-save multipliers are shown using full adders as building blocks.
The document contains questions from a switching theory and logic design exam. It asks students to answer any five of eight questions. The questions cover topics like:
1. Complements and duals of Boolean functions
2. Implementing logic circuits with PLA and K-maps
3. Sequential circuits like counters, flip-flops and state machines
4. Codes like binary, gray and hamming codes
5. Arithmetic operations using binary numbers
Lec12 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Ad...Hsien-Hsin Sean Lee, Ph.D.
This document summarizes key concepts in combinational logic building blocks including adders, subtractors, and parity checkers. It describes half adders, full adders, ripple carry adders, carry lookahead adders, subtraction using 2's complement, and even parity generation and detection. The document discusses issues like carry propagation delay in ripple carry adders and improved delay in carry lookahead adders. It also covers overflow/underflow detection in signed arithmetic and examples of parity error detection.
This document discusses register transfer language and microoperations in a central processing unit. It describes how data is transferred between registers and memory through bus and memory transfers. It also explains different types of microoperations including arithmetic operations like addition and subtraction, logic operations, and shift operations. Diagrams and tables are provided to illustrate register transfer, bus structure, arithmetic circuits, logic functions, and the function of an arithmetic logic shift unit.
Synchronous loadable up and down counter is a very important block in any complex digital system design. It is not just used for counting, it is also used for phase signal generation, clock division and for initiation of a process.
This document summarizes the contents of the CS110 lecture on modeling computation. It discusses solving quadratic equations, including calculating discriminants and square roots. It provides sample code for solving quadratic equations and multiplying polynomials. It also presents an algorithm for designing a communication pattern such that all people can share information in log2n steps.
This presentation discusses digital search trees (DST), including their definition, structure, applications, and how to perform insertion, search, and deletion operations. A DST is a binary tree that stores only binary data, with nodes placed in the left subtree if their key begins with 0 and the right subtree if it begins with 1. The presentation provides examples of building a DST and searching/deleting keys within it. DST operations are simpler than with binary search trees but require keys be of fixed length. The tree has applications in areas like IP routing and packet classification.
This document provides an overview of register transfer and microoperations in computer architecture. It discusses register transfer language, register transfer, bus and memory transfers, and different types of microoperations including arithmetic, logic, and shift operations. Diagrams and examples are provided to illustrate concepts like register transfer, bus structure, arithmetic circuits, logic functions, and shift operations. The document is intended to teach fundamental concepts related to the low-level implementation of operations in a computer's central processing unit.
Transistors can be used as switches in logic circuits to perform operations like AND, OR, and XOR.
AND logic returns 1 only if both inputs are 1. OR logic returns 1 if either or both inputs are 1.
XOR (exclusive OR) returns 1 if only one input is 1, but not both.
Binary numbers use a base-2 system of 0 and 1 to represent values, with place values increasing in powers of two from right to left. Decimal numbers can be converted to binary by repeatedly dividing the number by two and noting the remainders.
The document contains 24 sample questions for an AM paper. The questions cover topics related to binary, logic, computing hardware, algorithms and data structures. They include multiple choice questions testing knowledge of binary representations, logic expressions, computer architecture concepts like cache memory and pipelining, and algorithms involving queues, trees and arrays.
The document discusses combinational logic and summarizes the design procedure for combinational logic circuits. It then describes half adders, full adders, decoders, and other common combinational logic circuits such as magnitude comparators. Circuits are designed for half adders, full adders, decimal adders, decoders, and other logic functions using Boolean algebra and logic gates.
- There are two classes of logic circuits: combinational circuits and sequential circuits.
- A combinational circuit consists of logic gates where the output depends only on the current inputs.
- Common combinational circuits include arithmetic functions, data transmission functions, and code converters.
- Combinational circuits can be analyzed using Boolean functions and truth tables to determine the function and design circuits.
important C questions and_answers praveensomeshpraveensomesh
This document contains 40 multiple choice questions related to the C programming language. The questions cover topics like data types, operators, arrays, pointers, functions, input/output, and more. Each question is followed by 4 possible answers, with the correct answer indicated. This quiz can be used to test knowledge of core C programming concepts and help identify areas requiring more study.
I semester Unit 4 combinational circuits.pptxMayank Pandey
- Combinational circuits consist of logic gates whose outputs depend only on the present inputs. They have no memory.
- A half adder is a basic combinational circuit that adds two 1-bit numbers and produces a sum and carry output. A full adder adds three 1-bit numbers.
- Other common combinational circuits described in the document include half and full subtractors, magnitude comparators, encoders, decoders, multiplexers, and demultiplexers. Each has a specific function and truth table defining its input-output behavior.
This document discusses error coding techniques used in digital communications. It begins by explaining modulo-2 arithmetic operations that are the basis for digital coding. It then covers binary manipulation of addition and multiplication. Various error detection and correction codes are described, including cyclic redundancy check (CRC), linear block codes, and Hamming codes. Hamming codes add redundant bits to allow detection and correction of bit errors during transmission.
This document contains 24 multiple choice questions related to Java programming concepts like object oriented programming, classes, methods, conditionals, loops, and more. It is a sample of 100 multiple choice questions for a CSAP review.
The document provides examples and explanations of basic theory concepts in computer science and mathematics. It contains 16 multiple choice questions covering topics like: binary and hexadecimal number representations and arithmetic, Boolean logic, probability, standard deviation, combinatorics, and floating point number representation. The questions are at a basic to intermediate level and are intended to test understanding of fundamental concepts.
The document describes the design and simulation of basic logic gates and a 2-to-4 decoder using Verilog HDL. It includes the block diagrams, truth tables, and Verilog code for AND, OR, NAND, NOR, XOR, XNOR and NOT gates. Testbenches are provided to simulate and verify the gate designs. The 2-to-4 decoder section provides the block diagram, theory of operation, and Verilog code using dataflow, behavioral and structural modeling styles. A testbench is also included to simulate the 2-to-4 decoder design.
This document contains instructions for a mathematics exam, including:
- The exam consists of multiple choice, true/false, and short answer questions worth a total of 100 points.
- No books, notes, or calculators with CAS or QWERTY keyboards are allowed. Cell phones may not be used.
- The multiple choice section includes 8 questions worth 5 points each.
- The true/false section includes 15 statements worth 15 points total.
- Three short answer questions are each worth 15 points.
The document provides an overview of the topics covered in a digital logic design course, including Boolean algebra, logic gates, Karnaugh maps, encoders, decoders, flip-flops, registers, counters, adders, and signed number representation. The course syllabus covers basic concepts in digital logic like logic functions, logic gates, sequential logic circuits, and how to design combinational and sequential logic circuits using logic gates.
Digital devices like computers, watches, and phones use binary numbers encoded as signals with two values, 0 and 1. Basic logic gates like AND, OR, and NOT are used to build more complex digital circuits. Boolean algebra describes the logic operations performed by these circuits using rules for binary true/false values. Circuits add binary numbers by performing full adder logic on corresponding bits with sum and carry outputs.
This document provides an overview of digital logic circuits and digital systems. It discusses binary logic, logic gates like NAND and NOR, Boolean algebra, decoders, adders, and the differences between analog and digital signals. It also covers representations of digital designs using truth tables, Boolean algebra, logic gate schematics, and logic simulations. Common logic gates, functions, identities, simplification techniques, and the duality principle of Boolean algebra are described.
The document provides solutions to various digital logic design problems involving gates like XOR, OR, NAND and circuits like alarm circuit, encoder, decoder, multiplexer, flip-flops, counters and linear feedback shift register. The problems are solved through truth tables, K-maps and schematic diagrams. Implementation of basic gates to realize complex functions and sequential circuits are demonstrated.
The document provides an overview of various data processing circuits including multiplexers, demultiplexers, decoders, encoders, adders, flip-flops and other logic gates. It describes the basic functionality and implementation of different types of multiplexers and demultiplexers with varying number of inputs and outputs. Decoder circuits like 1-of-16 decoder are explained along with their truth tables. Different arithmetic building blocks such as half adder, full adder and arithmetic logic unit are covered. The document also discusses flip-flops like RS, D, JK and their edge-triggered variations. Finally, it provides details on binary coded decimal representation.
There are several number systems that can be used to represent numbers, which can be categorized as positional or non-positional. Commonly used positional systems include decimal, binary, octal, and hexadecimal. Different systems use different bases and symbols to represent values. Numbers can be converted between systems using techniques like successive division, weighted multiplication, or grouping bits. Understanding different number systems is important for both humans and computers.
This document appears to be an exam for a course on machine learning or artificial intelligence. It contains instructions for taking the exam, which is closed book and does not allow calculators. It then lists 6 multiple choice or short answer questions worth various point values that assess knowledge of topics like linear separators, sources of error in machine learning models, designing neural network architectures, and radial basis feature transformations.
The document provides information about a course on digital electronics and combination logic circuits. It includes the course details, topics to be covered such as number systems, Boolean algebra, combinational logic circuits, and sequential logic circuits. It also lists recommended textbooks. The topics will cover number representations, logic gates, Boolean expressions, logic simplification techniques including Karnaugh maps, and basic combinational logic circuits such as adders, decoders, multiplexers. Sequential logic circuits including flip-flops will also be introduced. Worked examples applying concepts like Boolean algebra, logic gates, and circuit analysis are provided.
This document discusses various combinational and sequential logic blocks used in digital circuit design. It covers topics like adders, subtractors, multipliers, multiplexers, demultiplexers, decoders, encoders, flip-flops, registers, counters and finite state machines. It provides details on the design and working of different logic blocks like half adder, full adder, binary adder, magnitude comparator, encoder, decoder etc. with truth tables and logic diagrams. Examples are given to illustrate the implementation of logic functions using decoders and multiplexers.
The document discusses logical design and analysis of combinational circuits using logic gates. It covers topics such as logic gates, synchronous vs asynchronous circuits, circuit analysis, implementing switching functions using data selectors, priority encoders, decoders, multiplexers, demultiplexers and other basic digital components. Examples are provided to illustrate circuit design and analysis techniques for combinational logic circuits.
Similar a ⭐⭐⭐⭐⭐ SOLUCIÓN EVALUACIÓN SISTEMAS DIGITALES 1, 1er Parcial (2021 PAE) (20)
⭐⭐⭐⭐⭐ Device Free Indoor Localization in the 28 GHz band based on machine lea...Victor Asanza
This document discusses device-free indoor localization using machine learning techniques at 28 GHz. The methodology uses ray tracing to generate fingerprint data and selects features from received power values. A random forest algorithm is used for classification and regression training on global and combined classifiers. Results show that combining independent classifiers from one or two transmitters reduces positioning error by at least 16-19% compared to global classification, and by at least 36-37% when combining two transmitters with classification-regression. The size and number of partition classes impacts error, and additional small improvements are achieved through classification-regression combination.
Este documento describe un sistema digital que incluye una máquina de estado secuencial síncrona y tres registros. El sistema permite el ingreso de datos a los registros y encuentra el valor máximo y mínimo ingresado. Se pide completar la partición funcional del sistema, elaborar el diagrama de estados de la máquina de estado y proveer la descripción VHDL de la máquina de estado.
Researcher in fields like Digital Systems Design based on FPGA, Embedded Systems, Open-Source Hardware, Artificial Intelligence and Biomedical Signal Processing with a major research interest in Brain-Computer Interface.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ Trilateration-based Indoor Location using Supervised Learning AlgorithmsVictor Asanza
The indoor positioning system (IPS) has a wide range of applications, due to the advantages it has over Global Positioning Systems (GPS) in indoor environments. Due to the biosecurity measures established by the World Health Organization (WHO), where the social distancing is provided, being stricter in indoor environments. This work proposes the design of a positioning system based on trilateration. The main objective is to predict the positioning in both the ‘x’ and ‘y’ axis in an area of 8 square meters. For this purpose, 3 Access Points (AP) and a Mobile Device (DM), which works as a raster, have been used. The Received Signal Strength Indication (RSSI) values measured at each AP are the variables used in regression algorithms that predict the x and y position. In this work, 24 regression algorithms have been evaluated, of which the lowest errors obtained are 70.322 [cm] and 30.1508 [cm], for the x and y axes, respectively.
Published in: 2022 International Conference on Applied Electronics (AE)
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ Learning-based Energy Consumption PredictionVictor Asanza
✅ Published in: https://doi.org/10.1016/j.procs.2022.07.035
As more people send information to the cloud-fog infrastructure, this brings many problems to the management of computer energy consumption. Therefore, energy consumption management of servers, fog devices and cloud computing platform should be investigated to comply with the Green IT requirement. In this paper, we propose an energy consumption prediction model consisting of several components such as hardware design, data pre-processing, characteristics extraction and selection. Our main goal is to develop a non-invasive meter based on a network of sensors that includes a microcontroller, the MQTT communication protocol and the energy measurement module. This meter measures voltage, current, power, frequency, energy and power factor while a dashboard is used to present the energy measurements in real-time. In particular, we perform measurements using a workstation that has similar characteristics to the servers of a Datacenter locate at the Information Technology Center in ESPOL,
which currently provide this type of services in Ecuador. For convenience, we evaluated different linear regression models to select the best one and to predict future energy consumption based on the several measurements from the workstation during several hours which enables the consumer to optimize and to reduce the maintenance costs of the IT equipment. The supervised machine learning algorithms presented in this work allow us to predict the energy consumption by hours and by days.
⭐ The matlab code used for data processing are available in: https://github.com/vasanza/Matlab_Code/tree/EnergyConsumptionPredictionDatacenter
⭐ The dataset used for data processing are available in:https://ieee-dataport.org/open-access/data-server-energy-consumption-dataset
✅ Read more related topics:
https://vasanza.blogspot.com/
This project analyses the optimal parameters for the shrimp farming, trying to help the aquaculture of Ecuador, using a cyberphysical system, which includes temperature, salinity, dissolved oxygen, and pH sensors to monitor the water conditions and an embedded system to control it using an XBee andATMega328p microcontrollers to remotely activate and deactivate aerators to maintain the quality of each pool in neat conditions.
⭐⭐⭐⭐⭐Classification of Subjects with Parkinson's Disease using Finger Tapping...Victor Asanza
La enfermedad de Parkinson es el segundo trastorno neurodegenerativo más común y afecta a más de 7 millones de personas en todo el mundo. En este trabajo, clasificamos a los sujetos con la enfermedad de Parkinson utilizando datos de la pulsación de los dedos en un teclado. Utilizamos una base de datos gratuita de Physionet con más de 9 millones de registros, preprocesada para eliminar los datos atípicos. En la etapa de extracción de características, obtuvimos 48 características. Utilizamos Google Colaboratory para entrenar, validar y probar nueve algoritmos de aprendizaje supervisado que detectan la enfermedad. Como resultado, conseguimos un grado de precisión superior al 98 %.
Examen 1er parcial que incluye temas de los capítulos:
Capítulo 1, historia de los sistemas IoT y sistemas ciberfísicos.
Capítulo 2, tipos de arquitecturas incluyendo las multiprocessor y multicore.
Capítulo 3, donde se estudia las memorias FLASH, RAM, EEPROM.
Capítulo 4, registros de configuraciones del ADC, PWM, comunicacion serial, I2C y SPI.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ CHARLA #PUCESE Arduino Week: Hardware de Código Abierto TSC-LAB Victor Asanza
✅ #PUCESE, organizó el webinar: "ARDUINO WEEK 2022 PUCESE"
✅ Arduino Week PUCE Esmeraldas- Charla con Expertos
➡️ This is an initiative developed by FIEC-ESPOL professors. Temperature and Speed Control Lab (TSC-LAB) is an open-source hardware development.
➡️ Topics
1- Introducción
2- Hardware de Código Abierto
3- Temperature and Speed Control Lab (TSC-LAB)
4- Códigos de ejemplo
5- Datasets
6- Publicaciones científicas
7- Proyectos
8- Cursos
⭐ Para más contenido visita nuestro blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ #BCI System using a Novel Processing Technique Based on Electrodes Sele...Victor Asanza
This document summarizes a study that developed a brain-computer interface (BCI) system using electroencephalography (EEG) for controlling a hand prosthesis. The system uses an unsupervised learning technique with k-means clustering and principal component analysis to select relevant electrodes and signals. This reduces processing costs and allows for real-time classification on an FPGA. The system achieved 95.1% accuracy in classifying motor intentions to open/close fists and flex/extend ankles using EEG data from selective electrodes near the motor and somatosensory cortices. The electrode selection technique enables processing EEG data efficiently for prosthesis control using affordable off-the-shelf hardware.
⭐⭐⭐⭐⭐ SOLUCIÓN EVALUACIÓN FUNDAMENTOS DE ELECTRICIDAD Y SISTEMAS DIGITALES, 2...Victor Asanza
Problema 1A: (10%) Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar, reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar cuál de las siguientes opciones es la correcta.
Problema 2: (10%) Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar, reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar cuál de las siguientes opciones es la correcta.
Problema 3: (25%) Se desea diseñar un Sistemas Digital que capaz de controlar dos actuadores tipo bomba (A y B) en función del nivel de agua presente en un tanque. Este nivel de agua se monitorea con dos sensores (S0 y S1). El Sistemas Digital se muestra en la siguiente gráfica.
Problema 5: (15%): Dado el siguiente circuito digital, primero obtener la expresión resultante y luego seleccionar el mapa que corresponde al funcionamiento de dicha expresión.
Problema 6: (15%): Dado el siguiente circuito, encontrar la expresión booleana que define el comportamiento de la señal de salida F sin minimizar, luego reducir la expresión booleana usando mapas de Karnaugh (A, B, C, D) agrupando unos.
Problema 7: (20%). En la siguiente gráfica se puede observar el registro de un electrodo de Electromiografía (EMG) durante la ejecución de una tarea motora en extremidad superior. La señal EMG tiene una amplitud en el orden de los microvoltio - milivoltios y es susceptible a ruido debido a la adherencia del electrodo utilizado, frecuencia cardiaca, red eléctrica, tejido adiposo, etc. Como se muestra en la Fig. 1 el análisis post adquisición en el dominio de la frecuencia de la señal EMG indica que existe ruido de baja frecuencia menores a 5Hz debido a ruidos relacionados a movimientos relativos y en 50 Hz debido a la red eléctrica. Las señales EMG tienen información en el rango de 7 a 20Hz, por lo cual se sugiere diseñar un filtro RC paso banda que permita eliminar el ruido de la señal EMG.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
Problema #1 (50%) Dado el siguiente diagrama de un microprocesador genérico de 32 bits por instrucción de hasta 1023 instrucciones visto completamente en clase, que utiliza datos almacenados en memoria RAM (Register Files), como se muestra a continuación.
Problema #2: (10%) ¿Cuáles de las siguientes afirmaciones referentes a las memorias de Instrucciones de un microprocesador son ciertas?
Problema #3: (10%) ¿Cuáles de las siguientes afirmaciones referentes a las memorias EEPROM son ciertas?
Problema #4: (10%) ¿Cuáles de las siguientes afirmaciones referentes a las memorias de datos (Register File) son ciertas?
Problema #5: (20%) Shen et Al., escribió el paper titulado “An FPGA-based Distributed Computing System with Power and Thermal Management Capabilities” en donde desarrolla una plataforma computacional distribuida compuesta de múltiples FPGAs conectadas via Ethernet y cada FPGA está configurada como un sistema multi-core. Los núcleos en el mismo FPGA se comunican a través de la memoria compartida, mientras que diferentes FPGA se comunican a través de enlaces Ethernet, como se muestra en la siguiente gráfica.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ Performance Comparison of Database Server based on #SoC #FPGA and #ARM ...Victor Asanza
New emerging storage technologies have a great application for IoT systems. Running database servers on development boards, such as Raspberry or FPGA, has a great impact on effective performance when using large amounts of data while serving requests from many clients at the same time. In this paper, we designed and implemented an embedded system to monitor the access of a database using MySql database server installed on Linux in a standard FPGA DE10 with HPS resources. The database is designed to keep the information of an IoT system in charge of monitoring and controlling the temperature inside greenhouses. For comparison purposes, we carried out a performance analysis of the database service running on the FPGA and in a Raspberry Pi 4 B to determine the efficiency of the database server in both development cards. The performance metrics analyzed were response time, memory and CPU usage taking into account scenarios with one or more requests from clients simultaneously.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
La siguiente partición funcional que incluye una Maquina Secuencial Sincrónica (MSS) y tres registros de sostenimiento, debe realizar el ingreso de datos a cada uno de los registros y luego permitirá encontrar el valor máximo y mínimo ingresado. Además, cada uno de los registros indicados es de 8 bits para mostrar los valores encontrados de máximo (Qmax) y mínimo (Qmin) serán de 8 bits cada uno. El sistema digital funciona con una MSS modelo Moore de la siguiente forma:
1. La MSS luego de ser reiniciado empieza en el estado inicial.
2. El Sistema Digital en el estado inicial, esperará que el usuario presione y suelte la tecla Start dos veces, luego de lo cual esperará el ingreso de datos.
3. El ingreso de datos se lo hará presentando un byte en la entrada Datos, presionando y soltando la tecla Load (el usuario deberá realizar este paso tres veces, uno por cada registro).
4. Luego de ingresar los 3 datos, el usuario deberá presionar y soltar la tecla Find. Esta señal es la que le indica a la MSS del Sistema Digital, que es momento de realizar la búsqueda del valor máximo y mínimo.
5. Una vez finalizado el proceso de búsqueda de los valores máximo y mínimo, se activará la salida Done. El valor máximo se guardará en el RegistroMax y se presentará en su salida Qmax, por otro lado, el valor mínimo se guardará en el RegistroMin y se presentará en su salida Qmin.
6. La señal Done, las salidas Qmax y Qmin se presentarán hasta que el usuario presione y suelte la tecla Start una vez, luego de lo cual la MSS regresará al estado inicial.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ Charla FIEC: #SSVEP_EEG Signal Classification based on #Emotiv EPOC #BC...Victor Asanza
Este trabajo presenta el diseño experimental para el registro de señales de electroencefalografía (EEG) en 20 sujetos sometidos a potenciales evocados visualmente en estado estable (SSVEP). Además, la implementación de un sistema de clasificación basado en las señales SSVEP-EEG de la región occipital del cerebro obtenidas con el dispositivo Emotiv EPOC.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ #FPGA Based Meteorological Monitoring StationVictor Asanza
In this paper, we propose to implement a meteorological monitoring station using embedded systems. This model is possible thanks to different sensors that enable us to measure several environmental parameters, such as i) relative humidity, ii) average ambient temperature, iii) soil humidity, iv) rain occurrence, and v) light intensity. The proposed system is based on a field-programmable gate array device (FPGA). The proposed design aims at ensuring highresolution data acquisition and at predicting samples with precision and accuracy in real-time. To present the collected data, we develop also a web application with a simple and friendly user interface.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ SSVEP-EEG Signal Classification based on Emotiv EPOC BCI and Raspberry PiVictor Asanza
This work presents the experimental design for recording Electroencephalography (EEG) signals in 20 test subjects submitted to Steady-state visually evoked potential (SSVEP). The stimuli were performed with frequencies of 7, 9, 11 and 13 Hz. Furthermore, the implementation of a classification system based on SSVEP-EEG signals from the occipital region of the brain obtained with the Emotiv EPOC device is presented. These data were used to train algorithms based on artificial intelligence in a Raspberry Pi 4 Model B. Finally, this work demonstrates the possibility of classifying with times of up to 1.8 ms in embedded systems with low computational capacity.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
⭐⭐⭐⭐⭐ SOLUCIÓN LECCIÓN FUNDAMENTOS DE ELECTRICIDAD Y SISTEMAS DIGITALES, 2do ...Victor Asanza
Problema #1,2,3: (10%) El siguiente circuito es de un filtro paso banda. Los datos del circuito son los siguientes, R1 = 1K[Ω] y R2 = 1K[Ω]. ¿cuáles de las siguientes afirmaciones son correctas?
Problema #4,5,6: (10%) El siguiente bloque convertidor analógico digital (ADC) de 8 bits de resolución, se tiene un voltaje de referencia de 5Vcc. ¿cuáles de las siguientes afirmaciones son correctas?
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
Este documento presenta las instrucciones para un examen parcial de un curso de Sistemas Digitales. Detalla los criterios de calificación, incluyendo el requisito de presentar desarrollos a mano claros y correctos. Incluye dos problemas de circuitos lógicos, el primero con una entrada de un bit y salida de un bit, y el segundo con entradas de dos bits y salida de dos bits. Se pide simplificar las expresiones booleanas usando mapas de Karnaugh y describir el funcionamiento del segundo circuito.
Propuesta 1: BÚSQUEDA DE DATOS
Propuesta 2-3: ORDENAMIENTO DE DATOS
Propuesta 4: Microprocessor Architecture.
⭐ For more information visit our blog:
https://vasanza.blogspot.com/
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Fix the Import Error in the Odoo 17Celine George
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
1. vasanza
SISTEMAS DIGITALES 1
EXAMEN 1P
Fecha: 2021/04/01 PAE 2021-2022
Nombre: _________________________________________ Paralelo: __________
Criterios con los que se calificará este examen:
• Las preguntas de desarrollo solo obtendrán la máxima calificación si su respuesta presenta un
desarrollo a mano, claro, correcto, con sus respectivos nombres en cada hoja y haciendo uso de los
criterios vistos en clase002E
• La pregunta cuya opción múltiple esté correctamente seleccionada y además se presente el
respectivo desarrollo para llegar a la respuesta correcta (utilizando los conceptos vistos en clase),
será la pregunta que obtendrá la máxima calificación.
• Si la pregunta tiene seleccionada correctamente la opción múltiple y NO presenta el desarrollo o
con un desarrollo INCORRECTO, tendrá una calificación de CERO.
• EL estudiante deberá subir el desarrollo de la evaluación como carga de archivo. Solo en caso de
presentar problemas al momento de cargar su desarrollo, se permitirá enviarlo por email
(vasanza@espol.edu.ec) y será considerado en la calificación si y solo si es enviado durante el
tiempo que dura la evaluación.
Recomendación:
• Además, se sugiere enviar el desarrollo de la evaluación via correo electrónico, como respaldo
(Durante el tiempo que dure la evaluación).
Problema #1 (30%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada, es descrito con el siguiente
código VHDL:
2. vasanza
Realizar los siguientes desarrollos:
a) Usando mapas de karnaught y agrupamiento de minterms, simplicar la expresión booleana al
mínimo (15p).
b) Utilizando puertas lógicas, graficar el circuito que represente a la ecuación simplificada en el literal
anterior (15p).
Resolución:
a) b)
Problema #2 (30%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada, es descrito con el siguiente
código VHDL:
3. vasanza
Realizar los siguientes desarrollos:
a) Usando mapas de karnaught y agrupamiento de minterms, simplicar la expresión booleana al
mínimo (15p).
b) Utilizando puertas lógicas, graficar el circuito que represente a la ecuación simplificada en el literal
anterior (15p).
Resolución:
a) b)
Problema #3 (30%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada, es descrito con el siguiente
código VHDL:
4. vasanza
Realizar los siguientes desarrollos:
a) Usando mapas de karnaught y agrupamiento de minterms, simplicar la expresión booleana al
mínimo (15p).
b) Utilizando puertas lógicas, graficar el circuito que represente a la ecuación simplificada en el literal
anterior (15p).
Resolución:
a) b)
Problema #4 (30%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada, es descrito con el siguiente
código VHDL:
5. vasanza
Realizar los siguientes desarrollos:
a) Usando mapas de karnaught y agrupamiento de minterms, simplicar la expresión booleana al
mínimo (15p).
b) Utilizando puertas lógicas, graficar el circuito que represente a la ecuación simplificada en el literal
anterior (15p).
Resolución:
a) b)
Problema #5 (x%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada es la siguiente:
Para describir el comportamiento del sistema, se propone utilizar el siguiente código VHDL que está
incompleto:
Y(A,B,C,D) = ∑ (9,10,12,15)
𝑚
6. vasanza
Dadas las siguientes opciones, indicar cuál es la correcta asignación de señal para X0, X1, X2 y X3:
a) with A&B&C&D select Y<= ‘1’ when “1100”|“1111” |“1001” |“1010”, ‘0’ when others;
b) with A&B&C&D select Y<= ‘1’ when “1101”|“1110” |“1000” |“1011”, ‘0’ when others;
c) with A&B&C&D select Y<= ‘1’ when “0000”|“0011” |“1100” |“1111”, ‘0’ when others;
d) with A&B&C&D select Y<= ‘1’ when “0001”|“0010” |“1101” |“1110”, ‘0’ when others;
e) with A&B&C&D select Y<= ‘1’ when “0100”|“0111” |“1000” |“1011”, ‘0’ when others;
f) with A&B&C&D select Y<= ‘1’ when “0101”|“0110” |“1001” |“1010”, ‘0’ when others;
Resolución:
with A&B&C&D select
Y<= ‘1’ when “1100”|“1111” |“1001” |“1010”,
‘0’ when others;
Problema #6 (x%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada es la siguiente:
Para describir el comportamiento del sistema, se propone utilizar el siguiente código VHDL que está
incompleto:
Y(A,B,C,D) = ∑ (8,11,13,14)
𝑚
7. vasanza
Dadas las siguientes opciones, indicar cuál es la correcta asignación de señal para X0, X1, X2 y X3:
a) with A&B&C&D select Y<= ‘1’ when “1100”|“1111” |“1001” |“1010”, ‘0’ when others;
b) with A&B&C&D select Y<= ‘1’ when “1101”|“1110” |“1000” |“1011”, ‘0’ when others;
c) with A&B&C&D select Y<= ‘1’ when “0000”|“0011” |“1100” |“1111”, ‘0’ when others;
d) with A&B&C&D select Y<= ‘1’ when “0001”|“0010” |“1101” |“1110”, ‘0’ when others;
e) with A&B&C&D select Y<= ‘1’ when “0100”|“0111” |“1000” |“1011”, ‘0’ when others;
f) with A&B&C&D select Y<= ‘1’ when “0101”|“0110” |“1001” |“1010”, ‘0’ when others;
Resolución:
with A&B&C&D select
Y<= ‘1’ when “1101”|“1110” |“1000” |“1011”,
‘0’ when others;
Problema #7 (x%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada es la siguiente:
Para describir el comportamiento del sistema, se propone utilizar el siguiente código VHDL que está
incompleto:
Y(A,B,C,D) = ∑ (0,3,12,15)
𝑚
8. vasanza
Dadas las siguientes opciones, indicar cuál es la correcta asignación de señal para X0, X1, X2 y X3:
a) with A&B&C&D select Y<= ‘1’ when “1100”|“1111” |“1001” |“1010”, ‘0’ when others;
b) with A&B&C&D select Y<= ‘1’ when “1101”|“1110” |“1000” |“1011”, ‘0’ when others;
c) with A&B&C&D select Y<= ‘1’ when “0000”|“0011” |“1100” |“1111”, ‘0’ when others;
d) with A&B&C&D select Y<= ‘1’ when “0001”|“0010” |“1101” |“1110”, ‘0’ when others;
e) with A&B&C&D select Y<= ‘1’ when “0100”|“0111” |“1000” |“1011”, ‘0’ when others;
f) with A&B&C&D select Y<= ‘1’ when “0101”|“0110” |“1001” |“1010”, ‘0’ when others;
Resolución:
with A&B&C&D select
Y<= ‘1’ when “0000”|“0011” |“1100” |“1111”,
‘0’ when others;
Problema #8 (x%). El siguiente es un Sistema Digital que tiene las señales ‘A’,’ B’, ‘C’ y ‘D’ como
entradas de un bit; por otro lado, la señal ‘Y’ es una salida de un bit tal como se muestra en la siguiente
imagen:
El comportamiento de la señal de salida ‘Y’ en función de las señales de entrada es la siguiente:
Para describir el comportamiento del sistema, se propone utilizar el siguiente código VHDL que está
incompleto:
Y(A,B,C,D) = ∑ (1,2,13,14)
𝑚
9. vasanza
Dadas las siguientes opciones, indicar cuál es la correcta asignación de señal para X0, X1, X2 y X3:
a) with A&B&C&D select Y<= ‘1’ when “1100”|“1111” |“1001” |“1010”, ‘0’ when others;
b) with A&B&C&D select Y<= ‘1’ when “1101”|“1110” |“1000” |“1011”, ‘0’ when others;
c) with A&B&C&D select Y<= ‘1’ when “0000”|“0011” |“1100” |“1111”, ‘0’ when others;
d) with A&B&C&D select Y<= ‘1’ when “0001”|“0010” |“1101” |“1110”, ‘0’ when others;
e) with A&B&C&D select Y<= ‘1’ when “0100”|“0111” |“1000” |“1011”, ‘0’ when others;
f) with A&B&C&D select Y<= ‘1’ when “0101”|“0110” |“1001” |“1010”, ‘0’ when others;
Resolución:
with A&B&C&D select
Y<= ‘1’ when “0001”|“0010” |“1101” |“1110”,
‘0’ when others;
Problema #9: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴 + 𝐵 + 𝐶 + 𝐷)(𝐴 + 𝐵 + 𝐶̅ + 𝐷)(𝐴 + 𝐵
̅ + 𝐶 + 𝐷)(𝐴 + 𝐵
̅ + 𝐶̅ + 𝐷)
a) 𝑨 + 𝑫
b) 𝑨
̅ + 𝑫
c) 𝑨 + 𝑫
̅
d) 𝑨
̅ + 𝑫
̅
Resolución:
10. vasanza
Problema #10: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴̅ + 𝐵
̅ + 𝐶 + 𝐷)(𝐴̅ + 𝐵
̅ + 𝐶̅ + 𝐷)(𝐴̅ + 𝐵 + 𝐶 + 𝐷)(𝐴̅ + 𝐵 + 𝐶̅ + 𝐷)
a) 𝑨 + 𝑫
b) 𝑨
̅ + 𝑫
c) 𝑨 + 𝑫
̅
d) 𝑨
̅ + 𝑫
̅
Resolución:
Problema #11: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴̅ + 𝐵
̅ + 𝐶 + 𝐷
̅)(𝐴̅ + 𝐵
̅ + 𝐶̅ + 𝐷
̅)(𝐴̅ + 𝐵 + 𝐶 + 𝐷
̅)(𝐴̅ + 𝐵 + 𝐶̅ + 𝐷
̅)
a) 𝑨 + 𝑫
b) 𝑨
̅ + 𝑫
c) 𝑨 + 𝑫
̅
d) 𝑨
̅ + 𝑫
̅
Resolución:
11. vasanza
Problema #12: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴 + 𝐵 + 𝐶 + 𝐷
̅)(𝐴 + 𝐵 + 𝐶̅ + 𝐷
̅)(𝐴 + 𝐵
̅ + 𝐶 + 𝐷
̅)(𝐴 + 𝐵
̅ + 𝐶̅ + 𝐷
̅)
a) 𝑨 + 𝑫
b) 𝑨
̅ + 𝑫
c) 𝑨 + 𝑫
̅
d) 𝑨
̅ + 𝑫
̅
Resolución:
Problema #13: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴 + 𝐵 + 𝐶 + 𝐷)(𝐴 + 𝐵 + 𝐶 + 𝐷
̅)(𝐴̅ + 𝐵 + 𝐶 + 𝐷)(𝐴̅ + 𝐵 + 𝐶 + 𝐷
̅)
a) 𝑪 + 𝑩
b) 𝑪
̅ + 𝑩
c) 𝑪 + 𝑩
̅
d) 𝑪
̅ + 𝑩
̅
Resolución:
12. vasanza
Problema #14: (x%)
Dado la siguiente expresión booleana que define el comportamiento de la señal de salida F sin minimizar,
reducir dicha expresión usando mapas de Karnaugh (A, B, C, D) agrupando unos. Luego, seleccionar
cuál de las siguientes opciones es la correcta:
F = (𝐴 + 𝐵 + 𝐶̅ + 𝐷
̅)(𝐴 + 𝐵 + 𝐶̅ + 𝐷)(𝐴̅ + 𝐵 + 𝐶̅ + 𝐷
̅)(𝐴̅ + 𝐵 + 𝐶̅ + 𝐷)
a) 𝑪 + 𝑩
b) 𝑪
̅ + 𝑩
c) 𝑪 + 𝑩
̅
d) 𝑪
̅ + 𝑩
̅
Resolución:
Problema #15: (30%)
Se desea diseñar un Sistemas Digital que capaz de controlar dos actuadores tipo bomba (A y B) en función
del nivel de agua presente en un tanque. Este nivel de agua se monitorea con dos sensores (S0 y S1). El
Sistemas Digital se muestra en la siguiente gráfica:
13. vasanza
El funcionamiento del sistema digital se detalla a continuación:
• El caudal de entrada de agua se abre (A=1) o se cierra (A=0) con el ánimo de controlar el nivel del
agua presente en el tanque. Si el nivel del agua es el Mínimo (S1 = 0 y S0 = 1) o menor al mínimo
(S1=0 y S0=0) entonces el actuador tipo bomba (A) debe ser abierto (A = 1); por otro lado, si el
nivel del agua es el Máximo (S1 = 1 y S0 = 1) entonces el actuador tipo bomba (A) debe ser cerrado
(A = 0).
• El caudal de salida debe estar abierto (B=1) siempre y cuando el tanque de agua tenga un nivel de
agua entre el máximo y el mínimo (S1 =0 y S0 =1) o (S1 =1 y S0 =1). En caso de tener un nivel de
agua menor al mínimo (S1 =0 y S0 =0), entonces el caudal de salida debe estar cerrado (B=0).
• Recuerde que no es posible que el sensor de nivel máximo (S1) esté detectando agua mientras que
el sensor de nivel mínimo (S0) no la detecta (S1=1 y S0=0)
Realizar los siguientes desarrollos:
a) Completar la siguiente Tabla de Verdad (10p)
b) Utilizando mapas de Karnaugh obtener la expresión booleana minimizada de las salidas A y B (10p)
c) Utilizando puertas nand de dos entradas hacer el circuito resultante de las salidas A y B (10p)
S0 S1 A B
0 0
0 1
1 0
1 1
Resolución:
a)
S0 (min) S1 (max) A B
0 0 1 0
0 1 Φ Φ
1 0 1 1
1 1 0 1
b)