-
201
Design of 8-bit divider with VHDL language
Published 2008“…This project involves the design of 8-bit dividers with VHDL language. We illustrate the modern way of designing logic circuits, using sophisticated computer-aided-design (CAD) software tools.…”
Get full text
Thesis -
202
Analysis and design of 4-bit magnitude comparator
Published 2008“…This project involves the analysis and design of 4-bit Magnitude Comparator. This chip is available commercially as SN5485, SN54L85, SN54LS85, SN54S85 or SN7485, SN74L85, SN74LS85, SN74S85. …”
Get full text
Thesis -
203
Channel modeling for bit-patterned media recording
Published 2012“…In such a high areal density, Bit-Patterned Media Recording (BPMR) has been proposed as a prominent candidate for next generation hard disk drives (HDDs). …”
Get full text
Final Year Project (FYP) -
204
High speed 16-bit multiplier design
Published 2013“…In the second step of the project, I was adopting the Carry save multiplier idea from last year FYP student’s idea, and I made an improvement which replaced the last row of ripple adder by using Carry Look-Ahead adder and achieve even higher speed multiplier. Meanwhile, different bits (4-bit, 8-bit and 16-bit,) of Carry Look-Ahead adder was designed and simulated successfully. …”
Get full text
Final Year Project (FYP) -
205
-
206
Low power 16-bit multiplier design
Published 2015“…The aim of this project is to investigate the design of different 16-bit CMOS Multiplier based on different logic and its implementation for portable low power applications. …”
Get full text
Final Year Project (FYP) -
207
16-bit low power multiplier design
Published 2016“…Adders in the multiplier help to sum up the partial products and the carry bits in different levels depending on the bit size of the multiplier. …”
Get full text
Final Year Project (FYP) -
208
Low bit rate speech coding standards
Published 2011“…In this chapter all such standards are provided along with their year of standardization, coding type, bit rate and Mean Opinion Scores (MOS) which is a subjective, perceptual judgment…”
Get full text
Book Chapter -
209
-
210
Ranking function synthesis for bit-vector relations
Published 2010“…While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-level code. …”
Conference item -
211
Synthesising interprocedural bit-precise termination proofs
Published 2016“…Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination. Bit-precise termination arguments are synthesised over lexicographic linear ranking function templates. …”
Conference item -
212
An adaptive random bit multilevel algorithm for SDEs
Published 2020“…We study the approximation of expectations E(f (X)) for solutions X of stochastic differential equations and functionals f on the path space by means of Monte Carlo algorithms that only use random bits instead of random numbers. We construct an adaptive random bit multilevel algorithm, which is based on the Euler scheme, the Lévy-Ciesielski representation of the Brownian motion, and asymptotically optimal random bit approximations of the standard normal distribution. …”
Book section -
213
-
214
Ranking function synthesis for bit-vector relations
Published 2013“…While it is well-known how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-level code. …”
Journal article -
215
-
216
Bit threads and the membrane theory of entanglement dynamics
Published 2021“…Motivated by the new <em>bit threads</em> formulation of holographic entanglement entropy, given in terms of a convex optimization problem based on flow maximization, or equivalently tight packing of bit threads, we reformulate the membrane theory as a max flow problem by proving a max flow-min cut theorem. …”
Journal article -
217
Bit-precise procedure-modular termination analysis
Published 2018“…Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination. Bit-precise termination arguments are synthesised over lexicographic linear ranking function templates. …”
Journal article -
218
-
219
-
220
A new 128-bit block cipher
Published 2009“…From the results, this new block cipher has successfully generated randomness of the block cipher output for data ranging from 1 ,000,000 to 6,000,000 bits. This means that the new block cipher is secured to be used for data ranging from 1 ,000,000 to 6,000,000 bits. …”
Get full text
Thesis