Massive multiple-input multiple-output (MIMO) requires a large number (tens or hundreds) of base station antennas serving for much smaller number of terminals, with large gains in energy efficiency and spectral efficiency compared with traditional MIMO technology. Large scale antennas mean large scale radio frequency (RF) chains. Considering the plenty of power consumption and high cost of RF chains, antenna selection is necessary for Massive MIMO wireless communication systems in both transmitting end and receiving end. An energy efficient antenna selection algorithm based on convex optimization was proposed for Massive MIMO wireless communication systems. On the condition that the channel capacity of the cell is larger than a certain threshold, the number of transmit antenna, the subset of transmit antenna and servable mobile terminals (MTs) were jointly optimized to maximize energy efficiency. The joint optimization problem was proved in detail. The proposed algorithm is verified by analysis and numerical simulations. Good performance gain of energy efficiency is obtained comparing with no antenna selection.

Multiple-input multiple-output (MIMO) interference broadcast channel (IBC) plays an important role in the modern wireless communications. The upper bound of degrees of freedom (DoF) and its corresponding achievable schemes was investigated. However, all the achievable schemes require perfect channel state information at transmitters (CSIT). In absence of CSIT, the DoF value is still unknown. This article mainly focuses on the G-cell K-user MIMO IBC, where there are M antennas at each transmitter and N antennas at each receiver. The transmitters only know channel coherence time internals rather than the values of channel coefficients. The users in the same cell are assumed to be able to share the channel information. Based on a heterogeneous semi-staggered block fading model, a blind interference alignment (IA) scheme was proposed for this scenario. It is shown that when and , a total of DoF can be achieved. The inner bound is same with the decomposition DoF upper bound. Since the complexity is an important performance index to evaluate the achievable scheme, the quantitative analysis for the complexity is presented.

　A signal detection scheme was proposed for two-way relaying networks (TWRNs) using distributed differential space-time coding (DDSTC) under imperfect synchronization. Unlike most existing work perfect with synchronization assumed, a relative delay between the signals transmitted from both sources to the relay was considered. Since perfect channel state information (CSI) is difficult to be acquired in fast fading, the scenarios and computation complexity will be increased especially when there appear multiple relays, CSI is assumed unavailable at all nodes. Therefore, the article proposes a differential signal detection scheme based on estimating and cancelling the imperfect synchronization component in the received signal at the two source nodes, followed by a least square (LS) decoder. Simulations, using the Nakagami-m fading channel due to its versatile statistical distribution property, show that the proposed scheme for both source nodes are effective in suppressing the inter-symbol interference (ISI) caused by imperfect synchronization while neither the source nodes nor the relay nodes have any knowledge of CSI.

It’s well known that the mobile stations will comprise a wide range of radio access technologies (RAT), providing user with flexible and efficient access to multi-media service and high data rate communications. Although much work has been done for coexistence analysis between different systems base stations (BS), most of them have not addressed the interference within multi-mode terminal. Hence, for filling the gap,?The authors in the article present coexistence studyies of digital cellular system at 1 800 MHz (DCS1800) and time division duplex long term evolution (TDD-LTE) network in multi-mode terminal with multi-service provisioning. A new system model for coexistence was introduced and how deterministic analysis can be done within the terminal was explained. The interference evaluation model was given based on relations between reference sensitivity and signal-to-noise ratio (SNR), which is also deduced. The system simulation methodology was provided and assumption used in simulation was given. Simulation results were shown with different system parameters. Numeric results indicate that multi-mode terminal is mainly affected by local interference. The minimum antenna isolation required for a health system operation was provided.

　The orthogonal frequency division multiplexing (OFDM) is currently used in long term evolution (LTE) system. The time offset estimation (TOE) and frequency offset estimation (FOE) of OFDM is essential in mobile communication base. According to the conventional cross correlation TOE and FOE algorithms, a new cross correlation computation was proposed to estimate the time offset and frequency offset for LTE uplink system, so that the time offset and frequency offset can be estimated simultaneously with low complexity. Compared with the conventional TOE and FOE algorithms, the simulation show that the proposed can reduce complexity and improve performance for FOE with good performance for TOE in additive white Gaussian noise (AWGN) and multipath channel.

The key issue of original implementation for Gentry-style homomorphic encryption scheme is the so called slow key generation algorithm. Ogura proposed a key generation algorithm for Gentry-style somewhat homomorphic scheme that controlled the bound of the evaluation circuit depth by using the relation between the evaluation circuit depth and the eigenvalues of the primary matrix. However, their proposed key generation method seems to exclude practical application. In order to address this problem, a new key generation algorithm based on Gershgorin circle theorem was proposed. The authors choose the eigenvalues of the primary matrix from a desired interval instead of selecting the module. Compared with the Ogura’s work, the proposed key generation algorithm enables one to create a more practical somewhat homomorphic encryption scheme. Furthermore, a more aggressive security analysis of the approximate shortest vector problem (SVP) against lattice attacks is given. Experiments indicate that the new key generation algorithm is roughly twice as efficient as the previous methods.

　The ciphertext-policy (CP) attribute-based encryption (ABE) (CP-ABE) emergings as a promising technology for allowing users to conveniently access data in cloud computing. Unfortunately, it suffers from several drawbacks such as decryption overhead, user revocation and privacy preserving. The authors proposed a new efficient and privacy-preserving attribute-based broadcast encryption (BE) (ABBE) named EP-ABBE, that can reduce the decryption computation overhead by partial decryption, and protect user privacy by obfuscating access policy of ciphertext and user’s attributes. Based on EP-ABBE, a secure and flexible personal data sharing scheme in cloud computing was presented, in which the data owner can enjoy the flexibly of encrypting personal data using a specified access policy together with an implicit user index set. With the proposed scheme, efficient user revocation is achieved by dropping revoked user’s index from the user index set, which is with very low computation cost. Moreover, the privacy of user can well be protected in the scheme. The security and performance analysis show that the scheme is secure, efficient and privacy-preserving.

　The notion of the identity-based (id-based) strong designate verifier signature (SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors (LWE) problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution (SIS) problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than (3m+n) lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature (SDVRS) scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.

　Multiple heterogeneous wireless techniques, possibly administered by different entities, are coexisted in the rapidly-expanding communications market. In order to understand the complex interactions among different network service providers (NSPs), it is important to study the factors taken into consideration by users during their selections of the NSPs. The article focuses on interactions between macro-level dynamics of user subscription and the factors causing such dynamics. The key factor was discussed on the interactions between different subpopulations rather than the general factors such as quality of service (QoS). Guided by synergetic theory, a general mathematical description model was built. The influence of key factors on users’ selections was considered and analyzed. Some examples were presented to validate capabilities of the proposed model.

　A new concept of photonic crystal fiber (PCF) with high nonlinearity and flattened dispersion was designed. The PCF structure is indeed a hexagon lattice. The bigger air holes in the outer rings are used to confine the light field into the core region for enhancing the nonlinearity. The flattened dispersion can be achieved by adjusting the diameters of six smaller air holes in the first ring, and six micro air holes are inserted between smaller air holes for higher nonlinearity and the better flattened dispersion. By optimizing the size of the smaller and micro holes, the PCF can reach to high nonlinearity of 23.3 and the low dispersion of 51.32 ps/(nm·km) with the fluctuation range of 0.98 ps/(nm·km), which is within the wavelength range of 1 400 nm to 1 900 nm. The designed PCF can be used in important applications in realizing the Raman soliton self-frequency shift (RSSFS).

　To overcome particle impoverishment, a simultaneous localization and mapping (SLAM) method based on multi-agent particle swarm optimized particle filter (MAPSOPF) was presented by introducing the idea of multi-agent to the particle swarm optimized particle filter (PSOPF) which is an algorithm for SLAM. In MAPSOPF, agents can communicate and compete with each other and learn from each other. The MAPSOPF algorithm can update the prediction of particle, adjust the proposal distribution of particles, improve localization precision and fault tolerance, and propel the particles to concentrate on the robot's true pose. Compared with standard particle filter (PF), the proposed method can achieve better SLAM precision by fewer particles. Simulations verify its effectiveness and feasibility.

Internal wave parameter inversion based on Empirical Mode Decomposition 　Wind, the result of earth rotation and other processes，inaugurate the phenomenon of oceanic internal waves (OIWs), including driving turbulence, affecting nutrient and biomass distribution, and resuspending sediment. Therefore, a good understanding to OIWs’ characters becomes a vital component to enhance its monitoring and utilization. The parameter inversion was conducted in the article for the OIW based on the empirical mode decomposition (EMD) method. The experimental data, the advanced synthetic aperture radar (ASAR) image, was captured in Dongsha Islands surrounding area on July 22, 2011. Considering the formation mechanism of internal waves, two important issues in the EMD method—the curve fitting and end effects—were studied. After comparing different algorithms, the cubic spline interpolation (CSI) was used for curve fitting and the boundary full-wave (BFW) method was applied to inhibit the end effects. Used this inversion method, the internal wave signal was extracted from the ASAR image, the distance of the internal wave between peak and trough was calculated, and the half-width of soliton was obtained as well. In addition, the inversion result is consistent with the previous experimental findings, which indicates the effectiveness of our algorithm. 　

　This paper studies the behaviors of power amplifier (PA) driven by a single-carrier continuous wave (CW) signal and a two-carrier CW signal both in theory and simulation, and explains why the traditional dual-band PA failed to perform satisfactory results when a two-carrier CW signal is applied to, called concurrently. Besides that, an evaluation standard of concurrent dual-band PA was presented to value its performance. Solution was given with design and fabrication of a concurrent 1.85 GHz/2.65 GHz class F PA, employing a 10W GaN HEMT device from Cree, CGH40010, whose measurement shows the saturated output power is 40.6 dBm and 40.8dBm with drain efficiencies (DE) of 77.4% and 75.3% at 1.85 GHz and 2.65 GHz, respectively. On the other hand, we see that the peak DE achieves 59.7% with an output power of 39.9 dBm in concurrent mode, which follows up with the standard.

　Network failures are common on the Internet, and with mission-critical services widely applied, there grows demand for the Internet to maintain the performance in possibilities of failures. However, the border gateway protocol (BGP) can not react quickly to be recovered from them, which leads to unreliable packet delivery degrading the end-to-end performance. Although much solutions were proposed to address the problem, there exist limitations. The authors designed a software defined autonomous system (AS)-level fast rerouting (SD-FRR) to efficiently recover from interdomain link failures in the administrative domain. The approach leverages the principle of software defined networking (SDN) to achieve the centralized control of the entire network. By considering routing policies and BGP decision rules, an algorithm that can automatically find a policy-compliant protection path in case of link failure was proposed. The OpenFlow forwarding rules are installed on routers to ensure data forwarding. Furthermore, to deactivate the protection path, how to remove flow entries based on prefixes was proposed. Experiments show that the proposal provides effective failure recovery and does not introduce significant control overhead to the network.