• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 221
  • 80
  • 36
  • 26
  • 26
  • 10
  • 9
  • 9
  • 7
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 519
  • 161
  • 151
  • 70
  • 57
  • 52
  • 44
  • 43
  • 40
  • 37
  • 37
  • 37
  • 36
  • 35
  • 34
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
221

Functional Verification of Arithmetic Circuits using Linear Algebra Methods

Ameer Abdul Kader, Mohamed Basith Abdul 01 January 2011 (has links) (PDF)
This thesis describes an efficient method for speeding up functional verification of arithmetic circuits namely linear network such as wallace trees, counters using linear algebra techniques. The circuit is represented as a network of half adders, full adders and inverters, and modeled as a system of linear equations. The proof of functional correctness of the design is obtained by computing its algebraic signature using standard linear programming (LP) solver and comparing it with the reference signature provided by the designer. Initial experimental results and comparison with Satisfiability Modulo Theorem (SMT) solvers show that the method is efficient, scalable and applicable to complex arithmetic designs, including large multipliers. It is intended to provide a new front end theory/engine to enhance SMT solvers.
222

Electroplating and Machining of Silicon Carbide Wafers

Thompson, Madeline Beth 14 August 2023 (has links) (PDF)
Silicon carbide has many properties that make it a promising and desirable material for diverse applications. One such application for silicon carbide wafers is as a transparent cryogenic probe card. This thesis briefly describes the design of a probe card based on a silicon carbide wafer substrate. It includes a description of electroplating fundamentals and demonstrates the feasibility of electroplating copper onto a wafer for the formation of bond pads between the substrate and external PCB ring. The process for electroplating copper with good adhesion and quality based on metal alloy formation, current control, and materials selection is outlined. Results of this process are also presented. This work also demonstrates the ability to machine silicon carbide using electrical discharge machining, abrasive water jet machining, and diamond bit milling, proving diamond grinding to be the most versatile of the described methods for machining intricate patterns into the wafers.
223

Binary Codes for Enhancing the Most Significant Bit-Based Selective Encryption

Kafi, Mehrshad January 2022 (has links)
Selective encryption (SE) methods for images often encrypt the sign bits, i.e., the most significant bits (MSBs) of the codewords corresponding to key syntax elements (in compressed images) or to pixel intensities (for uncompressed images). Our work is motivated by the key observation that the binary code (BC) used for these representations has an impact on the quality of the reconstruction at the eavesdropper (Eve), which can be regarded as a measure of the degree of security of the encryption (the lower the quality, the higher the level of security). Therefore, we address the design of BCs that enhance the security of MSB-based SE by increasing the degradation at Eve’s side when she uses a simple replacement attack (replacing all MSBs either by 0s or by 1s). We first consider the scenario of fixed-length BCs, i.e., where all the codewords have the same length. We formulate the design problem as an optimization problem with the objective of maximizing the distortion at Eve’s without any constraint or with a constraint on the entropy of the MSBs in order to shorten the size of the MSB stream to reduce the computational overhead of encryption. We show that the problem can be cast as a binary integer linear program equivalent to a weighted non-bipartite graph matching problem, for which polynomial-time solution algorithms exist. We empirically assess the performance of the optimized BCs on a Mixed Gaussian source, as well as on Gaussian and Laplacian sources, the latter two being commonly used to model the distribution of transform coefficients and prediction residuals. Our experiments lead to the conclusion that MSB-based SE schemes could benefit from the proposed BC designs. For the case of uncompressed images, we also propose a family of structured BCs for the pixel intensity values. These BCs are constructed such that intensity values that are close have reconstructions that are far apart. As a result, the reconstruction with the replacement attack significantly destroys the smooth areas and blurs the edges, therefore increasing the degree of security. Next, we focus on the construction of variable-length BCs for the non-zero quantized AC coefficients in JPEG compressed images. For this, we first formulate the BC design problem as the problem of maximizing the distortion at Eve’s side with a constraint on the entropy. This problem can also be cast as a weighted non-bipartite graph matching problem and, therefore, can be solved efficiently. Furthermore, by gaining insights from the optimization results, a simpler and faster method for BC design is devised, which consists of only swapping a few codewords in the original code used in JPEG. We assess the practical performance of the proposed BCs for the SE method of JPEG images that encrypts only the MSBs of the non-zero quantized AC coefficients, along with the full encryption of the DC coefficients. Our experimental results show that high visual security can be achieved with only a small sacrifice in compression efficiency. In addition, the proposed BCs can be tuned to achieve various levels of degradation at Eve’s side, a property that is convenient for certain applications. / Thesis / Doctor of Philosophy (PhD)
224

Performance Evaluation of LoRa networks for Air-to-Ground Communications

Khorsandi, Kiana, Jalalizad, Sareh January 2023 (has links)
The current focus on the Internet of Things (IoT) has led to the emergence of many network scenarios with unlimited use cases, including smart homes, smart cities, smart agriculture, and more. Unmanned aerial vehicles (UAVs), also known as drones, have become increasingly popular due to their versatility and ability to collect and transmit data through various sensors and cameras. With real-time data transmission, autonomy, and cost-effectiveness, UAVs have become valuable tools for different applications, including disaster management, agriculture monitoring, and remote area control. Low-power wide-area network (LPWAN) technology plays a crucial role in enabling IoT, and LoRaWAN is one of the specific LPWAN communication technologies that can provide low power consumption and coverage over a wide range. During a catastrophe, wireless communication is critical for analyzing damaged regions, coordinating rescue and relief team actions, saving lives, and reducing economic losses. UAVs can partially replace damaged or overloaded wireless networks as an alternative wireless network provider. This thesis aimed to simulate a LoRa network and investigate the relationship between the UAV coverage radius and elevation angle, as well as the effect of multipath distortion and signal attenuation on UAV and user distance. By calculating signal-to-noise ratio (SNR) and bit error rate (BER) for LoRa in a line-of-sight (LoS) and non-line-of-sight (NLoS) environment, we provided a comprehensive analysis of LoRaWAN performance in real-life environments for long distances. The results indicate that LoRaWAN communication is reliable in various environments, making it a promising technology for emergency and medical communications. / Det nuvarande fokuset på Internet of Things (IoT) har lett till uppkomsten av många nätverksscenarier med obegränsade användningsfall, inklusive smarta hem, smarta städer, smart jordbruk och mer. Obemannade flygfarkoster (UAV), även kända som drönare, har blivit allt populärare på grund av deras mångsidighet och förmåga att samla in och överföra data genom olika sensorer och kameror. Med realtidsdataöverföring, autonomi och kostnadseffektivitet har UAVs blivit värdefulla verktyg för olika applikationer, inklusive katastrofhantering, jordbruksövervakning och fjärrkontroll av områden. Low-power wide-area network (LPWAN)-teknik spelar en avgörande roll för att möjliggöra IoT, och LoRaWAN är en av de specifika LPWAN-kommunikationsteknikerna som kan ge låg strömförbrukning och täckning över ett brett spektrum. Under en katastrof är trådlös kommunikation avgörande för att analysera skadade regioner, koordinera räddnings- och hjälpteams åtgärder, rädda liv och minska ekonomiska förluster. UAV:er kan delvis ersätta skadade eller överbelastade trådlösa nätverk som en alternativ leverantör av trådlöst nätverk. Detta examensarbete syftade till att simulera ett LoRa-nätverk och undersöka sambandet mellan UAV-täckningsradien och höjdvinkeln, såväl som effekten av flervägsdistorsion och signaldämpning på UAV och användaravstånd. Genom att beräkna signal-brusförhållande (SNR) och bitfelsfrekvens (BER) för LoRa i en siktlinje (LoS) och icke-siktlinje (NLoS) miljö, gav vi en omfattande analys av LoRaWAN prestanda i verkliga miljöer för långa avstånd. Resultaten indikerar att LoRaWAN-kommunikation är tillförlitlig i olika miljöer, vilket gör den till en lovande teknik för akut- och medicinsk kommunikation.
225

Noise cancellation for compact MIMO systems

Abdulkhaleq, Ahmed M., Ali, N.T., Abd-Alhameed, Raed, Sayidmarie, Khalil H., See, Chan H., Noras, James M., Excell, Peter S. January 2013 (has links)
No / A proposed method for cancelling or reducing the effect of the transmitted power within the transceiver MIMO unit is investigated and discussed using a feedback signal process between the elements. Several parameters including the level of feedback power mismatch, the transmitted power and the received power are considered in this work to test the performance of the system in term of the bit error rate (BER) versus signal to noise ratio (SNR). A new software programme using MATLAB is implemented to evaluate the proposed method. The results showed that the performances of the system are heavily dependent on the amount of the transmitted power, the received power, and the mismatch in the feedback component.
226

Testability insertion in bit-slice data path designs: A pseudo-exhaustive BIST approach

Soomro, Rahman Abdul January 1994 (has links)
No description available.
227

A Bloch Sphere Animation Software using a Three Dimensional Java Simulator

Huo, Changming January 2009 (has links)
No description available.
228

Hardware encryption of AES algorithm on Android platform

Joshi, Yogesh 08 October 2012 (has links)
No description available.
229

Adaptive Data Rate Multicarrier Direct Sequence Spread Spectrum in Rayleigh Fading Channel

Mannem, Narender Reddy 20 October 2005 (has links)
No description available.
230

Design of Minimum BER Linear Space-Time Block Codes for MIMO Systems Equipped with Zero-Forcing Equalizer{Correlated Channels

Wang, Lisha 10 1900 (has links)
<p>In this thesis, we consider a coherent MIMO system, emphasizing on the simplicity of implementation at both the code generator and the receiver. Specifically, we consider the transmission of a space-time block code (STBC) that is a linear combination of coding matrices weighted by the information symbols through a receiver-correlated flat-fading channel and received by a linear ZF detector. Our target is the design of a code which, while maintaining full data-transmission rate, minimizes the asymptotic average (over all the random channel coefficients) bit error probability of an ZF detector. To this end, we first ensure that the full data rate of symbols is maintained, and then, based on the BER for 4-QAM signals, we derive the conditions for optimal codes and establish a code structure that minimizes the asymptotic average bit error probability. We also prove that the diversity gain of our M × N MIMO system is N − M + 1. The resulting optimum code structure requires the individual coding matrices to be mutually orthogonal when vectorized and is related to covariance matrix of correlated channel. The first optimum structural characteristics of the coding matrices is described as trace-orthogonal. A new approach to express expected value of random correlated channel has been proposed as well. From simulation results we can see that advantage of optimum code over uncoded system is more apparent as channel correlation is higher.</p> / Master of Applied Science (MASc)

Page generated in 0.0262 seconds