scholarly journals A Novel Kernel for RBF Based Neural Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wasim Aftab ◽  
Muhammad Moinuddin ◽  
Muhammad Shafique Shaikh

Radial basis function (RBF) is well known to provide excellent performance in function approximation and pattern classification. The conventional RBF uses basis functions which rely on distance measures such as Gaussian kernel of Euclidean distance (ED) between feature vector and neuron’s center, and so forth. In this work, we introduce a novel RBF artificial neural network (ANN) where the basis function utilizes a linear combination of ED based Gaussian kernel and a cosine kernel where the cosine kernel computes the angle between feature and center vectors. Novelty of the proposed work relies on the fact that we have shown that there may be scenarios where the two feature vectors (FV) are more prominently distinguishable via the proposed cosine measure as compared to the conventional ED measure. We discuss adaptive symbol detection for multiple phase shift keying (MPSK) signals as a practical example to show where the angle information can be pivotal which in turn justifies our proposed RBF kernel. To corroborate our theoretical developments, we investigate the performance of the proposed RBF for the problems pertaining to three different domains. Our results show that the proposed RBF outperforms the conventional RBF by a remarkable margin.

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Gaoyuan Zhang ◽  
Haiqiong Li ◽  
Congzheng Han ◽  
Congyu Shi ◽  
Hong Wen ◽  
...  

Although the full multiple-symbol detection (MSD) for IEEE 802.15.4c multiple phase shift keying (MPSK) receivers gives much better performance than the symbol-by-symbol detection (SBSD), its implementation complexity is extremely heavy. We propose a simple MSD scheme based on two implementation-friendly but powerful strategies. First, we find the best and second-best decisions in each symbol position with the standard SBSD procedure, and the global best decision is frozen. Second, for the remaining symbol positions, only the best and second-best symbol decisions, not all the candidates, are jointly searched by the standard MSD procedure. The simulation results indicate that the packet error rate (PER) performance of the simplified MSD scheme is almost the same as that of the full scheme. In particular, at PER of 1 × 10 − 3 , no more than 0.2 dB performance gap is observed if we just increase the observation window length N to 2. However, the number of decision metrics needed to be calculated is reduced from 256 to 2. Thus, much balance gain between implementation complexity and detection performance is achieved.


Electronics ◽  
2020 ◽  
Vol 9 (12) ◽  
pp. 2049
Author(s):  
Congyu Shi ◽  
Gaoyuan Zhang ◽  
Haiqiong Li ◽  
Congzheng Han ◽  
Jie Tang ◽  
...  

In this work, an implementation-friendly multiple-symbol detection (MSD) scheme is proposed for the IEEE 802.15.4g offset quadrature phase shift keying (O-QPSK) receivers over the slow fading channel. The full MSD scheme presents better detection performance than the symbol-by-symbol detection (SBSD) scheme, yet its complexity increases exponentially as the observation window length increases. We introduce a simplified MSD scheme based on two powerful strategies. We first seek the optimal and suboptimal decisions in each symbol position with the standard SBSD procedure. Then, the aforementioned optimal and suboptimal decisions instead of all candidates are jointly searched with the standard MSD procedure. That is, only the most and second most reliable candidates in each symbol position are selected to participate in the final detection. The simulation results demonstrate that the new MSD scheme can achieve more encouraging energy gain than the SBSD scheme, while the high complexity of full MSD is also effectively reduced. A more legitimate compromise between detection performance and complexity is thus accomplished, which enables smart metering utility networks (SUN) nodes to achieve energy saving and maximum service life.


1994 ◽  
Vol 33 (Part 1, No. 5B) ◽  
pp. 3021-3025
Author(s):  
Nobushige Araki ◽  
Kenji Komine ◽  
Motoaki Hara ◽  
Hiroaki Ueno ◽  
Kohji Hohkawa

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zhuo Sun ◽  
Sese Wang ◽  
Xuantong Chen

Compressive sensing theory can be applied to reconstruct the signal with far fewer measurements than what is usually considered necessary, while in many scenarios, such as spectrum detection and modulation recognition, we only expect to acquire useful characteristics rather than the original signals, where selecting the feature with sparsity becomes the main challenge. With the aim of digital modulation recognition, the paper mainly constructs two features which can be recovered directly from compressive samples. The two features are the spectrum of received data and its nonlinear transformation and the compositional feature of multiple high-order moments of the received data; both of them have desired sparsity required for reconstruction from subsamples. Recognition of multiple frequency shift keying, multiple phase shift keying, and multiple quadrature amplitude modulation are considered in our paper and implemented in a unified procedure. Simulation shows that the two identification features can work effectively in the digital modulation recognition, even at a relatively low signal-to-noise ratio.


Sign in / Sign up

Export Citation Format

Share Document