Recent small cube satellites use higher frequency bands such as Ku-band for higher throughput communications. This requires high-frequency link in an earth radio station as well. As one of the solutions, we propose usage of bidirectional radio-on-fiber link employing a wavelength multiplexing scheme. It was numerically shown that the response linearity of the electro-absorption modulator integrated laser (EML) is sufficient and that the spurious emissions are lower enough or can be reduced by the radio-frequency filters. From the frequency response and the single-sideband phase noise measurements, the EML was proved to be used in a radio-on-fiber system of the cube satellite earth station.

We experimentally investigate the performance of a distributed Raman amplifier (DRA)-based pulse compressor for a phase modulated signal. A 10 Gb/s return-to-zero (RZ)-differential phase shift keying (DPSK) signal is compressed to picosecond range after transmission. Pulsewidth is continuously compressed in a wide range from 20 to 3.2 ps by changing the pump power of the DRA while the compressed waveforms are well-matched with sech2 function. Error-free operations at bit-error-rate (BER) of 10-9 are achieved for the compressed signals of various pulsewidths with low power penalties within 2.3 dB compared to the back-to-back. After the compression, the 10 Gb/s signal is used to generate a 40 Gb/s RZ-DPSK optical time division multiplexing (OTDM) signal. This 40 Gb/s OTDM signal is then successfully demultiplexed to 10 Gb/s DPSK signal by using an optical gate based on four-wave mixing (FWM) in a highly nonlinear fiber (HNLF).

This letter presents a new time-digital single-slope ADC (TDSS) architecture for CMOS image sensors. In the proposed ADC, a conventional single-slope ADC is used in coarse phase and a time to digital convertor is employed in fine phase. Through second comparison of the two different slope voltages (discharge input voltage and ramp voltage), the proposed ADC achieves low bit precision compensation. Compared with multiple-ramp single-slope (MRSS) ADC, the proposed ADC not only has a simple digital judgment circuit, but also increases conversion speed without complicated structure of ramp generator. A 10-bit TDSS ADC consisting of 7-bit conventional single-slope ADC and 3-bit time to digital converter was realized in a 0.13µm CIS process. Simulations demonstrate that the conversion speed of a TDSS ADC is almost 3.5 times faster than that of a single-slope ADC.

It is known that in the selected mapping (SLM) scheme for orthogonal frequency division multiplexing (OFDM), correlation (CORR) metric outperforms the peak-to-average power ratio (PAPR) metric in terms of bit error rate (BER) performance. It is also well known that four times oversampling is used for estimating the PAPR performance of continuous OFDM signal. In this paper, the oversampling effect of OFDM signal is analyzed when CORR metric is used for the SLM scheme in the presence of nonlinear high power amplifier. An analysis based on the correlation coefficients of the oversampled OFDM signals shows that CORR metric of two times oversampling in the SLM scheme is good enough to achieve the same BER performance as four times and 16 times oversampling cases. Simulation results confirm that for the SLM scheme using CORR metric, the BER performance for two times oversampling case is almost the same as that for four and 16 times oversampling cases.

In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.

The traffic of the future aggregation network will dynamically change not only in volume but also destination to support the application of virtualization technology to network edge equipment to achieve cost-effectiveness. Therefore, future aggregation network will have to accommodate this traffic cost-effectively, despite dynamic changes in both volume and destination. To correspond to this trend, in this paper, we propose an optical layer 2 switch network based on bufferless optical time division multiplexing (TDM) and dynamic bandwidth allocation to achieve a future aggregation network cost-effectively. We show here that our proposed network architecture effectively reduced the number of wavelengths and optical interfaces by application of bufferless optical TDM technology and dynamic bandwidth allocation to the aggregation network.

Bag of Visual Words (BoVW) is an effective framework for image retrieval. Query expansion (QE) further boosts retrieval performance by refining a query with relevant visual words found from the geometric consistency check between the query image and highly ranked retrieved images obtained from the first round of retrieval. Since QE checks the pairwise consistency between query and highly ranked images, its performance may deteriorate when there are slight degradations in the query image. We propose Query Bootstrapping as a variant of QE to circumvent this problem by using the consistency of highly ranked images instead of pairwise consistency. In so doing, we regard frequently co-occurring visual words in highly ranked images as relevant visual words. Frequent itemset mining (FIM) is used to find such visual words efficiently. However, the FIM-based approach requires sensitive parameters to be fine-tuned, namely, support (min/max-support) and the number of top ranked images (top-k). Here, we propose an adaptive support algorithm that adaptively determines both the minimum support and maximum support by referring to the first round's retrieval list. Selecting relevant images by using a geometric consistency check further boosts retrieval performance by reducing outlier images from a mining process. An important parameter for the LO-RANSAC algorithm that is used for the geometric consistency check, namely, inlier threshold, is automatically determined by our algorithm. We further introduce tf-fi-idf on top of tf-idf in order to take into account the frequency of inliers (fi) in the retrieved images. We evaluated the performance of QB in terms of mean average precision (mAP) on three benchmark datasets and found that it gave significant performance boosts of 5.37%, 9.65%, and 8.52% over that of state-of-the-art QE on Oxford 5k, Oxford 105k, and Paris 6k, respectively.

We present a new cryptanalysis approach to analyze the security of a class of authenticated encryption schemes, which shares similarity with the previous length extension attack against hash-function-based MACs. Hence we name our approach by message extension attack. For an authenticated encryption from the target class, it consists of three phases; initialization with nonce and key as input, state update function with associated data and message as input and tag generation with updated state as input. We will show how to mount a forgery attack in the nonce-repeating model under the chosen-plaintext scenario, when both state update function and tag generation is built based on the same function. To demonstrate the effectiveness of our message extension attack approach, we apply it to a dedicated authenticated encryption called PANDA, which is a candidate of the ongoing CAESAR cryptographic competition. We successfully found an existential forgery attack on PANDA with 25 chosen plaintexts, 264 computations, and a negligible memory, and it breaks the claimed 128-bit security for the nonce-repeating model. We note that this is the first result that breaks the security claim of PANDA, which makes it withdrawn from the CAESAR competition by its designer.

Recently, many neural networks have been proposed for radar sea clutter suppression. However, they have poor performance under the condition of low signal to interference plus noise ratio (SINR). In this letter, we put forward a novel method to detect a small target embedded in sea clutter based on an optimal filter. The proposed method keeps the energy in the frequency cell under test (FCUT) invariant, at the same time, it minimizes other frequency signals. Finally, detect target by judging the output SINR of every frequency cell. Compared with the neural networks, the algorithm proposed can detect under lower SINR. Using real-life radar data, we show that our method can detect the target effectively when the SINR is higher than -39dB which is 23dB lower than that needed by the neural networks.

An analog-beamforming-based eigenmode transmission technique is proposed that employs a network of interconnected 180-degree hybrid couplers at both transmitting and receiving sides of a plane-symmetrically configured short-range MIMO system. This technique can orthogonalize MIMO channels regardless of array parameters such as antenna spacing and Tx-Rx distance, provided the MIMO array is symmetric. For verifying the effectiveness of the proposed technique in channel orthogonalization, an experiment is conducted using a 4×4 MIMO array consisting of microstrip antennas and cascade-connected rat-race hybrid couplers. The results indicate a reduction in interference by approximately -28.3dB on average compared to desired signal power, and the ability to realize four-stream parallel MIMO transmission by using only analog passive networks. The proposed technique can achieve channel capacity almost equivalent to that of eigenbeam space division multiplexing with ideal digital beamforming.

In this paper, a method for designing of Incremental Granular Model (IGM) based on integration of Linear Regression (LR) and Linguistic Model (LM) with the aid of fuzzy granulation is proposed. Here, IGM is designed by the use of information granulation realized via Context-based Interval Type-2 Fuzzy C-Means (CIT2FCM) clustering. This clustering approach are used not only to estimate the cluster centers by preserving the homogeneity between the clustered patterns from linguistic contexts produced in the output space, but also deal with the uncertainty associated with fuzzification factor. Furthermore, IGM is developed by construction of a LR as a global model, refine it through the local fuzzy if-then rules that capture more localized nonlinearities of the system by LM. The experimental results on two examples reveal that the proposed method shows a good performance in comparison with the previous works.

HMAC is the most widely used hash based MAC scheme. Recently, several generic attacks have been presented against HMAC with a complexity between 2n/2 and 2n, where n is the output size of an underlying hash function. In this paper, we investigate the security of strengthened HMAC instantiated with a Merkle-Damgård hash function in which the key is used to process underlying compression functions. With such a modification, the attacker is unable to precompute the property of the compression function offline, and thus previous generic attacks are prevented. In this paper, we show that keying the compression function in all blocks is necessary to prevent a generic internal state recovery attack with a complexity less than 2n. In other words, only with a single keyless compression function, the internal state is recovered faster than 2n. To validate the claim, we present a generic attack against the strengthened HMAC instantiated with a Merkle-Damgård hash function in which only one block is keyless, thus pre-computable offline. Our attack uses the previous generic attack by Naito et al. as a base. We improve it so that the attack can be applied only with a single keyless compression function while the attack complexity remains unchanged from the previous work.

The conventional bilateral motion estimation (BME) for motion-compensated frame rate up-conversion (MC-FRUC) can avoid the problem of overlapped areas and holes but usually results in lots of inaccurate motion vectors (MVs) since 1) the MV of an object between the previous and following frames is more likely to have no temporal symmetry with respect to the target block of the interpolated frame and 2) the repetitive patterns existing in video frame lead to the problem of mismatch due to the lack of the interpolated block. In this paper, a new BME algorithm with a low computational complexity is proposed to resolve the above problems. The proposed algorithm incorporates multi-resolution search into BME, since it can easily utilize the MV consistency between two adjacent pyramid levels and spatial neighboring MVs to correct the inaccurate MVs resulting from no temporal symmetry while guaranteeing low computational cost. Besides, the multi-resolution search uses the fast wavelet transform to construct the wavelet pyramid, which not only can guarantee low computational complexity but also can reserve the high-frequency components of image at each level while sub-sampling. The high-frequency components are used to regularize the traditional block matching criterion for reducing the probability of mismatch in BME. Experiments show that the proposed algorithm can significantly improve both the objective and subjective quality of the interpolated frame with low computational complexity, and provide the better performance than the existing BME algorithms.

Among several optical devices in integrated optics, the fundamental characteristics of collinear optical switching devices have been studied about optical dielectric waveguides. Conventional waveguide-type acousto-optic (A-O) devices use collinear and longitudinal interactions with mode coupling based on the Bragg condition between optical waves and surface acoustic waves (SAW). Collinear A-O devices of the waveguide-type show sufficient performance for wavelength-selective switching with narrow bandwidths. However, in these collinear A-O devices, interaction time is several microseconds for 10 mm waveguide device length. In A-O devices of optical waveguides using transverse A-O interaction, where SAW propagates transversely to optical wave propagation direction, SAW propagation lengths needed for complete A-O interaction may become 10 µm and interaction time may be several nanoseconds. In this paper, fundamental characteristics of the transverse A-O interaction are studied as an electromagnetic boundary value problem. Refractive indices in optical waveguides induced by A-O effects with SAW are shown by sine functions. Wave field characteristics in periodic structures for transverse directions are analyzed by analytic method of Hill's equations for transverse spectral functions. Electromagnetic fields in regions with periodic structures are discussed by the Mathieu functions and the perturbation method. Dispersion characteristics of A-O eigen modes are studied for wavelengths of optical waves and SAW, with A-O coefficients.

With extensive use of automotive radars, mutual interference between radars has become a crucial issue, since it increases the noise floor in the frequency domain triggering frequent false alarms and unsafe decision. This paper introduces a mathematical model for a frequency-modulated continuous-wave (FMCW) radar in interfering environments. In addition, this paper proposes a time-domain interference suppression method to provide anti-interference capability regardless of the signal-to-interference ratio. Numerical results are presented to verify the performance of a 77GHz FMCW radar systme with the proposed method in interference-rich environments.

This paper presents the first non-trivial collision attack on the double-block-length compression function presented at FSE 2006 instantiated with round-reduced AES-256: f0(h0||h1,M)||f1(h0||h1,M) such that f0(h0||h1, M) = Eh1||M(h0)⊕h0 , f1(h0||h1,M) = Eh1||M(h0⊕c)⊕h0⊕c , where || represents concatenation, E is AES-256 and c is a 16-byte non-zero constant. The proposed attack is a free-start collision attack using the rebound attack proposed by Mendel et al. The success of the proposed attack largely depends on the configuration of the constant c: the number of its non-zero bytes and their positions. For the instantiation with AES-256 reduced from 14 rounds to 8 rounds, it is effective if the constant c has at most four non-zero bytes at some specific positions, and the time complexity is 264 or 296. For the instantiation with AES-256 reduced to 9 rounds, it is effective if the constant c has four non-zero bytes at some specific positions, and the time complexity is 2120. The space complexity is negligible in both cases.

This paper presents a new methodology of the over-the-air (OTA) assessment for vertically arranged multiple-input multiple-output (MIMO) array antennas. Particular emphasis is placed on how well handset MIMO antennas with a vertically arranged structure are characterized using the limited number of scatterers implemented in a fading emulator. First we studied the mechanism of the arrangement of scatterers on the variation of channel responses using a proposed three-dimensional analytical model. It is shown that the condition of a 3D-OTA with the prescribed parameters allows the correlation to be reduced, which permits the channel capacity to increase in the same manner that sufficient scatterers are distributed over the entire solid angle. Then the appropriate scatterers arrangement for a 3D-OTA instrument considering the number of DUT antenna elements and multipath characteristics is investigated. The analytical results show that a suitable scatterers arrangement can be determined for various conditions of multipath environments and numbers of array elements, and that the arrangement can be employed for designing an actual 3D-OTA apparatus.

In this letter, we show the recursive representation of the optimum projection matrix. The recursive representation of the orthogonal projection and oblique projection have been done in past references. These projections are optimum when the noise is only characterized by the white noise or the structured noise. However, in some practical applications, a desired signal is deteriorated by both the white noise and structured noise. In this situation, the optimum projection matrix has been given by Behrens. For this projection matrix, the recursive representation has not been done. Therefore, in this letter, we propose the recursive representation of this projection matrix.

In this paper, a novel method of high-grade brain tumor segmentation from multi-sequence magnetic resonance images is presented. Firstly, a Gaussian mixture model (GMM) is introduced to derive an initial posterior probability by fitting the fluid attenuation inversion recovery histogram. Secondly, some grayscale and region properties are extracted from different sequences. Thirdly, grayscale and region characteristics with different weights are proposed to adjust the posterior probability. Finally, a cost function based on the posterior probability and neighborhood information is formulated and optimized via graph cut. Experiment results on a public dataset with 20 high-grade brain tumor patient images show the proposed method could achieve a dice coefficient of 78%, which is higher than the standard graph cut algorithm without a probability-adjusting step or some other cost function-based methods.

Data stored in non-volatile memories may be destructed due to crosstalk and radiation but we can restore their data by using error-correcting codes. However, non-volatile memories consume a large amount of energy in writing. How to reduce maximum writing bits even using error-correcting codes is one of the challenges in non-volatile memory design. In this paper, we first propose Doughnut code which is based on state encoding limiting maximum and minimum Hamming distances. After that, we propose a code expansion method, which improves maximum and minimum Hamming distances. When we apply our code expansion method to Doughnut code, we can obtain a code which reduces maximum-flipped bits and has error-correcting ability equal to Hamming code. Experimental results show that the proposed code efficiently reduces the number of maximum-writing bits.