We propose a stochastic iteration approach to signal set design. Four practical stochastic iterative algorithms are proposed with respect to equal and average energy constraints and sequential and batch modes. By simulation, a new optimal signal set, the L2 signal set (consisting of a regular simplex set of three signals and some zero signals), is found under the strong simplex conjecture (SSC) condition (equal a priori probability and average energy constraint) at low signal-to-noise ratios (SNR). The optimality of the L1 signal set, the confirmation of the weak simplex conjecture, and two of Dunbridge's (1967) theorems are some of the results obtained by simulations. The influence of SNR and a priori probabilities on the signal sets is also investigated via simulation. As an application to practical communication system design, the signal sets of eight two-dimensional (2-D) signals are studied by simulation under the SSC condition. Two signal sets better than 8-PSK are found. Optimal properties of the L2 signal set are analyzed under the SSC condition at low SNRs. The L2 signal set is proved to be uniquely optimal in 2-D space. The class of signal sets S(M, K) (consisting of a regular simplex set of K signals and M-K zero signals) is analyzed. It is shown that any of the signal sets S(M, K) for 3/spl les/K/spl les/M-1 disproves the strong simplex conjecture for M/spl ges/4, and if M/spl ges/7, S(M, 2) (the L1 signal set) also disproves the strong simplex conjecture. It is proved that the L2 signal set is the unique optimal signal set in the class of signal sets S(M, K) for all M/spl ges/4. Several results obtained by Steiner (see ibid., vol.40, no.5, p.721-31, 1994) for all M/spl ges/7 are extended to all M/spl ges/4. Finally, we show that for M/spl ges/7, there exists an integer K'
[1]
Charles L. Weber,et al.
Elements of Detection and Signal Design
,
1968
.
[2]
L. Nelson,et al.
Stochastic Iterative Algorithms for Signal Set Design for Gaussian Channels and the L 2 Signal Set
,
1997
.
[3]
A. Balakrishnan.
A contribution to the sphere-packing problem of communication theory
,
1961
.
[4]
Harold J. Kushner,et al.
wchastic. approximation methods for constrained and unconstrained systems
,
1978
.
[5]
Michael J. Steiner,et al.
The strong simplex conjecture is false
,
1994,
IEEE Trans. Inf. Theory.
[6]
D. Slepian,et al.
On the optimality of the regular simplex code
,
1966
.
[7]
Thomas M. Cover,et al.
Open Problems in Communication and Computation
,
2011,
Springer New York.
[8]
Lennart Ljung,et al.
Analysis of recursive stochastic algorithms
,
1977
.
[9]
S. Hyakin,et al.
Neural Networks: A Comprehensive Foundation
,
1994
.
[10]
Robert Bartle,et al.
The Elements of Real Analysis
,
1977,
The Mathematical Gazette.
[11]
B. Dunbridge.
Asymmetric signal design for the coherent Gaussian channel
,
1967,
IEEE Trans. Inf. Theory.
[12]
Steven Mark Farber.
On the signal selection problem for phase conherent and incoherent communication channels
,
1968
.