- •About This Manual
- •Additional Resources
- •Manual Contents
- •Conventions
- •Typographical
- •Online Document
- •Using Foundation Express with VHDL
- •Hardware Description Languages
- •Typical Uses for HDLs
- •Advantages of HDLs
- •About VHDL
- •Foundation Express Design Process
- •Using Foundation Express to Compile a VHDL Design
- •Design Methodology
- •Design Descriptions
- •Entities
- •Entity Generic Specifications
- •Entity Port Specifications
- •Architecture
- •Declarations
- •Components
- •Concurrent Statements
- •Constant Declarations
- •Processes
- •Signal Declarations
- •Subprograms
- •Type Declarations
- •Examples of Architectures for NAND2 Entity
- •Configurations
- •Packages
- •Using a Package
- •Package Structure
- •Package Declarations
- •Package Body
- •Resolution Functions
- •Data Types
- •Type Overview
- •Enumeration Types
- •Enumeration Overloading
- •Enumeration Encoding
- •Enumeration Encoding Values
- •Integer Types
- •Array Types
- •Constrained Array
- •Unconstrained Array
- •Array Attributes
- •Record Types
- •Record Aggregates
- •Predefined VHDL Data Types
- •Data Type BOOLEAN
- •Data Type BIT
- •Data Type CHARACTER
- •Data Type INTEGER
- •Data Type NATURAL
- •Data Type POSITIVE
- •Data Type STRING
- •Data Type BIT_VECTOR
- •Unsupported Data Types
- •Physical Types
- •Floating-Point Types
- •Access Types
- •File Types
- •Express Data Types
- •Subtypes
- •Expressions
- •Overview
- •Operators
- •Logical Operators
- •Relational Operators
- •Adding Operators
- •Unary (Signed) Operators
- •Multiplying Operators
- •Miscellaneous Arithmetic Operators
- •Operands
- •Operand Bit-Width
- •Computable Operands
- •Aggregates
- •Attributes
- •Expressions
- •Function Calls
- •Identifiers
- •Indexed Names
- •Literals
- •Numeric Literals
- •Character Literals
- •Enumeration Literals
- •String Literals
- •Qualified Expressions
- •Records and Fields
- •Slice Names
- •Limitations on Null Slices
- •Limitations on Noncomputable Slices
- •Type Conversions
- •Sequential Statements
- •Assignment Statements and Targets
- •Simple Name Targets
- •Indexed Name Targets
- •Slice Targets
- •Field Targets
- •Aggregate Targets
- •Variable Assignment Statements
- •Signal Assignment Statements
- •Variable Assignment
- •Signal Assignment
- •if Statements
- •Evaluating Conditions
- •Using the if Statement to Infer Registers and Latches
- •case Statements
- •Using Different Expression Types
- •Invalid case Statements
- •loop Statements
- •Basic loop Statement
- •while...loop Statements
- •for...loop Statements
- •Steps in the Execution of a for...loop Statement
- •for...loop Statements and Arrays
- •next Statements
- •exit Statements
- •Subprograms
- •Subprogram Always a Combinatorial Circuit
- •Subprogram Declaration and Body
- •Subprogram Calls
- •Procedure Calls
- •Function Calls
- •return Statements
- •Procedures and Functions as Design Components
- •Example with Component Implication Directives
- •Example without Component Implication Directives
- •wait Statements
- •Inferring Synchronous Logic
- •Combinatorial Versus Sequential Processes
- •null Statements
- •Concurrent Statements
- •Overview
- •process Statements
- •Combinatorial Process Example
- •Sequential Process Example
- •Driving Signals
- •block Statements
- •Nested Blocks
- •Guarded Blocks
- •Concurrent Versions of Sequential Statements
- •Concurrent Procedure Calls
- •Concurrent Signal Assignments
- •Simple Concurrent Signal Assignments
- •Conditional Signal Assignments
- •Selected Signal Assignments
- •Component Instantiation Statements
- •Direct Instantiation
- •generate Statements
- •for...generate Statements
- •Steps in the Execution of a for...generate Statement
- •Common Usage of a for...generate Statement
- •if...generate Statements
- •Register and Three-State Inference
- •Register Inference
- •The Inference Report
- •Latch Inference Warnings
- •Controlling Register Inference
- •Inferring Latches
- •Inferring Set/Reset (SR) Latches
- •Inferring D Latches
- •Inferring Master-Slave Latches
- •Inferring Flip-Flops
- •Inferring D Flip-Flops
- •Inferring JK Flip-Flops
- •Inferring Toggle Flip-Flops
- •Getting the Best Results
- •Understanding Limitations of Register Inference
- •Three-State Inference
- •Reporting Three-State Inference
- •Controlling Three-State Inference
- •Inferring Three-State Drivers
- •Inferring a Simple Three-State Driver
- •Three-State Driver with Registered Enable
- •Three-State Driver Without Registered Enable
- •Writing Circuit Descriptions
- •How Statements Are Mapped to Logic
- •Design Structure
- •Adding Structure
- •Using Variables and Signals
- •Using Parentheses
- •Using Design Knowledge
- •Optimizing Arithmetic Expressions
- •Arranging Expression Trees for Minimum Delay
- •Sharing Common Subexpressions
- •Changing an Operator Bit-Width
- •Using State Information
- •Propagating Constants
- •Sharing Complex Operators
- •Asynchronous Designs
- •Don’t Care Inference
- •Using Don’t Care Default Values
- •Differences Between Simulation and Synthesis
- •Synthesis Issues
- •Feedback Paths and Latches
- •Fully Specified Variables
- •Asynchronous Behavior
- •Understanding Superset Issues and Error Checking
- •Foundation Express Directives
- •Notation for Foundation Express Directives
- •Foundation Express Directives
- •Translation Stop and Start Pragma Directives
- •synthesis_off and synthesis_on Directives
- •Resolution Function Directives
- •Component Implication Directives
- •Foundation Express Packages
- •std_logic_1164 Package
- •std_logic_arith Package
- •Using the Package
- •Modifying the Package
- •Data Types
- •UNSIGNED
- •SIGNED
- •Conversion Functions
- •Arithmetic Functions
- •Example 10-1: Binary Arithmetic Functions
- •Example 10-2: Unary Arithmetic Functions
- •Comparison Functions
- •Example 10-3: Ordering Functions
- •Example 10-4: Equality Functions
- •Shift Functions
- •ENUM_ENCODING Attribute
- •pragma built_in
- •Type Conversion
- •numeric_std Package
- •Understanding the Limitations of numeric_std package
- •Using the Package
- •Data Types
- •Conversion Functions
- •Resize Function
- •Arithmetic Functions
- •Comparison Functions
- •Defining Logical Operators Functions
- •Shift Functions
- •Rotate Functions
- •Shift and Rotate Operators
- •std_logic_misc Package
- •ATTRIBUTES Package
- •VHDL Constructs
- •VHDL Construct Support
- •Design Units
- •Data Types
- •Declarations
- •Specifications
- •Names
- •Identifiers and Extended Identifiers
- •Specifics of Identifiers
- •Specifics of Extended Identifiers
- •Operators
- •Shift and Rotate Operators
- •xnor Operator
- •Operands and Expressions
- •Sequential Statements
- •Concurrent Statements
- •Predefined Language Environment
- •VHDL Reserved Words
- •Examples
- •Moore Machine
- •Mealy Machine
- •Read-Only Memory
- •Waveform Generator
- •Smart Waveform Generator
- •Definable-Width Adder-Subtracter
- •Count Zeros—Combinatorial Version
- •Count Zeros—Sequential Version
- •Soft Drink Machine—State Machine Version
- •Soft Drink Machine—Count Nickels Version
- •Carry-Lookahead Adder
- •Carry Value Computations
- •Implementation
- •Serial-to-Parallel Converter—Counting Bits
- •Input Format
- •Implementation Details
- •Serial-to-Parallel Converter—Shifting Bits
- •Programmable Logic Arrays
VHDL Reference Guide
SEEN_ZERO <= TRUE; COUNT <= COUNT + 1;
end if;
if (BITS_SEEN = 7) then COUNT_READY <= TRUE;
else
BITS_SEEN <= BITS_SEEN + 1; end if;
end if; |
-- |
if (READ) |
end if; |
-- |
if (RESET) |
end process; |
|
|
end BEHAVIOR; |
|
|
Figure A-13 Count Zeros—Sequential Schematic
Soft Drink Machine—State Machine Version
The soft drink machine—state machine example is a control unit for a soft drink vending machine.
The circuit reads signals from a coin input unit and sends outputs to a change dispensing unit and a drink dispensing unit.
Here are the design parameters for the following two examples.
•This example assumes that only one kind of soft drink is dispensed.
•This is a clocked design with CLK and RESET input signals.
A-36 |
Xilinx Development System |
Examples
•The price of the drink is 35 cents.
•The input signals from the coin input unit are NICKEL_IN (nickel deposited), DIME_IN (dime deposited), and QUARTER_IN (quarter deposited).
•The output signals to the change dispensing unit are NICKEL_OUT and DIME_OUT.
•The output signal to the drink dispensing unit is DISPENSE (dispense drink).
•The first VHDL description for this design uses a state machine description style. The second VHDL description is in the example after the following example.
library synopsys; use synopsys.attributes.all;
entity DRINK_STATE_VHDL is
port(NICKEL_IN, DIME_IN, QUARTER_IN, RESET: BOOLEAN; CLK: BIT;
NICKEL_OUT, DIME_OUT, DISPENSE: out BOOLEAN); end DRINK_STATE_VHDL;
architecture BEHAVIOR of DRINK_STATE_VHDL is
type STATE_TYPE is (IDLE, FIVE, TEN, FIFTEEN, TWENTY, TWENTY_FIVE, THIRTY, OWE_DIME);
signal CURRENT_STATE, NEXT_STATE: STATE_TYPE; attribute STATE_VECTOR : STRING;
attribute STATE_VECTOR of BEHAVIOR : architecture is ”CURRENT_STATE”;
attribute sync_set_reset of reset : signal is ”true”; begin
process(NICKEL_IN, DIME_IN, QUARTER_IN, CURRENT_STATE, RESET, CLK)
begin
-- Default assignments NEXT_STATE <= CURRENT_STATE; NICKEL_OUT <= FALSE; DIME_OUT <= FALSE;
DISPENSE <= FALSE;
-- Synchronous reset if(RESET) then
NEXT_STATE <= IDLE; else
VHDL Reference Guide |
A-37 |
VHDL Reference Guide
-- State transitions and output logic case CURRENT_STATE is
when IDLE => if(NICKEL_IN) then
NEXT_STATE <= FIVE; elsif(DIME_IN) then
NEXT_STATE <= TEN; elsif(QUARTER_IN) then
NEXT_STATE <= TWENTY_FIVE; end if;
when FIVE => if(NICKEL_IN) then
NEXT_STATE <= TEN; elsif(DIME_IN) then
NEXT_STATE <= FIFTEEN; elsif(QUARTER_IN) then
NEXT_STATE <= THIRTY; end if;
when TEN => if(NICKEL_IN) then
NEXT_STATE <= FIFTEEN; elsif(DIME_IN) then
NEXT_STATE <= TWENTY; elsif(QUARTER_IN) then
NEXT_STATE <= IDLE; DISPENSE <= TRUE;
end if;
when FIFTEEN => if(NICKEL_IN) then
NEXT_STATE <= TWENTY; elsif(DIME_IN) then
NEXT_STATE <= TWENTY_FIVE; elsif(QUARTER_IN) then
NEXT_STATE <= IDLE; DISPENSE <= TRUE; NICKEL_OUT <= TRUE;
end if;
when TWENTY => if(NICKEL_IN) then
NEXT_STATE <= TWENTY_FIVE; elsif(DIME_IN) then
NEXT_STATE <= THIRTY; elsif(QUARTER_IN) then
NEXT_STATE <= IDLE; DISPENSE <= TRUE;
A-38 |
Xilinx Development System |
Examples
DIME_OUT <= TRUE; end if;
when TWENTY_FIVE => if(NICKEL_IN) then
NEXT_STATE <= THIRTY; elsif(DIME_IN) then
NEXT_STATE <= IDLE; DISPENSE <= TRUE;
elsif(QUARTER_IN) then NEXT_STATE <= IDLE; DISPENSE <= TRUE; DIME_OUT <= TRUE; NICKEL_OUT <= TRUE;
end if;
when THIRTY => if(NICKEL_IN) then
NEXT_STATE <= IDLE; DISPENSE <= TRUE;
elsif(DIME_IN) then NEXT_STATE <= IDLE; DISPENSE <= TRUE; NICKEL_OUT <= TRUE;
elsif(QUARTER_IN) then NEXT_STATE <= OWE_DIME; DISPENSE <= TRUE; DIME_OUT <= TRUE;
end if;
when OWE_DIME => NEXT_STATE <= IDLE; DIME_OUT <= TRUE;
end case; end if;
end process;
--Synchronize state value with clock
--This causes it to be stored in flip-flops process
begin
wait until CLK’event and CLK = ’1’; CURRENT_STATE <= NEXT_STATE;
end process;
end BEHAVIOR;
VHDL Reference Guide |
A-39 |
