Performance bounds for LPI communications
R.P. Higgins · 2002
Evaluation of the theoretical lower bound on signal-to-noise ratio for a spread spectrum system is provided. The bound is based on Shannon's sphere packing bound and is evaluated for a finite probability of error and coding complexity. Coding delay, which is the time from when the first information bit enters the encoder to when the first information bit leaves the decoder is used as a measure of the complexity of the code. This provides a tighter bound on performance for a real system than the capacity theorem which assumes an arbitrarily low error rate and infinite coding complexity.>