Adaptive modulation is an efficient method to increase the spectral efficiency of OFDM based high-speed wireless data transmission systems in multipath channel. Blind modulation classification schemes play an important role in adaptive modulation systems, eliminating the need for transmitting modulation information, thereby increasing spectral efficiency. In this paper, a novel blind modulation classification algorithm is derived from the finite alphabet property of information symbols and the equivalent parallel model of OFDM systems. The performances of the proposed algorithm and M2M4P algorithm [1] are tested and compared using Monte-Carlo simulations. It is found that, the novel algorithm yields performance better than that of M2M4P algorithm and with much less complexity.

A novel approach of robust adaptive beamforming (RABF) is presented in this paper, aiming at robustness against both finite-sample effects and steering vector mismatches. It belongs to the class of diagonal loading approaches with the loading level determined based on worst-case performance optimization. The proposed approach, however, is distinguished by two points. (1) It takes finite-sample effects into account and applies worst-case performance optimization to not only the constraints, but also the objective of the constrained quadratic equation, for which it is referred to as joint worst-case RABF (JW-RABF). (2) It suggests a simple closed-form solution to the optimal loading after some approximations, revealing how different factors affect the loading. Compared with many existing methods in this field, the proposed one achieves better robustness in the case of small sample data size as well as steering vector mismatches. Moreover, it is less computationally demanding for presenting a simple closed-form solution to the optimal loading. Numerical examples confirm the effectiveness of the proposed approach.

In 2006, Miranda et al. proposed an anonymity scheme to achieve peers' anonymity in Peer-to-Peer (P2P) reputation systems. In this paper, we show that this scheme can not achieve peers' anonymity in two cases. We also propose an improvement which solves the problem and improves the degree of anonymity.