An integrated incremental self-organizing map and hierarchical neural network approach for cognitive radio learning
18 Jul 2010-pp 1-6
TL;DR: An incremental self-organizing map integrated with hierarchical neural network (ISOM-HNN) is proposed as an efficient approach for signal classification in cognitive radio networks and the adaptability of ISOM can improve the real-time learning performance.
Abstract: In this paper, an incremental self-organizing map integrated with hierarchical neural network (ISOM-HNN) is proposed as an efficient approach for signal classification in cognitive radio networks. This approach can effectively detect unknown radio signals in the uncertain communication environment. The adaptability of ISOM can improve the real-time learning performance, which provides the advantage of using this approach for on-line learning and control of cognitive radios in many real-world application scenarios. Furthermore, we propose to integrate the ISOM with the hierarchical neural network (HNN) to improve the learning and prediction accuracy. Detailed learning algorithm and simulation results are presented in this work to demonstrate the effectiveness of this approach.
Citations
More filters
01 Jan 1990
TL;DR: An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article, where the authors present an overview of their work.
Abstract: An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article.
2,933 citations
TL;DR: A hybrid learning model of imbalanced evolving self-organizing maps (IESOMs) is proposed to address the imbalanced learning problems to modify the classic SOM learning rule to search the winner neuron based on energy function by minimally reducing local error in the competitive learning phase.
32 citations
Cites methods from "An integrated incremental self-orga..."
...Generally speaking, the procedure of unsupervised SOM [20,50] is viewed as nonlinear transformation from higher dimensional input space to lower dimensional (one- or two-dimensional) map lattice, involving the local search based on interactively lateral influence of competitive neurons....
[...]
TL;DR: Feature related to the linguistic and the production constraints are proposed for modeling the prosodic parameters such as duration, intonation and intensities of the syllables for text-to-speech synthesis (TTS) system.
19 citations
Posted Content•
TL;DR: An overview and survey of prior work related to major research considerations in the RFML application space are provided, which are not generally present in the image, audio, and/or text application spaces.
Abstract: While deep machine learning technologies are now pervasive in state-of-the-art image recognition and natural language processing applications, only in recent years have these technologies started to sufficiently mature in applications related to wireless communications. In particular, recent research has shown deep machine learning to be an enabling technology for cognitive radio applications as well as a useful tool for supplementing expertly defined algorithms for spectrum sensing applications such as signal detection, estimation, and classification (termed here as Radio Frequency Machine Learning, or RFML). A major driver for the usage of deep machine learning in the context of wireless communications is that little, to no, a priori knowledge of the intended spectral environment is required, given that there is an abundance of representative data to facilitate training and evaluation. However, in addition to this fundamental need for sufficient data, there are other key considerations, such as trust, security, and hardware/software issues, that must be taken into account before deploying deep machine learning systems in real-world wireless communication applications. This paper provides an overview and survey of prior work related to these major research considerations. In particular, we present their unique considerations in the RFML application space, which are not generally present in the image, audio, and/or text application spaces.
18 citations
Additional excerpts
...and resources to properly collect [23]–[29], [36], [41], [43], [44], [59]–[63], [80], [84], [88], [93]–[96], [98], [99], [101], [137], [138]....
[...]
TL;DR: Four-neuron BAM networks with inertia and multiple delays are considered and it is found that Hopf bifurcation occurs when the sum of time delays passes through a sequence of critical values.
Abstract: Bidirectional associative memory (BAM) networks play an important role in various fields such as optimization, pattern recognition, classification, signal and image processing, parallel computation and associative memory. In this paper, four-neuron BAM networks with inertia and multiple delays are considered. By analyzing the distribution of the eigenvalues of the associated characteristic transcendental equation, local stability criteria are obtained for various system parameters and time delays. By choosing the sum of time delays as a bifurcation parameter, we found that Hopf bifurcation occurs when the sum of time delays passes through a sequence of critical values. Some explicit formulae for determining the stability and the direction of the Hopf bifurcation periodic solutions are obtained by using the normal form theory and center manifold theory. Some numerical simulations are carried out to support theoretical predictions. Our results are new and supplement some previously known studies.
17 citations
References
More filters
Book•
01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Abstract: From the Publisher:
This book brings together - in an informal and tutorial fashion - the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields
Major concepts are illustrated with running examples, and major algorithms are illustrated by Pascal computer programs No prior knowledge of GAs or genetics is assumed, and only a minimum of computer programming and mathematics background is required
52,797 citations
Book•
16 Jul 1998
TL;DR: Thorough, well-organized, and completely up to date, this book examines all the important aspects of this emerging technology, including the learning process, back-propagation learning, radial-basis function networks, self-organizing systems, modular networks, temporal processing and neurodynamics, and VLSI implementation of neural networks.
Abstract: From the Publisher:
This book represents the most comprehensive treatment available of neural networks from an engineering perspective. Thorough, well-organized, and completely up to date, it examines all the important aspects of this emerging technology, including the learning process, back-propagation learning, radial-basis function networks, self-organizing systems, modular networks, temporal processing and neurodynamics, and VLSI implementation of neural networks. Written in a concise and fluid manner, by a foremost engineering textbook author, to make the material more accessible, this book is ideal for professional engineers and graduate students entering this exciting field. Computer experiments, problems, worked examples, a bibliography, photographs, and illustrations reinforce key concepts.
29,130 citations
01 Feb 1989
TL;DR: In this paper, the authors provide an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and give practical details on methods of implementation of the theory along with a description of selected applications of HMMs to distinct problems in speech recognition.
Abstract: This tutorial provides an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and gives practical details on methods of implementation of the theory along with a description of selected applications of the theory to distinct problems in speech recognition. Results from a number of original sources are combined to provide a single source of acquiring the background required to pursue further this area of research. The author first reviews the theory of discrete Markov chains and shows how the concept of hidden states, where the observation is a probabilistic function of the state, can be used effectively. The theory is illustrated with two simple examples, namely coin-tossing, and the classic balls-in-urns system. Three fundamental problems of HMMs are noted and several practical techniques for solving these problems are given. The various types of HMMs that have been studied, including ergodic as well as left-right models, are described. >
21,819 citations
Book•
[...]
TL;DR: The Self-Organising Map (SOM) algorithm was introduced by the author in 1981 as mentioned in this paper, and many applications form one of the major approaches to the contemporary artificial neural networks field, and new technologies have already been based on it.
Abstract: The Self-Organising Map (SOM) algorithm was introduced by the author in 1981. Its theory and many applications form one of the major approaches to the contemporary artificial neural networks field, and new technologies have already been based on it. The most important practical applications are in exploratory data analysis, pattern recognition, speech analysis, robotics, industrial and medical diagnostics, instrumentation, and control, and literally hundreds of other tasks. In this monograph the mathematical preliminaries, background, basic ideas, and implications are expounded in a manner which is accessible without prior expert knowledge.
12,920 citations
TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
Abstract: This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver.
We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.
10,526 citations