Search for dissertations about: "Random array"
Showing result 1 - 5 of 41 swedish dissertations containing the words Random array.
-
1. Antenna array mapping for DOA estimation in radio signal reconnaissance
Abstract : To counter radio signal reconnaissance, an efficient way of covert communication is to use subsecond duration burst transmissions in the congested HF band. Against this background, the present thesis treats fast direction finding (DF) using antenna arrays with known response only in a few calibration directions. READ MORE
-
2. Sparse Array Architectures for Wireless Communication and Radar Applications
Abstract : This thesis focuses on sparse array architectures for the next generation of wireless communication, known as fifth-generation (5G), and automotive radar direction-of-arrival (DOA) estimation. For both applications, array spatial resolution plays a critical role to better distinguish multiple users/sources. READ MORE
-
3. Antenna Designs Aiming at the Next Generation of Wireless Communication
Abstract : Millimeter-wave (mm-wave) frequencies have drawn large attention, specically for the fifth generation (5G) of wireless communication, due to their capability to provide high data-rates. However, design and characterization of the antenna system in wireless communication will face new challenges when we move up to higher frequency bands. READ MORE
-
4. Readout Strategies for Biomolecular Analyses
Abstract : This thesis describes three readout formats for molecular analyses. A common feature in all works is probing techniques that upon specific target recognition ideally results in equimolar amounts of DNA circles. These are then specifically amplified and detected using any of the techniques presented herein. READ MORE
-
5. Split Trees, Cuttings and Explosions
Abstract : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. READ MORE