A Vehicle-collision Learning System Using Driving Patterns on the Road (open access)

A Vehicle-collision Learning System Using Driving Patterns on the Road

Demand of automobiles are significantly growing despite various factors, steadily increasing the average number of vehicles on the road. Increase in the number of vehicles, subsequently increases the risk of collisions, characterized by the driving behavior. Driving behavior is influenced by factors like class of vehicle, road condition and vehicle maneuvering by the driver. Rapidly growing mobile technology and use of smartphones embedded with in-built sensors, provides scope of constant development of assistance systems considering the safety of the driver by integrating with the information obtained from the vehicle on-board sensors. Our research aims at learning a vehicle system comprising of vehicle, human and road by employing driving patterns obtained from the sensor data to develop better systems of safety and alerts altogether. The thesis focusses on utilizing together various data recorded by the in-built embedded sensors in a smartphone to understand the vehicle motion and dynamics, followed by studying various impacts of collision events, types and signatures which can potentially be integrated in a prototype framework to detect variations, alert drivers and emergency responders in an event of collision.
Date: August 2013
Creator: Urs, Chaitra Vijaygopalraj
System: The UNT Digital Library
Effective and Accelerated Informative Frame Filtering in Colonoscopy Videos Using Graphic Processing Units (open access)

Effective and Accelerated Informative Frame Filtering in Colonoscopy Videos Using Graphic Processing Units

Colonoscopy is an endoscopic technique that allows a physician to inspect the mucosa of the human colon. Previous methods and software solutions to detect informative frames in a colonoscopy video (a process called informative frame filtering or IFF) have been hugely ineffective in (1) covering the proper definition of an informative frame in the broadest sense and (2) striking an optimal balance between accuracy and speed of classification in both real-time and non real-time medical procedures. In my thesis, I propose a more effective method and faster software solutions for IFF which is more effective due to the introduction of a heuristic algorithm (derived from experimental analysis of typical colon features) for classification. It contributed to a 5-10% boost in various performance metrics for IFF. The software modules are faster due to the incorporation of sophisticated parallel-processing oriented coding techniques on modern microprocessors. Two IFF modules were created, one for post-procedure and the other for real-time. Code optimizations through NVIDIA CUDA for GPU processing and/or CPU multi-threading concepts embedded in two significant microprocessor design philosophies (multi-core design and many-core design) resulted a 5-fold acceleration for the post-procedure module and a 40-fold acceleration for the real-time module. Some innovative software modules, …
Date: August 2010
Creator: Karri, Venkata Praveen
System: The UNT Digital Library
FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field (open access)

FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. Tate pairing is a bilinear map used in identity based cryptography schemes. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. Similarly, Tate pairing is also quite computationally expensive. Therefore, it is more attractive to implement the ECC and Tate pairing using hardware than using software. The bases of both ECC and Tate pairing are Galois field arithmetic units. In this thesis, I propose the FPGA implementations of the elliptic curve point multiplication in GF (2283) as well as Tate pairing computation on supersingular elliptic curve in GF (2283). I have designed and synthesized the elliptic curve point multiplication and Tate pairing module using Xilinx's FPGA, as well as synthesized all the Galois arithmetic units used in the designs. Experimental results demonstrate that the FPGA implementation can speedup the elliptic curve point multiplication by 31.6 times compared to software based implementation. The results also demonstrate that the FPGA implementation can speedup the Tate pairing computation by 152 times compared to software based implementation.
Date: August 2007
Creator: Huang, Jian
System: The UNT Digital Library
VLSI Architecture and FPGA Prototyping of a Secure Digital Camera for Biometric Application (open access)

VLSI Architecture and FPGA Prototyping of a Secure Digital Camera for Biometric Application

This thesis presents a secure digital camera (SDC) that inserts biometric data into images found in forms of identification such as the newly proposed electronic passport. However, putting biometric data in passports makes the data vulnerable for theft, causing privacy related issues. An effective solution to combating unauthorized access such as skimming (obtaining data from the passport's owner who did not willingly submit the data) or eavesdropping (intercepting information as it moves from the chip to the reader) could be judicious use of watermarking and encryption at the source end of the biometric process in hardware like digital camera or scanners etc. To address such issues, a novel approach and its architecture in the framework of a digital camera, conceptualized as an SDC is presented. The SDC inserts biometric data into passport image with the aid of watermarking and encryption processes. The VLSI (very large scale integration) architecture of the functional units of the SDC such as watermarking and encryption unit is presented. The result of the hardware implementation of Rijndael advanced encryption standard (AES) and a discrete cosine transform (DCT) based visible and invisible watermarking algorithm is presented. The prototype chip can carry out simultaneous encryption and watermarking, which …
Date: August 2006
Creator: Adamo, Oluwayomi Bamidele
System: The UNT Digital Library
Effects of UE Speed on MIMO Channel Capacity in LTE (open access)

Effects of UE Speed on MIMO Channel Capacity in LTE

With the introduction of 4G LTE, multiple new technologies were introduced. MIMO is one of the important technologies introduced with fourth generation. The main MIMO modes used in LTE are open loop and closed loop spatial multiplexing modes. This thesis develops an algorithm to calculate the threshold values of UE speed and SNR that is required to implement a switching algorithm which can switch between different MIMO modes for a UE based on the speed and channel conditions (CSI). Specifically, this thesis provides the values of UE speed and SNR at which we can get better results by switching between open loop and closed loop MIMO modes and then be scheduled in sub-channels accordingly. Thus, the results can be used effectively to get better channel capacity with less ISI. The main objectives of this thesis are: to determine the type of MIMO mode suitable for a UE with certain speed, to determine the effects of SNR on selection of MIMO modes, and to design and implement a scheduling algorithm to enhance channel capacity.
Date: August 2016
Creator: Shukla, Rahul
System: The UNT Digital Library
FPGA Implementation of Low Density Party Check Codes Decoder (open access)

FPGA Implementation of Low Density Party Check Codes Decoder

Reliable communication over the noisy channel has become one of the major concerns in the field of digital wireless communications. The low density parity check codes (LDPC) has gained lot of attention recently because of their excellent error-correcting capacity. It was first proposed by Robert G. Gallager in 1960. LDPC codes belong to the class of linear block codes. Near capacity performance is achievable on a large collection of data transmission and storage.In my thesis I have focused on hardware implementation of (3, 6) - regular LDPC codes. A fully parallel decoder will require too high complexity of hardware realization. Partly parallel decoder has the advantage of effective compromise between decoding throughput and high hardware complexity. The decoding of the codeword follows the belief propagation alias probability propagation algorithm in log domain. A 9216 bit, (3, 6) regular LDPC code with code rate ½ was implemented on FPGA targeting Xilinx Virtex 4 XC4VLX80 device with package FF1148. This decoder achieves a maximum throughput of 82 Mbps. The entire model was designed in VHDL in the Xilinx ISE 9.2 environment.
Date: August 2009
Creator: Vijayakumar, Suresh
System: The UNT Digital Library