Design step for Sigma-Delta ADC is introduced. Suitable solution for performance improvement of the original Sigma-Delta ADC, which meets new requirements on resolution of 16 bits and signal bandwidth 20-50 kHz is presented. Advantage of using multi-bit quantization and DEM DWA method reducing the linearity requirements of the internal feedback DAC is shown.

This thesis concisely describes essential type of modulation technique for transmission of binary signal. In introductory part there are summarized advantages and disadvantages for each described modulation technique. There are described proceeding of modulation and demodulation too. Next part is specialized mainly to determination of incorrect receiving probability. For each modulation technique are calculated theoretical values of bit error rate and compiled graph. In practical part there are described possibilities of Matlab platform for measurement of bit error rate. In implement Simulink there is built model of communication channel with additional AWGN channel. Graphs are constructed from simulation data by the help of model’s control script. On selected modulation technique are inspected various elements which are reacted with graph. In finale part there are compared theoretical and measured values and summarized analysis.

Presented thesis deals with the conceptual design of an integrated 11-bit, dual, bipolar, DA converter with current output. Converter is designed in I3T50E proprietary technology of ONSemiconductor. The converter is of a segmented architecture with 6 MSB bits unary and 4 LSB bits binary weighted. Work also describes basic general properties of DA converters, topology examples with regard to the project assignment. The design is assumed for automotive industrial field of application. The operating temperature range is from -40 Deg.C. up to 175 Deg.C. The qualities of produced integrated converter are measured and results are discussed.

In the thesis at hand, different concepts of magnetic recording were investigated both from an experimental and theoretical point of view. On the one hand, micromagnetic simulations of bit patterned media were performed examining the influence of magnetic and geometrical parameters on the magnetization reversal mechanism of the bit array. In this regard, the recording concept called exchange coupled composite (ECC) media was applied in combination with bit patterned media (BPM). It was demonstrated that ECC/BPM is superior in terms of narrowing the SFD which is vital for the implementation of BPM as a recording scheme in magnetic data storage deviced. Moreover, the stability of the magnetic state was calculated for single nanomagnets using the nudged elastic band algorithm. It was found out that the magnetic and geometrical properties have a severe influence on both, the energy barrier for magnetization reversal and the magnetization reversal process of the single nanomagnets. On the other hand, experimental studies of granular CoCrPt:SiO2 films deposited on self-assembled arrays of SiO2 nanoparticles with a size from 10 nm to 330 nm have been carried out, showing a distinct size-dependence of the coercive field and remanent magnetization with changing nanoparticle size. Moreover, these films have been irradiated with Co+ ions with different fluences, resulting in a change of the magnetic properties of the films due to both a change of the intergranular exchange coupling of the film and a degredation of the magnetic layers at higher irradiation fluences.

In recent years, there has been a significant push to implement Deep Neural Networks (DNNs) on edge devices, which requires power and hardware efficient circuits to carry out the intensive matrix-vector multiplication (MVM) operations. This work presents hardware efficient MVM implementation techniques using bit-serial arithmetic and a novel MSB first computation circuit. The proposed designs take advantage of the pre-trained network weight parameters, which are already known in the design stage. Thus, the partial computation results can be pre-computed and stored into look-up tables. Then the MVM results can be computed in a bit-serial manner without using multipliers. The proposed novel circuit implementation for convolution filters and rectified linear activation function used in deep neural networks conducts computation in an MSB-first bit-serial manner. It can predict earlier if the outcomes of filter computations will be negative and subsequently terminate the remaining computations to save power. The benefits of using the proposed MVM implementations techniques are demonstrated by comparing the proposed design with conventional implementation. The proposed circuit is implemented on an FPGA. It shows significant power and performance improvements compared to the conventional designs implemented on the same FPGA.

<p>Probabilistic computing has been proposed as an attractive alternative for bridging the computational gap between the classical computers of today and the quantum computers of tomorrow. It offers to accelerate the solution to many combinatorial optimization and machine learning problems of interest today, motivating the development of dedicated hardware. Similar to the ‘bit’ of classical computing or ‘q-bit’ of quantum computing, probabilistic bit or ‘p-bit’ serve as a fundamental building-block for probabilistic hardware. p-bits are robust classical quantities, fluctuating rapidly between its two states, envisioned as three-terminal devices with a stochastic output controlled by its input. It is possible to implement fast and efficient hardware p-bits by modifying the present day magnetic random access memory (MRAM) technology. In this dissertation, we evaluate the design and performance of low-barrier magnet (LBM) based p-bit realizations.<br> </p> <p>LBMs can be realized from perpendicular magnets designed to be close to the in-plane transition or from circular in-plane magnets. Magnetic tunnel junctions (MTJs) built using these LBMs as free layers can be integrated with standard transistors to implement the three-terminal p-bit units. A crucial parameter that determines the response of these devices is the correlation-time of magnetization. We show that for magnets with low energy barriers (Δ ≤ k_BT) the circular disk magnets with in-plane magnetic anisotropy (IMA) can lead to correlation-times in <i>sub-ns</i> timescales; two orders of magnitude smaller compared to magnets having perpendicular magnetic anisotropy (PMA). We show that this striking difference is due to a novel precession-like fluctuation mechanism that is enabled by the large demagnetization field in mono-domain circular disk magnets. Our predictions on fast fluctuations in LBM magnets have recently received experimental confirmation as well.<br></p> <p>We provide a detailed energy-delay performance evaluation of the stochastic MTJ (s-MTJ) based p-bit hardware. We analyze the hardware using benchmarked SPICE multi-physics modules and classify the necessary and sufficient conditions for designing them. We connect our device performance analysis to systems-level metrics by emphasizing problem and substrate independent figures-of-merit such as flips per second and dissipated energy per flip that can be used to classify probabilistic hardware. </p>

During the last decade, the data rates provided by mobile networks have improved to the point that it is now feasible to provide richer services, such as streaming multimedia, to mobile users. However, due to factors such as radio interference and cell load, the throughput available to a client varies over time. If the throughput available to a client decreases below the media’s bit rate, the client’s buffer will eventually become empty. This causes the client to enter a period of rebuffering, which degrades user experience. In order to avoid this, a streaming server may provide the media at different bit rates, thereby allowing the media’s bit rate (and quality) to be modified to fit the client’s bandwidth. This is referred to as adaptive streaming. The aim of this thesis is to devise an algorithm to find the media quality most suitable for a specific client, focusing on how to detect that the user is able to receive content at a higher rate. The goal for such an algorithm is to avoid depleting the client buffer, while utilizing as much of the bandwidth available as possible without overflowing the buffers in the network. In particular, this thesis looks into the difficult problem of how to do adaptation for live content and how to switch to a content version with higher bitrate and quality in an optimal way. This thesis examines if existing adaptation mechanisms can be improved by considering the characteristics of different mobile networks. In order to achieve this, a study of mobile networks currently in use has been conducted, as well as experiments with streaming over live networks. The experiments and study indicate that the increased available throughput can not be detected by passive monitoring of client feedback. Furthermore, a higher data rate carrier will not be allocated to a client in 3G networks, unless the client is sufficiently utilizing the current carrier. This means that a streaming server must modify its sending rate in order to find its maximum throughput and to force allocation of a higher data rate carrier. Different methods for achieving this are examined and discussed and an algorithm based upon these ideas was implemented and evaluated. It is shown that increasing the transmission rate by introducing stuffed packets in the media stream allows the server to find the optimal bit rate for live video streams without switching up to a bit rate which the network can not support. This thesis was carried out during the summer and autumn of 2008 at Ericsson Research, Multimedia Technologies in Kista, Sweden. / Under det senaste decenniet har överföringshastigheterna i mobilnätet ökat så pass mycket att detnu är möjligt att erbjuda användarna mer avancerade tjänster, som till exempel strömmandemultimedia. I mobilnäten varierar dock klientens bandbredd med avseende på tiden på grund avfaktorer som störningar på radiolänken och lasten i cellen. Om en klients överföringshastighetsjunker till mindre än mediets bithastighet, kommer klientens buffert till slut att bli tom. Dettaleder till att klienten inleder en period av ombuffring, vilket försämrar användarupplevelsen. Föratt undvika detta kan en strömmande server erbjuda mediet i flera olika bithastigheter, vilket gördet möjligt för servern att anpassa bithastigheten (och därmed kvalitén) till klientens bandbredd.Denna metod kallas för adaptive strömning. Syftet för detta examensarbete är att utveckla en algoritm, som hittar den bithastighet som är bästlämpad för en specifik användare med fokus på att upptäcka att en klient kan ta emot media avhögre kvalité. Målet för en sådan algoritm är att undvika att klientens buffert blir tom ochsamtidigt utnyttja så mycket av bandbredden som möjligt utan att fylla nätverksbuffertarna. Merspecifikt undersöker denna rapport det svåra problemet med hur adaptering för direktsänd mediakan utföras. Examensarbetet undersöker om existerande adapteringsmekanismer kan förbättras genom attbeakta de olika radioteknologiers egenskaper. I detta arbete ingår både en studie avradioteknologier, som för tillfället används kommersiellt, samt experiment med strömmandemedia över dessa. Resultaten från studien och experimenten tyder på att ökad bandbredd inte kanupptäckas genom att passivt övervaka ”feedback” från klienten. Vidare kommer inte användarenatt allokeras en radiobärare med högre överföringshastighet i 3G-nätverk, om inte den nuvarandebäraren utnyttjas maximalt. Detta innebär att en strömmande server måste variera sinsändningshastighet både för att upptäcka om mer bandbredd är tillgänglig och för att framtvingaallokering av en bärare med högre hastighet. Olika metoder för att utföra detta undersöks ochdiskuteras och en algoritm baserad på dessa idéer utvecklas. Detta examensarbete utfördes under sommaren och hösten 2008 vid Ericsson Research,Multimedia Technologies i Kista, Sverige.

This study aims to evaluate how Rögle BK:s work with CSR affects their sponsors relation to their sponsorship cooperation.  We do this via a quantitative and qualitative analysis of the club’s sponsors. Since Rögle BK have many sponsors, we put the limit to be included in this study at 90 000 SEK in sponsorship-money per year. Out of 158 possible survey respondents we received 73 answers. Out of the 73 respondents, 4 of them were selected to an interview. The selection for interview participants was chosen from the type of business they operated in, as we looked for variation of companies in the interviews.  We used the theory Brand Image Transfer in order to understand the reasons for companies to enter a sponsorship coorperation with Rögle BK and if Rögle BK:s work with CSR had any impact on this. The study found that Rögle BK:s work with CSR is appreciated by the sponsors but it is not the main reason for their decision to enter a sponsorship cooperation with the club. This could be because Rögle BK:s business network (which is available for all sponsors who have a sponsorship deal worth 90 000 SEK or more) is very appreciated and is believed to increase the business for the companies that are in the network. Another reason why Rögle BK:s work with CSR don’t seem to be the  one of the most important reasons for sponsorship cooperation could be the lack of communication related to it or that CSR in sport is a relative new phenomenon. However, Rögle BK:s work with CSR have had some impact, as most sponsors like the initiative and one sponsor would have left if it hadn’t happened and another sponsor joined because of it. Our assumption based on the accumulated knowledge from previous researches and this study is that Rögle BK:s work with CSR will be of a greater dignity later on, as more companies are getting more aware of the importance of sustainability.

High-throughput next-generation sequencing techniques have hugely decreased the cost and increased the speed of sequencing, resulting in an explosion of sequencing data. This motivates the development of high-efficiency sequence alignment algorithms. In this thesis, I present multiple bit-parallel and Single Instruction Multiple Data (SIMD) algorithms that greatly accelerate the processing of biological sequences. The first chapter describes the BitPAl bit-parallel algorithms for global alignment with general integer scoring, which assigns integer weights for match, mismatch, and insertion/deletion. The bit-parallel approach represents individual cells in an alignment scoring matrix as bits in computer words and emulates the calculation of scores by a series of logic operations. Bit-parallelism has previously been applied to other pattern matching problems, producing fast algorithms. In timed tests, we show that BitPAl runs 7 - 25 times faster than a standard iterative algorithm. The second part involves two approaches to alignment with substitution scoring, which assigns a potentially different substitution weight to every pair of alphabet characters, better representing the relative rates of different mutations. The first approach extends the existing BitPAl method. The second approach is a new SIMD algorithm that uses partial sums of adjacent score differences. I present a simple partial sum method as well as one that uses parallel scan for additional acceleration. Results demonstrate that these algorithms are significantly faster than existing SIMD dynamic programming algorithms. Finally, I describe two extensions to the partial sums algorithm. The first adds support for affine gap penalty scoring. Affine gap scoring represents the biological likelihood that it is more likely for gaps to be continuous than to be distributed throughout a region by introducing a gap opening penalty and a gap extension penalty. The second extension is an algorithm that uses the partial sums method to calculate the tandem alignment of a pattern against a text sequence using a single pattern copy. Next generation sequencing data provides a wealth of information to researchers. Extracting that information in a timely manner increases the utility and practicality of sequence analysis algorithms. This thesis presents a family of algorithms which provide alignment scores in less time than previous algorithms.

This thesis explores the use of an ASIP for handling O-RAN control data. A model application was constructed, optimized and profiled on a simple RV32-IMC core. The compiled code was analyzed, and the instructions “byte swap”, “pack”, bitwise extract/deposit” and “bit field place” were implemented. Synthesis of the core, and profiling of the model application, was done with and without each added instruction. Byte swap had the largest impact on performance (14% improvement per section, and 100% per section extension), followed by bitwise extract/deposit (10% improvement per section but no impact on section extensions). Pack and bit field place had no impact on performance. All instructions had negligible impact on core size, except for bitwise extract/deposit, which increased size by 16%. Further studies, with respect to both overall architecture and further evaluation of instructions to implement, would be necessary to design an ideal ASIP for the application.