Multiplicative mismatched filters for optimum range sidelobe suppression in Barker code reception
First Claim
1. A mismatched filter for systems that employ Barker codes as pulse compression codes, the said filter being a sidelobe suppression filter in cascade with a matched filter matched to the code of interest;
- the sidelobe suppression filter being based on a multiplicative expansion, approximation and parameterization of the transfer function of the inverse filter 1/R(z) where R(z) denotes the matched filter output in the z-domain. The parameters introduced in the said mismatched filter transfer function are optimized for the particular Barker code and the number of terms used in the multiplicative expansion.
0 Assignments
0 Petitions
Accused Products
Abstract
Very efficient sidelobe suppression of Barker codes is achieved through the use of a mismatched filter, which is comprised of a conventional matched filter cascaded with a computationally efficient filter based on multiplicative expansion. Several constant parameters are introduced in the terms of the expansion and are optimized to improve the performance of the filter. Optimized mismatched filters for length 13, 11, 7 and 5 Barker codes are presented. For each of these codes, filters with one, two and three stages are studied. The technique is extended to compound Barker codes based on their representation in a factored form in the z-domain. Hardware requirements for the filters discussed in the disclosure are also presented.
88 Citations
3 Claims
-
1. A mismatched filter for systems that employ Barker codes as pulse compression codes, the said filter being a sidelobe suppression filter in cascade with a matched filter matched to the code of interest;
- the sidelobe suppression filter being based on a multiplicative expansion, approximation and parameterization of the transfer function of the inverse filter 1/R(z) where R(z) denotes the matched filter output in the z-domain. The parameters introduced in the said mismatched filter transfer function are optimized for the particular Barker code and the number of terms used in the multiplicative expansion.
- View Dependent Claims (2, 3)
Specification