See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/5600563

A novel artificial neural network for sorting

Article in IEEE TRANSACTIONS ON CYBERNETICS · February 1999

DOI: 10.1109/3477.752799 · Source: PubMed

CITATIONS READS
20 744

1 author:

Tatiana Tambouratzis
University of Piraeus
85 PUBLICATIONS 308 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Analysis and custom-made presentation of music notation View project

Power Plant Operation, Monitoring and Control View project

All content following this page was uploaded by Tatiana Tambouratzis on 22 December 2015.

The user has requested enhancement of the downloaded file.

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 29, NO. 2, APRIL 1999
of the equalizer, first, the equalizer was trained with 5000 symbols
to obtain optimum weight values. Then, subsequent 1000 symbols
were transmitted and the outputs of the equalizer were obtained for
plotting the eye-patterns.
The signal constellation of 1000 noisy received signal samples
(before equalization) along with the eye-patterns of 1000 symbols
at SNR of 15 dB for CH = 6 with nonlinear model (NL = 1)
is shown in Fig. 10. It may be seen that the effectiveness of
channel equalization using ANN’s is superior to the linear LMS-
based equalizer. Out of the three ANN structures, FLANN-based
equalizer provides the most effective equalization for both linear and
nonlinear channel models. Similar observations were made for all the
six channels with linear and three nonlinear models studied.
VIII. CONCLUSION
Considering channel equalization as a multi-category classification
problem, it is shown that performance of ANN-based equalizers
provides substantial improvement in terms of convergence rate, MSE
floor level and BER. In a linear equalizer the performance degrades
drastically with increase in EVR, specially when the channel is
nonlinear. However, it is shown that, in the ANN-based equalizer
the performance degradation with increase in EVR is not so severe.
We have introduced a novel FLANN-based equalizer structure for
adaptive channel equalization of nonlinear channels. Because of its
single layer structure the FLANN offers advantages over MLP. The
performance of PPN and MLP is found to be similar in most of
the experiments. But the single layer PPN structure is preferable
than MLP as it offers less computational complexity. Out of the
three ANN equalizer structures, the performance of the FLANN is
found to be the best in terms of MSE level, convergence rate, BER
and computational complexity for linear as well as nonlinear channel
models over a wide range of SNR and EVR variations. Because of
computational advantages the FLANN may be used in other signal
processing applications.
REFERENCES
[1] S. Chen, G. J. Gibson, and C. F. N. Cowan, “Adaptive channel
equalization using a polynomial perceptron structure,” Proc. Inst. Elect.
Eng., vol. 137, pt. 1, pp. 257–264, Oct. 1990.
[2] S. Chen, G. J. Gibson, C. F. N. Cowan, and P. M. Grant, “Adaptive
equalization of finite nonlinear channels using multilayer perceptrons,”
Signal Process., vol. 20, pp. 107–119, 1990.
[3] W. S. Gan, J. J. Soraghan, and T. S. Durrani, “A new functional-link
based equaliser,” Electron. Lett., vol. 28, pp. 1643–1645, Aug. 1992.
[4] G. J. Gibson, S. Siu, and C. F. N. Cowan, “The application of nonlinear
structures to the reconstruction of binary signals,” IEEE Trans. Signal
Processing, vol. 39, pp. 1877–1884, Aug. 1991.
[5] S. Haykin, Adaptive Filter Theory, 2nd ed. Englewood Cliffs, NJ:
Prentice-Hall, 1991.
[6] M. Meyer and G. Pfeiffer, “Multilayer perceptron based decision feed-
back equalizers for channels with intersymbol interference,” Proc. IEE,
vol. 140, pt. 1, pp. 420–424, Dec. 1993.
[7] Y.-H. Pao, Adaptive Pattern Recognition and Neural Networks. Read-
ing, MA: Addison-Wesley, 1989.
[8] Y.-H. Pao, G.-H. Park, and D. J. Sobajic, “Learning and generalization
characteristics of random vector functional-link net,” Neurocomputation,
vol. 6, pp. 163–180, 1994.
[9] J. C. Patra, “Some studies on artificial neural networks for signal pro-
cessing applications,” Ph.D. dissertation, Indian Inst. Technol., Kharag-
pur, Dec. 1996.
[10] J. C. Patra and R. N. Pal, “A functional link artificial neural network for
adaptive channel equalization,” Signal Process., vol. 43, pp. 181–195,
May 1995.
1083–4419/99$10.00  1999 IEEE
271
[11] , “Functional link neural network-based adaptive equalization of
nonlinear channels with QAM signal,” in Proc. IEEE Int. Conf. Systems,
Man, Cybernetics, Vancouver, B.C., Canada, Oct. 1995, pp. 2081–2086.
[12] N. Sadegh, “A perceptron based neural network for identification and
control of nonlinear systems,” IEEE Trans. Neural Networks, vol. 4, pp.
982–988, Nov. 1993.
[13] S. Siu, G. J. Gibson, and C. F. N. Cowan, “Decision feedback equal-
ization using neural network structures and performance comparison
with standard architecture,” Proc. Inst. Elect. Eng., vol. 137, pt. 1, pp.
221–225, Aug. 1990.
[14] J. T. Tou and R. C. Gonzalez, Pattern Recognition Principles. Reading,
MA: Addison-Wesley, 1981.
[15] B. Widrow and M. A. Lehr, “30 Years of adaptive neural networks:
perceptron, madaline and backpropagation,” Proc. IEEE, vol. 78, pp.
1415–1442, Sept. 1990.
[16] Z. Xiang, G. Bi, and T.-L. Ngoc, “Polynomial perceptrons and their
applications to fading channel equalization and co-channel interference
suppression,” IEEE Trans. Signal Processing, vol. 42, pp. 2470–2479,
Sept. 1994.
[17] S. S. Yang and C. S. Tseng, “An orthonormal neural network for
function approximation,” IEEE Trans. Syst., Man, Cybern. B, vol. 26,
pp. 779–785, Oct. 1996.
A Novel Artificial Neural Network for Sorting
T. Tambouratzis
Abstract—An artificial neural network (ANN) is employed for sorting
a sequence of real elements in monotonic (descending or ascending)
order. Although inspired by harmony theory (HT), whereby the same
construction as for the HT ANN is followed, the proposed ANN differs in
the mode of operation, namely the obliteration of the consensus (harmony)
function, the circumvention of simulated annealing as a means of settling
to a solution, the simplification of the activation updating of the nodes
of the upper layer, the clamping of the nodes of the lower layer, the
gradual shrinking of the ANN and the use of an automatic termination
criterion. The creation of the sorted sequence is progressive, whereby at
most as many network updates are required as there are elements in the
sequence. Ties between elements are resolved by simultaneous activation
of the corresponding nodes. Finally, the min and max problems are solved
in a single network update.
Index Terms—Artificial neural networks, harmony theory, sorting.
I. INTRODUCTION
Sorting constitutes a basic operation of many computing tasks,
including VLSI design, digital signal processing, network commu-
nications, database management and data processing, for which it
has been estimated that sorting operations account for over 25% of
the total processing time. The significance of sorting is reflected in
the multitude of sorting techniques that have been proposed over the
previous decades. The main aim of these techniques, be they serial
or parallel in construction and operation, is the minimization of the
time and storage requirements of the sorting operation. Instructive
overviews of serial and parallel sorting techniques are given in [1]
and [2], respectively. Representative serial sorting techniques appear
Manuscript received June 19, 1998; revised November 8, 1998. This paper
was recommended by Associate Editor R. Popp.
The author is with the Institute of Nuclear Technology—Radiation Protec-
tion, NCSR “Demokritos,” Aghia Paraskevi 153 10, Athens, Greece (e-mail:
tatiana@ipta.demokri-tos.gr).
Publisher Item Identifier S 1083-4419(99)02296-7.
272 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 29, NO. 2, APRIL 1999
Fig. 1. The general structure of the HT ANN.
in [3]–[9], while, more recently, parallel sorting techniques have been
proposed by [10]–[18].
In this piece of research, a novel artificial neural network (ANN),
characterized by simplicity and transparency in construction as well
as during operation, is proposed for sorting a sequence of N real ele-
ments fni g; i = 1; 2; . . . ; N . The same ANN can sort the elements in
descending or in ascending order, while ties between the elements are
accommodated for. The creation of the sorted sequence is progressive,
whereby at most N node activation updates are required; additionally,
an automatic termination criterion of operation is utilized.
The proposed ANN is derived from harmony theory (HT) [19]
whereby the same construction as for the standard HT ANN is
followed. However, its mode of operation constitutes a modified
version of the corresponding HT ANN in terms of the clamping of the
nodes of the lower layer, the simplification of the activation updating
of the nodes of the upper layer, the circumvention of the slow and
time-consuming process of simulated annealing as a means of settling
to a solution and the obliteration of the consensus (harmony) function.
This paper is organized as follows: Section II describes the struc-
ture of the HT ANN, while Section III introduces the modifications
leading to the ANN proposed for sorting. The general results as
well as a comparison with three recent—and distinct—ANN sorting
techniques appear in Section IV. Section V concludes the paper.
II. HARMONY THEORY ARTIFICIAL NEURAL NETWORKS (HT ANN’s)
The ANN proposed for sorting is derived from the harmony theory
(HT) ANN [19]. The main characteristics of the HT ANN, shown in
Fig. 1, are as follows.
Relating to construction
1) The nodes assume binary activation values and are partitioned
into two groups, each of which is arranged in a separate layer.
The nodes of the lower layer assume activation values of
f01; +1g and represent the elements of the problem to be
solved, while those of the upper layer assume activation values
of f0; +1g and represent the constraints between the elements.
2) HT is furnished with a training phase whereby the connections
and the accompanying weights evolve over time; the alternative
of direct construction also exists. In both cases, the connections
are symmetric and only allowed between nodes of different
layers. The weights of the connections serve to enforce the
constraints between the elements of the problem.
Relating to the mode of operation
3) The HT ANN state is described by the activation values
of its nodes; these values collectively represent the current
problem state and, consequently, the proposed solution. The
consensus (harmony) function associated with the HT ANN
assigns a harmony value to every state corresponding to its
fitness in constituting a solution of the problem; the states
where the harmony function is maximized (harmony maxima
states) correspond to the optimal solutions. The harmony value
is raised when such activation values are assigned to the HT
ANN nodes as to (for more details on the harmony function the
reader is referred to [19] and [21]): a) maximize the number of
active nodes of the upper layer, b) render the active nodes of the
upper layer compatible (i.e. the signs of the nonzero weights
connecting all the active nodes of the upper layer with the same
node of the lower layer must be identical; this must hold for
all the nodes of the lower layer), and c) render the nodes of the
lower layer compatible (i.e. the signs of the activation values
of the nodes of the lower layer and the signs of the weights of
the connected active nodes of the upper layer must coincide).
4) The HT ANN employs simulated annealing in order to settle
(reach a solution). During simulated annealing, the HT ANN
performs a number of network updates (stochastic updates of
the activation values of its nodes) which collectively aim at
maximizing harmony. Each update is executed at a specific
value of the temperature parameter T , which is decremented
before the next update. The stochastic nature of the updates
causes nonmonotonic ascent in terms of harmony which, in
turn, ensures that the network settles at a global harmony
maximum state (optimal solution).
5) During simulated annealing, each network update is performed
in two passes for a specific value of the temperature parameter
T . The first pass comprises the stochastic update of the activa-
tion values of the nodes of the upper layer, while the second
pass comprises the stochastic update of the activation values of
the nodes of the lower layer. For the first network update only,
an initial random assignment of f01; +1g activation values to
the nodes of the lower layer is made. Assuming that the HT
ANN consists of x and y nodes in the upper and lower layer,
respectively, the first pass is described by (1)–(3). The total
input Ii (i = 1; 2; . . . ; x) from all the nodes of the lower layer
to each node of the upper layer is calculated:
y
Ii = wij actlj 0 k (1)
j =1
where wij denotes the weight of the connection between the
ith node of the upper layer and the j th node of the lower layer
(j = 1; 2; . . . ; y ); actlj denotes the current activation value of
the j th node of the lower layer and k denotes the threshold
parameter of HT. k is crucial in guiding the HT ANN toward
a state of maximum harmony: it specifies the required degree
of agreement between the connections of a node of the upper
layer and the activation values of the connected nodes of the
lower layer in order for the node of the upper layer to raise
harmony by becoming active (for more details the reader is
referred to [19] and [21]). Ii is processed through a sigmoid
nonlinearity, producing a quantity P between 0 and 1
1
1 + e0I=T
P = (2)
where I = Ii . The new activation value actui is produced by
comparing P with a random number R in the range [0; +1]
+1 if P > R
actui = (3)
0 otherwise
The second pass is described by (2), (4), and (5). The total input
Ij(j = 1; 2; . . . ; y ) from all the nodes of the upper layer to
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 29, NO. 2, APRIL 1999 273

each node of the lower layer is calculated: the first update determines the min and max elements of the
x sequence.
I j =2 ij actui
w (4) 50 ) Each network update comprises a single deterministic pass of
j =1 activation. The activation values of the nodes of the lower
layer aclj (j = 1; 2; . . . ; N ) are uniformly clamped to +1
which is again processed as shown in (2) for I = j . The new
I
or 01 depending on whether the desired order of sorting is
activation value actlj is given by descending or ascending, respectively. Owing to clamping, the
+1 if P > R second pass of activation is obliterated. Concerning the first
actlj =
01 otherwise.
(5) pass, (2) and (3) are substituted by

The comparisons in (3) and (5) are responsible for the stochastic actui =
1 i0
I
(8)
nature of the activation updates of the nodes of both layers. The 0 i<0
I

interested reader is referred to [21] for more details on the effect

of T on the sharpness of the sigmoid in (2) and, subsequently,
on the monotonicity of the ascent in terms of harmony.
Directly constructed HT ANN’s have been employed in constraint-
propagation tasks (electrical circuit operation, scene analysis via line
labeling) [19], [20], in optimization tasks (map coloring, the n-queens
problem, graph planarization, satellite broadcasting) [21]–[26] and,
more recently, in clustering tasks [27]. It has been demonstrated that,
for appropriate values of the HT parameters, an optimal solution of
the problem is invariably settled upon. Additionally, if more than one
optimal solutions exist, each of them is settled upon with roughly
equal probability.
III. MODIFIED HT ANN FOR SORTING
i.e., the nodes of the upper layer are reduced into simple
threshold units. Once the activation value of a node of the
upper layer becomes +1, the corresponding element of the
given sequence is added to the sorted sequence and the node
is deactivated (not considered in the next network updates).
Node deactivation also provides the criterion for the automatic
termination of ANN operation; once all the nodes of the upper
layer have been deactivated, the entire sorted sequence has
been produced. Equation (1) becomes
I i = Compi 0 km (9)
i.e., i
I is decomposed into a constant term Compi (i =
and the variable term km 1 Compi equals
1; 2; . . . ; N )

The proposed ANN for sorting is derived from the HT ANN. In N

this section it will be explained how Compi = ij actlj
w

j =1
• the construction characteristics of the proposed ANN are inher- N wij ;
j =1 if descending order
0 Nj=1 wij ;
ited from the HT ANN; = (10)
• the mode of operation of the proposed ANN differs from the HT if ascending order
ANN in terms of the circumvention of both simulated annealing
while km (m = 1; 2; . . . ; N ) stands for the progressively de-
and the harmony consensus function as a means of settling to
creasing threshold parameter employed at the network updates
a solution, the simplification of the activation updating of the
and is given by
nodes of the upper layer, the clamping of the nodes of the lower
layer and the progressive deactivation of the nodes of the upper m = N + 1 0 2m
k (11)
layer.
Assuming that a sequence of N elements fni g (i = 1; 2; . . . ; N ) such that the required degree of agreement in order for a node
is to be sorted, the ANN is characterized as follows. of the upper layer to become active is reduced at each update.
Relating to construction As a result of (8)–(11), the nodes of the upper layer assume
10 ) 2 1 N nodes, arranged in two layers of N nodes each. The activation values of +1 in the order in which the corresponding
ith node of the upper layer (i = 1; 2; . . . ; N ) represents the
elements ni appear in the sorted sequence. In the event of ties
ith element ni of the given sequence and its activation value
between l elements at a particular value of km , these elements
of 0 or +1 denotes whether ni must be entered in the sorted are added to the sorted sequence at the same network update,
sequence. while the threshold parameter jumps l consecutive values for
20 ) N 2 symmetric connections. The network is fully connected the next network update (km+l ). If M distinct elements appear
and the weights of the connections are directly determined by in the given sequence, exactly M network updates are required
for producing the entire sorted sequence.
+1; if ni > nj
w ij = 01; if ni < nj (6)
IV. RESULTS COMPARISONS
ni = nj
AND
A; if
In order to sort a given sequence of N elements fni g (i =
(i; j = 1; 2; . . . ; N ),
where the value of A depends on the 1; 2; . . . ; N ), the proposed ANN comprises two layers of N nodes
desired order of sorting each, with full connectivity between nodes of different layers. The
+1; if descending order nodes of the lower layer are clamped to activation values of 61
A =
01; if ascending order.
(7) depending on the desired order of the sorted sequence, whereby
each network update consists of updating the activation values of
the nodes of the upper layer only. As many updates are required for
Relating to the mode of operation producing the sorted sequence as there are distinct elements in the
30 ) The harmony function is not employed as a means of reaching given sequence, while the min and max elements are output in the
a solution. first network update. At each update, as many nodes of the upper layer
40 ) No use of simulated annealing is made. At most N network are deactivated as there are elements added to the ordered sequence.
updates are required for producing the sorted sequence, while Fig. 2 illustrates the proposed ANN for sorting the sample sequence
274 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 29, NO. 2, APRIL 1999
Fig. 2. The proposed ANN for sorting the sample sequence f08 72 2 07
: ; : ;
3:15; 0; 2:07g.
f08 72 2 07 3 15 0 2 07g, where the weights have been marked
: ; : ; : ; ; :
next to the corresponding connections.
To create the descending order sequence Sdesc ; A = +1 in (7)
(i.e. w11 = w22 = w33 = w44 = w55 = w25 = w52 = +1),
while all the nodes of the lower layer are clamped to actlj = +1
(j = 1; 2; 3; 4; 5). The values Compi (i = 1; 2; 3; 4; 5) are given by
(10) as Comp1 = 03; Comp2 = 3; Comp3 = 5; Comp4 = 01;
and Comp4 = 3, while the consecutive values of the threshold
parameter are given by (11) as k1 = 4; k2 = 2; k3 = 0; k4 = 02
and k5 = 04.
• For the first network update (k1 = 4); I1 = 07; I2 = 01;
I3 = 1; I4 = 05; and I5 = 01 from (9), whereby only
actu3 = +1 from (8). The third element of the given sequence
n3 = 3:15 is added to the sorted sequence Sdesc = f3:15g and
the third node of the upper layer is deactivated. Additionally,
3:15 constitutes the max element of the given sequence.
• For the second network update (k2 = 2); I1 = 05; I4 = 03
and I2 = I5 = 1, whereby actu2 = actu5 = +1; a tie l = 2
occurs between the second and fifth elements of the sequence
n2 = n5 = 2:07 that are simultaneously added to the sorted
sequence Sdesc = f3:15; 2:07; 2:07g; the corresponding two
nodes are deactivated and the value of the threshold parameter
jumps to k = k2+l = k4 for the next network update.
• For the third network update (k4 = 02); I1 = 01 and I4 = 1,
whereby actu4 = +1 and n4 = 0 is added to the sorted
sequence Sdesc = f3:15; 2:07; 2:07; 0g, while the corresponding
node is deactivated.
• For the fourth update (k5 = 04); I1 = 1; actu1 = +1
and n1 = 08:72 is added to the sorted sequence, while the
corresponding node is deactivated. As all the nodes of the upper
layer of the ANN have been deactivated, the sorted sequence
becomes finalized to Sdesc = f3:15; 2:07; 2:07; 0; 08; 72g.
An identical procedure is followed for the creation of the ascending
order sequence Sasc . The same consecutive values of the threshold
parameter k are used (k1 = 4; k2 = 2; k3 = 0; k4 = 02 and
k5 = 04) and A = 01 (w11 = w22 = w33 = w44 = w55 = w25 =
w52 = 01). The nodes of the lower layer are clamped to actlj = 01
(j = 1; 2; 3; 4), whereby Comp1 = 5; Comp2 = 1; Comp3 = 03;
Comp4 = 3 and Comp5 = 1.
In the following, a comparison between the proposed ANN and
three recent ANN sorting techniques [14], [17], [18] is made; the
three ANN’s are characterized by distinct architectures, none of which
is related to harmony theory. Like the proposed ANN, the ANN of
TABLE I
COMPARISON OF CONSTRUCTION AND PERFORMANCE
CHARACTERISTICS OF FOUR ANN SORTING TECHNIQUES
[17] can sort a sequence of real elements in descending as well as
in ascending order, while that of [14] can only sort positive integers
in ascending order; the ANN of [18] can also sort the elements of
the given sequence in bitonic order. Table I contrasts the four ANN’s
in terms of construction and performance characteristics. The main
features distinguishing the proposed ANN from the other three ANN’s
are summarized next.
1) The proposed ANN is simple in terms of construction and
operation. As seen in Table I, it is smaller in the number of
nodes and connections, while simple pair-wise comparisons
between elements suffice for ANN construction. Additionally,
the total number of operations as well as the node complexity
(average number of operations per node activation update) of
the proposed ANN are significantly lower than those of the
other ANN’s, implying faster sorting. Owing to the modifica-
tion of the HT ANN the following is true.
• Simulated annealing and the stochasticity of correspond-
ing updating procedure are substituted by a deterministic
network updating scheme, while no consensus (harmony)
function is employed. As a result, 1) the need for a large
number of network updates in order to reach a solution (as in
[18]) 2) the search for exact parameter values accomplishing
successful as well as fast ANN settling (as in [14]), and 3)
a consensus-function-based termination criterion concerning
ANN operation are obliterated. Unlike the ANN’s of [14]
and [18] whose computational requirements remain con-
stant throughout sorting, the proposed ANN progressively
shrinks, thus further limiting the total number of required
operations.
• Owing to the clamping of the nodes of the lower layer,
the removal of the sigmoid activation function and the
obliteration of the consensus function, each network update
comprises a single pass of activation which is straight-
forward to construct and rapid to perform. The relative
simplicity of the activation functions of the nodes of the
proposed ANN becomes evident when the node complexity
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 29, NO. 2, APRIL 1999
of the proposed ANN is compared to that of [17]: the
observed difference is due to the intricacy of the activation
functions of the nodes of first hidden and output layers [17]
(both ANN’s are characterized by the lack of a consensus
function, a similar logic for the production of the ordered
sequence and a comparable total number of operations).
2) The proposed ANN is transparent during operation.
• Unlike the two consensus-function ANN’s [14] and [18],
the termination criterion of the proposed ANN is automatic;
once all the nodes of the upper layer of the ANN are
deactivated, the entire sorted sequence has been produced.
• The elements are output sequentially, in the order in which
they appear in the sorted sequence. This is preferable to
the precedence-matrix [14] and the position-matrix [18]
representations of the solution, both of which require further
processing for determining the ordered sequence.
• The ties between elements of the given sequence are re-
solved by simultaneous activation of the corresponding
nodes of the upper layer, i.e., in a straightforward and
order-of-appearance-independent manner. This contrasts the
appearance of equiprobable solutions in the same matrix
representation [14] as well as the appearance—in the sorted
sequence—of equal-valued elements in the order in which
the elements appear in the given sequence [17].
• The min and max elements of the sequence are output in
a single (first) iteration. Similarly, the proposed ANN is
capable of seeking the part of the sorted sequence that is
contained within given bounds without the need to perform
all of the network updates. Such an approach is preferable
to the other ANN’s which operate completely in parallel
and, thus, output the entire sorted sequence one-shot. The
advantage of the proposed ANN becomes especially evident
when large sequences are involved, whereby a fraction
only of the total number of computations is necessary for
executing the aforementioned operations.
V. CONCLUSION
A new artificial-neural-network-based sorting technique has been
proposed which is capable of sorting a given sequence of real
elements in monotonic (descending or ascending) order. Although the
employed artificial neural network is derived from the harmony theory
artificial neural network [19] in terms of construction characteristics,
its mode of operation has been modified in the following respects:
neither the harmony consensus function nor simulated annealing
are employed, the activation functions are simplified, determinis-
tic activation updating is performed, progressive deactivation of
the activated nodes occurs and an automatic termination criterion
concerning operation is provided. These modifications render the
proposed technique simple in construction as well as transparent and
rapid during operation.
ACKNOWLEDGMENT
The author wishes to thank the anonymous referees for their helpful
comments in improving the manuscript.
REFERENCES
[1] D. E. Knuth, The Art of Computer Programming: Sorting and Searching.
Reading, MA: Addison-Wesley, 1973.
[2] S. G. Akl, Parallel Sorting Algorithms. New York: Academic, 1985.
[3] D. P. Agrawal and K. K. Agarwal, “Efficient sorting with CCD’s
and magnetic bubble memories,” IEEE Trans. Comput., vol. C-30, pp.
153–157, Feb. 1981.
View publication stats
275
[4] D. T. Lee, H. Chang, and C. K. Wong, “An on-chip compare/steer bubble
sorter,” IEEE Trans. Comput., vol. C-30, pp. 396–405, June 1981.
[5] G. Bilardi and F. P. Preparata, “A minimum area VLSI network for
O(log n) time sorting,” IEEE Trans. Comput., vol. C-34, pp. 336–343,
Apr. 1985.
[6] D. Rotem, N. Santoro, and J. B. Sidney, “Distributed sorting,” IEEE
Trans. Comput., vol. C-34, pp. 372–376, Apr. 1985.
[7] Y. H. Choi and M. Malek, “A fault-tolerant systolic sorter,” IEEE Trans.
Comput., vol. 37, pp. 621–624, May 1988.
[8] R. S. Francis and I. D. Mathieson, “Benchmark parallel sort for
shared memory multiprocessors,” IEEE Trans. Comput., vol. 37, pp.
1619–1626, Dec. 1988.
[9] H. M. Alnuweiri and V. K. P. Kumar, “Optimal VLSI sorting with
reduced number of processors,” IEEE Trans. Comput., vol. 40, pp.
105–110, Jan. 1991.
[10] M. Atkins, “Sorting by Hopfield net,” in Proc. Int. Joint Conf. Neural
Networks, Washington, DC, 1989, pp. 65–68.
[11] W. Chen and K. Hsieh, “A neural sorting algorithm with (1) timeO
complexity,” in Proc. Int. Joint Conf. Neural Networks, San Diego, CA,
1990, pp. 793–798.
[12] K. Y. Siu and J. Bruck, “Neural computation of arithmetic functions,”
Proc. IEEE, vol. 78, pp. 1669–1675, Oct. 1990.
[13] Y. Takefuji and K. C. Lee, “A two-step parallel sorting algorithm based
on neural networks,” J. Neural Network Comput., vol. 2, no. 1, pp.
30–32, 1990.
[14] Y. Takefuji and K. C. Lee, “A super-parallel sorting algorithm based on
neural networks,” IEEE Trans. Circuits Syst., vol. 37, pp. 1425–1429,
Nov. 1990.
[15] R. W. Brockett, “Dynamical systems that sort lists, diagonize matrices
and solve linear programming problems,” Linear Algebra Applicat., vol.
146, pp. 79–91, 1991.
[16] T. M. Kwon and M. Zervakis, “A parallel sorting network without
comparators: A neural network approach,” in Proc. Int. Joint Conf.
Neural Networks, Baltimore, MD, 1991, pp. 701–706.
[17] Y. H. Tseng and J. L. Wu, “Solving sorting and related problems by
quadratic perceptrons,” Electron. Lett., vol. 28, no. 10, pp. 906–908,
1992.
[18] J. Wang, “Analysis and design of an analog sorting network,” IEEE
Trans. Neural Networks, vol. 6, no. 4, pp. 962–971, 1995.
[19] P. Smolensky, “Information processing in dynamical systems: Foun-
dations of harmony theory,” in Parallel Distributed Processing: Explo-
rations in the Microstructure of Cognition Foundations, D. E. Rumelhart
and J. L. McClellands, Eds. Cambridge, MA: MIT Press, 1986, pp.
194–281, 1986.
[20] T. Tambouratzis, “An implementation of a harmony theory network for
interpreting line-drawings,” Network: Computation Neural Syst., vol. 2,
no. 4, pp. 443–454, 1991.
[21] , “A consensus-function artificial neural network for map-
coloring,” IEEE Trans. Syst., Man, Cybern. B, vol. 28, pp. 721–728,
Oct. 1998.
[22] , “A simulated annealing artificial neural network implementation
n
of the -queens problem,” Int. J. Intell. Syst., vol. 12, no. 10, pp.
739–751, 1997.
[23] , “Edge crossing minimization via artificial neural networks,”
Electron. Lett., vol. 33, no. 19, pp. 1621–1623, 1997.
[24] , “Graph planarization employing a harmony theory artificial neural
network,” Neural Comput. Applicat., vol. 6, no. 4, pp. 116–124, 1997.
[25] P. Burrascano and M. Melis, “A neural technique or satellite coverage
plans optimization,” in Artificial Neural Networks 2, I. Aleksander and J.
Taylor, Eds. Amsterdam, The Netherlands: North-Holland, 1992, pp.
1499–1502.
[26] T. Tambouratzis, “A decomposition-coordination artificial neural net-
work for satellite broadcast scheduling,” Electron. Lett., vol. 34, no. 15,
pp. 1503–1504, 1998.
[27] G. Tambouratzis, T. Tambouratzis, and D. Tambouratzis, “Neural net-
work versus statistical clustering techniques: A pilot study in a phoneme
recognition task,” in Mathematics of Neural Networks: Models, Algo-
rithms and Applications, Massachusetts, S. W. Ellacott, J. C. Mason,
and I. J. Anderson, Eds. Norwell, MA: Kluwer, 1997, pp. 355–360.