26 September 2019 in IEEE Transactions on Vehicular Technology
This paper addresses the spectrum sensing problem in an orthogonal frequency-division multiplexing (OFDM) system based on machine learning. To adapt to signal-to-noise ratio (SNR) variations, we first formulate the sensing problem into a novel SNR-related multi-class classification problem. Then, we train a naive Bayes classifier (NBC), and propose a class-reduction assisted prediction method to reduce spectrum sensing time. We derive the performance bounds by translating the Bayes error rate into spectrum sensing error rate. Compared with the conventional methods, the proposed method is shown by simulation to achieve higher spectrum sensing accuracy, in particular at critical areas of low SNRs. It offers a potential solution to the hidden node problem.
1 January 2018 in IEEE Access
In this paper, blind channel order and signal to noise ratio (SNR) estimators based on time-varying autocorrelation function (TVAF) are proposed for orthogonal frequency division multiplexing systems. The TVAF of the received signal reveals clearly the inherent periodicity introduced by cyclic prefix (CP) and carries rich information of channel and additive noise. To investigate the relationships among the TVAF, channel order, and SNR, a newly close-form expression of the TVAF of the received signal is derived. Not only the CP-induced TVAF components but the channel-spread TVAF elements are employed to derive the proposed estimators. Specifically, the two kinds of the TVAF components are separate from the components superimposed by the additive noise, which enables optimal estimation performance even for the low SNR regime. Numerical results show that, in contrast with the alternative methods, the proposed estimators achieve significant performance gain in the low SNR regime, while hold competitive performance in the high SNR regime.
1 July 1998 in Physical Review C
A thick natural lead target has been bombarded with a 600 MeV beam. With the use of an online gas-thermochromatographic device the mercury isotopes produced as target residues were rapidly separated and collected. A special coincident measurement technique increased the sensitivity to detecting -delayed rays, resulting in the observation of six neutron-rich mercury isotopes . Here was created through an exotic multinucleon transfer process and was identified for the first time. The half-life of has been determined to be s, and four rays following its decays have been assigned. The measured thick-target average production cross sections of were analyzed together with the known cross section data related to the exit channels. It has been found that the independent cross sections from various reactions induced by lighter heavy-ion projectiles below , display a regular dependence, suggesting that the heavy neutron-rich target residues were produced mainly in quasielastic and deep inelastic multinucleon transfer processes. The half-life of has been determined to be min.
1 September 2007 in Journal of Environmental Informatics
1 January 2019 in International Journal of Electronics and Telecommunications
1 March 2018 in IEEE Access
Multi-user multiple input multiple output (MU-MIMO) is a basic technique which has been widely investigated for its ability to increase system capacity. However, the inter-user interference (IUI) is one of the obstacles to obtain system capacity. With the help of pre-coding technique, the IUI can be canceled or reduced at the base station (BS). Vector perturbation (VP) is one of the most celebrated precoding schemes that can approach system capacity. By perturbing users' data vector with a certain integer vector offset at the BS, the VP scheme can offer the users a higher effective signal-to-noise ratio. To reach the theory bound of VP, the BS has to select the optimal integer vector from all candidate integer vectors globally. This exhaustive search has been proved to be NP-hard, which is hard to be implemented. In this paper, we analyze several state-of-the-art modified low-complexity VP schemes and propose the subset VP (SVP) scheme to reduce the complexity of the VP. The basic principle of the SVP is that some vectors are selected as the optimal vector with high probability, whereas the others are scarcely selected. So, we try to form a subset consists of vectors with a relatively higher probability. First, we calculate the probability of all candidate vectors which have been selected as the optimal vector. Second, we propose a method to divide all vectors into several subgroups. Vectors in the same subgroup have a similar probability, whereas vectors in different subgroups have distinguished probability. Third, we build a subset that is comprised of several subgroups in which vectors have a relatively higher probability. Simulation results show that we get almost the same bit-error rate performance with a significant complexity reduction.