Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithms (1)
- All-optical networks (1)
- Arch-like inductor (1)
- Channel equalization (1)
- Compiler optimization (1)
-
- Convex images (1)
- Dome-shaped inductor (1)
- Embedded systems (1)
- Filterbank transceivers (1)
- Floating gate potential diagrams (1)
- Hamilton-jacobi equations (1)
- Harmonic distortion (1)
- Harmonic filters (1)
- High frequency (1)
- Inductor (1)
- Kalman filter (1)
- Left inverses (1)
- Memory optimization (1)
- Mems (1)
- Mesh topology (1)
- Micromachining (1)
- Minimum mean-squared-error (1)
- Moments (1)
- Multi-valued logic (1)
- Multiple input floating gate MOSFETs (1)
- Multirate transmultiplexers (1)
- Nonlinear h-infinity control (1)
- Nonlinear systems (1)
- On-chip (1)
- Online (1)
Articles 1 - 10 of 10
Full-Text Articles in Engineering
Optimal Channel Equalization For Filterbank Transceivers In Presence Of White Noise, Ehab Farouk Badran
Optimal Channel Equalization For Filterbank Transceivers In Presence Of White Noise, Ehab Farouk Badran
LSU Doctoral Dissertations
Filterbank transceivers are widely employed in data communication networks to cope with inter-symbol-interference (ISI) through the use of redundancies. This dissertation studies the design of the optimal channel equalizer for both time-invariant and time-varying channels, and wide-sense stationary (WSS) and possible non-stationary white noise processes. Channel equalization is investigated via the filterbank transceivers approach. All perfect reconstruction (PR) or zero-forcing (ZF) receiver filterbanks are parameterized in an affine form, which eliminate completely the ISI. The optimal channel equalizer is designed through minimization of the mean-squared-error (MSE) between the detected signals and the transmitted signals. Our main results show that the …
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 …
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. …
Three-Dimensional Micromachined On-Chip Inductors For High Frequency Applications, Nimit Chomnawang
Three-Dimensional Micromachined On-Chip Inductors For High Frequency Applications, Nimit Chomnawang
LSU Doctoral Dissertations
Demands for wireless communication are ever-escalating for consumer and military communication applications. The requirements of portability, more functionality and lower cost have been driving forces toward smaller, more sophisticated and flexible wireless devices with lower power consumption. To meet these requirements, monolithically integrated passive inductors with high Q-factors and high self-resonant frequencies are desirable. Q-factor and self-resonant frequency of an inductor are significantly degraded at high frequencies due to conductor ohmic loss, magnetically induced eddy current in the conductive substrate, and lower self-resonant frequency from capacitance between conductive substrate and conductors.
In this dissertation, novel three-dimensional arch-like solenoid and dome-shaped …
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 …
A Factorization Approach For Solving The Hamilton-Jacobi Equations In Nonlinear Optimal Control, Mohammad Dikko Aliyu
A Factorization Approach For Solving The Hamilton-Jacobi Equations In Nonlinear Optimal Control, Mohammad Dikko Aliyu
LSU Doctoral Dissertations
The Hamilton-Jacobi equation (HJE) arose early in the last century in the study of the calculus of variation, classical mechanics and Hamiltonian systems. Recently, there has been a renewed interest in HJEs arising in various analysis and synthesis problems in systems theory. The HJE despite providing a necessary and sufficient condition for an optimal control, is very difficult to solve for general nonlinear systems, and therefore its application remained limited to linear systems. Yet, the HJE has been studied extensively in the literature from diverse areas of science and engineering, varying from mathematical physics, to mechanics, control theory, and to …
Memory Optimization Techniques For Embedded Systems, Jinpyo Hong
Memory Optimization Techniques For Embedded Systems, Jinpyo Hong
LSU Doctoral Dissertations
Embedded systems have become ubiquitous and as a result optimization of the design and performance of programs that run on these systems have continued to remain as significant challenges to the computer systems research community. This dissertation addresses several key problems in the optimization of programs for embedded systems which include digital signal processors as the core processor. Chapter 2 develops an efficient and effective algorithm to construct a worm partition graph by finding a longest worm at the moment and maintaining the legality of scheduling. Proper assignment of offsets to variables in embedded DSPs plays a key role in …
Improvement Of Resonant Harmonic Filter Effectiveness In The Presence Of Distribution Voltage Distortion, Herbert L. Ginn
Improvement Of Resonant Harmonic Filter Effectiveness In The Presence Of Distribution Voltage Distortion, Herbert L. Ginn
LSU Doctoral Dissertations
Resonant harmonic filters (RHFs), are the most common devices installed in distribution systems for reducing distortion caused by harmonic generating loads. When such filters are applied in systems with a distorted distribution voltage their effectiveness may decline drastically. This dissertation explores the causes of degradation of RHFs effectiveness and suggests methods of their improvement both by optimization algorithms and by modification of the filter structure. An optimization based design method is developed for the conventional RHF. It takes into consideration the interaction of the filter with the distribution system and provides a filter which gives the maximum effectiveness with respect …
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 …