• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.361-378
• /
• 2012

Most of the current frequency hopping (FH) based dynamic spectrum access (DSA) methods concern a reactive channel access scheme with synchronous inter-channel spectrum sensing, i.e., FH is reactively triggered by the primary user (PU)'s return reported by spectrum sensing, and the PU channel to be switched to is assumed precisely just sensed or ready to be sensed, as if the inter-channel spectrum sensing moments are synchronous. However, the inter-channel spectrum sensing moments are more likely to be asynchronous, which risks PU suffering more interference. Moreover, the spectrum sensing is usually erroneous, which renders the problem more complex. To address this problem, we propose a proactive FH based DSA method against both erroneous spectrum sensing and asynchronous inter-channel spectrum sensing (moments). We term it as proactive DSA. The optimal FH sequence is obtained by dynamic programming. The complexity is also analyzed. Finally, the simulation results confirm the effectiveness of the proposed method.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.301-307
• /
• 2008

In this paper, the impact of channel sensing methods to IEEE 802.15.4 under the interference of IEEE 802.11b are analyzed. Two different channel sensing methods, energy detection and carrier sense, are considered. An average transmission delay, a throughput, and a power drain rate are used as performance measures. Those performance measures of IEEE 802.15.4 under the interference of IEEE 802.11b are analyzed mathematically. The simulation results are shown to validate the analytic results.

• Journal of electromagnetic engineering and science
• /
• v.10 no.3
• /
• pp.190-198
• /
• 2010

This paper evaluates the performance of two methods of spectrum sensing: the linear combining method and the selection combining method which is based on maximum SNR of sensing channel. We proposed a rule for global detection for the purpose of combating hidden terminal problems in spectrum sensing. Our analysis considers a situation when sensing channels experience the non-identically, independently distributed(n.i.d) Rayleigh fading. The average probabilities of global detection in these methods are derived and compared. In the scope of this paper, the reporting channels are assumed to be the AWGN channel with invariant and identical gain during the system's operation.

• Journal of Information Processing Systems
• /
• v.17 no.6
• /
• pp.1083-1096
• /
• 2021

Compressed sensing-based matching pursuit algorithms can estimate the sparse channel of massive multiple input multiple-output systems with short pilot sequences. Although they have the advantages of low computational complexity and low pilot overhead, their accuracy remains insufficient. Simply multiplying the weight value and the estimated channel obtained in different iterations can only improve the accuracy of channel estimation under conditions of low signal-to-noise ratio (SNR), whereas it degrades accuracy under conditions of high SNR. To address this issue, an improved weighted matching pursuit algorithm is proposed, which obtains a suitable weight value u_op by training the channel data. The step of the weight value increasing with successive iterations is calculated according to the sparsity of the channel and u_op. Adjusting the weight value adaptively over the iterations can further improve the accuracy of estimation. The results of simulations conducted to evaluate the proposed algorithm show that it exhibits improved performance in terms of accuracy compared to previous methods under conditions of both high and low SNR.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.317-329
• /
• 2010

In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method-the expectation-sparse-maximization (ESpaM) algorithm-for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.88-97
• /
• 2013

Most of the traditional spectrum sensing methods consider only the current detected data sets of Primary User (PU). However previous state of PU is a kind of conditional probability that strengthens the reliability of the detector. Therefore, in the cross entropy spectrum sensing method, relationship of the previous and current spectrum sensing is considered to detect PU signal more effectively. But these cross entropy spectrum sensing methods only consider the ideal system. In other words, PU always occupy the channel during the same period. However, PU can occupy the channel either for a longer or a shorter period than the ideal case in the real system. For this reason, the spectrum sensing performance can be varied. In this paper, we propose the method that can maintain the performance of spectrum sensing in the real system and we confirm the results with the help of simulation.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.4
• /
• pp.423-429
• /
• 2011

Cooperative spectrum sensing is proposed to overcome some problem such as multipath fading and shadowing and to improve spectrum sensing performance. There are different combining methods for cooperative spectrum sensing: hard decision method and soft decision method. In this paper, we analysis the performance of cooperative spectrum sensing with distance based weight that is kind of a soft decision rule for cognitive radio(CR) systems and CR systems sense the spectrum of the licensed user by using a energy detection method. Threshold is determined in accordance with the constant false alarm rate(CFAR) algorithm for energy detection. The signal of licensed user is OFDM signal and the wireless channel between a licensed user and CR systems is modeled as Gaussian channel. From the simulation results, the cooperative spectrum sensing with distance based weight combining(DWC) and equal gain combing(EGC) methods shows higher spectrum sensing performance than single spectrum sensing does. And the detection probability performance with the DWC is higher than that with the EGC.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.37-43
• /
• 2012

In this paper, we analysis wideband spectrum sensing with distance based weight combining for Cognitive Radio (CR) systems. CR systems is implemented the spectrum of the Primary User(PU) by using a energy detection method. Threshold is determined in accordance with the constant false alarm rate (CFAR) algorithm for energy detection. The signal of PU is BPSK signal and the wireless channel between a PU and CR systems is modeled as Gaussian channel. From the simulation results, the wideband sensing with distance based and Distance based weight Combing (DWC) methods shows higher spectrum sensing performance than single CR user spectrum sensing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3498-3511
• /
• 2016

We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.