Abstract

The performance of robust metrics (metrics that can be computed from the outputs of the matched filters only) with convolutional coding and diversity under worst-case partial-band noise jamming is analyzed. Both binary and dual-k convolutional codes employing these metrics with diversity are compared via Union-Chernoff bounds. The performances of metrics considered in the literature that assume perfect side-information are given for comparison purposes. It is found that there exist very good robust metrics that provide performance comparable to metrics using perfect side-information. Among the robust metrics considered, the self-normalized metric offers the best performance and achieves performance practically identical to that of the square-law-combining metric with perfect side-information for M=8. >

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call