Spelling suggestions: "subject:"systolic arrays"" "subject:"systolic errays""
11 |
Concurrent Error Detection in Finite Field Arithmetic OperationsBayat Sarmadi, Siavash January 2007 (has links)
With significant advances in wired and wireless technologies and also increased shrinking in the size of VLSI circuits, many devices have become very large because they need to contain several large units. This large number of gates and in turn large number of transistors causes the devices to be more prone to faults. These faults specially in sensitive and critical applications may cause serious failures and hence should be avoided.
On the other hand, some critical applications such as cryptosystems may also be prone to deliberately injected faults by malicious attackers. Some of these faults can produce erroneous results that can reveal some important secret information of the cryptosystems. Furthermore, yield factor improvement is always an important issue in VLSI design and fabrication processes. Digital systems such as cryptosystems and digital signal processors usually contain finite field operations. Therefore, error detection and correction of such operations have become an important issue recently.
In most of the work reported so far, error detection and correction are applied using redundancies in space (hardware), time, and/or information (coding theory). In this work, schemes based on these redundancies are presented to detect errors in important finite field arithmetic operations resulting from hardware faults. Finite fields are used in a number of practical cryptosystems and channel encoders/decoders. The schemes presented here can detect errors in arithmetic operations of finite fields represented in different bases, including polynomial, dual and/or normal basis, and implemented in various architectures, including bit-serial, bit-parallel and/or systolic arrays.
|
12 |
Concurrent Error Detection in Finite Field Arithmetic OperationsBayat Sarmadi, Siavash January 2007 (has links)
With significant advances in wired and wireless technologies and also increased shrinking in the size of VLSI circuits, many devices have become very large because they need to contain several large units. This large number of gates and in turn large number of transistors causes the devices to be more prone to faults. These faults specially in sensitive and critical applications may cause serious failures and hence should be avoided.
On the other hand, some critical applications such as cryptosystems may also be prone to deliberately injected faults by malicious attackers. Some of these faults can produce erroneous results that can reveal some important secret information of the cryptosystems. Furthermore, yield factor improvement is always an important issue in VLSI design and fabrication processes. Digital systems such as cryptosystems and digital signal processors usually contain finite field operations. Therefore, error detection and correction of such operations have become an important issue recently.
In most of the work reported so far, error detection and correction are applied using redundancies in space (hardware), time, and/or information (coding theory). In this work, schemes based on these redundancies are presented to detect errors in important finite field arithmetic operations resulting from hardware faults. Finite fields are used in a number of practical cryptosystems and channel encoders/decoders. The schemes presented here can detect errors in arithmetic operations of finite fields represented in different bases, including polynomial, dual and/or normal basis, and implemented in various architectures, including bit-serial, bit-parallel and/or systolic arrays.
|
13 |
On Algorithmic Design Methodologies, Heterogenous RFSoC/GPU Beamformers, and Cryogenic Antenna Efficiency Evaluation for Phased Array Receivers in Radio AstronomyBurnett, Mitchell C. 26 June 2023 (has links) (PDF)
Modern radio astronomy’s demand for high sensitivity and wide fields of view is met through innovations that reduce receiver system noise temperatures and integrate technology supporting parallel processing and larger instantaneous bandwidths. The advanced L-band phased array camera for astronomy (ALPACA) is a fully cryogenic 69 dual-polarized dipole PAF and digital beamformer back end for the Green Bank Telescope. This instrument will form 40 dual-polarized beams yielding a 0.35 sq. deg field of view on the sky with a 305.2 MHz processing bandwidth. The target system noise temperature is 27 K. A structured technique to map critically sampled and oversampled polyphase filter banks (PFBs) onto a systolic array for implementation on a field programmable gate array (FPGA) is shown. This method provides unique insights into the operation of these algorithms. A case study for an oversampled PFB operating at 666.67 Msps shows that these designs effectively utilize FPGA resources, maintain high-throughput, and are flexible solutions for varied application requirements. A new class of FPGA, the Radio Frequency System-on-Chip (RFSoC), is integrated as a full-functioning software-defined hardware platform in an open-source signal processing toolchain. This provides astronomers with essential hardware for contemporary scientific research. The demonstration for an experimental technique for measuring antenna radiation efficiency using the antenna Y factor method is presented. The noise contribution of the ALPACA dipole when operating at cryogenic temperatures is estimated. Our findings show that the antenna is expected to contribute less than 1 K to the instrument’s overall system noise temperature. Research contributions of this work are: the integration of new high-performance digital hardware in radio astronomical PAF digital back ends, an open-source RFSoC signal processing development toolchain, an oversampled PFB using an FPAG-based systolic array design, and estimating the cryogenic noise temperature of an ALPACA dipole from its radiation efficiency.
|
14 |
Hierarchical Data Structures for Pattern RecognitionChoudhury, Sabyasachy 05 1900 (has links)
Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches:
1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n) ) and above, Hierarchical agglomerative algorithms, on the other hand, are effective when clusters are non-isotropic. The single linkage method of hierarchical category produces a dendrogram which corresponds to the minimal spanning tree, conventional approaches are time consuming requiring O (n2 ) computational time.
In this thesis we propose an intelligent partitioning scheme for generating the minimal spanning tree in the co-ordinate space. This is computationally elegant as it avoids the computation of similarity between many pairs of samples me minimal spanning tree generated can be used to produce C disjoint clusters by breaking the (C-1) longest edges in the tree.
A systolic architecture has been proposed to increase the speed of the algorithm further. Simulation study has been conducted and the corresponding results are reported. The simulation package has been developed on DEC-1090 in Pascal. It is observed based on the simulation study that the parallel implementation reduces the time enormously. The number of processors required for the parallel implementation is a constant making the approach more attractive.
Texture analysis and synthesis has been extensively studied in the context of computer vision, Two important approaches which have been studied extensively by researchers earlier are statistical and structural approaches, Texture is understood to be a periodic pattern with primitive sub patterns repeating in a particular fashion. This has been used to characterize texture with the help of the hierarchical data structure, tree. It is convenient to use a tree data structure as, along with the operations like merging, splitting, deleting a node, adding a node, etc, .it would be useful to handle a periodic pattern. Various functions like angular second moment, correlation etc, which are used to characterize texture have been translated into the new language of hierarchical data structure.
|
15 |
Systolic design space exploration of EEA-based inversion over binary and ternary fieldsHazmi, Ibrahim 29 August 2018 (has links)
Cryptographic protocols are implemented in hardware to ensure low-area, high speed and reduced power consumption especially for mobile devices. Elliptic Curve Cryptography (ECC) is the most commonly used public-key cryptosystem and its performance depends heavily on efficient finite field arithmetic hardware. Finding the multiplicative inverse (inversion) is the most expensive finite field operation in ECC. The two predominant algorithms for computing finite field inversion are Fermat’s Little Theorem (FLT) and Extended Euclidean Algorithm (EEA). EEA is reported to be the most efficient inversion algorithm in terms of performance and power consumption.
This dissertation presents a new reformulation of EEA algorithm, which allows for speedup and optimization techniques such as concurrency and resource sharing. Modular arithmetic operations over GF(p) are introduced for small values of p, observing interesting figures, particularly for modular division. Whereas, polynomial arithmetic operations over GF(pm) are discussed adequately in order to examine the potential for processes concurrency. In particular, polynomial division and multiplication are revisited in order to derive their iterative equations, which are suitable for systolic array implementation. Consequently, several designs are proposed for each individual process and their complexities are analyzed and compared. Subsequently, a concurrent divider/multiplier-accumulator is developed, while the resulting systolic architecture is utilized to build the EEA-based inverter.
The processing elements of our systolic architectures are created accordingly, and enhanced to accommodate data management throughout our reformulated EEA algorithm. Meanwhile, accurate models for the complexity analysis of the proposed inverters are developed. Finally, a novel, fast, and compact inverter over binary fields is proposed and implemented on FPGA. The proposed design outperforms the reported inverters in terms of area and speed. Correspondingly, an EEA-based inverter over ternary fields is built, showing the lowest area-time complexity among the reported inverters. / Graduate
|
16 |
Design and Rapid-prototyping of Multidimensional-DSP Beamformers Using the ROACH-2 FPGA PlatformSeneviratne, Vishwa January 2017 (has links)
No description available.
|
Page generated in 0.0295 seconds