This paper introduces a wireless-powered relay transceiver designed to extend 5G millimeter-wave coverage. It employs an on-chip butler matrix, enabling beam control-free operation. The prototype includes PCB array antennas and on-chip butler matrix and rectifiers manufactured using a Si CMOS 65 nm process. The relay transceiver performs effectively in beam angles from -45° to 45°. In the 24 GHz wireless power transmission (WPT) mode, it generates 0.12 mW with 0 dBm total input power, boasting an RF-DC conversion efficiency of 12.2%. It also demonstrates communication performance at 28 GHz in both RX and TX modes with a 100 MHz bandwidth and 64QAM modulation.

During the COVID-19 pandemic, a robust system for masked face recognition has been required. Most existing solutions used many samples per identity for the model to recognize, but the processes involved are very laborious in a real-life scenario. Therefore, we propose “CPNet” as a suitable and reliable way of recognizing masked faces from only a few samples per identity. The prototype classifier uses a few-shot learning paradigm to perform the recognition process. To handle complex and occluded facial features, we incorporated the covariance structure of the classes to refine the class distance calculation. We also used sharpness-aware minimization (SAM) to improve the classifier. Extensive in-depth experiments on a variety of datasets show that our method achieves remarkable results with accuracy as high as 95.3%, which is 3.4% higher than that of the baseline prototype network used for comparison.

In this paper, we first recall the concept of 2-tuples distribution matrix, and further study its properties. Based on these properties, we find four special classes of 2-tuples distribution matrices. Then, we provide a new sufficient and necessary condition for n-variable rotation symmetric Boolean functions to be 2-correlation immune. Finally, we give a new method for constructing such functions when n=4t - 1 is prime, and we show an illustrative example.

In cyber-physical systems (CPSs) that interact between physical and information components, there are many sensors that are connected through a communication network. In such cases, the reduction of communication costs is important. Event-triggered control that the control input is updated only when the measured value is widely changed is well known as one of the control methods of CPSs. In this paper, we propose a design method of output feedback controllers with decentralized event-triggering mechanisms, where the notion of uniformly ultimate boundedness is utilized as a control specification. Using this notion, we can guarantee that the state stays within a certain set containing the origin after a certain time, which depends on the initial state. As a result, the number of times that the event occurs can be decreased. First, the design problem is formulated. Next, this problem is reduced to a BMI (bilinear matrix inequality) optimization problem, which can be solved by solving multiple LMI (linear matrix inequality) optimization problems. Finally, the effectiveness of the proposed method is presented by a numerical example.

Given an odd prime q and an integer m ≤ q, a binary mq × q2 quasi-cyclic parity-check matrix H(m, q) can be constructed for an array low-density parity-check (LDPC) code C (m, q). In this letter, we investigate the first separating redundancy of C (m, q). We prove that H (m, q) is 1-separating for any pair of (m, q), from which we conclude that the first separating redundancy of C (m, q) is upper bounded by mq. Then we show that our upper bound on the first separating redundancy of C (m, q) is tighter than the general deterministic and constructive upper bounds in the literature. For m=2, we further prove that the first separating redundancy of C (2, q) is 2q for any odd prime q. For m ≥ 3, we conjecture that the first separating redundancy of C (m, q) is mq for any fixed m and sufficiently large q.

In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian [Inf. Process. Lett., 87 (2003)].

In this article, a new Beamforming Network (BFN) realized in Broadside Coupled Stripline (BCS) is proposed to feed 1×4 and 2×2 arrays antenna at 28 GHZ-Band. The new BFN is composed only of couplers and phase shifters. It doesn't require any crossover compared to the conventional Butler Matrix (BM) which requires two crossovers. The tight coupling and low loss characteristics of the BCS allow a design of a compact and wideband BFN. The new BFN produces the phase differences of (±90°) and (±45°, ±135°) respectively in x- and y-directions. Its integration with a 1×4 linear array antenna reduces the array area by 70% with an improvement of the gain performance compared with the conventional array. The integration with a 2×2 array allows the realization of a full 2-D beam scanning. The proposed concept has been verified experimentally by measuring the fabricated prototypes of the BFN, the 1-D and 2-D patch arrays antennas. The measured 11.5 dBi and 11.3 dBi maximum gains are realized in θ0 = 14° and (θ0, φ0) = (45°,345°) directions respectively for the 1-D and 2-D patch arrays. The physical area of the fabricated BFN is only (0.37λ0×0.3λ0×0.08λ0), while the 1-D array and 2-D array antennas areas without feeding transmission lines are respectively (0.5λ0×2.15λ0×0.08λ0) and (0.9λ0×0.8λ0×0.08λ0).

In this paper, we propose a unified algebraic design of the generalized Moreau enhancement matrix (GME matrix) for the Linearly involved Generalized-Moreau-Enhanced (LiGME) model. The LiGME model has been established as a framework to construct linearly involved nonconvex regularizers for sparsity (or low-rank) aware estimation, where the design of GME matrix is a key to guarantee the overall convexity of the model. The proposed design is applicable to general linear operators involved in the regularizer of the LiGME model, and does not require any eigendecomposition or iterative computation. We also present an application of the LiGME model with the proposed GME matrix to a group sparsity aware least squares estimation problem. Numerical experiments demonstrate the effectiveness of the proposed GME matrix in the LiGME model.

The design and adjustment of the divergence in audio applications using nonnegative matrix factorization (NMF) is still open problem. In this study, to deal with this problem, we explore a representation of the divergence using neural networks (NNs). Instead of the divergence, our approach extends the multiplicative update algorithm (MUA), which estimates the NMF parameters, using NNs. The design of the extended MUA incorporates NNs, and the new algorithm is referred to as the deep MUA (DeMUA) for NMF. While the DeMUA represents the algorithm for the NMF, interestingly, the divergence is obtained from the incorporated NN. In addition, we propose theoretical guides to design the incorporated NN such that it can be interpreted as a divergence. By appropriately designing the NN, MUAs based on existing divergences with a single hyper-parameter can be represented by the DeMUA. To train the DeMUA, we applied it to audio denoising and supervised signal separation. Our experimental results show that the proposed architecture can learn the MUA and the divergences in sparse denoising and speech separation tasks and that the MUA based on generalized divergences with multiple parameters shows favorable performances on these tasks.

The estimation problem of structured clutter covariance matrix (CCM) in space-time adaptive processing (STAP) for airborne radar systems is studied in this letter. By employing the prior knowledge and the persymmetric covariance structure, a new estimation algorithm is proposed based on the whitening ability of the covariance matrix. The proposed algorithm is robust to prior knowledge of different accuracy, and can whiten the observed interference data to obtain the optimal solution. In addition, the extended factored approach (EFA) is used in the optimization for dimensionality reduction, which reduces the computational burden. Simulation results show that the proposed algorithm can effectively improve STAP performance even under the condition of some errors in prior knowledge.

In this paper, we present a novel discriminative dictionary learning (DDL) method for image classification. The local structural relationship between samples is first built by the Laplacian eigenmaps (LE), and then integrated into the basic DDL frame to suppress inter-class ambiguity in the feature space. Moreover, in order to improve the discriminative ability of the dictionary, the category label information of training samples is formulated into the objective function of dictionary learning by considering the discriminative promotion term. Thus, the data points of original samples are transformed into a new feature space, in which the points from different categories are expected to be far apart. The test results based on the real dataset indicate the effectiveness of this method.

This paper addresses an observer-design method only using data. Usually, the observer requires a mathematical model of a system for state prediction and observer gain calculation. As an alternative to the model-based prediction, the proposed predictor calculates the states using a linear combination of the given data. To design the observer gain, the data which represent dual systems are derived from the data which represent the original system. Linear matrix inequalities that depend on data of the dual system provides the observer gains.

In mobile communication systems, the channel state information (CSI) is severely affected by the noise effect of the receiver. The adaptive subcarrier grouping (ASG) for sample matrix inversion (SMI) based minimum mean square error (MMSE) adaptive array has been previously proposed. Although it can reduce the additive noise effect by increasing samples to derive the array weight for co-channel interference suppression, it needs to know the signal-to-noise ratio (SNR) in advance to set the threshold for subcarrier grouping. This paper newly proposes adaptive zero padding (AZP) in the time domain to improve the weight accuracy of the SMI matrix. This method does not need to estimate the SNR in advance, and even if the threshold is always constant, it can adaptively identify the position of zero-padding to eliminate the noise interference of the received signal. Simulation results reveal that the proposed method can achieve superior bit error rate (BER) performance under various Rician K factors.

The problem of Isomorphism of Polynomials (IP problem) is known to be important to study the security of multivariate public key cryptosystems, one of the major candidates of post-quantum cryptography, against key recovery attacks. In these years, several schemes based on the IP problem itself or its generalization have been proposed. At PQCrypto 2020, Santoso introduced a generalization of the problem of Isomorphism of Polynomials, called the problem of Blockwise Isomorphism of Polynomials (BIP problem), and proposed a new Diffie-Hellman type encryption scheme based on this problem with Circulant matrices (BIPC problem). Quite recently, Ikematsu et al. proposed an attack called the linear stack attack to recover an equivalent key of Santoso's encryption scheme. While this attack reduced the security of the scheme, it does not contribute to solving the BIPC problem itself. In the present paper, we describe how to solve the BIPC problem directly by simplifying the BIPC problem due to the conjugation property of circulant matrices. In fact, we experimentally solved the BIPC problem with the parameter, which has 256 bit security by Santoso's security analysis and has 72.7bit security against the linear stack attack, by about 10 minutes.

We attempt to design and fabricate of a 4×4 Butler matrix for short-millimeter-wave frequencies by using the microfabrication process for a polytetrafluoroethylene (PTFE) substrate-integrated waveguide (SIW) by the synchrotron radiation (SR) direct etching of PTFE and the addition of a metal film by sputter deposition. First, the dimensions of the PTFE SIW using rectangular through-holes for G-band (140-220 GHz) operation are determined, and a cruciform 90 ° hybrid coupler and an intersection circuit are connected by the PTFE SIW to design the Butler matrix. Then, a trial fabrication is performed. Finally, the validity of the design result and the fabrication process is verified by measuring the radiation pattern.

Adaptive multilooking is a critical processing step in multi-temporal interferometric synthetic aperture radar (InSAR) measurement, especially in small temporal baseline subsets. Various amplitude-based adaptive multilook approaches have been proposed for the improvement of interferometric processing. However, the phase signal, which is fundamental in interferometric systems, is typically ignored in these methods. To fully exploit the information in complex SAR images, a nonlocal adaptive multilooking is proposed based on complex covariance matrix in this work. The complex signal is here exploited for the similiarity measurement between two pixels. Given the complexity of objects in SAR images, structure feature detection is introduced to adaptively estimate covariance matrix. The effectiveness and reliability of the proposed approach are demonstrated with experiments both on simulated and real data.

The phenomenon known as social polarization, in which a social group splits into two or more groups, can cause division of the society by causing the radicalization of opinions and the spread of misinformation, is particularly significant in online communities. To develop technologies to mitigate the effects of polarization in online social networks, it is necessary to understand the mechanism driving its occurrence. There are some models of social polarization in which network structure and users' opinions change, based on the quantified opinions held by the users of online social networks. However, they are based on the interaction between users connected by online social networks. Current recommendation systems offer information from unknown users who are deemed to have similar interests. We can interpret this situation as being yielded non-local effects brought on by the network system, it is not based on local interactions between users. In this paper, based on the spectral graph theory, which can describe non-local effects in online social networks mathematically, we propose a model of polarization that user behavior and network structure change while influencing each other including non-local effects. We investigate the characteristics of the proposed model. Simultaneously, we propose an index to evaluate the degree of network polarization quantitatively, which is needed for our investigations.

Stance prediction on social media aims to infer the stances of users towards a specific topic or event, which are not expressed explicitly. It is of great significance for public opinion analysis to extract and determine users' stances using user-generated content on social media. Existing research makes use of various signals, ranging from text content to online network connections of users on these platforms. However, it lacks joint modeling of the heterogeneous information for stance prediction. In this paper, we propose a self-supervised heterogeneous graph contrastive learning framework for stance prediction in online debate forums. Firstly, we perform data augmentation on the original heterogeneous information network to generate an augmented view. The original view and augmented view are learned from a meta-path based graph encoder respectively. Then, the contrastive learning among the two views is conducted to obtain high-quality representations of users and issues. Finally, the stance prediction is accomplished by matrix factorization between users and issues. The experimental results on an online debate forum dataset show that our model outperforms other competitive baseline methods significantly.

A multibeam massive multiple input multiple output (MIMO) configuration employs beam selection with high power in the analog part and executes a blind algorithm such as the independent component analysis (ICA), which does not require channel state information in the digital part. Two-dimensional (2-D) multibeams are considered in actual power losses and beam steering errors regarding the multibeam patterns. However, the performance of these 2-D beams depends on the beam pattern of the multibeams, and they are not optimal multibeam patterns suitable for multibeam massive MIMO configurations. In this study, we clarify the performance difference due to the difference of the multibeam pattern and consider the multibeam pattern suitable for the system condition. Specifically, the optimal multibeam pattern was determined with the element spacing and beamwidth of the element directivity as parameters, and the effectiveness of the proposed method was verified via computer simulations.

Logical matrices are binary matrices often used to represent relations. In the map folding problem, each folded state corresponds to a unique partial order on the set of squares and thus could be described with a logical matrix. The logical matrix representation is powerful than graphs or other common representations considering its association with category theory and homology theory and its generalizability to solve other computational problems. On the application level, such representations allow us to recognize map folding intuitively. For example, we can give a precise mathematical description of a folding process using logical matrices so as to solve problems like how to represent the up-and-down relations between all the layers according to their adjacency in a flat-folded state, how to check self-penetration, and how to deduce a folding process from a given order of squares that is supposed to represent a folded state of the map in a mathematical and natural manner. In this paper, we give solutions to these problems and analyze their computational complexity.