Synthetic aperture radar (SAR) is a device for observing the ground surface and is one of the important technologies in the field of microwave remote sensing. In SAR observation, a platform equipped with a small-aperture antenna flies in a straight line and continuously radiates pulse waves to the ground during the flight. After that, by synthesizing the series of observation data obtained during the flight, one realize high-resolution ground surface observation. In SAR observation, there are two spatial resolutions defined in the range and azimuth directions and they are limited by the bandwidth of the SAR system. The purpose of this study is to improve the resolution of SAR by sparse reconstruction. In particular, we aim to improve the resolution of SAR without changing the frequency parameters. In this paper, we propose to improve the resolution of SAR using the deconvolution iterative shrinkage-thresholding algorithm (ISTA) and verify the proposed method by carrying out an experimental analysis using an actual SAR dataset. Experimental results show that the proposed method can improve the resolution of SAR with low computational complexity.

This paper proposes a multibeam digital predistorter (DPD) that suppresses intercarrier interference caused by nonlinear distortions of power amplifiers (PAs) while reducing the power consumption of a multibeam array antenna transmitter. The proposed DPD reduces power consumption by allowing the final PAs of the array antenna transmitter to operate in a highly efficient nonlinear mode and compensating for the nonlinear distortions of the PAs with a unified dedicated DPD per subarray. Additionally, it provides the required high-quality signal transmission for high throughputs, such as realizing a 256-quadrature amplitude modulation (QAM) transmission instead of a 64-QAM transmission. Specifically, it adds an inverse-component signal to cancel the interference from an adjacent carrier of another beam. Consequently, it can suppress the intercarrier interference in the beam direction and improve the error vector magnitude (EVM) during the multibeam transmission, in which the frequency bands of the beams are adjacent. The experimental results obtained for two beams at 28.0 and 28.4GHz demonstrate that, compared with the previous single-beam DPD, the proposed multibeam DPD can improve the EVM. Also, they demonstrate that the proposed DPD can achieve an EVM value of <3%, which completely satisfies the 3GPP requirements for a 256-QAM transmission.

Annealing computation has recently attracted attention as it can efficiently solve combinatorial optimization problems using an Ising spin-glass model. Stochastic cellular automata annealing (SCA) is a promising algorithm that can realize fast spin-update by utilizing its parallel computing capability. However, in SCA, pinning effect control to suppress the spin-flip probability is essential, making escaping from local minima more difficult than serial spin-update algorithms, depending on the problem. This paper proposes a novel approach called APC-SCA (Autonomous Pinning effect Control SCA), where the pinning effect can be controlled autonomously by focusing on individual spin-flip. The evaluation results using max-cut, N-queen, and traveling salesman problems demonstrate that APC-SCA can obtain better solutions than the original SCA that uses pinning effect control pre-optimized by a grid search. Especially in solving traveling salesman problems, we confirm that the tour distance obtained by APC-SCA is up to 56.3% closer to the best-known compared to the conventional approach.

Canonical decomposition for bipartite graphs, which was introduced by Fouquet, Giakoumakis, and Vanherpe (1999), is a decomposition scheme for bipartite graphs associated with modular decomposition. Weak-bisplit graphs are bipartite graphs totally decomposable (i.e., reducible to single vertices) by canonical decomposition. Canonical decomposition comprises series, parallel, and K+S decomposition. This paper studies a decomposition scheme comprising only parallel and K+S decomposition. We show that bipartite graphs totally decomposable by this decomposition are precisely P6-free chordal bipartite graphs. This characterization indicates that P6-free chordal bipartite graphs can be recognized in linear time using the recognition algorithm for weak-bisplit graphs presented by Giakoumakis and Vanherpe (2003).

We thank Kamata et al. (2023) [1] for their interest in our work [2], and for providing an explanation of the quasi-linear kernel from a viewpoint of multiple kernel learning. In this letter, we first give a summary of the quasi-linear SVM. Then we provide a discussion on the novelty of quasi-linear kernels against multiple kernel learning. Finally, we explain the contributions of our work [2].

Multi-core fiber (MCF) is one of the promising space-division multiplexing technologies to increase the capacity of optical networks. MCF-based networks have two challenges. One is the inter-core crosstalk (XT) that degrades the quality of optical signals in two neighboring fiber cores. The other is network protection against link failures that cause massive data loss. One way to protect against multiple link failures is to prepare physically separated links as a backup network. Probabilistic protection improves the efficiency of protection by allowing a certain probability of protection failure. Existing studies on backup network design with probabilistic protection do not target MCF-based networks, which raises problems such as protection failure due to the inter-core XT and excessive consumption of optical resources. To address these problems, this paper proposes a XT-aware backup network design model for the MCF optical path networks. The proposed model protects the network against probabilistic multiple link failures. We adopt probabilistic protection that allows a certain probability of protection failure due to the inter-core XT and minimizes the required number of links in the backup network. We present an algorithm to satisfy the probabilistic protection requirement and formulate the model as an integer linear programming problem. We develop a heuristic approach to apply the proposed model to larger networks. Numerical results observe that the proposed model requires fewer links than the dedicated allocation model, which provisions the backup paths in the same manner as the primary paths.

This study proposed a novel decoupling method for four planar inverted-F antennas (PIFAs) operating at 2.0GHz (f0). The edge-to-edge and center-to-center spacings of the adjacent PIFAs are extremely small (0.05λ0 and 0.17λ0, respectively), resulting in strong mutual coupling among them. In our previous study, we proposed a structure consisting of parasitic elements (PEs) and a bridge line (BL) for the decoupling of two PIFAs. One attractive feature of the proposed method is that no adjustment of the original structure and size of the PIFAs is necessary. However, as the number of PIFAs increases to four, their decoupling becomes considerably more complicated, and impedance mismatch is also an issue to be considered. Therefore, in this study, PEs and BLs are functionally developed to simultaneously achieve low mutual coupling and improved impedance matching of the four PIFAs. The simulated results showed that loading the proposed PEs and BLs onto the four PIFAs could reduce as well as maintain all mutual coupling for less than -10dB, and simultaneously improve impedance matching. Therefore, the total antenna efficiency at 2.0GHz could be significantly improved from 64.2% to 84.8% for PIFA1 and PIFA4, and from 35.9% to 74.2% for PIFA2 and PIFA3. Four PIFAs with PEs and BLs were fabricated and measured to validate the simulation results.

This paper presents a power amplifier (PA) designed as a part of a transceiver front-end fabricated in 130-nm SiGe BiCMOS. The PA shares its output antenna port with a low noise amplifier using a low-loss transmission/reception switch. The output matching network of the PA is designed to provide high output power, low AM-AM distortion, and uniform performance over frequencies in the range of 24.25-29.5GHz. Measurements of the front-end in TX mode demonstrate peak S21 of 30.3dB at 26.7GHz, S21 3-dB bandwidth of 9.8GHz from 22.2to 32.0GHz, and saturated output power (Psat) above 20dBm with power-added efficiency (PAE) above 22% from 24 to 30GHz. For a 64-QAM 400MHz bandwidth orthogonal frequency division multiplexing (OFDM) signal, -25dBc error vector magnitude (EVM) is measured at an average output power of 12.3dBm and average PAE of 8.8%. The PA achieves a competitive ITRS FoM of 92.9.

This paper proposes a dual-polarized filtering antenna with extracted-pole unit (EPU) using LTCC substrate. The EPU realizes the high skirt characteristic of the bandpass filter with transmission zeros (TZs) located near the passband without cross coupling. The filtering antenna with EPU is designed and fabricated in 28GHz band for 5G Band-n257 (26.5-29.5GHz). The measured S11 is less than -10.6dB in Band-n257, and the isolation between two ports for dual polarization is greater than 20.0dB. The measured peak antenna gain is 4.0dBi at 28.8GHz and the gain is larger than 2.5dBi in Band-n257. The frequency characteristics of the measured antenna gain shows the high skirt characteristic out of band, which are in good agreement with electromagnetic (EM)-simulated results.

In this paper, we applied the circuit synthesis theory of filters to the design of transmission-type metasurface cells and arbitrarily designed the amplitude and phase of the transmission and reflection by adjusting the resonant frequency and coupling coefficient. In addition, we successfully designed the phase of the unit cell by using the frequency conversion of filter theory. Moreover, we designed a refractive transmission-type metasurface plate with a novel cell structure that reacts to both polarizations. The prototype operated at the desired refraction angle, confirming the design theory.

Indoor free space optical (FSO) communication technology that provides high-speed connectivity to edge users is expected to be introduced in the near future mobile communication system, where the silicon photonics solid-state beam scanning device is a promising tool because of its low cost, long-term reliability, and other beneficial properties. However, the current two-dimensional beam scanning devices using grating coupler arrays have difficulty in increasing the transmission capacity because of bandwidth regulation. To solve the problem, we have introduced a broadband surface optical coupler, “elephant coupler,” which has great potential for combining wavelength and spatial division multiplexing technologies into the beam scanning device, as an alternative to grating couplers. The prototype port-selective silicon beam scanning device fabricated using a 300 mm CMOS pilot line achieved broadband optical beam emission with a 1 dB-loss bandwidth of 40 nm and demonstrated beam scanning using an imaging lens. The device has also exhibited free-space signal transmission of non-return-to-zero on-off-keying signals at 10 Gbps over a wide wavelength range of 60 nm. In this paper, we present an overview of the developed beam scanning device. Furthermore, the theoretical design guidelines for indoor mobile FSO communication are discussed.

We propose a novel mode-multiplexed light source using angularly-multiplexed volume holograms. Mode division multiplexing beams can be generated from a simple transmitter that is made of a laser array, single lens, and volume holograms. Hologram media has low recording sensitivity; hence, using holograms in the communication band is difficult. However, a dual wavelength method that uses different wavelengths for recording and reading holograms can realize the volume holograms for the infrared region. The volume holograms for three spatial mode multiplexing are formed using a compact Michelson interferometer type recording setup; simultaneous generations of three modes were demonstrated using a fiber array or vertical cavity surface emitting laser array with the volume holograms. A low loss coupling of three modes to few-mode-fiber can be achieved through the precise design and recording of volume holograms. The simple and low-cost mode-multiplexed light source using the volume holograms has the potential to broaden the application of MDM.

The Variational Quantum Eigensolver (VQE) algorithm is gaining interest for its potential use in near-term quantum devices. In the VQE algorithm, parameterized quantum circuits (PQCs) are employed to prepare quantum states, which are then utilized to compute the expectation value of a given Hamiltonian. Designing efficient PQCs is crucial for improving convergence speed. In this study, we introduce problem-specific PQCs tailored for optimization problems by dynamically generating PQCs that incorporate problem constraints. This approach reduces a search space by focusing on unitary transformations that benefit the VQE algorithm, and accelerate convergence. Our experimental results demonstrate that the convergence speed of our proposed PQCs outperforms state-of-the-art PQCs, highlighting the potential of problem-specific PQCs in optimization problems.

Existing simple routing protocols (e.g., OSPF, RIP) have some disadvantages of being inflexible and prone to congestion due to the concentration of packets on particular routers. To address these issues, packet routing methods using machine learning have been proposed recently. Compared to these algorithms, machine learning based methods can choose a routing path intelligently by learning efficient routes. However, machine learning based methods have a disadvantage of training time overhead. We thus focus on a lightweight machine learning algorithm, OS-ELM (Online Sequential Extreme Learning Machine), to reduce the training time. Although previous work on reinforcement learning using OS-ELM exists, it has a problem of low learning accuracy. In this paper, we propose OS-ELM QN (Q-Network) with a prioritized experience replay buffer to improve the learning performance. It is compared to a deep reinforcement learning based packet routing method using a network simulator. Experimental results show that introducing the experience replay buffer improves the learning performance. OS-ELM QN achieves a 2.33 times speedup than a DQN (Deep Q-Network) in terms of learning speed. Regarding the packet transfer latency, OS-ELM QN is comparable or slightly inferior to the DQN while they are better than OSPF in most cases since they can distribute congestions.

An interconnection network is an inevitable component for constructing parallel computers. It connects computation nodes so that the nodes can communicate with each other. As a parallel computation essentially requires inter-node communication according to a parallel algorithm, the interconnection network plays an important role in terms of communication performance. This paper focuses on the collective communication that is frequently performed in parallel computation and this paper addresses the Cup-Stacking method that is proposed in our preceding work. The key issues of the method are splitting a large packet into slices, re-shaping the slice, and stacking the slices, in a genetic algorithm (GA) manner. This paper discusses extending the Cup-Stacking method by introducing additional items (genes) and proposes the extended Cup-Stacking method. Furthermore, this paper places comprehensive discussions on the drawbacks and further optimization of the method. Evaluation results reveal the effectiveness of the extended method, where the proposed method achieves at most seven percent improvement in duration time over the former Cup-Stacking method.

A multifunctional radar (MFR) with varying pulse sequences can change its signal characteristics and/or pattern, based on the presence of targets and to avoid being jammed. To take a countermeasure against an MFR, it is crucial for an electronic warfare (EW) system to be able to identify and separate a MFR's modes via analyzing intercepted radar signals, without a priori knowledge. In this article, two correlation-based methods, one taking the signal's order into account and another one ignoring the signal's order, are proposed and investigated for this task. The results demonstrate their great potential.

We assess how well the recently created MRI reconstruction technique, Multi-Resolution Convolutional Neural Network (MRCNN), performs in the core medical vision field (classification). The primary goal of MRCNN is to identify the best k-space undersampling patterns to accelerate the MRI. In this study, we use the Figshare brain tumor dataset for MRI classification with 3064 T1-weighted contrast-enhanced MRI (CE-MRI) over three categories: meningioma, glioma, and pituitary tumors. We apply MRCNN to the dataset, which is a method to reconstruct high-quality images from under-sampled k-space signals. Next, we employ the pre-trained VGG16 model, which is a Deep Neural Network (DNN) based image classifier to the MRCNN restored MRIs to classify the brain tumors. Our experiments showed that in the case of MRCNN restored data, the proposed brain tumor classifier achieved 92.79% classification accuracy for a 10% sampling rate, which is slightly higher than that of SRCNN, MoDL, and Zero-filling methods have 91.89%, 91.89%, and 90.98% respectively. Note that our classifier was trained using the dataset consisting of the images with full sampling and their labels, which can be regarded as a model of the usual human diagnostician. Hence our results would suggest MRCNN is useful for human diagnosis. In conclusion, MRCNN significantly enhances the accuracy of the brain tumor classification system based on the tumor location using under-sampled k-space signals.

The diffusion model has achieved success in generating and editing high-quality images because of its ability to produce fine details. Its superior generation ability has the potential to facilitate more detailed segmentation. This study presents a novel approach to segmentation tasks using an inverse heat dissipation model, a kind of diffusion-based models. The proposed method involves generating a mask that gradually shrinks to fit the shape of the desired segmentation region. We comprehensively evaluated the proposed method using multiple datasets under varying conditions. The results show that the proposed method outperforms existing methods and provides a more detailed segmentation.

Bandpass filters (BPFs) are very important to extract target signals and eliminate noise from the received signals. A BPF of which frequency characteristics is a sum of Gaussian functions is called the Gaussian mixture BPF (GMBPF). In this research, we propose to implement the GMBPF approximately by the sum of several frequency components of the sliding Fourier transform (SFT) or the attenuated SFT (ASFT). Because a component of the SFT/ASFT can be approximately realized using the finite impulse response (FIR) recursive filters, its calculation complexity does not depend on the length of the impulse response. The property makes GMBPF ideal for narrow bandpass filtering applications. We conducted experiments to demonstrate the advantages of the proposed GMBPF over FIR filters designed by a MATLAB function with regard to the computational complexity.

This paper proposes an accurate and efficient method to calculate probability distributions of pulse-shaped complex signals. We show that the distribution over the in-phase and quadrature-phase (I/Q) complex plane is obtained by a recursive probability mass function of the accumulator for a pulse-shaping filter. In contrast to existing analytical methods, the proposed method provides complex-plane distributions in addition to instantaneous power distributions. Since digital signal processing generally deals with complex amplitude rather than power, the complex-plane distributions are more useful when considering digital signal processing. In addition, our approach is free from the derivation of signal-dependent functions. This fact results in its easy application to arbitrary constellations and pulse-shaping filters like Monte Carlo simulations. Since the proposed method works without numerical integrals and calculations of transcendental functions, the accuracy degradation caused by floating-point arithmetic is inherently reduced. Even though our method is faster than Monte Carlo simulations, the obtained distributions are more accurate. These features of the proposed method realize a novel framework for evaluating the characteristics of pulse-shaped signals, leading to new modulation, predistortion and peak-to-average power ratio (PAPR) reduction schemes.