We propose a new configuration for a parallel fiber amplifier that can amplify both the C- and L-bands simultaneously by employing bundled Er3+-doped fiber (EDF). The bundled EDF is a candidate amplification medium for multi-core optical fiber amplifiers. Our parallel fiber amplifier is another application of the multi-core amplification medium. The amplifier achieves almost the same signal gain of 20 dB for both the C- and L-bands by using a bundled EDF, which is realized by bundling seven identical single-core EDFs.

In this letter, the amount of interference and an analytic methodology from a combination of Korea's LTE system and Japan's digital terrestrial TV broadcasting system using the 700 MHz frequency band are established when considering a practical deployment of both systems. We performed Monte-Carlo simulations on the throughput loss to evaluate how much interference radiating from Japan's DTV is imposed on the Korean LTE system. The results of the established methodology can be used as a guideline for allowing the deployed LTE system to avoid an unacceptable amount of interference.

Computational Fluid Dynamics (CFD) is used as a common design tool in the aerospace industry. UPACS, a package for CFD, is convenient for users, since a customized simulator can be built just by selecting desired functions. The problem is its computation speed, which is difficult to enhance by using the clusters due to its complex memory access patterns. As an economical solution, accelerators using FPGAs are hopeful candidate. However, the total scale of UPACS is too large to be implemented on small numbers of FPGAs. For cost efficient implementation, partial reconfiguration which dynamically loads only required functions is proposed in this paper. Here, the MUSCL scheme, which is used frequently in UPACS, is selected as a target. Partial reconfiguration is applied to the flux limiter functions (FLF) in MUSCL. Four FLFs are implemented for Turbulence MUSCL (TMUSCL) and eight FLFs are for Convection MUSCL (CMUSCL). All FLFs are developed independently and separated from the top MUSCL module. At start-up, only required FLFs are selected and deployed in the system without interfering the other modules. This implementation has successfully reduced the resource utilization by 44% to 63%. Total power consumption also reduced by 33%. Configuration speed is improved by 34-times faster as compared to full reconfiguration method. All implemented functions achieved at least 17 times speed-up performance compared with the software implementation.

The Hilbert-Schmidt independence criterion (HSIC) is a kernel-based statistical independence measure that can be computed very efficiently. However, it requires us to determine the kernel parameters heuristically because no objective model selection method is available. Least-squares mutual information (LSMI) is another statistical independence measure that is based on direct density-ratio estimation. Although LSMI is computationally more expensive than HSIC, LSMI is equipped with cross-validation, and thus the kernel parameter can be determined objectively. In this paper, we show that HSIC can actually be regarded as an approximation to LSMI, which allows us to utilize cross-validation of LSMI for determining kernel parameters in HSIC. Consequently, both computational efficiency and cross-validation can be achieved.

This paper presents two halftoning methods to improve efficiency in generating structurally similar halftone images using Structure Similarity Index Measurement (SSIM). Proposed Method I reduces the pixel evaluation area by applying pixel-swapping algorithm within inter-correlated blocks followed by phase block-shifting. The effect of various initial pixel arrangements is also investigated. Proposed Method II further improves efficiency by applying bit-climbing algorithm within inter-correlated blocks of the image. Simulation results show that proposed Method I improves efficiency as well as image quality by using an appropriate initial pixel arrangement. Proposed Method II reaches a better image quality with fewer evaluations than pixel-swapping algorithm used in Method I and the conventional structure aware halftone methods.

In this letter, we adopt a new factor analysis of neighborhood-preserving embedding (NPE) for speaker verification. NPE aims at preserving the local neighborhood structure on the data and defines a low-dimensional speaker space called neighborhood-preserving embedding space. We compare the proposed method with the state-of-the-art total variability approach on the telephone-telephone core condition of the NIST 2008 Speaker Recognition Evaluation (SRE) dataset. The experimental results indicate that the proposed NPE method outperforms the total variability approach, providing up to 24% relative improvement.

The Internet infrastructure is evolving with various approaches such as cloud computing. Interest in cloud computing is growing with the rise of services and applications particularly in business community. For delivering service securely, cloud computing providers are facing several security issues, including controlling access to services and ensuring privacy. Most of access control approaches tend to a centralization of policy administration and decision by introducing a mediator central third party. However, with the growth of the Internet and the increase of cloud computing providers, a centralized administration is no longer supported. In this paper, we present a new collaborative access control infrastructure for distributed cloud computing environment, supporting collaborative delegations across multiple domains in order to authorize users to access services at a visited domain that does not have a direct cooperative relationship with the user's home domain. For this purpose, we propose an extension of the XACML (eXtensible Access Control Markup Language) model with a new entity called Delegation Validation Point (DVP) to support multi-domain delegation in a distributed environment. We describe the new extended model and functionalities of the new component. In addition, we define new XACML messages for acquiring delegation across domains. For exchanging delegation between domains we use SAML (Security Association Markup Language) and Diameter protocol. Two Diameter applications are defined for transporting securely multiple delegation requests and answers and for building a trusted path of cooperation to acquire the chain of delegations. We detail the implemented prototype and evaluate performance within a testbed of up to 20 domains.

Recently, network coding has been applied to reliable multicast in wireless networks for packet loss recovery, resulting in significant bandwidth savings. In network-coding-based multicast schemes, once a receiver receives one packet from the source it sends an ACK to acknowledge packet receipt. Such acknowledgment mechanism has the following limitation: when an ACK from one receiver is lost, the source considers the corresponding packet to be lost at this receiver and then conducts unnecessary retransmission. Motivated by this basic observation, we first propose a block-based acknowledgment mechanism, where an ACK now acknowledges all previously received packets in the current block such that the later received ACKs can offset the loss of previous ACKs. To reduce the total amount of feedback overhead, we further propose a more simple feedback mechanism, in which the receivers only start to send acknowledgments from the last two packets (not from the first one as in the first mechanism) of the current block. The first mechanism has the potential to achieve better performance over the latter one in wireless networks with long deep fades (i.e., continuous packet losses) due to its continuous transmissions of ACKs, while the second one is more promising for wireless networks with only random packet losses due to its smaller amount of feedback. Both theoretical and simulation results demonstrate that, compared to the current acknowledgment mechanism in network-coding-based reliable multicast schemes, these two mechanisms can achieve much higher bandwidth efficiency.

In this paper, the design and fabrication of a miniaturized class-F 2.5 GHz 8 W power amplifier using a commercially available GaN HEMT bare chip from TriQuint and a Selectively Anodized Aluminum Oxide (SAAO) substrate are presented. The SAAO process was recently proposed and patented by Wavenics Inc., Daejeon, Korea, which provides the fabrication of small size circuit comparable to conventional MMIC and at drastically low cost due to the use of aluminum as a wafer. The advantage of low cost is especially promising for RF components fabrication in commercial applications like mobile communications. The fabricated power amplifier has a compact size of 4.4 4.4 mm2 and shows power added efficiency (PAE) of about 35% and harmonic suppression of above 30 dBc for second and third harmonics at an output power of 39 dBm.

Nowadays, there are a great deal of e-documents being accessed on the Internet. It would be helpful if those documents and significant extract contents could be automatically analyzed. Similarity analysis and topic extraction are widely used as document relation analysis techniques. Most of the methods being proposed need some processes such as stemming, stop words removal, and etc. In those methods, natural language processing (NLP) technology is necessary and hence they are dependent on the language feature and the dataset. In this study, we propose novel document relation analysis and topic extraction methods based on text compression. Our proposed approaches do not require NLP, and can also automatically evaluate documents. We challenge our proposal with model documents, URCS and Reuters-21578 dataset, for relation analysis and topic extraction. The effectiveness of the proposed methods is shown by the simulations.

We investigate the possibility of reducing router power consumption through dynamic router performance control. The proposed algorithm employs a typical low pass filter and, therefore, is simple enough to implement in each related element in a router. Numerical experiments using several real Internet traffic data sets show the degree of reduction in power consumption that can be achieved by using the proposed dynamic performance control algorithm. Detailed analysis clarifies the relationships among various parameter values that include packet loss ratios and the degree of power savings. We also propose a simple method based on the leaky bucket model, which can instantaneously estimate the packet loss ratio. It is shown that this simple method yields a good approximation of the results obtained by exact packet-by-packet simulation. The simple method easily enables us to derive appropriate parameter values for the control algorithm for given traffic that may differ in different segments of the Internet.

Sensor networks, in which many small terminals are wirelessly connected, have recently received considerable interest according to the development of wireless technology and electronic circuit. To provide advanced applications and services by the sensor networks, data collection including node location is essential. Hence the location estimation is important and many localization schemes have been proposed. Time of arrival (TOA) localization is one of the popular schemes because of its high estimation accuracy in ultra wide-band (UWB) sensor networks. However, a non-line-of-sight (NLOS) environment between the target and the anchor nodes causes a serious estimation error because the time is delayed more than its true one. Thus, the NLOS nodes should be detected and eliminated for estimation. As a well-known NLOS detection scheme, an iterative minimum residual (IMR) scheme which has low calculation complexity is used for detection. However, the detection error exists in IMR scheme due to the measurement error. Therefore, in this paper, we propose a new IMR-based NLOS detection scheme and show its performance improvement by computer simulations.

For maximum-likelihood (ML) estimation to jointly track carrier frequency offset (CFO) and channel impulse response (CIR) in orthogonal frequency division multiplexing (OFDM) systems, we present a finite high order approximation method utilizing the MATLAB ‘roots' command on the log-likelihood function derived from the OFDM received signal, coupled with an adaptive iteration algorithm. The tracking performance of this high order approximation algorithm is found to be excellent, and as expected, the algorithm outperforms the other existing first order approximation algorithms.

The energy consumption is always a serious problem for mobile devices powered by battery. As the capacity and density of off-chip memory continuous to scale, its energy consumption accounts for a considerable amount of the whole system energy. There are therefore strong demands for energy efficient techniques towards memory system. Different from previous works, we explore the different power management modes of the off-chip memory by process scheduling for the multi-core mobile devices. In particular, we schedule the processes based on their memory access characteristics to maximize the number of the memory banks being in low power mode. We propose a fast approximation algorithm to solve the scheduling process problem for the dual-core mobile device. And for those equipped with more than two cores, we prove that the scheduling process problem is NP-Hard, and propose two heuristic algorithms. The proposed algorithms are evaluated through a series of experiments, for which we have encouraging results.

It is becoming more and more important to make use of personal or classified information while keeping it confidential. A promising tool for meeting this challenge is secure multi-party computation (MPC). It enables multiple parties, each given a snippet of a secret s, to compute a function f(s) by communicating with each other without revealing s. However, one of the biggest problems with MPC is that it requires a vast amount of communication. Much research has gone into making each protocol (equality testing, interval testing, etc.) more efficient. In this work, we make a set of multiple protocols more efficient by transforming them into their equivalent batch processing form and propose two protocols: “Batch Logical OR” and “Batch Logical AND.” Using proposed protocols recursively, we also propose “Batch Logical OR-AND” and “Batch Logical AND-OR,” and show arbitrary formula consisting of Boolean protocols, OR gates, and AND gates can be batched. Existing logical OR and logical AND protocols consisting of t equality testing invocations have a communication complexity of O(t), where is the bit length of the secrets. Our batched versions of these protocols reduce it to O( + t). For t interval testing invocations, they reduce both communication and round complexity. Thus they can make the queries on a secret shared database more efficient. For example, the use of the proposed protocols reduces the communication complexity for a query consisting of equality testing and interval testing by approximately 70% compared to the use of the corresponding existing protocols. The concept of the proposed protocols is versatile and can be applied to logical formulae consisting of protocols other than equality testing and interval testing, thereby making them more efficient as well.

This paper presents the analysis on hidden node due to multiple transmission power level and its potential impact to system performance of White Space radio operating in the TV bands, a.k.a TV white space (TVWS). For this purpose, a generic interference model for determining the hidden node occurrence probability based on realistic physical (PHY) layer model is developed. Firstly, the generic hidden node interference model is constructed considering typical TVWS radio network deployment scenario. Emphasis is given on cases where the hidden node scenario involves multiple transmission power level. Secondly, the PHY layer design and channel propagation are modeled to analyze the realistic operating range of the TVWS radio. By combining the hidden node interference model and the PHY layer/propagation models, the realistic probability of hidden node occurrence is calculated. Finally, the performance degradation in the victim receiver due to interference generated by the potential hidden node is quantified. As a result, for urban environment, it is found that for networks consisting of devices with multiple transmit power level, the probability of hidden node occurrence is similar to that of networks consisting of devices with uni-transmit power level, provided that the interferer-victim separation distance in the former is 800 m farther apart. Furthermore, this number may increase to a maximum of 1.1 km in a suburban environment. Also, it is found that if the hidden node actually occurs, a co-channel interference (CCI) of -15 dB typically causes a degradation of 2 dB in the victim receiver.

This paper proposes a cumulative DNL (CDNL) test methodology for the BIST of ADCs. It analyzes the histogram of the DNL of a predetermined k LSBs distance to determine the DNL and gain error. The advantage of this method over others is that the numbers of required code bins and required samples are significantly reduced. The simulation and measurements of a 12-bit ADC show that the proposed CDNL has an error of less than 5% with only 212 samples, which can only be achieved with 222 samples using the conventional method. It only needs 16 registers to store code bins in this experiment.

This paper addresses conjugate-gradient (CG) based pilot-assisted channel estimation and equalization in doubly selective channels for orthogonal frequency division multiplexing (OFDM) block transmissions. With the help of the discrete prolate spheroidal sequence, which shows flat mean-square error (MSE) curves for the reconstructed channels in the presence of Doppler frequency mismatch, a basis expansion model for a parsimonious channel representation over multiple OFDM blocks is developed, a system equation for the least square channel estimation under widely used pilot lattices, where the pilot symbols are irregularly placed in the subcarrier domain, is formulated by introducing carving matrices, and the standard CG method is applied to the system. Relying on the CG method again, the linear minimum mean-square error channel equalization is pursued without performing any matrix inversion, while elevating the convergence speed of the iterative algorithm with a simple preconditioner. Finally, we validate our schemes with numerical experiments on the integrated services digital broadcasting-terrestrial system in doubly-selective channels and determine the normalized MSE and uncoded bit error rate.

A wideband beamformer with mainlobe control is proposed. To make the beamformer robust against pointing errors, inequality rather than equality constraints are used to restrict the mainlobe response, thus more degrees of freedom are saved. The constraints involved are nonconvex, therefore are linearly approximated so that the beamformer can be obtained by iterating a second-order cone program. Moreover, the response variance element is introduced to achieve a frequency invariant beamwidth. The effectiveness of the technique is demonstrated by numerical examples.

In this letter, we propose a novel binding scheme for network mobility support in PMIPv6 networks where new network-layer messages are suggested to solve the duplicate tunneling problem. Also our proposed scheme is designed to reduce handover latency and signaling overhead for network-based mobility management. To evaluate the performance of our method, we verify the operation of the proposed scheme with the network simulator, ns-2, and accomplished the simulation to show its superior performance. The simulation results show that our proposed scheme works more efficiently than the scheme defined by the IETF NETLMM WG in terms of packet loss, handover latency, and average packet throughput.