This paper proposes the assignment of resource blocks (RBs) to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) in a multi-user OFDM system. This system ranks the users according to the channel state information (CSI) for RB assignment. In our proposed technique, an RB is assigned to either the first- or second-ranked mobile station (MS) to minimize the PAPR of the OFDM signal. While this process reduces the PAPR, the throughput is also reduced because of the user diversity gain loss. A PAPR-throughput tradeoff is then established. Theoretical analyses and computer simulations confirm that when the number of MSs becomes large, the PAPR-throughput tradeoff is eased because of the minimal effect of the diversity gain loss. Therefore, significant PAPR reduction is achieved with only a slight degradation in the throughput.

Ultra-wide band (UWB) radar has a great advantage for range resolution, and is suitable for 3-dimensional (3-D) imaging sensor, such as for rescue robots or surveillance systems, where an accurate 3-dimensional measurement, impervious to optical environments, is indispensable. However, in indoor sensing situations, an available aperture size is severely limited by obstacles such as collapsed furniture or rubles. Thus, an estimated region of target image often becomes too small to identify whether it is a human body or other object. To address this issue, we previously proposed the image expansion method based on the ellipse extrapolation, where the fitting space is converted from real space to data space defined by range points to enhance the extrapolation accuracy. Although this method achieves an accurate image expansion for some cases, by exploiting the feature of the efficient imaging method as range points migration (RPM), there are still many cases, where it cannot maintain sufficient extrapolation accuracy because it only employs the single scattered component for imaging. For more accurate extrapolation, this paper extends the above image expansion method by exploiting double-scattered signals between the target and the wall in an indoor environment. The results from numerical simulation validate that the proposed method significantly expands the extrapolated region for multiple elliptical objects, compared with that obtained using only single scattered signal.

A scalable low voltage signaling (SLVS) transmitter, with asymmetric impedance calibration, is proposed for mobile applications which require low power consumption. The voltage swing of the proposed SLVS transmitter is scalable from 40,mV to 440,mV. The proposed asymmetric impedance calibration asymmetrically controls the pull-up and pull-down drivers for the SLVS transmitter with an impedance of 50,$Omega$. This makes it possible to remove the additional regulator used to calibrate the impedance of an output driver by controlling the swing level of a pre-driver. It also maintains the common mode voltage at the center voltage level of the transmitted signal. The proposed SVLS transmitter is implemented using a 0.18-$mu $m 1-poly 6-metal CMOS process with a 1.2-V supply. The active area and power consumption of the transmitter are $250 imes 123 mu$ m$^{2}$ and 2.9,mW/Gb/s, respectively.

Wireless Local Area Networks (WLANs) are widely deployed for internet access. Multiple interfering Access Points (APs) lead to a significant increase in collisions, that reduces throughput and affects media traffic. Thus, interference mitigation among different APs becomes a crucial issue in Multi-Cell WLAN systems. One solution to this issue is to assign a different frequency channel to each AP so as to prevent neighboring cells from operating on the same channel. However, most of the existing WLANs today operate in the unlicensed 2.4GHz Industrial, Scientific and Medical (ISM) band, which suffers from lack of the available channels. Therefore, effective channel assignment to minimize the interference in Multi-Cell WLANs is necessary. In this article, we formulate the channel assignment problem as a mixed integer linear programming (MILP) problem that minimizes the worst case total interference power. The main advantage of this algorithm is that it provides a global solution and at the same time guarantees a non-overlapping channel assignment. We also propose a Lagrangian relaxation approach to transform the MILP into a low complexity linear program which can be solved efficiently in real time, even for large sized networks. Simulation results reveal that both the MILP algorithm and the Lagrangian relaxation approach provide a total interference reduction below the default setting of having all APs assigned the same channel. In addition, simulation results on cumulative density function (CDF) of the SINR at the user level prove the validity of the proposed algorithms.

We discuss a new high performance computing service (HPCS) platform that has been developed to provide domain-neutral computing service under the governmental support from “EDucation-research Integration through Simulation On the Net” (EDISON) project. With a first focus on technical features, we not only present in-depth explanations of the implementation details, but also describe the strengths of the EDISON platform against the successful nanoHUB.org gateway. To validate the performance and utility of the platform, we provide benchmarking results for the resource virtualization framework, and prove the stability and promptness of the EDISON platform in processing simulation requests by analyzing several statistical datasets obtained from a three-month trial service in the initiative area of computational nanoelectronics. We firmly believe that this work provides a good opportunity for understanding the science gateway project ongoing for the first time in Republic of Korea, and that the technical details presented here can be served as an useful guideline for any potential designs of HPCS platforms.

Maximizing network lifetime and optimizing aggregate system utility are important but usually conflict goals in wireless multi-hop networks. For the trade-off, we present a matrix game-theoretic cross-layer optimization formulation to jointly maximize the diverse objectives in such networks with network coding. To this end, we introduce a cross-layer formulation of general network utility maximization (NUM) that accommodates routing, scheduling, and stream control from different layers in the coded networks. Specifically, for the scheduling problem and then the objective function involved, we develop a matrix game with the strategy sets of the players corresponding to hyperlink and transmission mode, and design multiple payoffs specific to lifetime and system utility, respectively. In particular, with the inherit merit that matrix game can be solved with mathematical programming, our cross-layer programming formulation actually benefits from both game-based and NUM-based approaches at the same time by cooperating the programming model for the matrix game with that for the other layers in a consistent framework. Finally, our numerical experiments quantitatively exemplify the possible performance trad-offs with respect to the two variants developed on the multiple objectives in question while qualitatively exhibiting the differences between the framework and the other related works.

The next generation of information technology demands both high capacity and mobility for applications such as high speed wireless access capable of supporting broadband services. The transport of wireless and wireline signals is converging into a common telecommunication infrastructure. In this paper, we will present the Marie Curie Framework Program 7 project “Wireless and wireline service convergence in next generation optical access networks” (WISCON), which focuses on the conception and study of novel architectures for wavelength-division-multiplexing (WDM) optical multi-modulation format radio-over-fiber (RoF) systems; this is a promising solution to implement broadband seamless wireless -wireline access networks. This project successfully concluded in autumn 2013, and is being follow up by another Marie Curie project entitled “flexible edge nodes for dynamic optical interconnection of access and core networks” (FENDOI), which will be also briefly described.

We investigate resolution improvement in optical quantization with keeping high sampling rate performance in optical sampling. Since our optical quantization approach uses power-to-wavelength conversion based on soliton self-frequency shift, a spectral compression can improve resolution in exchange for sampling rate degradation. In this work, we propose a different approach for resolution improvement by parallel use of dispersion devices so as to avoid sampling rate degradation. Additional use of different dispersion devices can assist the wavelength separation ability of an original dispersion device. We demonstrate the principle of resolution improvement in 3 bit optical quantization. Simulation results based on experimental evaluation of 3 bit optical quantization system shows 4 bit optical quantization is achieved by parallel use of dispersion devices in 3 bit optical quantization system. The maximum differential non-linearity (DNL) and integral non-linearity (INL) are 0.49 least significant bit (LSB) and 0.50 LSB, respectively. The effective number of bits (ENOB) estimated to 3.62 bit.

Many detailed studies ranging from networking to hardware as well as standardization activities over the last few years have advanced the performance of the elastic optical network. Thanks to these intensive works, the elastic optical network has been becoming feasible. This paper reviews the recent advances in the elastic optical network from the aspects of networking technology and hardware design. For the former, we focus on the efficient elastic network design technology related to routing and spectrum assignment (RSA) of elastic optical paths including network optimization or standardization activities, and for the latter, two key enabling technologies are discussed: elastic transponders/regenerators and gridless optical switches. Making closely-dependent networking and hardware technologies work synergistically is the key factor in implementing truly effective elastic optical networks.

Currently, a correspondent host will have difficulties in establishing a direct session path to a mobile host because of the partial deployment of MIPv6-aware mobile hosts. Even MIPv6-aware hosts will spend up to several seconds to obtain the new location of the mobile host during Layer 3 (L3) handover. This paper proposes an application-level mobility management scheme that can solve the problems related to the increase of Internet traffic end-to-end delay under the current situation that most of the mobile devices are MIPv6-non-aware. The proposed Secure Mobility Management Application (SMMA) enables the updates of care-of address to be faster and more reliable even when L3 handovers occur frequently. SMMA uses a cross-layer approach for session mobility management with the support of Binding Updates to the home agent via IPSec tunnels. The main feature of SMMA is to handle the session-related mobility management for which operation starts just after the completion of name resolution as a pre-call mobility management, which operates in conjunction with the DNS. Our session-related mobility management introduces three new signaling messages: SS-Create for session state creation, SS-Refresh for session state extension and SS-Renewal for updating new care-of address at the mid-session. Finally, this paper analyzes the work load imposed on a mobile host to create a session state and the security strength of the SS-Renewal message, which depends on the key size used.

This paper presents a comparative study of the number of pieces of optical transport equipment, network cost and power consumption depending on the transmission reach of the 400-Gb/s-based signal between flexible-bitrate networks using 100-Gb/s and 400-Gb/s signals and 100-Gb/s-based single-line-rate networks. In this study, we use three types of network topologies: a North American network topology, a European network topology and a Japan photonic network topology. As for the transmission reach of the 400-Gb/s-based signal, considering performance margins, different transmission reaches of the 400-Gb/s signal are assumed varying from 300km to 600km with 100-km increments. We show that the 100-Gb/s and 400-Gb/s-based flexible-bitrate networks are effective for cutting the total number of pieces of equipment and could be effective for reducing network cost and power consumption depending on the transmission reach of the 400-Gb/s signal in the case of a relatively small-scale network.

Nonlinearity compensation algorithm and soft-decision forward error correction (FEC) are considered as key technologies for future high-capacity and long-haul optical transmission system. In this report, we experimentally demonstrate the following three benefits brought by low complexity perturbation back-propagation nonlinear compensation algorithm in 224Gb/s DP-16QAM transmission over large-Aeff pure silica core fiber; (1) improvement of pre-FEC bit error ratio, (2) reshaping noise distribution to more Gaussian, and (3) reduction of cycle slip probability.

The recently suggested regular-type triangular quadrature amplitude modulation (TQAM) provides considerable power gain over square quadrature amplitude modulation (SQAM) at the expense of a slight increase in detection complexity. However, the power gain of the TQAM is limited due to the constraint that signal points should be regularly located at the vertexes of contiguous equilateral triangles. In this paper, we investigate two irregular (optimum and suboptimum) TQAMs where signal points are irregularly distributed while preserving the equilateral triangular lattice, and calculate achievable power gains of the proposed constellations. We also address optimum and suboptimum bit stream mapping methods and suggest a simple and optimum detection method for the constellations to be meaningful in practical implementation, and present analytical and simulation results. The proposed constellations can provide the asymptotic power gains of 0.825dB and 0.245dB over SQAM and regular TQAM, respectively.

We experimentally demonstrate an optical packet and circuit integrated (OPCI) ring network interoperated with a wavelength-switched optical network (WSON) in a network domain. OPCI network and WSON have distinct characteristics from each other: the methods to transfer path control messages and the protocols to set up or delete the optical connections in an optical circuit switch. To interoperate the two types of optical networks, we develop a common path control-plane which can establish or release an end-to-end path by only one autonomous distributed signaling process without stitching. In the common path control-plane, we modify the signaling protocol for OCS so that we can allocate a distinct wavelength to each link on an end-to-end path and also allocate a distinct path route to each of downstream and upstream directions in a bi-directional path. We experimentally show that the common path control-plane can dynamically establish end-to-end paths over the heterogeneous network including the two types of optical networks.

For the sake of privacy preservation, services that are offered with reference to individual user preferences should do so with a sufficient degree of anonymity. We surveyed various tools that meet requirements of such services and decided that group signature schemes with weakened anonymity (without unlinkability) are adequate. Then, we investigated a theoretical gap between unlinkability of group signature schemes and their other requirements. We show that this gap is significantly large. Specifically, we clarify that if unlinkability can be achieved from any other property of group signature schemes, it becomes possible to construct a chosen-ciphertext secure cryptosystem from any one-way function. This result implies that the efficiency of group signature schemes can be drastically improved if unlinkability is not taken into account. We also demonstrate a way to construct a scheme without unlinkability that is significantly more efficient than the best known full-fledged scheme.

Consider a simple undirected graph G = (V,E) with vertex set V and edge set E. Let G-u be a subgraph induced by the vertex set V-{u}. The distance δG(x,y) is defined as the length of the shortest path between vertices x and y in G. The vertex u ∈ V is a hinge vertex if there exist two vertices x,y ∈ V-{u} such that δG-u(x,y)>δG(x,y). Let U be a set consisting of all hinge vertices of G. The neighborhood of u is the set of all vertices adjacent to u and is denoted by N(u). We define d(u) = max{δG-u(x,y) | δG-u(x,y)>δG(x,y),x,y ∈ N(u)} for u ∈ U as detour degree of u. A maximum detour hinge vertex problem is to find a hinge vertex u with maximum d(u) in G. In this paper, we proposed an algorithm to find the maximum detour hinge vertex on an interval graph that runs in O(n2) time, where n is the number of vertices in the graph.

The proposed stimulus design for linearity test is embedded in a differential successive approximation register analog-to-digital converter (SAR ADC), i.e. a design for testability (DFT). The proposed DFT is compatible to the pattern generator (PG) and output response analyzer (ORA) with the cost of 12.4-% area of the SAR ADC. The 10-bit SAR ADC prototype is verified in a 0.18-µm CMOS technology and the measured differential nonlinearity (DNL) error is between -0.386 and 0.281 LSB at 1-MS/s.

We consider the problem of optimizing the quantizer design for distributed estimation systems where all nodes located at different sites collect measurements and transmit quantized data to a fusion node, which then produces an estimate of the parameter of interest. For this problem, the goal is to minimize the amount of information that the nodes have to transmit in order to attain a certain application accuracy. We propose an iterative quantizer design algorithm that seeks to find a non-regular mapping between quantization partitions and their codewords so as to minimize global distortion such as the estimation error. We apply the proposed algorithm to a system where an acoustic amplitude sensor model is employed at each node for source localization. Our experiments demonstrate that a significant performance gain can be achieved by our technique as compared with standard typical designs and even with distributed novel designs recently published.

At CaLC 2001, Howgrave-Graham proposed the polynomial time algorithm for solving univariate linear equations modulo an unknown divisor of a known composite integer, the so-called partially approximate common divisor problem. So far, two forms of multivariate generalizations of the problem have been considered in the context of cryptanalysis. The first is simultaneous modular univariate linear equations, whose polynomial time algorithm was proposed at ANTS 2012 by Cohn and Heninger. The second is modular multivariate linear equations, whose polynomial time algorithm was proposed at Asiacrypt 2008 by Herrmann and May. Both algorithms cover Howgrave-Graham's algorithm for univariate cases. On the other hand, both multivariate problems also become identical to Howgrave-Graham's problem in the asymptotic cases of root bounds. However, former algorithms do not cover Howgrave-Graham's algorithm in such cases. In this paper, we introduce the strategy for natural algorithm constructions that take into account the sizes of the root bounds. We work out the selection of polynomials in constructing lattices. Our algorithms are superior to all known attacks that solve the multivariate equations and can generalize to the case of arbitrary number of variables. Our algorithms achieve better cryptanalytic bounds for some applications that relate to RSA cryptosystems.

A three dimensional (3D) chip stack featuring a 4096-bit wide I/O demonstrator incorporates an in-place waveform capturer on an intermediate interposer within the stack. The capturer includes probing channels on paths of signaling as well as in power delivery and collects analog waveforms for diagnosing circuits within 3D integration. The collection of in-place waveforms on vertical channels with through silicon vias (TSVs) are demonstrated among 128 vertical I/O channels distributed in 8 banks in a 9.9mm × 9.9mm die area. The analog waveforms confirm a full 1.2-V swing of signaling at the maximum data transmission bandwidth of 100GByte/sec with sufficiently small deviations of signal skews and slews among the vertical channels. In addition, it is also experimentally confirmed that the signal swing can be reduced to 0.75V for error free data transfer at 100GByte/sec, achieving the energy efficiency of 0.21pJ/bit.