CENG 342 – Digital Systems
Routing with a Process Larry Pyeatt
SDSM&T
CENG 342 Digital Systems Routing with a Process Larry Pyeatt - - PowerPoint PPT Presentation
CENG 342 Digital Systems Routing with a Process Larry Pyeatt SDSM&T Process Statements inside a process are written as if they will be executed sequentially . The process is actually a concurrent statement (or set of concurrent
SDSM&T
1 process(b, c) 2 begin 3
4
5 end process;
1 if boolean1 then 2
3 elsif boolean2 then 4
5 ... 6 else 7
8 end if;
30 architecture if_arch of prio_encoder is 31 begin 32
33
34
35
36
37
38
39
40
41
42
43
44
45
46 end if_arch;
33 architecture if_arch of decoder_2_4 is 34 begin 35
36
37
38
39
40
41
42
43
44
45
46
47
48
49 end if_arch;
1 case sel is 2
3
4
5
6
7
8
9 end case
48 architecture case_arch of prio_encoder is 49 begin 50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66 end case_arch;
51 architecture case_arch of decoder_2_4 is 52
53 begin 54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70 end case_arch;
1 -- Two greater-than comparators are needed to synthesize the 2 -- following using conditional signal assignment 3
4
1 -- One greater-than comparator is needed to synthesize the 2 -- circuit using a process 3 -- note: process construct is required, but omitted here 4 if a>b then 5
6
7
8
9
10
1 max <= a when ((a>b) and (a>c)) else 2
3
4
1 process(a, b, c) 2 begin 3
4
5
6
7
8
9
10
11
12
13
14
15
16 end process;
1
2
3
4
5
6
7
8
1 process (a, b) 2 begin 3
4
5
6
7
8
9
10
11
12
13 end process;
1 process (a, b) 2 begin 3
4
5
6
7
8
9
10 end process;