The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing schemes. Then we propose an integer optimization approach to minimize the average share size.

Much attention has recently been paid to sparsity-aware space-time adaptive processing (STAP) algorithms. The idea of sparsity-aware technology is commonly based on the convex l₁-norm penalty. However, some works investigate the l_q (0 < q < 1) penalty which induces more sparsity owing to its lack of convexity. We herein consider the design of an l_q penalized STAP processor with a generalized sidelobe canceler (GSC) architecture. The l_q cyclic descent (CD) algorithm is utilized with the least squares (LS) design criterion. It is validated through simulations that the l_q penalized STAP processor outperforms the existing l₁-based counterparts in both convergence speed and steady-state performance.

In this paper, we explore the relationship between Geometric Dilution of Precision (GDOP) and Cramer-Rao Bound (CRB) by tracing back to the original motivations for deriving these two indexes. In addition, the GDOP is served as a sensor-target geometric uncertainty analysis tool whilst the CRB is served as a statistical performance evaluation tool based on the sensor observations originated from target. And CRB is the inverse matrix of Fisher information matrix (FIM). Based on the original derivations for a same positioning application, we interpret their difference in a mathematical view to show that.

Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field F_q, we can construct a regular binary γq×q² matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.

In this letter, we propose an improved timing offset estimation scheme without making use of pilot symbols in the HomePlug Green PHY (HomePlug GP) standard. In contrast to the conventional decision-directed timing estimation scheme, the proposed scheme exploits the inherent repetition information of the HomePlug GP signals, thus not only removing the need for the estimated data or pilot symbols but also improving the timing estimation performance.

Interference alignment (IA) is a promising technology for eliminating interferences while it still achieves the optimal capacity scaling. However, in practical systems, the IA feasibility limit and the heavy signaling overhead obstructs employing IA to large-scale networks. In order to jointly consider these issues, we propose the feedback overhead-aware IA clustering algorithm which comprises two parts: adaptive feedback resource assignment and dynamic IA clustering. Numerical results show that the proposed algorithm offers significant performance gains in comparison with conventional approaches.

An uncorrelated asymmetric ZCZ (UA-ZCZ) sequence set is a special version of an asymmetric ZCZ (A-ZCZ) sequence set, which contains multiple subsets and each subset is a typical ZCZ sequence set. One of the most important properties of UA-ZCZ sequnence set is that two arbitrary sequences from different sequence subsets are uncorrelated sequences, whose cross-correlation function (CCF) is zeros at all shifts. Based on interleaved technique and an uncorrelated sequence set, a new UA-ZCZ sequence set is obtained via interleaving a perfect sequence. The uncorrelated property of the UA-ZCZ sequence sets is expected to be useful for avoiding inter-cell interference of QS-CDMA systems.

An interference-aware dynamic channel assignment scheme is proposed with consideration of co-tier interference for the downlink of an OFDMA/FDD based dense small-cell network. The proposed scheme adaptively assigns subchannels to the small-cell user equipment (SUE) according to the given traffic load and interference effect from neighbor small-cell access points. The simulation results show that the proposed scheme outperforms the other schemes based on the graph coloring algorithm in terms of the mean SUE capacity.