By Topic

Optimization of signal sets for partial-response channels. I. Numerical techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Honig, M.L. ; Bellcore, Morristown, NJ, USA ; Steiglitz, K. ; Norman, S.A.

Given a linear, time-invariant, discrete-time channel, the problem of constructing N input signals of finite length K that maximize minimum l2 distance between pairs of outputs is considered. Two constraints on the input signals are considered: a power constraint on each of the N inputs (hard constraint) and an average power constraint over the entire set of inputs (soft constraint). The hard constraint, problem is equivalent to packing N points in an ellipsoid in min(K,N-1) dimensions to maximize the minimum Euclidean distance between pairs of points. Gradient-based numerical algorithms and a constructive technique based on dense lattices are used to find locally optimal solutions to the preceding signal design problems. Two numerical examples are shown for which the average spectrum of an optimized signal set resembles the water pouring spectrum that achieves Shannon capacity, assuming additive white Gaussian noise

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 5 )