Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Engineering
Efficient Convolvers Using The Polynomial Residue Number System Technique, Surendar Paruchuri
Efficient Convolvers Using The Polynomial Residue Number System Technique, Surendar Paruchuri
LSU Master's Theses
The problem of computing linear convolution is a very important one because with linear convolution we can mechanize digital filtering. The linear convolution of two N-point sequences can be computed by the cyclic convolution of the following 2N-point sequences. The original sequence padded with N zero’s each. The cyclic convolution of two N-point sequences requires multiplications and additions for its computation. A very efficient way of computing cyclic convolution of two sequences is by using the Polynomial Residue Number System (PRNS) technique. Using this technique the cyclic convolution of two N-point sequences can be computed using only N multiplications instead …
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
LSU Master's Theses
In this thesis, we study several well-motivated variants of the Traveling Salesman Problem (TSP). First, we consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a Polynomial Time Approximation Scheme (PTAS) for …
Computing Moments Of A Binary Horizontally/Vertically Convex Image Using Run-Time Reconfiguration, Cheowway Neoh
Computing Moments Of A Binary Horizontally/Vertically Convex Image Using Run-Time Reconfiguration, Cheowway Neoh
LSU Master's Theses
In this thesis, we present a design for computing moments of a binary horizontally/vertically convex image on an FPGA chip, using run-time reconfiguration. We compute the moments of up to third order for a total of 16 moments. We address how run-time reconfiguration speeds up moment computations without taking up huge hardware resources. Since we are considering a binary horizontally/vertically convex image, we look at an alternative method in moment computations that utilizes constant coefficient multipliers. We divide the image into segments and process one segment at a time. We reconfigure the constant coefficient multipliers before processing the next segment. …
Ternary And Quaternary Logic To Binary Bit Conversion Cmos Integrated Circuit Design Using Multiple Input Floating Gate Mosfets, Harish N. Venkata
Ternary And Quaternary Logic To Binary Bit Conversion Cmos Integrated Circuit Design Using Multiple Input Floating Gate Mosfets, Harish N. Venkata
LSU Master's Theses
Multiple-input floating gate MOSFETs and floating gate potential diagrams have been used for conversion of ternary-valued input and quaternary-valued input into corresponding binary-valued output in CMOS integrated circuit design environment. The method is demonstrated through the design of a circuit for conversion of ternary inputs 00 to -1-1 (decimal 0 to -4) and 00 to 11 (decimal 0 to +4) into the corresponding binary bits and for conversion of quaternary inputs (decimal 0 to 3) into the corresponding binary bits (binary 00 to 11) in a standard 1.5 mm digital CMOS technology. The physical design of the circuits is simulated …
Wavelength Assignment In All-Optical Networks For Mesh Topologies, Prabhulaiah Bijja
Wavelength Assignment In All-Optical Networks For Mesh Topologies, Prabhulaiah Bijja
LSU Master's Theses
All-Optical Networks employing Dense Wavelength Division Multiplexing (DWDM) are believed to be the next generation networks that can meet the ever-increasing demand for bandwidth of the end users. This thesis presents some new heuristics for wavelength assignment and converter placement in mesh topologies. Our heuristics try to assign the wavelengths in an efficient manner that results in very low blocking probability. We propose novel static and dynamic assignment schemes that outperform the assignments reported in the literature even when converters are used. The proposed on-line scheme called "Round-Robin" assignment outperforms previously proposed strategies such as first-fit and random assignment schemes. …