In this letter, motivated by the research of Tian et al., two constructions of asymptotically optimal codebooks in regard to the Welch bound with additive and multiplicative characters are provided. The parameters of constructed codebooks are new, which are different from those in the letter of Tian et al.

Effective user accommodation will be more and more important in passive optical networks (PONs) in the next decade since the number of subscribers has been leveling off as well and it is becoming more difficult for network operators to keep sufficient numbers of maintenance workers. Drastically reducing the number of small-scale communication buildings while keeping the number of accommodated users is one of the most attractive solutions to meet this situation. To achieve this, we propose two types of long-reach repeater-free upstream transmission configurations for PON systems; (i) one utilizes a semiconductor optical amplifier (SOA) as a pre-amplifier and (ii) the other utilizes distributed Raman amplification (DRA) in addition to the SOA. Our simulations assuming 10G-EPON specifications and transmission experiments on a 10G-EPON prototype confirm that configuration (i) can add a 17km trunk fiber to a normal PON system with 10km access reach and 1 : 64 split (total 27km reach), while configuration (ii) can further expand the trunk fiber distance to 37km (total 47km reach). Network operators can select these configurations depending on their service areas.

A high degree of freedom in spectral domain allows us to accommodate additional optical signal processing for wavelength division multiplexing in photonic analog-to-digital conversion. We experimentally verified a spectral compression to save a necessary bandwidth for soliton self-frequency shift based optical quantization through the cascade of the four-wave mixing based and the sum-frequency generation based spectral compression. This approach can realize 0.03 nm individual bandwidth correspond to save up to more than 85 percent of bandwidth for 7-bit optical quantization in C-band.

In this letter, the structural analysis of nonbinary cyclic and quasi-cyclic (QC) low-density parity-check (LDPC) codes with α-multiplied parity-check matrices (PCMs) is concerned. Using analytical methods, several structural parameters of nonbinary cyclic and QC LDPC codes with α-multiplied PCMs are determined. In particular, some classes of nonbinary LDPC codes constructed from finite fields and finite geometries are shown to have good minimum and stopping distances properties, which may explain to some extent their wonderful decoding performances.

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.

Mode-by-mode impulse responses, or spectral transfer matrix (STM) of birefringent fibers are measured by using linear optical sampling, with assist of polarization multiplexed probe pulse. By using the eigenvalue analysis of the STM, the differential mode delay and PMD vector of polarization-maintaining fiber are analyzed as a function of optical frequency over 1THz. We show that the amplitude averaging of the complex impulse responses is effective for enhancing the signal-to-noise ratio of the measurement, resulting in improving the accuracy and expanding the bandwidth of the measurement.

This paper proposes two algorithms, namely Server-User Matching (SUM) algorithm and Extended Server-User Matching (ESUM) algorithm, for the distributed server allocation problem. The server allocation problem is to determine the matching between servers and users to minimize the maximum delay, which is the maximum time to complete user synchronization. We analyze the computational time complexity. We prove that the SUM algorithm obtains the optimal solutions in polynomial time for the special case that all server-server delay values are the same and constant. We provide the upper and lower bounds when the SUM algorithm is applied to the general server allocation problem. We show that the ESUM algorithm is a fixed-parameter tractable algorithm that can attain the optimal solution for the server allocation problem parameterized by the number of servers. Numerical results show that the computation time of ESUM follows the analyzed complexity while the ESUM algorithm outperforms the approach of integer linear programming solved by our examined solver.

At ASIACRYPT 2018, Castryck, Lange, Martindale, Panny and Renes proposed CSIDH, which is a key-exchange protocol based on isogenies between elliptic curves, and a candidate for post-quantum cryptography. However, the implementation by Castryck et al. is not constant-time. Specifically, a part of the secret key could be recovered by the side-channel attacks. Recently, Meyer, Campos, and Reith proposed a constant-time implementation of CSIDH by introducing dummy isogenies and taking secret exponents only from intervals of non-negative integers. Their non-negative intervals make the calculation cost of their implementation of CSIDH twice that of the worst case of the standard (variable-time) implementation of CSIDH. In this paper, we propose a more efficient constant-time algorithm that takes secret exponents from intervals symmetric with respect to the zero. For using these intervals, we need to keep two torsion points on an elliptic curve and calculation for these points. We evaluate the costs of our implementation and that of Meyer et al. in terms of the number of operations on a finite prime field. Our evaluation shows that our constant-time implementation of CSIDH reduces the calculation cost by 28% compared with the implementation by Mayer et al. We also implemented our algorithm by extending the implementation in C of Meyer et al. (originally from Castryck et al.). Then our implementation achieved 152 million clock cycles, which is about 29% faster than that of Meyer et al. and confirms the above reduction ratio in our cost evaluation.

Recently, intelligent heating, next generation microwave ovens that achieve uniform heating and spot heating using solid-state devices, has been actively studied. There are two types of microwave generators using solid-state devices. Since compactness is indispensable to accommodate in a limited space, the miniaturized oscillator type was selected. The authors proposed an imbalanced coupling resonator, a resonator-less feedback circuit, a high power frequency variable resonator, and injection-locked phase control in order to achieve high performance of the oscillator type microwave generator. In addition, we confirmed that the oscillator type can be used as the microwave generator for intelligent heating using a Wilkinson combiner. As a result, it was demonstrated that the oscillator type microwave generator, realized the same high efficiency (67%) as the amplifier type, and found the possibility of variable frequency (2.4 to 2.5GHz) and variable phase, and can be used as the microwave generator for intelligent heating.

One of key technologies in the fifth generation mobile communications is a distributed antenna system (DAS). As DAS creates tightly packed antenna arrangements, inter-user interference degrades its spectrum efficiency. Round-robin (RR) scheduling is known as a scheme that achieves a good trade-off between computational complexity and spectrum efficiency. This paper proposes a user equipment (UE) allocation scheme for RR scheduling. The proposed scheme offers low complexity as the phase of UE allocation sequences are predetermined. Four different phase selection criteria are compared in this paper. Numerical results obtained through computer simulation show that maximum selection, which sequentially searches for the phase with the maximum tentative throughput realizes the best spectrum efficiency next to full search. There is an optimum number of UEs which obtains the largest throughput in single-user allocation while the system throughput improves as the number of UEs increases in 2-user RR scheduling.

Hadoop is a popular data-analytics platform based on Google's MapReduce programming model. Hard-disk drives (HDDs) are generally used in big-data analysis, and the effectiveness of the Hadoop platform can be optimized by enhancing its I/O performance. HDD performance varies depending on whether the data are stored in the inner or outer disk zones. This paper proposes a method that utilizes the knowledge of job characteristics to realize efficient data storage in HDDs, which in turn, helps improve Hadoop performance. Per the proposed method, job files that need to be frequently accessed are stored in outer disk tracks which are capable of facilitating sequential-access speeds that are higher than those provided by inner tracks. Thus, the proposed method stores temporary and permanent files in the outer and inner zones, respectively, thereby facilitating fast access to frequently required data. Results of performance evaluation demonstrate that the proposed method improves Hadoop performance by 15.4% when compared to normal cases when file placement is not used. Additionally, the proposed method outperforms a previously proposed placement approach by 11.1%.

This paper proposes a deterministic pilot pattern placement optimization scheme based on the quantum genetic algorithm (QGA) which aims to improve the performance of sparse channel estimation in orthogonal frequency division multiplexing (OFDM) systems. By minimizing the mutual incoherence property (MIP) of the sensing matrix, the pilot pattern placement optimization is modeled as the solution of a combinatorial optimization problem. QGA is used to solve the optimization problem and generate optimized pilot pattern that can effectively avoid local optima traps. The simulation results demonstrate that the proposed method can generate a sensing matrix with a smaller MIP than a random search or the genetic algorithm (GA), and the optimized pilot pattern performs well for sparse channel estimation in OFDM systems.

The dispersion problem is a variant of the facility location problem. Given a set P of n points and an integer k, we intend to find a subset S of P with |S|=k such that the cost minp∈S{cost(p)} is maximized, where cost(p) is the sum of the distances from p to the nearest c points in S. We call the problem the dispersion problem with partial c sum cost, or the PcS-dispersion problem. In this paper we present two algorithms to solve the P2S-dispersion problem(c=2) if all points of P are on a line. The running times of the algorithms are O(kn2 log n) and O(n log n), respectively. We also present an algorithm to solve the PcS-dispersion problem if all points of P are on a line. The running time of the algorithm is O(knc+1).

In this paper, we propose a notion for high-dimensional generalizations of mutually orthogonal Latin squares (MOLS) and mutually orthogonal diagonal Latin squares (MODLS), called mutually dimensionally orthogonal d-cubes (MOC) and mutually dimensionally orthogonal diagonal d-cubes (MODC). Systematic constructions for MOC and MODC by using polynomials over finite fields are investigated. In particular, for 3-dimensional cubes, the results for the maximum possible number of MODC are improved by adopting the proposed construction.

Over the past two decades, irregular low-density parity-check (LDPC) codes have not been able to decode information corrupted by insertion and deletion (ID) errors without markers. In this paper, we bring to light the existence of irregular LDPC codes that approach the symmetric information rates (SIR) of the channel with ID errors, even without markers. These codes have peculiar shapes in their check-node degree distributions. Specifically, the check-node degrees are scattered and there are degree-2 check nodes. We propose a code construction method based on the progressive edge-growth algorithm tailored for the scattered check-node degree distributions, which enables the SIR-approaching codes to progress in the finite-length regime. Moreover, the SIR-approaching codes demonstrate asymptotic and finite-length performance that outperform the existing counterparts, namely, concatenated coding of irregular LDPC codes with markers and spatially coupled LDPC codes.

The direct sequence code division multiple access (DS-CDMA) technique is widely used in various communication systems. When adopting orthogonal variable spreading factor (OVSF) codes, DS-CDMA is particularly suitable for supporting multi-user/multi-rate data transmission services. A useful property of OVSF codes is that no two code sequences assigned to different users will ever interfere with each other, even if their spreading factors are different. Conventional OVSF codes are constructed based on binary orthogonal codes, called Walsh codes, and OVSF code sequences are binary sequences. In this paper, we propose new OVSF codes that are constructed based on polyphase orthogonal codes and consist of complex sequences in which each symbol is represented as a complex number. Construction of the proposed codes is based on a tree structure that is similar to conventional OVSF codes. Since the proposed codes are generalized versions of conventional OVSF codes, any conventional OVSF code can be presented as a special case of the proposed codes. Herein, we show the method used to construct the proposed OVSF codes, after which the orthogonality of the codes, including conventional OVSF codes, is investigated. Among the advantages of our proposed OVSF codes is that the spreading factor can be designed more flexibly in each layer than is possible with conventional OVSF codes. Furthermore, combination of the proposed code and a non-binary phase modulation is well suited to DS-CDMA systems where the level fluctuation of signal envelope is required to be suppressed.

This paper presents a large-angle imaging algorithm based on a dynamic scattering model for inverse synthetic aperture radar (ISAR). In this way, more information can be presented in an ISAR image than an ordinary RD image. The proposed model describes the scattering characteristics of ISAR target varying with different observation angles. Based on this model, feature points in each sub-image of the ISAR targets are extracted and matched using the scale-invariant feature transform (SIFT) and random sample consensus (RANSAC) algorithms. Using these feature points, high-precision rotation angles are obtained via joint estimation, which makes it possible to achieve a large angle imaging using the back-projection algorithm. Simulation results verifies the validity of the proposed method.

In the typical unmanned aircraft system (UAS), several unmanned aerial vehicles (UAVs) traveling at a velocity of 40-100km/h and with altitudes of 150-1,000m will be used to cover a wide service area. Therefore, Doppler shifts occur in the carrier frequencies of the transmitted and received signals due to changes in the line-of-sight velocity between the UAVs and the terrestrial terminal. By observing multiple Doppler shift values for different UAVs or observing a single UAV at different local times, it is possible to detect the user position on the ground. We conducted computer simulations for evaluating user position detection accuracy and Doppler shift distribution in several flight models. Further, a positioning accuracy index (PAI), which can be used as an index for position detection accuracy, was proposed as the absolute value of cosine of the inner product between two gradient vectors formed by Doppler shifts to evaluate the relationship between the location of UAVs and the position of the user. In this study, a maximum positioning error estimation method related to the PAI is proposed to approximate the position detection accuracy. Further, computer simulations assuming a single UAV flying on the curved routes such as sinusoidal routes with different cycles are conducted to clarify the effectiveness of the flight route in the aspects of positioning accuracy and latency by comparing with the conventional straight line fight model using the PAI and the proposed maximum positioning error estimation method.

A ring-resonator type of electrode (RRTE) has been proposed to detect the circulating tumor cell (CTC) for evaluation of the current cancer progression and malignancy in clinical applications. Main emphasis is placed on the identification sensitivity for the lossy materials that can be found in biomedical fields. At first, the possibility of the CTC detection was numerically considered to calculate the resonant frequency of the RRTE catching the CTC, and it was evident that the RRTE with the cell has the resonant frequency inherent in the cell featured by its complex permittivity. To confirm the numerical consideration, the BaTiO3 particle, whose size was similar to that of the CTC, was inserted in the RRTE instead of the CTC as a preliminary experiment. Next, the resonant frequencies of the RRTE with internal organs of the beef cattle such as liver, lung, and kidney were measured for evaluation of the lossy materials such as the CTC, and degraded Q curves were observed because the Q-factors inherent in the internal organs were usually low due to the poor loss tangents. To overcome such difficulty, the RRTE, the oscillator circuit consisting of the FET being added, was proposed to improve the identification sensitivity. Comparing the identification sensitivity of the conventional RRTE, it has been improved because the oscillation frequency spectrum inherent in an internal organ could be easily observed thanks to the oscillation condition with negative resistance. Thus, the validity of the proposed technique has been confirmed.

In this study, the transient characteristics on the super-steep subthreshold slope (SS) of a PN-body tied (PNBT) silicon-on-insulator field-effect transistor (SOI-FET) were investigated using technology computer-aided design and pulse measurements. Carrier charging effects were observed on the super-steep SS PNBT SOI-FET. It was found that the turn-on delay time decreased to nearly zero when the gate overdrive-voltage was set to 0.1-0.15 V. Additionally, optimizing the gate width improved the turn-on delay. This has positive implications for the low speed problems of this device. However, long-term leakage current flows on turn-off. The carrier lifetime affects the leakage current, and the device parameters must be optimized to realize both a high on/off ratio and high-speed operation.