A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints

Pulse design is critical for impulse radio communications, as it determines the transmission efficiency with respect to regulation spectral limits. In this paper, we propose the design of several novel pulse shapes relying on combinations of Gaussian derivatives with the target of improving the spectral efficiency. A general model for maximizing the efficiency of dual and triplet couplings is presented, employing the interior point global optimization algorithm. Then, the spectrum peak frequency is derived in closed form for any combination of two Gaussians with consecutive orders of derivation. The parameters controlling the time properties of the generated waveforms have been adequately adjusted to reach the best compliance with the spectral mask. Novel pulses have been investigated providing a high efficiency using simple generation mechanisms, which can be practically implemented via analog circuits. Results demonstrated the advantage of the proposed pulse shapes in terms of the bit error rate performance for 2 Gbps OOK and 1 Gbps PPM in AWGN and multipath channels.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints

Cited by 2 publications

References 37 publications

A polynomial time infeasible interior-point arc-search algorithm for convex optimization

A polynomial time infeasible interior-point arc-search algorithm for convex optimization

Spectrally efficient IR-UWB pulse designs based on linear combinations of Gaussian Derivatives

Contact Info

Product

Resources

About