Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

Ultra-Wideband (Uwb) Communications: New Paradigms And Opportunities, Robert H. Morelos-Zaragoza Mar 2004

Ultra-Wideband (Uwb) Communications: New Paradigms And Opportunities, Robert H. Morelos-Zaragoza

Robert Henry Morelos-Zaragoza

In this talk, the unique characteristics of ultra wideband (UWB) communications systems are introduced. Receiver design considerations are presented. Focus is on the relation between the symbol duration and the delay spread of the channel. This determines whether the receiver should use a Rake receiver (Spread-spectrum system) or an equalizer (multiple carrier or OFDM system).


A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar Jan 2004

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.