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
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/37132 |
| Date | 29 April 1992 |
| Creators | Myers, Timothy F. |
| Contributors | Magana, Mario E. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0019 seconds