• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A derivation of the probability distribution function of the output of a square-law detector operating in a jamming environment

Jordan, Ramiro January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries
2

Proposed implementation of a near-far resistant multiuser detector without matrix inversion using Delta-Sigma modulation

Myers, Timothy F. 29 April 1992 (has links)
A new algorithm is proposed which provides a sub-optimum near-far resistant pattern for correlation with a known signal in a spread-spectrum multiple access environment with additive white gaussian noise (AWGN). Only the patterns and respective delays of the K-1 interfering users are required. The technique does not require the inversion of a cross-correlation matrix. The technique can be easily extended to as many users as desired using a simple recursion equation. The computational complexity is O(K²) for each user to be decoded. It is shown that this method provides the same results as the "one-shot" method proposed by Verdu and Lupas. Also shown is a new array architecture for implementing this new solution using delta-sigma modulation and a correlator for non-binary patterns that takes advantage of the digitized Al: signals. Simulation results are presented which show the algorithm and correlator to be implementable in VLSI technology. This approach allows processing of the received signal in real-time with a delay of O(.K) bit periods per user. A modification of the algorithm is examined which allows further reduction of complexity at the expense of reduced performance. / Graduation date: 1992

Page generated in 0.16 seconds