Name
Abstract | ||
|---|---|---|
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 |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/18.133250 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
constraint theory,encoding,information theory,telecommunication channels,Shannon capacity,additive white Gaussian noise,dense lattices,discrete-time channel,gradient based numerical algorithms,hard constraint,linear time invariant channel,minimum Euclidean distance,partial-response channels,power constraint,signal sets optimisation,soft constraint | Information theory,Discrete mathematics,Ellipsoid,Combinatorics,Euclidean distance,Decoding methods,Numerical analysis,Additive white Gaussian noise,Channel capacity,Mathematics,Binary constraint | Journal |
Volume | Issue | ISSN |
37 | 5 | 0018-9448 |
Citations | PageRank | References |
8 | 1.58 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael L. Honig | 1 | 2971 | 411.29 |
| Kenneth Steiglitz | 2 | 1128 | 660.13 |
| Norman, S.A. | 3 | 8 | 1.58 |