In this paper, we consider the stack layout of the bubble-sort graph. The bubble-sort graph is a type of Cayley graph on a symmetric group; the bubble-sort graph has an important role for the study of Cayley graphs as interconnection networks. The stack layout and the queue layout problem that are treated in this paper have been studied widely. In this paper, we show that the stack number of the bubble-sort graph BS(n) is either n-1 or n-2. In addition, we show that an upper bound of the queue number of BS(n) is n-2.

We propose an exact algorithm to determine the satisfiability of oblivious read-twice branching programs. Our algorithm runs in $2^{left(1 - Omega(rac{1}{log c}) ight)n}$ time for instances with n variables and cn nodes.

In this paper, a convolution theorem which is analogous to the theorem for Fourier transform is shown among a certain type of polynomials. We establish a fast method of the multiplication in a special class of quotient rings of multivariate polynomials over q-element finite field GF(q). The polynomial which we treat is one of expressing forms of the multiple-valued logic function from the product of the semigroups in GF(q) to GF(q). Our results can be applied to the speedup of both software and hardware concerning multiple-valued Boolean logic.

Some diffusive and recurrence properties of Lorentz Lattice Gas Cellular Automata (LLGCA) have been expensively studied in terms of the densities of some of the left/right static/flipping mirrors/rotators. In this paper, for any combination S of these well known scatters, we study the computational complexity of the following problem which we call PERIODICITY on the S-model: given a finite configuration that distributes only those scatters in S, whether a particle visits the starting position periodically or not. Previously, the flipping mirror model and the occupied flipping rotator model have been shown unbounded, i.e. the process is always diffusive [17]. On the other hand, PERIODICITY is shown PSPACE-complete in the unoccupied flipping rotator model [21]. In this paper, we show that PERIODICITY is PSPACE-compete in any S-model that is neither occupied, unbounded, nor static. Particularly, we prove that PERIODICITY in any unoccupied and bounded model containing flipping mirror is PSPACE-complete.

It is a well-known and useful problem to find a matching in a given graph G whose size is at most a given parameter k and whose weight is maximized (over all matchings of size at most k in G). In this paper, we consider two natural extensions of this problem. One is to find t disjoint matchings in a given graph G whose total size is at most a given parameter k and whose total weight is maximized, where t is a (small) constant integer. Previously, only the special case where t=2 was known to be fixed-parameter tractable. In this paper, we show that the problem is fixed-parameter tractable for any constant t. When t=2, the time complexity of the new algorithm is significantly better than that of the previously known algorithm. The other is to find a set of vertex-disjoint paths each of length 1 or 2 in a given graph whose total length is at most a given parameter k and whose total weight is maximized. As interesting applications, we further use the algorithms to speed up several known approximation algorithms (for related NP-hard problems) whose approximation ratio depends on a fixed parameter 0<ε<1 and whose running time is dominated by the time needed for exactly solving the problems on graphs in which each connected component has at most ε^-1 vertices.

In this paper we discuss approximation algorithms for the ELEMENT-DISJOINT STEINER TREE PACKING problem (Element-STP for short). For a graph G=(V,E) and a subset of nodes T⊆V, called terminal nodes, a Steiner tree is a connected, acyclic subgraph that contains all the terminal nodes in T. The goal of Element-STP is to find as many element-disjoint Steiner trees as possible. Element-STP is known to be APX-hard even for |T|=3 [1]. It is also known that Element-STP is NP-hard to approximate within a factor of Ω(log |V|) [3] and there is an O(log |V|)-approximation algorithm for Element-STP [2],[4]. In this paper, we provide a $lceil rac{|T|}{2} ceil$-approximation algorithm for Element-STP on graphs with |T| terminal nodes. Furthermore, we show that the approximation ratio of 3 for Element-STP on graphs with five terminal nodes can be improved to 2.

Left-weight sequences (LW-sequences for short) are in common currency for encoding binary trees. In [16], Wu et al. proposed an algorithm associated with tree rotations for listing all binary trees in diverse representations including LW-sequences. In particular, such a list of LW-sequences is generated in Gray-code order. In this paper, based on this ordering, we present efficient ranking and unranking algorithms. For binary trees with n internal nodes, the time complexity and the space requirement in each of our ranking and unranking algorithms are O(n²) and O(n), respectively.

In the 3-slope ski-rental problem, the player is asked to determine a strategy, that is, (i) whether to buy a ski wear and then a ski set separately, or to buy them at once for a discount price, and (ii) when to buy these goods. If the player has not got any thing, he/she can rent it for some price. The objective is to minimize the total cost, under the assumption that the player does not know how many times he/she goes skiing in the future. We reveal that even with a large discount for buying at once available, there is some price setting for which to buy the goods separately is a more reasonable choice. We also show that the performance of the optimal strategy may become arbitrarily worse, when a large discount is offered.

The most famous silhouette puzzle is the tangram, which originated in China more than two centuries ago. From around the same time, there is a similar Japanese puzzle called Sei Shonagon Chie no Ita. Both are derived by cutting a square of material with straight incisions into seven pieces of varying shapes, and each can be decomposed into sixteen non-overlapping identical right isosceles triangles. It is known that the pieces of the tangram can form thirteen distinct convex polygons. We first show that the Sei Shonagon Chie no Ita can form sixteen. Therefore, in a sense, the Sei Shonagon Chie no Ita is more expressive than the tangram. We also propose more expressive patterns built from the same 16 identical right isosceles triangles that can form nineteen convex polygons. There exist exactly four sets of seven pieces that can form nineteen convex polygons. We show no set of seven pieces can form at least 20 convex polygons, and demonstrate that eleven pieces made from sixteen identical isosceles right triangles are necessary and sufficient to form 20 convex polygons. Moreover, no set of six pieces can form nineteen convex polygons.

In this paper, we describe an improvement of integer factorization of k RSA moduli N_i=p_iq_i (1≤i≤k) with implicit hints, namely all p_i share their t least significant bits. May et al. reduced this problem to finding a shortest (or a relatively short) vector in the lattice of dimension k obtained from a given system of k RSA moduli, for which they applied Gaussian reduction or the LLL algorithm. In this paper, we improve their method by increasing the determinant of the lattice obtained from the k RSA moduli. We see that, after our improvement, May et al.'s method works smoothly with higher probability. We further verify the efficiency of our method by computer experiments for various parameters.

An (≤n,≤ω)-one-time secure broadcast encryption scheme (BES) allows a sender to choose any subset of receivers so that only the designated users can decrypt a ciphertext. In this paper, we first show an efficient construction of an (≤n,≤ω)-one-time secure BES with general ciphertext sizes. Specifically, we propose a generic construction of an (≤n,≤ω)-one-time secure BES from key predistribution systems (KPSs) when its ciphertext size is equal to integer multiple of the plaintext size, and our construction includes all known constructions. However, there are many possible combinations of the KPSs to realize the BES in our construction methodology, and therefore, we show that which combination is the best one in the sense that secret-key size can be minimized. Our (optimized) construction provides a flexible parameter setup (i.e. we can adjust the secret-key sizes) by setting arbitrary ciphertext sizes based on restrictions on channels such as channel capacity and channel bandwidth.

While standard signatures provide an efficient mechanism for information certification, the lack of privacy protecting measures makes them unsuitable if sensitive or confidential information is being certified. In this paper, we revisit nominative signatures, first introduced by Kim, Park and Won, which provides the functionality and security guarantees required to implement a certification system allowing the user (and not the authority) to control the verifiability of an obtained certificate. Unlike systems based on related primitives, the use of nominative signatures protects the user against authority information leaks and impersonation attacks based on these. We refine the security model of nominative signatures, and propose a new efficient scheme which is provably secure based on the computational Diffie-Hellman problem and the decisional linear problem. To the best of our knowledge, our scheme is the the only nominative signature scheme which is provably secure in the standard model based on standard assumptions. Furthermore, unlike most previous schemes, the proposed scheme provides signatures which hide both the signer and user identity. Hence, through our nominative signature scheme, we achieve an efficient non-transferable user certification scheme with strong security guarantees.

It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, there are no known results to construct a set of COPY, XOR, and AND protocols based on a two-card-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-card-per-bit encoding scheme. Our protocols use a minimum number of cards in the setting of two-card-per-bit encoding schemes since four cards are always required to encode the inputs. Moreover, we show that it is possible to construct two-card COPY, two-card XOR, and three-card AND protocols based on a one-card-per-bit encoding scheme using a common reference polarizer which is a polarizing material accessible to all parties.

WPA is the security protocol for IEEE 802.11 wireless networks standardized as a substitute for WEP in 2003, and uses RC4 stream cipher for encryption. It improved a 16-byte RC4 key generation procedure, which is known as TKIP, from that in WEP. One of the remarkable features in TKIP is that the first 3-byte RC4 key is derived from the public parameter IV, and an analysis using this feature has been reported by Sen Gupta et al. at FSE 2014. They focused on correlations between the keystream bytes and the known RC4 key bytes in WPA, which are called key correlations or linear correlations, and improved the existing plaintext recovery attack using their discovered correlations. No study, however, has focused on such correlations including the internal states in WPA. In this paper, we investigated new linear correlations including unknown internal state variables in both generic RC4 and WPA. From the result, we can successfully discover various new linear correlations, and prove some correlations theoretically.

The Building puzzle is played on an N×N grid of cells. Initially, some numbers are given around the border of the grid. The object of the puzzle is to fill out blank cells such that every row and column contains the numbers 1 through N. The number written in each cell represents the height of the building. The numbers around the border indicate the number of buildings which a person can see from that direction. A shorter building behind a taller one cannot be seen by him. It is shown that deciding whether the Building puzzle has a solution is NP-complete.

An r-gathering of customers C to facilities F is an assignment A of C to open facilities F^' ⊂ F such that r (≥ 2) or more customers are assigned to each open facility. (Each facility needs enough number of customers for its opening.) Then the r-gathering problem finds an r-gathering minimizing a designated cost. Armon gave a simple 3-approximation algorithm for the r-gathering problem and proved that with assumption P ≠ NP the problem cannot be approximated within a factor of less than 3 for any r ≥ 3. The running time of the 3-approximation algorithm is O(|C||F|+r|C|+|C|log|C|)). In this paper we improve the running time of the algorithm by (1) removing the sort in the algorithm and (2) designing a simple but efficient data structure.

MUltiple SIgnal Classification (MUSIC) is a standard technique for direction of arrival (DOA) estimation with high resolution. However, MUSIC cannot estimate DOAs accurately in the case of underdetermined conditions, where the number of sources exceeds the number of microphones. To overcome this drawback, an extension of MUSIC using cumulants called 2q-MUSIC has been proposed, but this method greatly suffers from the variance of the statistics, given as the temporal mean of the observation process, and requires long observation. In this paper, we propose a new approach for extending MUSIC that exploits higher-order moments of the signal for the underdetermined DOA estimation with smaller variance. We propose an estimation algorithm that nonlinearly maps the observed signal onto a space with expanded dimensionality and conducts MUSIC-based correlation analysis in the expanded space. Since the dimensionality of the noise subspace is increased by the mapping, the proposed method enables the estimation of DOAs in the case of underdetermined conditions. Furthermore, we describe the class of mapping that allows us to analyze the higher-order moments of the observed signal in the original space. We compare 2q-MUSIC and the proposed method through an experiment assuming that the true number of sources is known as prior information to evaluate in terms of the bias-variance tradeoff of the statistics and computational complexity. The results clarify that the proposed method has advantages for both computational complexity and estimation accuracy in short-time analysis, i.e., the time duration of the analyzed data is short.

A generalized covariance matrix taper (GCMT) model is proposed to enhance the performance of knowledge-aided space-time adaptive processing (KA-STAP) under sea clutter environments. In KA-STAP, improving the accuracy degree of the a priori clutter covariance matrix is a fundamental issue. As a crucial component in the a priori clutter covariance matrix, the taper matrix is employed to describe the internal clutter motion (ICM) or other subspace leakage effects, and commonly constructed by the classical covariance matrix taper (CMT) model. This work extents the CMT model into a generalized CMT (GCMT) model with a greater degree of freedom. Comparing it with the CMT model, the proposed GCMT model is more suitable for sea clutter background applications for its improved flexibility. Simulation results illustrate the efficiency of the GCMT model under different sea clutter environments.

Operating swarm robots has the virtues of improved performance, fault tolerance, distributed sensing, and so on. The problem is, high overall system costs are the main barrier in managing a system of foraging swarm robots. Moreover, its control algorithm should be scalable and reliable as the foraging (search) spaces become wider. This paper analyzes a nature-inspired cooperative method to reduce the operating costs of the foraging swarm robots through simulation experiments. The aim of this research is to improve efficiency of mechanisms for reducing the cost by developing a new algorithm for the synergistic cooperation of the group. In this paper, we set the evaluation index of energy efficiency considering that the mission success rate as well as energy saving is important. The value is calculated as the number of successful operations against the total consumption of energy in order to also guarantee optimized for the work processing power than the one simple goal of energy savings. The method employs a behavioral model of a honey bee swarm to improve the energy efficiency in collecting crops or minerals. Experiments demonstrate the effectiveness of the approach. The experiment is set a number of strategies to combine the techniques to the proposed and conventional methods. Considering variables such as the area of search space and the size of a swarm, the efficiency comparison test is performed. As the result, the proposed method showed the enhanced energy efficiency of the average 76.9% as compared to the conventional simple model that means reduction of the recharging cost more than 40%.

In this paper, the system identification problem from the high-dimensional input and output is considered. If the relationship between the features extracted from the data is represented as a linear time-invariant dynamical system, the input-output manifold learning method has shown to be a powerful tool for solving such a system identification problem. However, in the previous study, the system is assumed to be initially relaxed because the transfer function model is used for system representation. This assumption may not hold in several tasks. To handle the initially non-relaxed system, we propose the alternative approach of the input-output manifold learning with state space model for the system representation. The effectiveness of our proposed method is confirmed by experiments with synthetic data and motion capture data of human-human conversation.

In this study we investigate the synchronization of relaxation oscillators having individual differences by using non-periodic signal injection. When a common non-periodic signal is injected into the relaxation oscillators, the oscillators exhibit synchronization phenomena. Such synchronization phenomena can be classified as injection locking. We also consider the relation between the synchronization state and the individual difference. Further, we pay attention to the effect of the fluctuation range of the non-periodic injected signal. When the fluctuation range is wide, we confirm that the synchronization range increases if the individual difference is small.

As technology nodes continue to shrink, the impact of radiation-induced soft error on processor reliability increases. Estimation of processor reliability and identification of vulnerable flip-flops requires accurate soft error rate (SER) analysis techniques. This paper presents a proposal for a soft error propagation analysis technique. We specifically examine single event upset (SEU) occurring at a flip-flop in sequential circuits. When SEUs propagate in sequential circuits, the faults can be masked temporally and logically. Conventional soft error propagation analysis techniques do not consider error convergent timing on re-convergent paths. The proposed technique can analyze soft error propagation while considering error-convergent timing on a re-convergent path by combinational analysis of temporal and logical effects. The proposed technique also considers the case in which the temporal masking is disabled with an enable signal of the erroneous flip-flop negated. Experimental results show that the proposed technique improves inaccuracy by 70.5%, on average, compared with conventional techniques using ITC 99 and ISCAS 89 benchmark circuits when the enable probability is 1/3, while the runtime overhead is only 1.7% on average.

Through-silicon vias (TSV) allow the stacking of dies into multilayer structures, and solve connection problems between neighboring tiers for three-dimensional (3D) integrated circuit (IC) technology. Several studies have investigated the placement and routing in 3D ICs, but not much has focused on circuit partitioning for 3D stacking. However, with the scaling trend of CMOS technology, the influence of the area of I/O pads, power/ground (P/G) pads, and TSVs should not be neglected in 3D partitioning technology. In this paper, we propose an iterative layer-aware partitioning algorithm called EX-iLap, which takes into account the area of I/O pads, P/G pads, and TSVs for area balancing and minimization of inter-tier interconnections in a 3D structure. Minimizing the quantity of TSVs reduces the total silicon die area, which is the main source of recurring costs during fabrication. Furthermore, estimations of the number of TSVs and the total area are somewhat imprecise if P/G TSVs are not taken into account. Therefore, we calculate the power consumption of each cell and estimate the number of P/G TSVs at each layer. Experimental results show that, after considering the power of interconnections and pads, our algorithm can reduce area-overhead by ~39% and area standard deviation by ~69%, while increasing the quantity of TSVs by only 12%, as compared to the algorithm without considering the power of interconnections and pads.

A cover free family (CFF) is a useful mathematical tool for cryptographic schemes where any pre-defined number of sets in the family do not cover another set in the family. The common disadvantage of CFF-based schemes is the requirement for a significantly large amount of data such as public keys and ciphertexts. This paper proposes a simple method to reduce the size of ciphertexts in CFF-based broadcast encryption schemes by removing redundant elements from sets in the family, and then analyzes the size of cihpertexts. As a result, in a typical distribution case, the average amount of ciphertexts is reduced to 83 percents (from 691Kbits to 576Kbits).

Controlling the peak-to-mean envelope power ratio (PMEPR) of orthogonal frequency-division multiplexed (OFDM) transmissions is a significant obstacle in many low-cost applications of OFDM. An coding approach proposed by H.R. Sadjadpour presents non-square M-QAM symbols as a combination of QPSK and BPSK signals when M=2²ⁿ⁺¹, and then uses QPSK and BPSK Golay (or Golay-like) sequences with a constant PMEPR to generate M-QAM sequences. This paper proposes a new scheme in which M-QAM sequences are generated by QPSK and BPSK sequences with variable PMEPRs. In other words, this new scheme is a general case of the existing approach. As a result, the code rate of the new sequence is significantly improved, while the upper bound of its PMEPR remains at a comparative level.

The dyadic filter bank property of multivariate empirical mode decomposition (MEMD) for white Gaussian noise (WGN) is well established. In order to investigate the way MEMD behaves in the presence of fractional Gaussian noise (fGn), we conduct thorough numerical experiments for MEMD for fGn inputs. It turns out that similar to WGN, MEMD follows dyadic filter bank structure for fGn inputs, which is more stable than empirical mode decomposition (EMD) regardless of the Hurst exponent. Moreover, the estimation of the Hurst exponent of fGn contaminated with different kinds of signals is also presented via MEMD in this work.

Synthetic aperture radar (SAR) imagery is significantly deteriorated by the random phase noises which are generated by the frequency jitter of the transmit signal and atmospheric turbulence. In this paper, we recast the SAR imaging problem via the phase-corrupted data as for a special case of quadratic compressed sensing (QCS). Although the quadratic measurement model has potential to mitigate the effects of the phase noises, it also leads to a nonconvex and quartic optimization problem. In order to overcome these challenges and increase reconstruction robustness to the phase noises, we proposed a QCS-based SAR imaging algorithm by greedy local search to exploit the spatial sparsity of scatterers. Our proposed imaging algorithm can not only avoid the process of precise random phase noise estimation but also acquire a sparse representation of the SAR target with high accuracy from the phase-corrupted data. Experiments are conducted by the synthetic scene and the moving and stationary target recognition Sandia laboratories implementation of cylinders (MSTAR SLICY) target. Simulation results are provided to demonstrate the effectiveness and robustness of our proposed SAR imaging algorithm.

The classification of warheads and decoys is a core technology in the defense of the ballistic missile. Usually, a high range resolution is favorable for the development of the classification algorithm, which requires a high sampling rate in fast time, and thus leads to a heavy computation burden for data processing. In this paper, a novel method based on compressed sensing (CS) is presented to improve the range resolution of the target with low computational complexity. First, a tool for electromagnetic calculation, such as CST Microwave Studio, is used to simulate the frequency response of the electromagnetic scattering of the target. Second, the range-resolved signal of the target is acquired by further processing. Third, a greedy algorithm is applied to this signal. By the iterative search of the maximum value from the signal rather than the calculation of the inner product for raw echo, the scattering coefficients of the target can be reconstructed efficiently. A series of experimental results demonstrates the effectiveness of our method.

An extended harmonic disturbance observer is designed for speed (or position) sensorless current control of DC motor subject to a biased sinusoidal disturbance and parameter uncertainties. The proposed method does not require the information on the mechanical part of the motor equation. Theoretical analysis via the singular perturbation theory is performed to verify that the feedforward compensation using the estimation can improve the robust transient performance of the closed-loop system. A stability condition is derived against parameter uncertainties. Comparative experimental results validate the robustness of the proposed method against the uncertainties.

The transmission control protocol with a random early detection (TCP/RED) is an important algorithm for a TCP congestion control [1]. It has been expressed as a simple second-order discrete-time hybrid dynamical model, and shows unique and typical nonlinear phenomena, e.g., bifurcation phenomena or chaotic attractors [2], [3]. However, detailed behavior is unclear due to discontinuity that describes the switching of transmission phases in TCP/RED, but we have proposed its analysis method in previous study. This letter clarifies bifurcation structures with it.

Since 2008, three different classes of Boolean functions with optimal algebraic immunity have been proposed by Carlet and Feng [2], Wang et al.[8] and Chen et al.[3]. We call them C-F functions, W-P-K-X functions and C-T-Q functions for short. In this paper, we propose three affine equivalent classes of Boolean functions containing C-F functions, W-P-K-X functions and C-T-Q functions as a subclass, respectively. Based on the affine equivalence relation, we construct more classes of Boolean functions with optimal algebraic immunity. Moreover, we deduce a new lower bound on the nonlinearity of C-F functions, which is better than all the known ones.

In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.

Based on a perfect Gaussian integer sequence, shift and combination operations are performed to construct Gaussian integer sequences with zero correlation zone (ZCZ). The resultant sequence sets are optimal or almost optimal with respect to the Tang-Fan-Matsufuji bound. Furthermore, the ZCZ Gaussian integer sequence sets can be provided for quasi-synchronous code-division multiple-access systems to increase transmission data rate and reduce interference.

The problem of power allocation in maximizing the energy efficiency of the secondary user (SU) in a delay quality-of-service (QoS) constrained CR network is investigated in this paper. The average interference power constraint is used to protect the transmission of the primary user (SU). The energy efficiency is expressed as the ratio of the effective capacity to the total power consumption. By using non-linear fractional programming and convex optimization theory, we develop an energy efficiency power allocation scheme based on the Dinkelbach method and the Lagrange multiplier method. Numerical results show that the proposed scheme outperforms the existing schemes, in terms of energy efficiency.

A novel scheme to implement a filter bank multicarrier/offset quadrature amplitude modulation (FBMC/OQAM) transmission system is proposed. This is achieved by replacing the existing polyphase filter banks based on FFT/IFFT with fast filter bank (FFB) in order to utilize its good properties such as cascaded structure and high frequency selectivity with a comparable complexity as FFT/IFFT. Although this topic is not addressed in the literature, the impulse response of the prototype filter for each stage within FFB can still be obtained by using an optimization technique, which is used to minimize the distortion caused by intersymbol and interchannel interferences (ISI and ICI) of the proposed FBMC/OQAM transmission system, subject to allowable ripples in the passband and stopband. As a result, the relationship between two-path prototype filters in each subfilter should be modified with a general form accordingly. Simulations show that the number of multiplications required by the proposed scheme is smaller than that needed by the polyphase filter banks solution based on FFT/IFFT. Furthermore, the suitability of the design of prototype filters and the validation can be also supported by the results.

Distributed compressive video sensing (DCVS) is an emerging low-complexity video coding framework which integrates the merits of distributed video coding (DVC) and compressive sensing (CS). In this paper, we propose a novel rate-distortion optimized DCVS codec, which takes advantage of a rate-distortion optimization (RDO) model based on the estimated correlation noise (CN) between a non-key frame and its side information (SI) to determine the optimal measurements allocation for the non-key frame. Because the actual CN can be more accurately recovered by our DCVS codec, it leads to more faithful reconstruction of the non-key frames by adding the recovered CN to the SI. The experimental results reveal that our DCVS codec significantly outperforms the legacy DCVS codecs in terms of both objective and subjective performance.