Orthogonal pulse shape design via semidefinite programming

In digital communications, orthogonal pulse shapes are often used to represent message symbols for transmission through a channel. The design of such pulse shapes is formulated as a convex semidefinite programming problem, from which a globally optimal pulse shape can be efficiently found using interior point methods. The formulation is used to design filters which achieve the minimal bandwidth for a given filter length, and the minimal filter length for a given bandwidth. The effectiveness of the method is demonstrated by the design of waveforms with substantially improved performance over the 'chip' waveforms specified in the standards for digital mobile telecommunications.

[1]  Brian D. O. Anderson,et al.  Recursive algorithm for spectral factorization , 1974 .

[2]  Stephen P. Boyd,et al.  FIR Filter Design via Spectral Factorization and Convex Optimization , 1999 .

[3]  Stephen P. Boyd,et al.  FIR filter design via semidefinite programming and spectral factorization , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[4]  P. P. Vaidyanathan,et al.  Globally optimal two channel FIR orthonormal filter banks adapted to the input signal statistics , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[5]  John B. Anderson,et al.  Bandwidth-Efficient Coded Modulation with Optimized Linear Partial-Response Signals , 1998, IEEE Trans. Inf. Theory.