Spelling suggestions: "subject:"dumber atemsystem"" "subject:"dumber systsystem""
21 |
Circuitos aritméticos e representação numérica por resíduos / Arithmetic circuits and residue number systemHändel, Milene January 2007 (has links)
Este trabalho mostra os diversos sistemas de representação numérica, incluindo o sistema numérico normalmente utilizado em circuitos e alguns sistemas alternativos. Uma maior ênfase é dada ao sistema numérico por resíduos. Este último apresenta características muito interessantes para o desenvolvimento de circuitos aritméticos nos dias atuais, como por exemplo, a alta paralelização. São estudadas também as principais arquiteturas de somadores e multiplicadores. Várias descrições de circuitos aritméticos são feitas e sintetizadas. A arquitetura de circuitos aritméticos utilizando o sistema numérico por resíduos também é estudada e implementada. Os dados da síntese destes circuitos são comparados com os dados dos circuitos aritméticos tradicionais. Com isto, é possível avaliar as potenciais vantagens de se utilizar o sistema numérico por resíduos no desenvolvimento de circuitos aritméticos. / This work shows various numerical representation systems, including the system normally used in current circuits and some alternative systems. A great emphasis is given to the residue number system. This last one presents very interesting characteristics for the development of arithmetic circuits nowadays, as for example, the high parallelization. The main architectures of adders and multipliers are also studied. Some descriptions of arithmetic circuits are made and synthesized. The architecture of arithmetic circuits using the residue number system is also studied and implemented. The synthesis data of these circuits are compared with the traditional arithmetic circuits results. Then it is possible to evaluate the potential advantages of using the residue number system in arithmetic circuits development.
|
22 |
The cognitive underpinnings of non-symbolic comparison task performanceClayton, Sarah January 2016 (has links)
Over the past twenty years, the Approximate Number System (ANS), a cognitive system for representing non-symbolic quantity information, has been the focus of much research attention. Psychologists seeking to understand how individuals learn and perform mathematics have investigated how this system might underlie symbolic mathematical skills. Dot comparison tasks are commonly used as measures of ANS acuity, however very little is known about the cognitive skills that are involved in completing these tasks. The aim of this thesis was to explore the factors that influence performance on dot comparison tasks and discuss the implications of these findings for future research and educational interventions. The first study investigated how the accuracy and reliability of magnitude judgements is influenced by the visual cue controls used to create dot array stimuli. This study found that participants performances on dot comparison tasks created with different visual cue controls were unrelated, and that stimuli generation methods have a substantial influence on test-retest reliability. The studies reported in the second part of this thesis (Studies 2, 3, 4 and 5) explored the role of inhibition in dot comparison task performance. The results of these studies provide evidence that individual differences in inhibition may, at least partially, explain individual differences in dot comparison task performance. Finally, a large multi-study re-analysis of dot comparison data investigated whether individuals take account of numerosity information over and above the visual cues of the stimuli when comparing dot arrays. This analysis revealed that dot comparison task performance may not reflect numerosity processing independently from visual cue processing for all participants, particularly children. This novel evidence may provide some clarification for conflicting results in the literature regarding the relationship between ANS acuity and mathematics achievement. The present findings call into question whether dot comparison tasks should continue to be used as valid measures of ANS acuity.
|
23 |
Modeling the Interaction of Numerosity and Perceptual Variables with the Diffusion ModelKang, Inhan 26 August 2019 (has links)
No description available.
|
24 |
Security of Lightweight Cryptographic PrimitivesVennos, Amy Demetra Geae 10 June 2021 (has links)
Internet-of-Things (IoT) devices are increasing in popularity due to their ability to help automate many aspects of daily life while performing these necessary duties on billions of low-power appliances. However, the perks of these small devices also come with additional constraints to security. Security always has been an issue with the rise of cryptographic backdoors and hackers reverse engineering the security protocols within devices to reveal the original state that was encrypted. Security researchers have done much work to prevent attacks with high power algorithms, such as the international effort to develop the current Advanced Encryption Standard (AES). Unfortunately, IoT devices do not typically have the computational resources to implement high-power algorithms such as AES, and must rely on lightweight primitives such as pseudorandom number generators, or PRNGs.This thesis explores the effectiveness, functionality, and use of PRNGs in different applications. First, this thesis investigates the confidentiality of a single-stage residue number system PRNG, which has previously been shown to provide extremely high quality outputs for simulation and digital communication applications when evaluated through traditional techniques like the battery of statistical tests used in the NIST Random Number Generation and DIEHARD test suites or in using Shannon entropy metrics. In contrast, rather than blindly performing statistical analyses on the outputs of the single-stage RNS PRNG, this thesis provides both white box and black box analyses that facilitate reverse engineering of the underlying RNS number generation algorithm to obtain the residues, or equivalently the key, of the RNS algorithm. This thesis develops and demonstrate a conditional entropy analysis that permits extraction of the key given a priori knowledge of state transitions as well as reverse engineering of the RNS PRNG algorithm and parameters (but not the key) in problems where the multiplicative RNS characteristic is too large to obtain a priori state transitions. This thesis then discusses multiple defenses and perturbations for the RNS system that defeat the original attack algorithm, including deliberate noise injection and code hopping. We present a modification to the algorithm that accounts for deliberate noise, but rapidly increases the search space and complexity. Lastly, a comparison of memory requirements and time required for the attacker and defender to maintain these defenses is presented.
The next application of PRNGs is in building a translation for binary PRNGs to non-binary uses like card shuffling in a casino. This thesis explores a shuffler algorithm that utilizes RNS in Fisher-Yates shuffles, and that calls for inputs from any PRNG. Entropy is lost through this algorithm by the use of PRNG in lieu of TRNG and by its RNS component: a surjective mapping from a large domain of size $2^J$ to a substantially smaller set of arbitrary size $n$. Previous research on the specific RNS mapping process had developed a lower bound on the Shannon entropy loss from such a mapping, but this bound eliminates the mixed-radix component of the original formulation. This thesis calculates a more precise formula which takes into account the radix, $n$. This formulation is later used to specify the optimal parameters to simulate the shuffler with different test PRNGs. After implementing the shuffler with PRNGs with varying output entropies, the thesis examines the output value frequencies to discuss if utilizing PRNG is a feasible alternative for casinos to the higher-cost TRNG. / Master of Science / Cryptography, or the encrypting of data, has drawn widespread interest for years, initially sparking public concern through headlines and dramatized reenactments of hackers targeting security protocols. Previous cryptographic research commonly focused on developing the quickest, most secure ways to encrypt information on high-power computers. However, as wireless low-power devices such as smart home, security sensors, and learning thermostats gain popularity in ordinary life, interest is rising in protecting information being sent between devices that don't necessarily have the power and capabilities as those in a government facility. Lightweight primitives, the algorithms used to encrypt information between low-power devices, are one solution to this concern, though they are more susceptible to attackers who wish to reverse engineer the encrypting process. The pesudorandom number generator (PRNG) is a type of lightweight primitive that generates numbers that are essentially random even though it is possible to determine the input value, or seed, from the resulting output values. This thesis explores the effectiveness and functionality of PRNGs in different applications. First, this thesis explores a PRNG that has passed many statistical tests to prove its output values are random enough for certain applications. This project analyzes the quality of this PRNG through a new lens: its resistance to reverse engineering attacks. The thesis describes and implements an attack on the PRNG that allows an individual to reverse engineer the initial seed. The thesis then changes perspective from attacker to designer and develop defenses to this attack: by slightly modifying the algorithm, the designer can ensure that the reverse engineering process is so complex, time-consuming, and memory-requiring that implementing such an attack would be impractical for an attacker. The next application of PRNGs is in the casino industry, in which low-power and cost-effective automatic card shufflers for games like poker are becoming popular. This thesis explores a solution for optimal shuffling of a deck of cards.
|
25 |
Analysis of Lightweight Cryptographic PrimitivesGeorge, Kiernan Brent 05 May 2021 (has links)
Internet-of-Things (IoT) devices have become increasingly popular in the last 10 years, yet
also show an acceptance for lack of security due to hardware constraints. The range of sophistication in IoT devices varies substantially depending on the functionality required, so
security options need to be flexible. Manufacturers typically either use no security, or lean
towards the use of the Advanced Encryption Standard (AES) with a 128-bit key. AES-128
is suitable for the higher end of that IoT device range, but is costly enough in terms of
memory, time, and energy consumption that some devices opt to use no security. Short
development and a strong drive to market also contribute to a lack in security. Recent work
in lightweight cryptography has analyzed the suitability of custom protocols using AES as a
comparative baseline. AES outperforms most custom protocols when looking at security, but
those analyses fail to take into account block size and future capabilities such as quantum
computers. This thesis analyzes lightweight cryptographic primitives that would be suitable
for use in IoT devices, helping fill a gap for "good enough" security within the size, weight,
and power (SWaP) constraints common to IoT devices. The primitives have not undergone
comprehensive cryptanalysis and this thesis attempts to provide a preliminary analysis of
confidentiality. The first is a single-stage residue number system (RNS) pseudorandom number generator (PRNG) that was shown in previous publications to produce strong outputs
when analyzed with statistical tests like the NIST RNG test suite and DIEHARD. However, through analysis, an intelligent multi-stage conditional probability attack based on the
pigeonhole principle was devised to reverse engineer the initial state (key) of a single-stage
RNS PRNG. The reverse engineering algorithm is presented and used against an IoT-caliber
device to showcase the ability of an attacker to retrieve the initial state. Following, defenses
based on intentional noise, time hopping, and code hopping are proposed. Further computation and memory analysis show the proposed defenses are simple in implementation,
but increase complexity for an attacker to the point where reverse engineering the PRNG is
likely no longer viable. The next primitive proposed is a block cipher combination technique
based on Galois Extension Field multiplication. Using any PRNG to produce the pseudorandom stream, the block cipher combination technique generates a variable sized key matrix
to encrypt plaintext. Electronic Codebook (ECB) and Cipher Feedback (CFB) modes of
operation are discussed. Both system modes are implemented in MATLAB as well as on a
Texas Instruments (TI) MSP430FR5994 microcontroller for hardware validation. A series
of statistical tests are then run against the simulation results to analyze overall randomness,
including NIST and the Law of the Iterated Logarithm; the system passes both. The implementation on hardware is compared against a stream cipher variation and AES-128. The
block cipher proposed outperforms AES-128 in terms of computation time and consumption
for small block sizes. While not as secure, the cryptosystem is more scalable to block sizes
used in IoT devices. / Master of Science / An Internet-of-Things (IoT) device is a single-purpose computer that operates with less
computing resources and sometimes on battery power. The classification of IoT can range
anywhere from motion sensors to a doorbell camera, but IoT devices are used in more than
just home automation. The medical and industrial spaces use simple wireless computers for
a number of tasks as well. One concern with IoT, given the hardware constraints, is the lack
of security. Since messages are often transmitted through a wireless medium, anybody could
eavesdrop on what is being communicated if data is not encrypted prior to transmission.
Cryptography is the practice of taking any string of data and obfuscating it through a
process that only valid parties can reverse. The sophistication of cryptographic systems has
increased to the point where IoT manufacturers elect to use no security in many cases because
the hardware is not advanced enough to run them efficiently. The Advanced Encryption
Standard (AES) is usually the choice for security in the IoT space, but typically only higherend devices can afford to use AES. This thesis focuses on alternative lightweight systems to
AES. First, a single-stage residue number system (RNS) pseudorandom number generator
(PRNG) is analyzed, which has been proven to generate statistically random outputs in
previous publications. PRNGs are a cheap method of producing seemingly random outputs
through an algorithm once provided with an initial state known as a seed. An intelligent
attack on the PRNG is devised, which is able to reverse engineer the initial state, effectively
breaking the random behavior. Three defenses against the attack are then implemented to
protect against the reported vulnerability. Following, a block cipher combination technique
is presented, using the aforementioned PRNG as the source of randomness. A block cipher is
a method of encrypting large chunks of data together, to better obfuscate the output. Using
a block cipher is more secure than just using a PRNG for encryption. However, PRNGs
are used to generate the key for the proposed block cipher, as they offer a more efficient
method of security. The combination technique presented serves to increase the security of
PRNGs further. The cipher is shown to perform better on an IoT-caliber device in terms of
computation time and energy consumption at smaller block sizes than AES.
|
26 |
Residue number system arithmetic inspired applications in cellular downlink OFDMAZhu, Dalin January 1900 (has links)
Master of Science / Department of Electrical and Computer Engineering / Balasubramaniam Natarajan / In recent years, orthogonal frequency division multiplexing (OFDM) scheme has received significant research interest due to its capability of supporting high data rates in hostile environments. As compared to conventional single-carrier modulation schemes, OFDM benefits from low complexity equalization filters and high spectral efficiency. A multiple access implementation of OFDM, i.e., orthogonal frequency division multiple access (OFDMA) has been considered as the multiple access (MA) scheme in 3GPP LTE, or LTE advanced downlink. In cellular OFDMA, frequency hopping (FH) is widely used to exploit frequency diversity gain and improve system throughput; and pilot patterns that have low-cross correlation are employed to improve the quality of channel estimation. However, there are numerous unsolved problems that need to be addressed in frequency hopped and pilot assisted OFDMA systems.
Surveying the prior works in the literature, we find that limited research efforts have focused on coping with the inherent disadvantages regarding OFDM in cellular OFDMA systems. In this thesis, we employ the so-called residue number system (RNS) arithmetic concentrating on (a) FH pattern design for minimizing/averaging intra/inter-cell interference, (b) pilot pattern design for improving the quality of channel estimation, and (c) pilot pattern design for facilitating time-frequency synchronization and device identification in multi-cell OFDMA. Regarding (a), RNS-based FH patterns not only preserve orthogonality within the same cell, but also have the minimum number of symbol collisions among adjacent cells. Additionally, the RNS-based method exhibits consistent system performance and more frequency diversity gains as compared to previous efforts. With respect to (b), RNS-based pilot pattern design generates more unique pilot patterns than conventional methods. This results in low probability of pilot-to-pilot collisions, which in turn, significantly improves the quality of channel estimation from the system level perspective. For (c), as a special case of linear congruence sequences, RNS-based pilot patterns have good auto-correlation properties, which are extremely helpful in time-frequency synchronization and device identification.
|
27 |
Concurrent neurological and behavioral assessment of number line estimation performance in children and adultsBaker, Joseph Michael 01 May 2013 (has links)
Children who struggle to learn math are often identified by their poor performance on common math learning activities, such as number line estimations. While such behavioral assessments are useful in the classroom, naturalistic neuroimaging of children engaged in real-world math learning activities has the potential to identify concurrent behavioral and neurological correlates to poor math performance. Such correlates may help pinpoint effective teaching strategies for atypical learners, and may highlight instructional methods that elicit typical neurological response patterns to such activities. For example, multisensory stimulation that contains information about number enhances infants' and preschool children's behavioral performance on many numerical tasks and has been shown to elicit neural activation in areas related to number processing and decision-making. Thus, when applied to math teaching tools, multisensory stimulation may provide a platform through which both behavioral and neural math-related processes may be enhanced. Common approaches to neuroimaging of math processing lack ecological validity and are often not analogous to real-world learning activities. However, because of its liberal tolerance of movement, near-infrared spectroscopy (NIRS) provides an ideal platform for such studies. Here, NIRS is used to provide the first concurrent examination of neurological and behavioral data from number line estimation performance within children and adults. Moreover, in an effort to observe the behavioral and neurological benefits to number line estimations that may arise from multisensory stimulation, differential feedback (i.e., visual, auditory, or audiovisual) about estimation performance is provided throughout a portion of the task. Results suggest behavioral and neural performance is enhanced by feedback. Moreover, significant effects of age suggest young children show greater neurological response to feedback, and increase in task difficulty resulted in decreased behavioral performance and increased neurological activation associated with mathematical processing. Thus, typical math learners effectively recruit areas of the brain known to process number when math activities become increasingly difficult. Data inform understanding typical behavioral and neural responses to real-world math learning tasks, and may prove useful in triangulating signatures of atypical math learning. Moreover, results demonstrate the utility of NIRS as a platform to provide simultaneous neurological and behavioral data during naturalistic math learning activities.
|
28 |
Κυκλώματα ύψωσης στο τετράγωνο για το σύστημα αριθμητικής υπολοίπωνΣπύρου, Αναστασία 22 September 2009 (has links)
Στα σύγχρονα ψηφιακά συστήματα η ανάγκη για γρήγορους υπολογισμούς είναι πλέον από τους πιο καθοριστικούς παράγοντες. Άλλοι ιδιαίτερα κρίσιμοι παράγοντες είναι η απαιτούμενη επιφάνεια του κυκλώματος και η κατανάλωση ενέργειας. Ωστόσο, ο χρόνος παραμένει ένας από τους πιο σημαντικούς για πλήθος εφαρμογές. Τα αριθμητικά κυκλώματα, όπως αθροιστές, πολλαπλασιαστές και κυκλώματα ύψωσης στο τετράγωνο, είναι πλέον αναπόσπαστο κομμάτι των ψηφιακών κυκλωμάτων, γι’ αυτό η επιτάχυνση των λειτουργιών αυτών είναι ένας στόχος στην κατεύθυνση του οποίου πολλές διαφορετικές αρχιτεκτονικές έχουν προταθεί. Η μείωση της καθυστέρησης στις αριθμητικές μονάδες θα δώσει μεγάλη βελτίωση στη συνολική απόδοση των συστημάτων, μιας και οι περισσότερες εφαρμογές εμπεριέχουν πλήθος αριθμητικών πράξεων.
Η πράξη της ύψωσης στο τετράγωνο αποτελεί ειδική περίπτωση της πράξης του πολλαπλασιασμού, στην οποία ο πολλαπλασιαστέος ισούται με τον πολλαπλασιαστή. Ο λόγος για τον οποίο χρησιμοποιούμε εξειδικευμένα κυκλώματα για την πράξη αυτή είναι η εκμετάλλευση του γεγονότος ότι τα δύο έντελα είναι ίσα, κάτι που οδηγεί σε ελαχιστοποίηση του χρόνου που απαιτείται για την ολοκλήρωση της πράξης, αλλά και μείωση της απαιτούμενης επιφάνειας. Η πράξη της ύψωσης στο τετράγωνο χρησιμοποιείται σε πολλές εφαρμογές των υψηλής απόδοσης επεξεργαστών ψηφιακού σήματος (digital signal processors – DSP). Τέτοιες εφαρμογές συμπεριλαμβάνουν φιλτράρισμα σήματος (signal filtering), επεξεργασία εικόνας (image processing), και διαμόρφωση για τηλεπικοινωνιακά συστήματα. Η πράξη της ύψωσης στο τετράγωνο μπορεί, επίσης, να χρησιμοποιηθεί αποδοτικά στην υλοποίηση κρυπτογραφικών αλγορίθμων για την αποφυγή της χρονοβόρας διαδικασίας της ύψωσης σε δύναμη.
Το Σύστημα Αριθμητικής Υπολοίπων (RNS), είναι ένα αριθμητικό σύστημα το οποίο παρουσιάζει σημαντικά πλεονεκτήματα στην ταχύτητα με την οποία μπορούν να γίνουν οι αριθμητικές πράξεις. Στο RNS οι αριθμοί αναπαρίστανται σαν ένα σύνολο από υπόλοιπα. Για να αναπαραστήσουμε έναν αριθμό ορίζουμε ένα σύνολο από πρώτους μεταξύ τους ακεραίους που ονομάζεται βάση του συστήματος P={p1,p2,…pk}. Η αναπαράσταση ενός αριθμού X στο RNS ορίζεται ως το σύνολο των υπολοίπων του Χ ως προς τα στοιχεία της βάσης Ρ. Προκύπτει, έτσι, ότι X={x1,x2,…,xk} όπου το xi είναι το υπόλοιπο της διαίρεσης του X με το στοιχείο της βάσης pi και συμβολίζεται με Xi=|X|pi. Κάθε ακέραιος Χ που ανήκει στο εύρος τιμών 0<=X<M, όπου Μ είναι το γινόμενο όλων των στοιχείων της βάσης P, έχει μοναδική αναπαράσταση στο RNS. Μια αριθμητική πράξη δύο εντέλων, η οποία μπορεί να είναι πρόσθεση, αφαίρεση ή πολλαπλασιασμός, ορίζεται ως εξής: {z1,z2,…,zk} = {x1,x2,…,xk}*{y1,y2,…,yk}, όπου zi = (xi*yi) modpi. Συνεπώς, κάθε αριθμητική πράξη εφαρμόζεται σε παράλληλες μονάδες (μία για κάθε στοιχείο της βάσης), καθεμία από τις οποίες διαχειρίζεται μικρούς αριθμούς (υπόλοιπα), αντί μιας μονάδας που θα χρειαζόταν να διαχειριστεί μεγάλους αριθμούς.
Ένα από τα πιο δημοφιλή σύνολα βάσης είναι αυτά της μορφής {2^n, 2^n -1, 2^n+1}, λόγω του ότι προσφέρουν πολύ αποδοτικά κυκλώματα με κριτήριο το γινόμενο της επιφάνειας επί το τετράγωνο της καθυστέρησης (area * time^2), καθώς επίσης και αποδοτικούς μετατροπείς από και προς το δυαδικό σύστημα. Για το λόγο αυτό η υλοποίηση αποδοτικών modulo(2^n-1) και modulo(2n+1) κυκλωμάτων είναι σημαντική. Το πρόβλημα που παρουσιάζεται είναι ότι ενώ οι modulo(2^n) και modulo(2^n-1) αριθμητικές χρειάζονται το πολύ n δυαδικά ψηφία για την αναπαράσταση όλων των δυνατών υπολοίπων, στη modulo(2^n+1) αρχιτεκτονική χρειάζονται (n+1) ψηφία. Το πρόβλημα αυτό λύνεται με τη χρήση diminished-1 αναπαράστασης. Στη diminished-1 αναπαράσταση, κάθε αριθμός Χ αναπαρίσταται ως X-1=X-1. Έτσι, απαιτούνται n δυαδικά ψηφία για την αναπαράσταση, χρειάζονται, όμως, κυκλώματα μετατροπής από και προς την diminished-1 αναπαράσταση. Όταν χρησιμοποιείται η diminished-1 αναπαράσταση η τιμή εισόδου ίση με 0 χειρίζεται ξεχωριστά.
Στα πλαίσια της εργασίας αναλύονται υπάρχουσες αρχιτεκτονικές και προτείνονται νέες για κυκλώματα ύψωσης στο τετράγωνο στο Σύστημα Αριθμητικής Υπολοίπων (RNS). Οι προτεινόμενες αρχιτεκτονικές βελτιώνουν την καθυστέρηση και, ταυτόχρονα, μειώνουν τις απαιτήσεις σε επιφάνεια. / Fast computations are of major importance in modern digital systems. Other critical factors are the area and the energy consumption. However, delay is still one of the most important ones for a variety of applications. Due to the fact that arithmetic circuits, such as adders, multipliers and squarers, have been integral components of most digital systems, many schemes have been proposed in the direction of accelerating arithmetic operations. As most applications contain a big number of arithmetic operations, delay reduction in arithmetic units will lead to significant improvement in the total system’s performance.
Squaring is a special case of multiplication, where the multiplier equals the multiplicand. The reason for using a special circuit for squaring is to benefit from the fact that the two operands are equal, which reduces the delay and the area needed for the calculation of the square. The squaring operation is used in many applications of high performance digital signal processors. Such applications include signal filtering, image processing and modulation of communication components. Squarers can also find applicability in several cryptographic algorithms for the implementation of modular exponentiations.
The Residue Number System is an arithmetic system in which arithmetic operations can be calculated in high speed. In the RNS numbers are represented as a set of residues. In order to represent a number we define a set of pairwise relative prime integers P={p1,p2,…pk}, which is the system’s base. Every number X is represented with the set of the residues occurred after the division of X by each element of the base, P. Thus, X={x1,x2,…,xk}, where xi stands for the residue of the division of X by the ith element of the base, pi, which is denoted as Xi=|X|pi. In the RNS there is a unique representation for every integer X that 0<=X<M, where M is the product of all the elements of the base. A two-operant arithmetic operation, which can be an addition, a subtraction or a multiplication, is defined as {z1,z2,…,zk} = {x1,x2,…,xk}*{y1,y2,…,yk}, where zi = (xi*yi) modpi. Consequently, arithmetic operations are performed to parallel units (one unit for each element of the base) each one handling small residues, instead of a single unit that handles large numbers.
One of the most popular base sets is those of the form {2^n, 2^n -1, 2^n+1}, due to the fact that they offer very efficient circuits when considering the area*time^2 criterion and efficient converters from/to the binary system. Thus, the design of efficient modulo (2^n-1) and modulo (2^n+1) circuits is of high importance. The problem that arises is that while in modulo(2^n) and modulo(2^n-1) arithmetic n bits are sufficient for the representation of all possible residues, in modulo(2^n+1) arithmetic (n+1) bits are needed. This can be solved by the use of the diminished-1 representation. In the diminished-1 representation every number X is represented as X-1=X-1. Therefore, n bits are sufficient for the representation, but converters from/to the diminished-1 representation are needed. In cases that the diminished-1 representation is used, operands with value 0 is treated separately.
For the needs of this thesis, existing architectures of squaring circuits in the RNS are studied and new ones are proposed. The proposed architectures improve the system’s delay, while, in parallel, reduce the area needs.
|
29 |
IMPLEMENTATION OF A NOVEL INTEGRATED DISTRIBUTED ARITHMETIC AND COMPLEX BINARY NUMBER SYSTEM IN FAST FOURIER TRANSFORM ALGORITHMBowlyn, Kevin Nathaniel 01 December 2017 (has links)
This research focuses on a novel integrated approach for computing and representing complex numbers as a single entity without the use of any dedicated multiplier for calculating the fast Fourier transform algorithm (FFT), using the Distributed Arithmetic (DA) technique and Complex Binary Number Systems (CBNS). The FFT algorithm is one of the most used and implemented technique employed in many Digital Signal Processing (DSP) applications in the field of science, engineering, and mathematics. The DA approach is a technique that is used to compute the inner dot product between two vectors without the use of any dedicated multipliers. These dedicated multipliers are fast but they consume a large amount of hardware and are quite costly. The DA multiplier process is accomplished by shifting and adding only without the need of any dedicated multiplier. In today's technology, complex numbers are computed using the divide and conquer approach in which complex numbers are divided into two parts: the real and imaginary. The CBNS technique however, allows for each complex addition and multiplication to be computed in one single step instead of two. With the combined DA-CBNS approach for computing the FFT algorithm, those dedicated multipliers are being replaced with a DA system that utilize a Rom-based memory for storing the twiddle factor 'wn' value and the complex arithmetic operations being represented as a single entity, not two, with the CBNS approach. This architectural design was implemented by coding in a very high speed integrated circuit (VHSIC) hardware description language (VHDL) using Xilinx ISE design suite software program version 14.2. This computer aided tool allows for the design to be synthesized to a logic gate level in order to be further implemented onto a Field Programmable Gate Array (FPGA) device. The VHDL code used to build this architecture was downloaded on a Nexys 4 DDR Artix-7 FPGA board for further testing and analysis. This novel technique resulted in the use of no dedicated multipliers and required half the amount of complex arithmetic computations needed for calculating an FFT structure compared with its current traditional approach. Finally, the results showed that for the proposed architecture design, for a 32 bit, 8-point DA-CBNS FFT structure, the results showed a 32% area reduction, 41% power reduction, 59% reduction in run-time, 42% reduction in logic gate cost, and 66% increase in speed. For a 28 bit, 16-point DA-CBNS FFT structure, its area size, power consumption, run-time, and logic gate, were also found to be reduced at approximately 30%, 37%, 60%, and 39%, respectively, with an increase of speed of approximately 67% when compared to the traditional approach that employs dedicated multipliers and computes its complex arithmetic as two separate entities: the real and imaginary.
|
30 |
En kvalitativ studie om elevers kunskaper av tal i decimalform : A Qualitative Study Of Students' Knowledge Of Numbers In Decimal FormParmar, Ronak January 2021 (has links)
Syftet med studien är att erhålla en djupare förståelse av elevers kunskaper om det decimala talsystemet. Frågeställningen som undersöks är; vilka olika tillvägagångsätt kan identifieras när eleverna beskriver hur de har löst operationer som behandlar det decimala talsystemet? Den här studien har använt sig av en kvalitativ innehållsanalys, där elevernas olika tillvägagångsätt att lösa uppgifter har analyserats. Studien har lånat ord som förståelse och kvalitativa skillnader från den fenomenografiska forskningsansatsen. I studien har 17 elever deltagit och genomfört ett arbetsblad. Därefter valdes 10 elever slumpmässigt ut för vidare intervjuer. Resultatet som presenteras baseras på de uppgifter där det förekommer skillnader i elevsvaren. I uppgifterna och i de efterföljande elevintervjuerna har flertalet tillvägagångsätt kunnat identifieras. Det huvudsakliga resultatet visar att eleverna löste uppgifterna med olika tillvägagångsätt. Elevsvaren har i diskussionsdelen jämförts mot tidigare forskning för att kunna behandla studiens syfte. Vidare problematiseras även resultatets relevans för yrkesrollen och hur matematiklärare kan använda sig av resultatet för att planera och genomföra sin undervisning. / The aim of the study is to obtain a deeper understanding of students' knowledge of the decimal number system. The subject of interest is what different approaches can be identified when students describe how they have solved operations that deal with the decimal number system? This study has used a qualitative content analysis, where the students' different approaches to solving tasks have been analyzed. The study has borrowed words such as understanding and qualitative differences from the phenomenographic research approach. In the study, 17 students participated and completed a worksheet. Subsequently, 10 students were randomly selected for further interviews. The presented results are based on the data where there are differences in student responses. Through the task and the subsequent student interviews different approaches were identified. The main result is that the students solved the tasks with different approaches. In the discussion section, the student responses have been compared with previous research. Furthermore, the relevance of the result for the professional role and how the mathematics teacher is also problematized can use the results to plan and carry out their teaching.
|
Page generated in 0.1056 seconds