Results 1 - 10 of 50,783

Table 1. Number of gates in TSC for 4-bit, 8-bit, and 12-bit. Number of LFSR Size of FSM Size of Size of LFSR Size of Total Size

in Securing Scan Design Using Lock & Key Technique
by Jeremy Lee, Mohammed Tehranipoor, Chintan Patel, Jim Plusquellic 2005
"... In PAGE 7: ... We synthesized our Lock amp; Key technique in Verilog using Synopsys and the Design Analyzer tool [20]. Table1 shows the number of equivalent gates returned by Design Analyzer for the FSM, test key comparator, LFSR, and decoder with 4-bit, 8-bit, and 12-bit LFSRs. The Lock amp; Key test security controller grows fairly slowly for a large increase in the number of subchains.... In PAGE 7: ... For our implementation, we used a 64-bit test key. The size of the test key comparator in Table1 does not include the additional overhead for on-chip key storage, but we did include it in the final size of the TSC. Only the growth of the LFSR and decoder is of any significance in terms of size, but the number of subchains that can be used exponentially increases with each additional bit.... ..."
Cited by 1

Table 5 - 1 : PPAR Hello FSM

in unknown title
by unknown authors
"... In PAGE 42: ....1.1 Client and Server Side Hello Table 6 - 2 : Proxy PAR Hello Message Offset Size (Octets) Name Function/Description 0 8 PNNI Header A PNNI packet header structure with Packet type = 32 or 33 (client or server side Hello). See Table5 -20 in [PNNI]. 8 2 Flags reserved, must be 0.... ..."

Table III. Detailed Comparison of Bit-Split FSM and FPGA-Based Designsa

in Bit-split string-matching engines for intrusion detection and prevention
by Lin Tan, Brett Brotherton, Timothy Sherwood
Cited by 1

Table 5 - 2 : PPAR Service Registration FSM (Server Side)

in unknown title
by unknown authors
"... In PAGE 42: ....1.1 Client and Server Side Hello Table 6 - 2 : Proxy PAR Hello Message Offset Size (Octets) Name Function/Description 0 8 PNNI Header A PNNI packet header structure with Packet type = 32 or 33 (client or server side Hello). See Table5 -20 in [PNNI]. 8 2 Flags reserved, must be 0.... ..."

Table 5 - 3 : PPAR Service Registration FSM (Client Side)

in unknown title
by unknown authors
"... In PAGE 42: ....1.1 Client and Server Side Hello Table 6 - 2 : Proxy PAR Hello Message Offset Size (Octets) Name Function/Description 0 8 PNNI Header A PNNI packet header structure with Packet type = 32 or 33 (client or server side Hello). See Table5 -20 in [PNNI]. 8 2 Flags reserved, must be 0.... ..."

Table 5 - 4 : PAR Service Description FSM (Server Side)

in unknown title
by unknown authors
"... In PAGE 42: ....1.1 Client and Server Side Hello Table 6 - 2 : Proxy PAR Hello Message Offset Size (Octets) Name Function/Description 0 8 PNNI Header A PNNI packet header structure with Packet type = 32 or 33 (client or server side Hello). See Table5 -20 in [PNNI]. 8 2 Flags reserved, must be 0.... ..."

Table 5 - 5 : PPAR Service Description FSM (Client Side)

in unknown title
by unknown authors
"... In PAGE 42: ....1.1 Client and Server Side Hello Table 6 - 2 : Proxy PAR Hello Message Offset Size (Octets) Name Function/Description 0 8 PNNI Header A PNNI packet header structure with Packet type = 32 or 33 (client or server side Hello). See Table5 -20 in [PNNI]. 8 2 Flags reserved, must be 0.... ..."

Table 1 reports the size of the components (excluding the RAM) for different synthesis strategies. The equa- tions are parametrized by the RAM width (m) and depth (N). The term patt_gen is the contribution of a small FSM generating alternating bit patterns [CPSB94], whose size does not depend linearly on the RAM size. Area overhead values are also plotted in Fig. 4.

in unknown title
by unknown authors
"... In PAGE 4: ... Table1 : area overhead Concerning timing overheads, the component has been designed so that the critical path (lying on the path from a clock edge to an empty/full indication) does not contain any component relevant to BIST. In other words, the operating speed of the FIFO does not decrease as a consequence of the insertion of the BIST circuitry.... ..."

Table 3: Detailed Comparison of Our Bit Split FSM Design and existing FPGA-based Designs. Throughput, density, and efficiency are shown for a variety of different design options. g = group size. 1B/cc = read in one byte per cycle time.

in Network Intrusion Detection and Prevention Systems have
by unknown authors
"... In PAGE 8: ... In Section 2, we have described our architectural support for incremental and non-interrupting update, therefore we concentrate on the other two requirements, the worst case throughput and area efficiency, as well as performance per area (Through- put*Characters/Area) in the rest of this section. From Table3 , we can see that our design can achieve worst case throughput of over 10 Gbit/sec even if only 1 byte is read in each cycle, while the best of all FPGA-based meth-... ..."

Table 3: Detailed Comparison of Our Bit Split FSM Design and existing FPGA-based Designs. Throughput, density, and efficiency are shown for a variety of different design options. g = group size. 1B=cc = read in one byte per cycle time.

in Network Intrusion Detection and Prevention Systems have
by unknown authors
"... In PAGE 8: ... In Section 2, we have described our architectural support for incremental and non-interrupting update, therefore we concentrate on the other two requirements, the worst case throughput and area efficiency, as well as performance per area (Through- put*Characters/Area) in the rest of this section. From Table3 , we can see that our design can achieve worst case throughput of over 10 Gbit/sec even if only 1 byte is read in each cycle, while the best of all FPGA-based meth- Published in Proceedings of ISCA 2005... ..."
Results 1 - 10 of 50,783