-
Shuichi FUKUNAGA
Article type: LETTER
Article ID: 2023EAL2011
Published: 2023
Advance online publication: June 02, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The robust recursive identification method of ARX models is proposed using the beta divergence. The proposed parameter update law suppresses the effect of outliers using a weight function that is automatically determined by minimizing the beta divergence. A numerical example illustrates the efficacy of the proposed method.
View full abstract
-
Arne WINTERHOF
Article type: INVITED PAPER
Article ID: 2023SDI0001
Published: 2023
Advance online publication: May 31, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity, correlation measure of order k, expansion complexity and 2-adic complexity. The number-theoretic sequences are the Legendre sequence and the two-prime generator, the Thue-Morse sequence and its sub-sequence along squares, and the prime omega sequences for integers and polynomials.
View full abstract
-
Chaorong ZHANG, Yuyang PENG, Ming YUE, Fawaz AL-HAZEMI
Article type: LETTER
Article ID: 2023EAL2018
Published: 2023
Advance online publication: May 30, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
As a potential member of next generation wireless communications, the reconfigurable intelligent surface (RIS) can control the reflected elements to adjust the phase of the transmitted signal with less energy consumption. A novel RIS-assisted index modulation scheme is proposed in this paper, which is named the generalized reflected phase modulation (GRPM). In the GRPM, the transmitted bits are mapped into the reflected phase combination which is conveyed through the reflected elements on the RIS, and detected by the maximum likelihood (ML) detector. The performance analysis of the GRPM with the ML detector is presented, in which the closed form expression of pairwise error probability is derived. The simulation results show the bit error rate (BER) performance of GRPM by comparing with various RIS-assisted index modulation schemes in the conditions of various spectral efficiency and number of antennas.
View full abstract
-
Lin-Zhi SHEN, Yu-Jie WANG
Article type: LETTER
Article ID: 2023EAL2026
Published: 2023
Advance online publication: May 30, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
For an [n, k, d] (r, δ)-locally repairable codes ((r, δ)-LRCs) , its minimum distance d satisfies the Singleton-like bound. The construction of optimal (r, δ)-LRC, attaining this Singleton-like bound, is an important research problem in recent years for thier applications in distributed storage systems. In this letter, we use Reed-Solomon codes to construct two classes of optimal (r, δ)-LRCs. The optimal LRCs are given by the evaluations of multiple polynomials of degree at most r - 1 at some points in 𝔽q. The first class gives the [(r + δ - 1)t, rt - s, δ + s] optimal (r, δ)-LRC over 𝔽q provided that r + δ + s - 1 ≤ q, s ≤ δ, s < r, and any positive t. The code length is unbounded. The second class gives the [r +r' + d + δ - 2, r + r', d] optimal (r, δ)-LRC over 𝔽q provided that r - r' ≥ d - δ and r + d - 1 ≤ q + 1, which will produce optimal (r, δ)-LRCs with large minimum distance.
View full abstract
-
Masahiro KAMINAGA
Article type: LETTER
Article ID: 2023EAL2032
Published: 2023
Advance online publication: May 30, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
This paper shows that upper bounds on the coefficients of the shortest vector of a lattice can be represented using the smallest eigenvalue of the Gram matrix for the lattice, obtains its distribution for high-dimensional random Goldstein-Mayer lattice, and applies it to determine the percentage of zeros of coefficient vector.
View full abstract
-
Yu ZHOU, Jianyong HU, Xudong MIAO, Xiaoni DU
Article type: PAPER
Article ID: 2023EAP1009
Published: 2023
Advance online publication: May 24, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Low confusion coefficient values can make side-channel attacks harder for vector Boolean functions in Block cipher. In this paper, we give new results of confusion coefficient for f ⊞ g, f ⊡ g, f ⊕ g and fg for different Boolean functions f and g, respectively. And we deduce a relationship on the sum-of-squares of the confusion coefficient between one n-variable function and two (n - 1)-variable decomposition functions. Finally, we find that the confusion coefficient of vector Boolean functions is affine invariant.
View full abstract
-
Shinji FUKUMA, Yoshiro IWAI, Shin-ichiro MORI
Article type: PAPER
Article ID: 2023SMP0005
Published: 2023
Advance online publication: May 22, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
We propose a fine structure imaging for the surface and its inside of solid material such as coated drill bits with TiN (Titanium Nitride). We call this method i-MSE (innovative MSE) since the fine structure is visualized with a local mechanical strength (the local erosion rate) which is obtained from a set of erosion depth profiles measured with Micro Slurry-jet Erosion test (MSE). The local erosion rate at any sampling point is estimated from the depth profile using a sliding window regression and for the rest of the 2-dimensional points it is interpolated with the mean value coordinate technique. The interpolated rate is converted to a 2D image (i-MSE image) with a color map. The i-MSE image can distinguish layers if the testing material surface is composed of coats which have different resistance to erosion (erosive wear), while microscopic image such as SEM (Scanning Electron Microscope) and a calotest just provides appearance information, not physical characteristics. Experiments for some layered specimens show that i-MSE can be an effective tool to visualize the structure and to evaluate the mechanical characteristics for the surface and the inside of solid material.
View full abstract
-
Fuma SAWA, Yoshinori KAMIZONO, Wataru KOBAYASHI, Ittetsu TANIGUCHI, Hi ...
Article type: PAPER
Article ID: 2023SMP0006
Published: 2023
Advance online publication: May 22, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Advanced driver-assistance systems (ADAS) generally play an important role to support safe drive by detecting potential risk factors beforehand and informing the driver of them. However, if too many services in ADAS rely on visual-based technologies, the driver becomes increasingly burdened and exhausted especially on their eyes. The drivers should be back out of monitoring tasks other than significantly important ones in order to alleviate the burden of the driver as long as possible. In-vehicle auditory signals to assist the safe drive have been appealing as another approach to altering visual suggestions in recent years. In this paper, we developed an in-vehicle auditory signals evaluation platform in an existing driving simulator. In addition, using in-vehicle auditory signals, we have demonstrated that our developed platform has highlighted the possibility to partially switch from only visual-based tasks to mixing with auditory-based ones for alleviating the burden on drivers.
View full abstract
-
Lin LI, Jianhao HU
Article type: PAPER
Article ID: 2022EAP1132
Published: 2023
Advance online publication: May 19, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
For massive multiple-input multiple-output (MIMO) communication systems, simple linear detectors such as zero forcing (ZF) and minimum mean square error (MMSE) can achieve near-optimal detection performance with reduced computational complexity. However, such linear detectors always involve complicated matrix inversion, which will suffer from high computational overhead in the practical implementation. Due to the massive parallel-processing and efficient hardware-implementation nature, the neural network has become a promising approach to signal processing for the future wireless communications. In this paper, we first propose an efficient neural network to calculate the pseudo-inverses for any type of matrices based on the improved Newton's method, termed as the PINN. Through detailed analysis and derivation, the linear massive MIMO detectors are mapped on PINNs, which can take full advantage of the research achievements of neural networks in both algorithms and hardwares. Furthermore, an improved limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) quasi-Newton method is studied as the learning algorithm of PINNs to achieve a better performance/complexity trade-off. Simulation results finally validate the efficiency of the proposed scheme.
View full abstract
-
Asahi TAKAOKA
Article type: LETTER
Article ID: 2022EAL2103
Published: 2023
Advance online publication: May 17, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
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).
View full abstract
-
Atsushi MATSUO, Shigeru YAMASHITA, Daniel J. EGGER
Article type: PAPER
Article ID: 2022EAP1159
Published: 2023
Advance online publication: May 17, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Most quantum circuits require SWAP gate insertion to run on quantum hardware with limited qubit connectivity. A promising SWAP gate insertion method for blocks of commuting two-qubit gates is a predetermined swap strategy which applies layers of SWAP gates simultaneously executable on the coupling map. A good initial mapping for the swap strategy reduces the number of required swap gates. However, even when a circuit consists of commuting gates, e.g., as in the Quantum Approximate Optimization Algorithm (QAOA) or trotterized simulations of Ising Hamiltonians, finding a good initial mapping is a hard problem. We present a SAT-based approach to find good initial mappings for circuits with commuting gates transpiled to the hardware with swap strategies. Our method achieves a 65% reduction in gate count for random three-regular graphs with 500 nodes. In addition, we present a heuristic approach that combines the SAT formulation with a clustering algorithm to reduce large problems to a manageable size. This approach reduces the number of swap layers by 25% compared to both a trivial and random initial mapping for a random three-regular graph with 1000 nodes. Good initial mappings will therefore enable the study of quantum algorithms, such as QAOA and Ising Hamiltonian simulation applied to sparse problems, on noisy quantum hardware with several hundreds of qubits.
View full abstract
-
Yusuke MATSUOKA
Article type: LETTER
Article ID: 2023EAL2025
Published: 2023
Advance online publication: May 17, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this paper, a circuit based on a field programmable analog array (FPAA) is proposed for three types of chaotic spiking oscillator (CSO). The input/output conversion characteristics of a specific element in the FPAA can be defined by the user. By selecting the proper characteristics, three types of CSO are realized without changing the structure of the circuit itself. Chaotic attractors are observed in a hardware experiment. It is confirmed that the dynamics of the CSOs are consistent with numerical simulations.
View full abstract
-
Hojun SHIMOYAMA, Soh YOSHIDA, Takao FUJITA, Mitsuji MUNEYASU
Article type: PAPER
Article ID: 2023SMP0007
Published: 2023
Advance online publication: May 15, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Recent character detectors have been modeled using deep neural networks and have achieved high performance in various tasks, such as text detection in natural scenes and character detection in historical documents. However, existing methods cannot achieve high detection accuracy for wooden slips because of their multi-scale character sizes and aspect ratios, high character density, and close character-to-character distance. In this study, we propose a new U-Net-based character detection and localization framework that learns character regions and boundaries between characters. The proposed method enhances the learning performance of character regions by simultaneously learning the vertical and horizontal boundaries between characters. Furthermore, by adding simple and low-cost post-processing using the learned regions of character boundaries, it is possible to more accurately detect the location of a group of characters in a close neighborhood. In this study, we construct a wooden slip dataset. Experiments demonstrated that the proposed method outperformed existing character detection methods, including state-of-the-art character detection methods for historical documents.
View full abstract
-
Sei-ichiro Kamata, Tsunenori Mine
Article type: LETTER
Article ID: 2022EAL2051
Published: 2023
Advance online publication: May 08, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In 2014, the above paper entitled 'Quasi-Linear Support Vector Machine for Nonlinear Classification' was published by Zhou, et al. [1]. They proposed a quasi-linear kernel function for support vector machine (SVM). However, in this letter, we point out that this proposed kernel function is a part of multiple kernel functions generated by well-known multiple kernel learning which is proposed by Bach, et al. [2] in 2004. Since then, there have been a lot of related papers on multiple kernel learning with several applications [3]. This letter verifies that the main kernel function proposed by Zhou, et al. [1] can be derived using multiple kernel learning algorithms [3]. In the kernel construction, Zhou, et al. [1] used Gaussian kernels, but the multiple kernel learning had already discussed the locality of additive Gaussian kernels or other kernels in the framework [4][5]. Especially additive Gaussian or other kernels were discussed in tutorial at major international conference ECCV2012 [6]. The authors did not discuss these matters.
View full abstract
-
Bo ZHOU, Benhui CHEN, Jinglu HU
Article type: LETTER
Article ID: 2023EAL2006
Published: 2023
Advance online publication: May 08, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
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].
View full abstract
-
Toru HIRAOKA, Kanya GOTO
Article type: LETTER
Article ID: 2023EAL2012
Published: 2023
Advance online publication: May 08, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
We propose a non-photorealistic rendering method for automatically generating point-light-style (PLS) images from photographic images using peripheral difference filters with different window sizes. The proposed method can express PLS patterns near the edges of photographic images as dots. To verify the effectiveness of the proposed method, experiments were conducted to visually confirm PLS images generated from various photographic images.
View full abstract
-
Mashiho MUKAIDA, Yoshiaki UEDA, Noriaki SUETAKE
Article type: PAPER
Article ID: 2023SMP0003
Published: 2023
Advance online publication: April 21, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Recently, a lot of low-light image enhancement methods have been proposed. However, these methods have some problems such as causing fine details lost in bright regions and/or unnatural color tones. In this paper, we propose a new low-light image enhancement method to cope with these problems. In the proposed method, a pixel is represented by a convex combination of white, black, and pure color. Then, an equi-hue plane in RGB color space is represented as a triangle whose vertices correspond to white, black, and pure color. The visibility of low-light image is improved by applying a modified gamma transform to the combination coefficients on an equi-hue plane in RGB color space. The contrast of the image is enhanced by the histogram specification method using the histogram smoothed by a filter with a kernel determined based on a gamma distribution. In the experiments, the effectiveness of the proposed method is verified by the comparison with the state-of-the-art low-light image enhancement methods.
View full abstract
-
Xinghai Li, Shaofei Zang, Jianwei Ma, Xiaoyu Ma
Article type: PAPER
Article ID: 2022EAP1162
Published: 2023
Advance online publication: April 20, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
As an efficient classical machine learning classifier, the Softmax regression uses cross-entropy as the loss function. Therefore, it has high accuracy in classification. However, when there is inconsistency between the distribution of training samples and test samples, the performance of traditional Softmax regression models will degrade. A transfer discriminant Softmax regression model called Transfer Discriminant Softmax Regression with Weighted MMD (TDS-WMMD) is proposed in this paper. With this method, the Weighted Maximum Mean Divergence (WMMD) is introduced into the objective function to reduce the marginal distribution and conditional distribution between domains both locally and globally, realizing the cross domain transfer of knowledge. In addition, to further improve the classification performance of the model, Linear Discriminant Analysis (LDA) is added to the label iteration refinement process to improve the class separability of the designed method by keeping the same kind of samples together and the different kinds of samples repeling each other. Finally, after conducting classification experiments on several commonly used public transfer learning datasets, the results verify that the designed method can enhance the knowledge transfer ability of the Softmax regression model, and deliver higher classification performance compared with other current transfer learning classifiers.
View full abstract
-
Xiaolong ZHENG, Bangjie LI, Daqiao ZHANG, Di YAO, Xuguang YANG
Article type: LETTER
Article ID: 2022EAL2098
Published: 2023
Advance online publication: April 18, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The ionospheric clutter in High Frequency Surface Wave Radar (HFSWR) is the reflection of electromagnetic waves from the ionosphere back to the receiver, which should be suppressed as much as possible for the primary purpose of target detection in HFSWR. However, ionospheric clutter contains vast quantities of ionospheric state information. By studying ionospheric clutter, some of the relevant ionospheric parameters can be inferred, especially during the period of typhoons, when the ionospheric state changes drastically affected by typhoon-excited gravity waves, and utilizing the time-frequency characteristics of ionospheric clutter at typhoon time, information such as the trend of electron concentration changes in the ionosphere and the direction of the typhoon can be obtained. The results of the processing of the radar data showed the effectiveness of this method.
View full abstract
-
Jinguang HAO, Gang WANG, Honggang WANG, Lili WANG, Xuefeng LIU
Article type: LETTER
Article ID: 2023EAL2004
Published: 2023
Advance online publication: April 14, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The existing literature focuses on the applications of fast filter bank due to its excellent frequency responses with low complexity. However, the topic is not addressed related to the general transfer function expressions of the corresponding subfilters for a specific channel. To do this, in this paper, general closed-form transfer function expressions for fast filter bank are derived. Firstly, the cascaded structure of fast filter bank is modelled by a binary tree, with which the index of the subfilter at each stage within the channel can be determined. Then the transfer functions for the two outputs of a subfilter are expressed in a unified form. Finally, the general closed-form transfer functions for the channel and its corresponding subfilters are obtained by variables replacement if the prototype lowpass filters for the stages are given. Analytical results and simulations verify the general expressions. With such closed-form expressions lend themselves easily to analysis and direct computation of the transfer functions and the frequency responses without the structure graph.
View full abstract
-
Xinyu TIAN, Hongyu HAN, Limengnan ZHOU, Hanzhou WU
Article type: LETTER
Article ID: 2023EAL2020
Published: 2023
Advance online publication: April 13, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The low-hit-zone (LHZ) frequency hopping sequence (FHS) sets are widely applicable in quasi-synchronous frequency hopping multiple-access (QS-FHMA) systems. In order to reduce mutual interference (MI) in the zone around the signal origin between different users, we recommend the LHZ FHS set instead of the conventional FHS set. In this letter, we propose a design of LHZ FHS sets via interleaving techniques. The obtained sequences can be confirmed that they are near-optimal in relation to the Peng-Fan-Lee bound.
View full abstract
-
Junya YOSHIDA, Naoki HAYASHI, Shigemasa TAKAI
Article type: PAPER
Article ID: 2023EAP1020
Published: 2023
Advance online publication: April 13, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
This paper presents a quantized gradient descent algorithm for distributed nonconvex optimization in multiagent systems that takes into account the bandwidth limitation of communication channels. Each agent encodes its estimation variable using a zoom-in parameter and sends the quantized intermediate variable to the neighboring agents. Then, each agent updates the estimation by decoding the received information. In this paper, we show that all agents achieve consensus and their estimated variables converge to a critical point in the optimization problem. A numerical example of a nonconvex logistic regression shows that there is a trade-off between the convergence rate of the estimation and the communication bandwidth.
View full abstract
-
Naoko KIFUNE, Hironori UCHIKAWA
Article type: PAPER
Article ID: 2022EAP1119
Published: 2023
Advance online publication: April 12, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
At a flash memory, each stored data frame is protected by error correction codes (ECC) such as Bose-Chaudhuri-Hocquenghem (BCH) codes from random errors. Exclusive-OR (XOR) based erasure codes like RAID-5 have also been employed at the flash memory to protect from memory block defects. Conventionally, the ECC and erasure codes are used separately since their target errors are different. Due to recent aggressive technology scaling, additional error correction capability for random errors is required without adding redundancy. We propose an algorithm to improve error correction capability by using XOR parity with a simple counter that counts the number of unreliable bits in the XOR stripe. We also propose to apply Chase decoding to the proposed algorithm. The counter makes it possible to reduce the false correction and execute the efficient Chase decoding. We show that combining the proposed algorithm with Chase decoding can significantly improve the decoding performance.
View full abstract
-
Yukihiko YAMASHITA
Article type: PAPER
Article ID: 2022EAP1108
Published: 2023
Advance online publication: April 11, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
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.
View full abstract
-
Ruipan YANG, Ruihu LI, Qiang FU
Article type: PAPER
Article ID: 2023EAP1003
Published: 2023
Advance online publication: April 05, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The design of codes for distributed storage systems that protects from node failures has been studied for years, and locally repairable code (LRC) is such a method that gives a solution for fast recovery of node failures. Linear complementary dual code (LCD code) is useful for preventing malicious attacks, which helps to secure the system. In this paper, we combine LRC and LCD code by integration of enhancing security and repair efficiency, and propose some techniques for constructing LCD codes with their localities determined. On the basis of these methods and inheriting previous achievements of optimal LCD codes, we give optimal or near-optimal [n, k, d, r] LCD codes for k ≤ 6 and n ≥ k+1 with relatively small locality, mostly r ≤ 3. Since all of our obtained codes are distance-optimal, in addition, we show that the majority of them are r-optimal and the other 63 codes are all near r-optimal, according to CM bound.
View full abstract
-
Kyosuke YAMASHITA, Ryu ISHII, Yusuke SAKAI, Tadanori TERUYA, Takahiro ...
Article type: PAPER
Article ID: 2022DMP0005
Published: 2023
Advance online publication: April 03, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
A fault-tolerant aggregate signature (FT-AS) scheme is a variant of an aggregate signature scheme with the additional functionality to trace signers that create invalid signatures in case an aggregate signature is invalid. Several FT-AS schemes have been proposed so far, and some of them trace such rogue signers in multi-rounds, i.e., the setting where the signers repeatedly send their individual signatures. However, it has been overlooked that there exists a potential attack on the efficiency of bandwidth consumption in a multi-round FT-AS scheme. Since one of the merits of aggregate signature schemes is the efficiency of bandwidth consumption, such an attack might be critical for multi-round FT-AS schemes. In this paper, we propose a new multi-round FT-AS scheme that is tolerant of such an attack. We implement our scheme and experimentally show that it is more efficient than the existing multi-round FT-AS scheme if rogue signers randomly create invalid signatures with low probability, which for example captures spontaneous failures of devices in IoT systems.
View full abstract
-
Shunta TERUI, Katsuhisa YAMANAKA, Takashi HIRAYAMA, Takashi HORIYAMA, ...
Article type: PAPER
Article ID: 2022DMP0007
Published: 2023
Advance online publication: April 03, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
We are given a set S of n points in the Euclidean plane. We assume that S is in general position. A simple polygon P is an empty polygon of S if each vertex of P is a point in S and every point in S is either outside P or a vertex of P. In this paper, we consider the problem of enumerating all the empty polygons of a given point set. To design an efficient enumeration algorithm, we use a reverse search by Avis and Fukuda with child lists. We propose an algorithm that enumerates all the empty polygons of S in O(n2 |ϵ(S) |)-time, where ϵ(S) is the set of empty polygons of S. Moreover, by applying the same idea to the problem of enumerating surrounding polygons of a given point set S, we propose an enumeration algorithm that enumerates them in O(n2)-delay, while the known algorithm enumerates in O(n2 log n)-delay, where a surrounding polygon of S is a polygon such that each vertex of the polygon is a point in S and every point in S is either inside the polygon or a vertex of the polygon.
View full abstract
-
Hong-Yu Liu
Article type: PAPER
Article ID: 2022EAP1167
Published: 2023
Advance online publication: March 30, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Orthogonal frequency division multiplexing (OFDM) is very sensitive to the carrier frequency offset (CFO). The CFO estimation precision heavily makes impacts on the OFDM performance. In this paper, a new Bayesian learning-assisted joint CFO tracking and channel impulse response estimation is proposed. The proposed algorithm is modified from a Bayesian learning-assisted estimation (BLAE) algorithm in the literature. The BLAE is expectation-maximization (EM)-based and displays the estimator mean square error (MSE) lower than the Cramer-Rao bound (CRB) when the CFO value is near zero. However, its MSE value may increase quickly as the CFO value goes away from zero. Hence, the CFO estimator of the BLAE is replaced to solve the problem.
Originally, the design criterion of the single-time-sample (STS) CFO estimator in the literature is maximum likelihood (ML)-based. Its MSE performance can reach the CRB. Also, its CFO estimation range can reach the widest range required for a CFO tracking estimator. For a CFO normalized by the sub-carrier spacing, the widest tracking range required is from - 0.5 to + 0.5. Here, we apply the STS CFO estimator design method to the EM-based Bayesian learning framework. The resultant Bayesian learning-assisted STS algorithm displays the MSE performance lower than the CRB, and its CFO estimation range is between ±0.5.
With such a Bayesian learning design criterion, the additional channel noise power and power delay profile must be estimated, as compared with the ML-based design criterion. With the additional channel statistical information, the derived algorithm presents the MSE performance better than the CRB.
Two frequency-selective channels are adopted for computer simulations. One has fixed tap weights, and the other is Rayleigh fading. Comparisons with the most related algorithms are also been provided.
View full abstract
-
Hong LI, Wenjun CAO, Chen WANG, Xinrui ZHU, Guisheng LIAO, Zhangqing H ...
Article type: PAPER
Article ID: 2022EAP1151
Published: 2023
Advance online publication: March 29, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The configurable Ring oscillator Physical unclonable function (CRO PUF) is the newly proposed strong PUF based on classic RO PUF, which can generate exponential Challenge-Response Pairs (CRPs) and has good uniqueness and reliability. However, existing proposals have low hardware utilization and vulnerability to modeling attacks. In this paper, we propose a Novel Configurable Dual State (CDS) PUF with lower overhead and higher resistance to modeling attacks. This structure can be flexibly transformed into RO PUF and TERO PUF in the same topology according to the parity of the Hamming Weight (HW) of the challenge, which can achieve 100% utilization of the inverters and improve the efficiency of hardware utilization. A feedback obfuscation mechanism (FOM) is also proposed, which uses the stable count value of the ring oscillator in the PUF as the updated mask to confuse and hide the original challenge, significantly improving the effect of resisting modeling attacks. The proposed FOM-CDS PUF is analyzed by building a mathematical model and finally implemented on Xilinx Artix-7 FPGA, the test results show that the FOM-CDS PUF can effectively resist several popular modeling attack methods and the prediction accuracy is below 60%. Meanwhile it shows that the FOM-CDS PUF has good performance with uniformity, Bit Error Rate at different temperatures, Bit Error Rate at different voltages and uniqueness of 53.68%, 7.91%, 5.64% and 50.33% respectively.
View full abstract
-
Tomoya FUKAMI, Hirobumi SAITO, Akira HIROSE
Article type: PAPER
Article ID: 2022EAP1092
Published: 2023
Advance online publication: March 27, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
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.
View full abstract
-
Zeyao LI, Niu JIANG, Zepeng ZHUO
Article type: PAPER
Article ID: 2022EAP1096
Published: 2023
Advance online publication: March 27, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this paper, we study the properties of the sum-of-squares indicator of vectorial Boolean functions. Firstly, we give the upper bound of $\sum_{u\in \mathbb{F}_2^n,v\in \mathbb{F}_2^m}\mathcal{W}_F^3(u,v)$. Secondly, based on the Walsh-Hadamard transform, we give a secondary construction of vectorial bent functions. Further, three kinds of sum-of-squares indicators of vectorial Boolean functions are defined by autocorrelation function and the lower and upper bounds of the sum-of-squares indicators are derived. Finally, we study the sum-of-squares indicators with respect to several equivalence relations, and get the sum-of-squares indicator which have the best cryptographic properties.
View full abstract
-
Takashi FUCHINO, Takashi HARADA, Ken TANAKA, Kenji MIKAWA
Article type: PAPER
Article ID: 2022DMP0006
Published: 2023
Advance online publication: March 20, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Packet classification is used to determine the behavior of incoming packets in network devices according to defined rules. As it is achieved using a linear search on a classification rule list, a large number of rules will lead to longer communication latency. To solve this, the problem of finding the order of rules minimizing the latency has been studied. Misherghi et al. and Harada et al. have proposed a problem that relaxes to policy-based constraints. In this paper, we show that the Relaxed Optimal Rule Ordering (RORO) for the allowlist is NP-hard, and by reducing from this we show that RORO for the general rule list is NP-hard. We also propose a heuristic algorithm based on the greedy method for an allowlist. Furthermore, we demonstrate the effectiveness of our method using ClassBench, which is a benchmark for packet classification algorithms.
View full abstract
-
Tatsuya KAI, Koshi MAEHARA
Article type: PAPER
Article ID: 2022EAP1116
Published: 2023
Advance online publication: March 20, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
This paper develops a design method and theoretical analysis for piecewise nonlinear oscillators that have desired circular limit cycles. Especially, the mathematical proof on existence, uniqueness, and stability of the limit cycle is shown for the piecewise nonlinear oscillator. In addition, the relationship between parameters in the oscillator and rotational directions and periods of the limit cycle trajectories is investigated. Then, some numerical simulations show that the piecewise nonlinear oscillator has a unique and stable limit cycle and the properties on rotational directions and periods hold.
View full abstract
-
Makoto OSAWA, Norisato SUGA
Article type: LETTER
Article ID: 2022EAL2082
Published: 2023
Advance online publication: March 14, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The radio map of wireless communications should be surveyed in advance when installing base stations to efficiently utilize radio waves. Generally, this is calculated using radio wave propagation simulation. Because the simulation is time-consuming, a tensor-rank minimization-based interpolation method has been proposed as fast method. However, this method interpolates the radio map using an iterative algorithm. The number of iterations required for further acceleration should be reduced; therefore, we propose a tensor interpolation using rank minimization that considers the characteristics of radio wave propagation. Furthermore, we proved that the proposed method could interpolate with fewer iterations than the existing method.
View full abstract
-
Ren ISHIBASHI, Kazuki YONEYAMA
Article type: PAPER
Article ID: 2022DMP0001
Published: 2023
Advance online publication: March 13, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. Usually, PKI-based AKE schemes are designed to guarantee secrecy of the session key and mutual authentication. However, in practice, there are many cases where mutual authentication is undesirable such as in anonymous networks like Tor and Riffle, or difficult to achieve due to the certificate management at the user level such as the Internet. Goldberg et al. formulated a model of anonymous one-sided AKE which guarantees the anonymity of the client by allowing only the client to authenticate the server, and proposed a concrete scheme. However, existing anonymous one-sided AKE schemes are only known to be secure in the random oracle model. In this paper, we propose generic constructions of anonymous one-sided AKE in the random oracle model and in the standard model, respectively. Our constructions allow us to construct the first post-quantum anonymous one-sided AKE scheme from isogenies in the standard model.
View full abstract
-
Jiao DU, Ziyu CHEN, Le DONG, Tianyin WANG, Shanqi PANG
Article type: LETTER
Article ID: 2022EAL2096
Published: 2023
Advance online publication: March 09, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this paper, the notion of 2-tuples distribution matrices of the rotation symmetric orbits is proposed, by using the properties of the 2-tuples distribution matrix, a new characterization of 2-resilient rotation symmetric Boolean functions is demonstrated. Based on the new characterization of 2-resilient rotation symmetric Boolean functions, constructions of 2-resilient rotation symmetric Boolean functions (RSBFs) are further studied, and new 2-resilient rotation symmetric Boolean functions with prime variables are constructed.
View full abstract
-
Yuji HASHIMOTO, Koji NUIDA
Article type: PAPER
Article ID: 2022DMP0002
Published: 2023
Advance online publication: March 07, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
There are two types of elliptic curves, ordinary elliptic curves and supersingular elliptic curves. In 2012, Sutherland proposed an efficient and almost deterministic algorithm for determining whether a given curve is ordinary or supersingular. Sutherland's algorithm is based on sequences of isogenies started from the input curve, and computation of each isogeny requires square root computations, which is the dominant cost of the algorithm. In this paper, we reduce this dominant cost of Sutherland's algorithm to approximately a half of the original. In contrast to Sutherland's algorithm using j-invariants and modular polynomials, our proposed algorithm is based on Legendre form of elliptic curves, which simplifies the expression of each isogeny. Moreover, by carefully selecting the type of isogenies to be computed, we succeeded in gathering square root computations at two consecutive steps of Sutherland's algorithm into just a single fourth root computation (with experimentally almost the same cost as a single square root computation). The results of our experiments using Magma are supporting our argument; for cases of characteristic p of 768-bit to 1024-bit lengths, our proposed algorithm for characteristic p ≡ 1 (mod 4) runs in about 61.5% of the time and for characteristic p ≡ 3 (mod 4) also runs in about 54.9% of the time compared to Sutherland's algorithm.
View full abstract
-
Hiroki YAMAMURO, Keisuke HARA, Masayuki TEZUKA, Yusuke YOSHIDA, Keisuk ...
Article type: PAPER
Article ID: 2022DMP0004
Published: 2023
Advance online publication: March 07, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Message franking is introduced by Facebook in end-to-end encrypted messaging services. It allows to produce verifiable reports of malicious messages by including cryptographic proofs, called reporting tags, generated by Facebook. Recently, Grubbs et al. (CRYPTO'17) proceeded with the formal study of message franking and introduced committing authenticated encryption with associated data (CAEAD) as a core primitive for obtaining message franking.
In this work, we aim to enhance the security of message franking and introduce forward security and updates of reporting tags for message franking. Forward security guarantees the security associated with the past keys even if the current keys are exposed and updates of reporting tags allow for reporting malicious messages after keys are updated. To this end, we firstly propose the notion of key-evolving message franking with updatable reporting tags including additional key and reporting tag update algorithms. Then, we formalize five security requirements: confidentiality, ciphertext integrity, unforgeability, receiver binding, and sender binding. Finally, we show a construction of forward secure message franking with updatable reporting tags based on CAEAD, forward secure pseudorandom generator, and updatable message authentication code.
View full abstract
-
Hiroshi FUJIWARA, Masaya KAWAGUCHI, Daiki TAKIZAWA, Hiroaki YAMAMOTO
Article type: PAPER
Article ID: 2022DMP0008
Published: 2023
Advance online publication: March 07, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The bin packing problem is a problem of finding an assignment of a sequence of items to a minimum number of bins, each of capacity one. An online algorithm for the bin packing problem is an algorithm that irrevocably assigns each item one by one from the head of the sequence. Gutin, Jensen, and Yeo (2006) considered a version in which all items are only of two different sizes and the online algorithm knows the two possible sizes in advance, and gave an optimal online algorithm for the case when the larger size exceeds 1/2. In this paper we provide an optimal online algorithm for some of the cases when the larger size is at most 1/2, on the basis of a framework that facilitates the design and analysis of algorithms.
View full abstract
-
Miyuji HIROTA, Yoshifumi SAKAI
Article type: LETTER
Article ID: 2022DML0002
Published: 2023
Advance online publication: March 06, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
For any m strings of total length n, we propose an O(mn log n)-time, O(n)-space algorithm that finds a maximal common subsequence of all the strings, in the sense that inserting any character in it no longer yields a common subsequence of them. Such a common subsequence could be treated as indicating a nontrivial common structure we could find in the strings since it is NP-hard to find any longest common subsequence of the strings.
View full abstract
-
Kazuyuki MIURA
Article type: PAPER
Article ID: 2022DMP0009
Published: 2023
Advance online publication: March 06, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In a convex grid drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection, all vertices are put on grid points and all facial cycles are drawn as convex polygons. A plane graph G has a convex drawing if and only if G is internally triconnected, and an internally triconnected plane graph G has a convex grid drawing on an (n - 1) × (n - 1) grid if either G is triconnected or the triconnected component decomposition tree T (G) of G has two or three leaves, where n is the number of vertices in G. An internally triconnected plane graph G has a convex grid drawing on a 2n × 2n grid if T (G) has exactly four leaves. Furthermore, an internally triconnected plane graph G has a convex grid drawing on a 20n × 16n grid if T (G) has exactly five leaves.
In this paper, we show that an internally triconnected plane graph G has a convex grid drawing on a 10n × 5n grid if T (G) has exactly five leaves. We also present a linear-time algorithm to find such a drawing.
View full abstract
-
Veeramani KARTHIKA, Suresh JAGANATHAN
Article type: PAPER
Article ID: 2022EAP1088
Published: 2023
Advance online publication: March 06, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Considering the growth of the IoT network, there is a demand for a decentralized solution. Incorporating the blockchain technology will eliminate the challenges faced in centralized solutions, such as i) high infrastructure, ii) maintenance cost, iii) lack of transparency, iv) privacy, and v) data tampering. Blockchain-based IoT network allows businesses to access and share the IoT data within their organization without a central authority. Data in the blockchain are stored as blocks, which should be validated and added to the chain, for this consensus mechanism plays a significant role. However, existing methods are not designed for IoT applications and lack features like i) decentralization, ii) scalability, iii) throughput, iv) faster convergence, and v) network overhead. Moreover, current blockchain frameworks failed to support resource-constrained IoT applications. In this paper, we proposed a new consensus method (WoG) and a lightweight blockchain framework (iLEDGER), mainly for resource-constrained IoT applications in a permissioned environment. The proposed work is tested in an application that tracks the assets using IoT devices (Raspberry Pi 4 and RFID). Furthermore, the proposed consensus method is analyzed against benign failures, and performance parameters such as CPU usage, memory usage, throughput, transaction execution time, and block generation time are compared with state-of-the-art methods.
View full abstract
-
Xianliang GE, Shinji KIMURA
Article type: PAPER
Article ID: 2022EAP1103
Published: 2023
Advance online publication: March 03, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
Majority operation has been paid attention as a basic element of beyond-Moore devices on which logic functions are constructed from Majority elements and inverters. Several optimization methods are developed to reduce the number of elements on Majority-Inverter Graphs (MIGs) but more area and power reduction are required.
The paper proposes a new exact synthesis method for MIG based on a new topological constraint using node levels. Possible graph structures are clustered by the levels of input nodes, and all possible structures can be enumerated efficiently in the exact synthesis compared with previous methods. Experimental results show that our method decreases the runtime up to 25.33% compared with the fence-based method, and up to 6.95% with the partial-DAG-based method. Furthermore, our implementation can achieve better performance in size optimization for benchmark suites.
View full abstract
-
Masanori TSUJIKAWA, Yoshinobu KAJIKAWA
Article type: PAPER
Article ID: 2022EAP1130
Published: 2023
Advance online publication: February 28, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this paper, we propose a low-complexity and accurate noise suppression based on an a priori SNR (Speech to Noise Ratio) model for greater robustness w.r.t. short-term noise-fluctuation. The a priori SNR, the ratio of speech spectra and noise spectra in the spectral domain, represents the difference between speech features and noise features in the feature domain, including the mel-cepstral domain and the logarithmic power spectral domain. This is because logarithmic operations are used for domain conversions. Therefore, an a priori SNR model can easily be expressed in terms of the difference between the speech model and the noise model, which are modeled by the Gaussian mixture models, and it can be generated with low computational cost. By using a priori SNRs accurately estimated on the basis of an a priori SNR model, it is possible to calculate accurate coefficients of noise suppression filters taking into account the variance of noise, without serious increase in computational cost over that of a conventional model-based Wiener filter (MBW). We have conducted in-car speech recognition evaluation using the CENSREC-2 database, and a comparison of the proposed method with a conventional MBWshowed that the recognition error rate for all noise environments was reduced by 9%, and that, notably, that for audio-noise environments was reduced by 11%. We show that the proposed method can be processed with low levels of computational and memory resources through implementation on a digital signal processor.
View full abstract
-
Xiaoyu CHEN, Yihan ZHANG, Lianfeng SUN, Yubo LI
Article type: LETTER
Article ID: 2022EAL2071
Published: 2023
Advance online publication: February 24, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
This letter is devoted to constructing new Type-II Z-complementary pairs (ZCPs). A ZCP of length N with ZCZ width Z is referred to in short by the designation (N, Z)-ZCP. Inspired by existing works of ZCPs, systematic constructions of (2N+3, N+2)-ZCPs and (4N+4, 7/2N+4)-ZCPs are proposed by appropriately inserting elements into concatenated GCPs. The odd-length binary Z-complementary pairs (OB-ZCPs) are Z-optimal. Furthermore, the proposed construction can generate even-length binary Z-complementary pairs (EB-ZCPs) with ZCZ ratio (i.e. ZCZ width over the sequence length) of 7/8. It turns out that the PMEPR of resultant EB-ZCPs are upper bounded by 4.
View full abstract
-
Qing GAO, Yang DING
Article type: LETTER
Article ID: 2022EAL2090
Published: 2023
Advance online publication: February 20, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In this paper, we describe the Galois dual of rank metric codes in the ambient space $F_Q^{n\times m}$ and $F_{Q^m}^n$, where Q=qe. We obtain connections between the duality of rank metric codes with respect to distinct Galois inner products. Furthermore, for 0 ≤ s < e, we introduce the concept of qsm-dual bases of FQm over FQ and obtain some conditions about the existence of qsm-self-dual basis.
View full abstract
-
Yang CHEN, Masao YAMAGISHI, Isao YAMADA
Article type: PAPER
Article ID: 2022EAP1118
Published: 2023
Advance online publication: February 14, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
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.
View full abstract
-
Song LIU, Jie MA, Chenyu ZHAO, Xinhe WAN, Weiguo WU
Article type: PAPER
Article ID: 2022EAP1084
Published: 2023
Advance online publication: February 10, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
GPUs have become the dominant computing units to meet the need of high performance in various computational fields. But the long operation latency causes the underutilization of on-chip computing resources, resulting in performance degradation when running parallel tasks on GPUs. A good warp scheduling strategy is an effective solution to hide latency and improve resource utilization. However, most current warp scheduling algorithms on GPUs ignore the ability of long operations to hide latency. In this paper, we propose a long-operation-first warp scheduling algorithm, LFWS, for GPU platforms. The LFWS filters warps in the ready state to a ready queue and updates the queue in time according to changes in the status of the warp. The LFWS divides the warps in the ready queue into long and short operation groups based on the type of operations in their instruction buffers, and it gives higher priority to the long-operating warp in the ready queue. This can effectively use the long operations to hide some of the latency from each other and enhance the system's ability to hide the latency. To verify the effectiveness of the LFWS, we implement the LFWS algorithm on a simulation platform GPGPU-Sim. Experiments are conducted over various CUDA applications to evaluate the performance of LFWS algorithm, compared with other five warp scheduling algorithms. The results show that the LFWS algorithm achieves an average performance improvement of 8.01% and 5.09%, respectively, over three traditional and two novel warp scheduling algorithms, effectively improving computational resource utilization on GPU.
View full abstract
-
Yuji HASHIMOTO, Koji NUIDA
Article type: PAPER
Article ID: 2022DMP0003
Published: 2023
Advance online publication: February 07, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
The CGL hash function is a provably secure hash function using walks on isogeny graphs of supersingular elliptic curves. A dominant cost of its computation comes from iterative computations of power roots over quadratic extension fields. In this paper, we reduce the necessary number of power root computations by almost half, by applying and also extending an existing method of efficient isogeny sequence computation on Legendre curves (Hashimoto and Nuida, CASC 2021). We also point out some relationship between 2-isogenies for Legendre curves and those for Edwards curves, which is of independent interests, and develop a method of efficient computation for 2e-th roots in quadratic extension fields.
View full abstract
-
Pengxu JIANG, Yue XIE, Cairong ZOU, Li ZHAO, Qingyun WANG
Article type: LETTER
Article ID: 2022EAL2091
Published: 2023
Advance online publication: February 06, 2023
JOURNAL
FREE ACCESS
ADVANCE PUBLICATION
In human-computer interaction, acoustic scene classification (ASC) is one of the relevant research domains. In real life, the recorded audio may include a lot of noise and quiet clips, making it hard for earlier ASC-based research to isolate the crucial scene information in sound. Furthermore, scene information may be scattered across numerous audio frames; hence, selecting scene-related frames is crucial for ASC. In this context, an integrated convolutional neural network with a fusion attention mechanism (ICNN-FA) is proposed for ASC. Firstly, segmented mel-spectrograms as the input of ICNN can assist the model in learning the short-term time-frequency correlation information. Then, the designed ICNN model is employed to learn these segment-level features. In addition, the proposed global attention layer may gather global information by integrating these segment features. Finally, the developed fusion attention layer is utilized to fuse all segment-level features while the classifier classifies various situations. Experimental findings using ASC datasets from DCASE 2018 and 2019 indicate the efficacy of the suggested method.
View full abstract