Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Moving And Stationary Target Acquisition Radar Image Enhancement Through Polynomial Windows, Rajarajeswari Devarajulu
Moving And Stationary Target Acquisition Radar Image Enhancement Through Polynomial Windows, Rajarajeswari Devarajulu
Theses and Dissertations - UTB/UTPA
The Fourier transform involved in synthetic aperture radar (SAR) imaging causes undesired sidelobes which obscure weak backscatters and affect the image clarity. These sidelobes can be suppressed without deteriorating the image resolution by smoothing functions known as windowing or apodization. Recently, the theory of orthogonal polynomials has gained considerable attention in signal processing applications. The window functions that are derived from the orthogonal polynomials have interesting sidelobe roll-off properties for better sidelobe apodization, hence it can be used for radar image enhancement. In this work, a new window is constructed from Jacobi orthogonal polynomials and its performance in SAR imaging …
Design And Performance Evaluation Of Switching Architectures For High-Speed Internet, Alvaro Munoz
Design And Performance Evaluation Of Switching Architectures For High-Speed Internet, Alvaro Munoz
Theses and Dissertations - UTB/UTPA
The motivation for this thesis is the desire to build faster and scalable routers that efficiently handle the exponential traffic growth in the Internet. The Internet forwards information through a mesh of routers and switches, which has to keep up with the increasing demands of traffic. Shared-memory based switches are known to provide the best throughput-delay performance for a given memory size. In this thesis performance of commonly used memory-sharing schemes for the shared memory switches are evaluated under balanced and unbalanced bursty traffic. The scalability of shared-memory switches has been a research issue for quite sometime. One approach is …
A Study For Branch Predictors To Alleviate The Aliasing Problem, Tieling Xie, Robert Evans, Yul Chu
A Study For Branch Predictors To Alleviate The Aliasing Problem, Tieling Xie, Robert Evans, Yul Chu
Electrical and Computer Engineering Faculty Publications and Presentations
Modern processors usually have a deep pipeline, superscalar architecture to obtain higher performance. As pipelines are getting deeper, accurate branch prediction is critical to achieve high performance, since fetched instructions after a branch have to be flushed from inside the pipeline when the prediction is wrong. This paper studies the performance of several types of branch predictors, starting from local branch predictor and global branch predictor. Simulation results show that the global history predictor outperforms the local history predictor due to the characteristic that branches tend to be correlated. However, the global history predictor still suffers an aliasing problem that …
An Enhanced Dynamic Packet Buffer Management, Vinod Rajan, Yul Chu
An Enhanced Dynamic Packet Buffer Management, Vinod Rajan, Yul Chu
Electrical and Computer Engineering Faculty Publications and Presentations
A packet buffer for a protocol processor is a large shared memory space that holds incoming data packets in a computer network. This paper investigates four packet buffer management algorithms for a protocol processor including dynamic algorithm with different thresholds (DADT), which is proposed to reduce the packet loss ratio efficiently. The proposed algorithm takes the advantage of different packet sizes for each application by allocating buffer space for each queue proportionally. According to our simulation results, the DADT algorithm works well in reducing packet loss ratio compared to other three algorithms.