Fast Hardware Computation of x mod z.
(05/01/2014)
We show a high-speed hardware implementation of x mod z that can be pipelined in O(n-m) stages, where x is represented in n bits and z is represented in m bits. It is suitable for large x. We offer two versions. In the first, the value of z is fixed by the hardware. For example, using this circuit, we show a random number generator that produces more than 11 million random numbers per second on the SRC-6 reconfigurable computer. In the second, z is an independent input. This is suitable for RNS number system applications, for example. The second version...
Tác giả: Butler, J. T.; Sasao, T. |
Số trang: 5 |
Lĩnh vực: CNTT |
Năm XB: 2011 |
Loại tài liệu: Khác
Tài liệu cần xác thực trước khi tải
Tiêu đề | Tải về |
Fast Hardware Computation of x mod z. | Số trang: 5
| Loại file:
We show a high-speed hardware implementation of x mod z that can be pipelined in O(n-m) stages, where x is represented in n bits and z is represented in m bits. It is suitable for large x. We offer two versions. In the first, the value of z is fixed by the hardware. For example, using this circuit, we show a random number generator that produces more than 11 million random numbers per second on the SRC-6 reconfigurable computer. In the second, z is an independent input. This is suitable for RNS number system applications, for example. The second version can be pipelined in O(n) stages.
|
miễn phí
|
© Copyright 2012 Trung tâm Thông tin Khoa học và Công nghệ - Sở Khoa học & Công nghệ TP. Cần Thơ
Địa chỉ: 118/3 Trần Phú - P.Cái Khế - Q.Ninh Kiều - TPCT
Điện thoại: 0292 3824031 Fax: 0292 3812352
|
|
Lượt truy cập:
(Website trong thời gian thử nghiệm)