We experimentally evaluate the performance of a noncontact system that measures the heartbeat of a sleeping person. The proposed system comprises a pair of radar systems installed at two different positions. We use millimeter-wave ultra-wideband multiple-input multiple-output array radar systems and evaluate the performance attained in measuring the heart inter-beat interval and body movement. The importance of using two radar systems instead of one is demonstrated in this paper. We conduct three types of experiments; the first and second experiments are radar measurements of three participants lying on a bed with and without body movement, while the third experiment is the radar measurement of a participant actually sleeping overnight. The experiments demonstrate that the performance of the radar-based vital measurement strongly depends on the orientation of the person under test. They also show that the proposed system detects 70% of rolling-over movements made overnight.

The plain bend in a pair of differential transmission lines causes a path difference, which leads to differential-to-common mode conversion due to the phase difference. This conversion can cause serious common-mode noise issues. We previously proposed a tightly coupled asymmetrically tapered bend to suppress forward differential-to-common mode conversion and derived the constraint conditions for high-density wiring. To provide sufficient suppression of mode conversion, however, the additional correction was required to make the effective path difference vanish. This paper proposes a practical and straightforward design methodology by using a very tightly coupled bend (decreasing the line width and the line separation of the tightly coupled bend). Full-wave simulations below 20GHz demonstrated that sufficient suppression of the forward differential-to-common mode conversion is successfully achieved as designed. Measurements showed that our design methodology is effective.

Diffusion least-mean-square (LMS) is a method to estimate and track an unknown parameter at multiple nodes in a network. When the unknown vector has sparsity, the sparse promoting version of diffusion LMS, which utilizes a sparse regularization term in the cost function, is known to show better convergence performance than that of the original diffusion LMS. This paper proposes a novel choice of the coefficients involved in the updates of sparse diffusion LMS using the idea of message propagation. Moreover, we optimize the proposed coefficients with respect to mean-square-deviation at the steady-state. Simulation results demonstrate that the proposed method outperforms conventional methods in terms of the convergence performance.

This paper studies the infinite time horizon optimal control problem for continuous-time nonlinear systems. A completely model-free approximate optimal control design method is proposed, which only makes use of the real-time measured data from trajectories instead of a dynamical model of the system. This approach is based on the actor-critic structure, where the weights of the critic neural network and the actor neural network are updated sequentially by the method of weighted residuals. It should be noted that an external input is introduced to replace the input-to-state dynamics to improve the control policy. Moreover, strict proof of convergence to the optimal solution along with the stability of the closed-loop system is given. Finally, a numerical example is given to show the efficiency of the method.

Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot-placement problem is one of the combinatorial optimization problems, regarded as a quadratic assignment problem, which relates to the optimal logic-block placement in a digital circuit as well as optimal delivery planning. Here, we propose a mapping to the Ising model for solving a slot-placement problem with additional constraints, called a constrained slot-placement problem, where several item pairs must be placed within a given distance. Since the behavior of Ising machines is stochastic and we map the problem to the Ising model which uses the penalty method, the obtained solution does not always satisfy the slot-placement constraint, which is different from the conventional methods such as the conventional simulated annealing. To resolve the problem, we propose an interpretation method in which a feasible solution is generated by post-processing procedures. We measured the execution time of an Ising machine and compared the execution time of the simulated annealing in which solutions with almost the same accuracy are obtained. As a result, we found that the Ising machine is faster than the simulated annealing that we implemented.

The residue number system (RNS) is a method for representing an integer x as an n-tuple of its residues with respect to a given set of moduli. In RNS, addition, subtraction, and multiplication can be carried out by independent operations with respect to each modulus. Therefore, an n-fold speedup can be achieved by parallel processing. The main disadvantage of RNS is that we cannot efficiently compare the magnitude of two integers or determine the sign of an integer. Two general methods of comparison are to transform a number in RNS to a mixed-radix system or to a radix representation using the Chinese remainder theorem (CRT). We used the CRT to derive an equation approximating a value of x relative to M, the product of moduli. Then, we propose two algorithms that efficiently evaluate the equation and output a sign bit. The expected number of steps of these algorithms is of order n. The algorithms use a lookup table that is (n+3) times as large as M, which is reasonably small for most applications including cryptography.

Collecting and analyzing personal data is important in modern information applications. Though the privacy of data providers should be protected, the need to track certain data providers often arises, such as tracing specific patients or adversarial users. Thus, tracking only specific persons without revealing normal users' identities is quite important for operating information systems using personal data. It is difficult to know in advance the rules for specifying the necessity of tracking since the rules are derived by the analysis of collected data. Thus, it would be useful to provide a general way that can employ any data analysis method regardless of the type of data and the nature of the rules. In this paper, we propose a privacy-preserving data analysis construction that allows an authority to detect specific users while other honest users are kept anonymous. By using the cryptographic techniques of group signatures with message-dependent opening (GS-MDO) and public key encryption with non-interactive opening (PKENO), we provide a correspondence table that links a user and data in a secure way, and we can employ any anonymization technique and data analysis method. It is particularly worth noting that no “big brother” exists, meaning that no single entity can identify users who do not provide anomaly data, while bad behaviors are always traceable. We show the result of implementing our construction. Briefly, the overhead of our construction is on the order of 10 ms for a single thread. We also confirm the efficiency of our construction by using a real-world dataset.

This paper presents the first attribute-based signature (ABS) scheme in which the correspondence between signers and signatures is captured in an arithmetic model of computation. Specifically, we design a fully secure, i.e., adaptively unforgeable and perfectly signer-private ABS scheme for signing policies realizable by arithmetic branching programs (ABP), which are a quite expressive model of arithmetic computations. On a more positive note, the proposed scheme places no bound on the size and input length of the supported signing policy ABP's, and at the same time, supports the use of an input attribute for an arbitrary number of times inside a signing policy ABP, i.e., the so called unbounded multi-use of attributes. The size of our public parameters is constant with respect to the sizes of the signing attribute vectors and signing policies available in the system. The construction is built in (asymmetric) bilinear groups of prime order, and its unforgeability is derived in the standard model under (asymmetric version of) the well-studied decisional linear (DLIN) assumption coupled with the existence of standard collision resistant hash functions. Due to the use of the arithmetic model as opposed to the boolean one, our ABS scheme not only excels significantly over the existing state-of-the-art constructions in terms of concrete efficiency, but also achieves improved applicability in various practical scenarios. Our principal technical contributions are (a) extending the techniques of Okamoto and Takashima [PKC 2011, PKC 2013], which were originally developed in the context of boolean span programs, to the arithmetic setting; and (b) innovating new ideas to allow unbounded multi-use of attributes inside ABP's, which themselves are of unbounded size and input length.

In the design of electrical contacts, it is required to pursue a solution which satisfies simultaneously multi-objective (electrical, mechanical, and thermal) performances including conflicting requirements. Preference Set-Based Design (PSD) has been proposed as practical procedure of the fuzzy set-based design method. This brief paper newly attempts to propose a concurrent design method by PSD to electrical contact, specifically a design of a shape of cantilever in relay contacts. In order to reduce the calculation (and/or experimental) cost, this paper newly attempt to apply Design of Experiments (DoE) for meta-modeling to PSD. The number of the calculation for the meta-modeling can be reduced to $rac{1}{729}$ by using DoE. The design parameters (width and length) of a cantilever for drive an electrical contact, which satisfy required performance (target deflection), are obtained in ranges successfully by PSD. The validity of the design parameters is demonstrated by numerical modeling.

In this paper, we propose a WiFi-based indoor positioning system using a fingerprint method, whose database is constructed with estimated reference locations. The reference locations and their information, called data sets in this paper, are obtained by moving reference devices at a constant speed while gathering information of available access points (APs). In this approach, the reference locations can be estimated using the velocity without any precise reference location information. Therefore, the cost of database construction can be dramatically reduced. However, each data set includes some errors due to such as the fluctuation of received signal strength indicator (RSSI) values, the device-specific WiFi sensitivities, the AP installations, and removals. In this paper, we propose a method to merge data sets to construct a consistent database suppressing such undesired effects. The proposed approach assumes that the intervals of reference locations in the database are constant and that the fingerprint for each reference location is calculated from multiple data sets. Through experimental results, we reveal that our approach can achieve an accuracy of 80%. We also show a detailed discussion on the results related parameters in the proposed approach.

The notion of the signal-to-noise ratio (SNR), proposed by Guilley, et al. in 2004, is a property that attempts to characterize the resilience of (n, m)-functions F=(f1,...,fm) (cryptographic S-boxes) against differential power analysis. But how to study the signal-to-noise ratio for a Boolean function still appears to be an important direction. In this paper, we give a tight upper and tight lower bounds on SNR for any (balanced) Boolean function. We also deduce some tight upper bounds on SNR for balanced Boolean function satisfying propagation criterion. Moreover, we obtain a SNR relationship between an n-variable Boolean function and two (n-1)-variable decomposition functions. Meanwhile, we give SNR(f⊞g) and SNR(f⊡g) for any balanced Boolean functions f, g. Finally, we give a lower bound on SNR(F), which determined by SNR(fi) (1≤i≤m), for (n, m)-function F=(f1,f2,…,fm).

Aggregate signature (AS) schemes enable anyone to compress signatures under different keys into one. In sequential aggregate signature (SAS) schemes, the aggregate signature is computed incrementally by the sighers. Several trapdoor-permutation-based SAS have been proposed. In this paper, we give a constructions of SAS based on the first SAS scheme with lazy verification proposed by Brogle et al. in ASIACRYPT 2012. In Brogle et al.'s scheme, the size of the aggregate signature is linear of the number of the signers. In our scheme, the aggregate signature has constant length which satisfies the original ideal of compressing the size of signatures.

This paper provides theoretical analyses for maximum cyclic autocorrelation selection (MCAS)-based spectrum sensing techniques in cognitive radio networks. The MCAS-based spectrum sensing techniques are low computational complexity spectrum sensing in comparison with some cyclostationary detection. However, MCAS-based spectrum sensing characteristics have never been theoretically derived. In this study, we derive closed form solutions for signal detection probability and false alarm probability for MCAS-based spectrum sensing. The theoretical values are compared with numerical examples, and the values match well with each other.

In this paper, we propose a novel single-template strategy based on a mean template set and locally/globally weighted dynamic time warping (LG-DTW) to improve the performance of online signature verification. Specifically, in the enrollment phase, we implement a time series averaging method, Euclidean barycenter-based DTW barycenter averaging, to obtain a mean template set considering intra-user variability among reference samples. Then, we acquire a local weighting estimate considering a local stability sequence that is obtained analyzing multiple matching points of an optimal match between the mean template and reference sets. Thereafter, we derive a global weighting estimate based on the variable importance estimated by gradient boosting. Finally, in the verification phase, we apply both local and global weighting methods to acquire a discriminative LG-DTW distance between the mean template set and a query sample. Experimental results obtained on the public SVC2004 Task2 and MCYT-100 signature datasets confirm the effectiveness of the proposed method for online signature verification.

In inter-data center networks where high transmission capacity and spectral efficiency are required, a 16QAM format is deployed. On the other hand, in intra-data center networks, a PAM4 format is deployed to meet the demand for a simple and low-cost transceiver configuration. For a seamless and effective connection of such heterogeneous networks without using optical-electrical-optical conversion, an all-optical modulation format conversion technique is required. In this paper, we propose an all-optical PAM4 to 16QAM modulation format conversion using nonlinear optical loop mirror. The successful conversion operation from 2 × 26.6-Gbaud PAM4 signals to a 100-Gbps class 16QAM signal is verified by numerical simulation. Compared with an ideal 16QAM signal, the power penalty of the converted 16QAM signal can be kept within 0.51dB.

We developed a polarization-independent and reserved-band-less complementary spectral inverted optical phase conjugation (CSI-OPC) device using dual-band difference frequency generation based on highly efficient periodically poled LiNbO3 waveguide technologies. To examine the nonlinearity mitigation in a long-haul transmission using a large number of OPCs, we installed a CSI-OPC device in the middle of a pure silica core fiber-based recirculating loop transmission line with a length of 320km. First, we examined the fiber-input power tolerance after 5,120-km and 6,400-km transmission using 22.5-Gbaud PDM-16QAM 10-channel DWDM signals and found a Q-factor improvement of over 1.3dB along with enhanced power tolerance thanks to mitigating the fiber nonlinearity. We then demonstrated transmission distance extension using the CSI-OPC device. The use of multiple CSI-OPCs enables an obvious performance improvements attained by extending the transmission distance from 6,400km to 8,960km, which corresponds to applying the CSI-OPC device 28 times. Moreover, there was no Q-factor degradation for the link in a linear regime after applying the CSI-OPC device more than 16 times. These results demonstrate that the CSI-OPC device can improve the nonlinear tolerance of PDM-16QAM signals without an excess penalty.

We propose a new design approach to improve the computational efficiency of an optimal design of optical waveguide devices utilizing coupled mode theory (CMT) and a neural network (NN). Recently, the NN has begun to be used for efficient optimal design of optical devices. In this paper, the eigenmode analysis required in the CMT is skipped by using the NN, and optimization with an evolutionary algorithm can be efficiently carried out. To verify usefulness of our approach, optimal design examples of a wavelength insensitive 3dB coupler, a 1 : 2 power splitter, and a wavelength demultiplexer are shown and their transmission properties obtained by the CMT with the NN (NN-CMT) are verified by comparing with those calculated by a finite element beam propagation method (FE-BPM).

Impact of sampling frequency and the number of quantization bit of analog-to-digital conversion (ADC) in a direct detection lightwave system using Kramers-Kronig (KK) relation, which has been attracting attention in recent years, are numerically investigated. We studied the effect of spectral broadening caused by nonlinear operations (logarithm, square root) of the KK algorithm when the frequency gap (shift frequency) between the modulated signal and the optical tone is varied. We found that reception performances depend on both the ADC bandwidth and the relative positions of the optical tone and the spectrum. Spectral broadening caused by the logarithm operation of the KK algorithm is found to be the dominant factor of signal distortion in an ADC bandwidth limited system. We studied the effect of the number of quantization bit on the error vector magnitude (EVM) of KK relation based reception in a carrier-to-signal power ratio (CSPR) adjustable transmission system. We found that performances of KK relation based receiver can be improved by increasing the number of quantization bits. For minimum-phase-condition satisfied KK receiver, the required number of quantization bit was found to be 5 bits or more for detection of QPSK, 16-QAM and 64-QAM-modulated signal after 20-km transmission.

Wavelength division multiplexing (WDM) scheme is used widely in photonic metro-core networks. In a WDM network, wavelength continuity constraint is employed to simply construct relay nodes. This constraint reduces the wavelength usage efficiency of each link. To improve the same, an all-optical wavelength converter (AO-WC) has been attracting attention in recent years. In particular, an AO-WC is a key device because it enables simultaneous conversion of multiple wavelengths of signal lights to other wavelengths, independent of the modulation format. However, each AO-WC requires installation of multiple laser sources with narrow bandwidth because the lights emitted by the laser sources are used as pump lights when the wavelengths of the signal lights are converted by the four-wave mixing (FWM) process. To reduce the number of laser sources, we propose a remote pumped AO-WC, in which the laser sources of the pump lights are aggregated into several relay nodes. When the request for the wavelength conversion from the relay node without the laser source is conveyed, the relay node with the laser source transmits the pump light through the optical link. The proposed scheme enables reduction in the number of laser sources of the pump lights. Herein we analyze the distortion of the pump light by propagating it through the optical link We also evaluate the effect of the noise in optical amplifiers and nonlinearities in optical fibers using numerical simulations employing the representative parameters for a practical WDM network.

Capacitive coupling of line coded and DC-balanced digital signals is often used to eliminate steady bias current flow between the systems or components in various communication systems. A multi-layer ceramic chip capacitor is promising for the capacitor of very broadband signal coupling because of its high frequency characteristics expected from the downsizing of the chip recent years. The lower limit of the coupling bandwidth is determined by the capacitance while the higher limit is affected by the parasitic inductance associated with the chip structure. In this paper, we investigate the coupling characteristics up to millimeter wave frequencies by the measurement and simulations. A phenomenon has been found in which the change in the current distribution in the chip structure occur at high frequencies and the coupling characteristics are improved compared to the prediction based on the conventional equivalent circuit model. A new equivalent circuit model of chip capacitor that can express the effect of the improvement has been proposed.