Many selected mapping (SLM) schemes have been proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signal sequences. In this paper, an efficient selection (ES) method of the OFDM signal sequence with minimum PAPR among many alternative OFDM signal sequences is proposed; it supports various SLM schemes. Utilizing the fact that OFDM signal components can be sequentially generated in many SLM schemes, the generation and PAPR observation of the OFDM signal sequence are processed concurrently. While the u-th alternative OFDM signal components are being generated, by applying the proposed ES method, the generation of that alternative OFDM signal components can be interrupted (or stopped) according to the selection criteria of the best OFDM signal sequence in the considered SLM scheme. Such interruption substantially reduces the average computational complexity of SLM schemes without degradation of PAPR reduction performance, which is confirmed by analytical and numerical results. Note that the proposed method is not an isolated SLM scheme but a subsidiary method which can be easily adopted in many SLM schemes in order to further reduce the computational complexity of considered SLM schemes.

A projective Reed-Muller (PRM) code, obtained by modifying a Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The minimum distance and the dual code of a PRM code are known, and some decoding examples have been presented for low-dimensional projective spaces. In this study, we construct a decoding algorithm for all PRM codes by dividing a projective space into a union of affine spaces. In addition, we determine the computational complexity and the number of correctable errors of our algorithm. Finally, we compare the codeword error rate of our algorithm with that of the minimum distance decoding.

This letter considers a unified tone mapping operation (TMO) for HDR images. The unified TMO can perform tone mapping for various HDR image formats with a single common operation. The integer TMO which can realize unified tone mapping by converting an input HDR image into an intermediate format is proposed. This method can be executed efficiently with low memory and low performance processor. However, only floating-point HDR image formats have been considered in the method. In other words, a long-integer which is one of the HDR image formats has not been considered in the method. This letter applies the method to a long-integer format, and confirm its performance. The experimental results show the proposed method is effective for an integer format in terms of the resources such as the computational cost and the memory cost.

A connector model expressed as an inductance is proposed for use in a previously reported common-mode antenna model. The common-mode antenna model is an equivalent model for estimating only common-mode radiation from a printed circuit board (PCB) more quickly and with less computational resources than a calculation method that fully divides the entire structure of the PCB into elemental cells, such as narrow signal traces and thin dielectric layers. Although the common-mode antenna model can estimate the amount of radiation on the basis of the pin configuration of the connector between two PCBs, the calculation results do not show the peak frequency shift in the radiation spectrum when there is a change in the pin configuration. A previous study suggested that the frequency shift depends on the total inductance of the connector, which led to the development of the connector model reported here, which takes into account the effective inductance of the connector. The common-mode antenna model with the developed connector model accurately simulates the peak frequency shift caused by a change in the connector pin configuration. The results agree well with measured spectra (error of 3 dB).

Out-of-order superscalar processors rename register numbers to remove false dependencies between instructions. A renaming logic for register renaming is a high-cost module in a superscalar processor, and it consumes considerable energy. A renamed trace cache (RTC) was proposed for reducing the energy consumption of a renaming logic. An RTC caches and reuses renamed operands, and thus, register renaming can be omitted on RTC hits. However, conventional RTCs suffer from several performance, energy consumption, and hardware overhead problems. We propose a semi-global renamed trace cache (SGRTC) that caches only renamed operands that are short distance from producers outside traces, and solves the problems of conventional RTCs. Evaluation results show that SGRTC achieves 64% lower energy consumption for renaming with a 0.2% performance overhead as compared to a conventional processor.

We design a new hash table for high-speed networking that reduces main memory accesses even when the ratio of inserted items to the table size is high, at which point previous schemes no longer work. This improvement comes from a new design of a summary, called expanded keys, exploiting recent multiple hash functions and Bloom filter theories.

In this paper, we investigate the effect of outdated channel state information (CSI) on decode-and-forward opportunistic mobile relaying networks with direct link (DL) between source node and destination node. Relay selection schemes with different levels of CSI are considered: 1) only outdated CSI is available during the relay selection procedure; 2) not only outdated CSI but also second-order statistics information are available in relay selection process. Three relay selection schemes are proposed based on the two levels of outdated CSI. Closed-form expressions of the outage probability are derived for the proposed relay selection schemes. Meanwhile, the asymptotic behavior and the achievable diversity of three relay selection schemes are analyzed. Finally, simulation results are presented to verify our analytical results.

Time performance optimization and resource conflict resolution are two important challenges in multiple project management contexts. Compared with traditional project management, multi-project management usually suffers limited and insufficient resources, and a tight and urgent deadline to finish all concurrent projects. In this case, time performance optimization of the global project management is badly needed. To our best knowledge, existing work seldom pays attention to the formal modeling and analyzing of multi-project management in an effort to eliminate resource conflicts and optimizing the project execution time. This work proposes such a method based on PRT-Net, which is a Petri net-based formulism tailored for a kind of project constrained by resource and time. The detailed modeling approaches based on PRT-Net are first presented. Then, resource conflict detection method with corresponding algorithm is proposed. Next, the priority criteria including a key-activity priority strategy and a waiting-short priority strategy are presented to resolve resource conflicts. Finally, we show how to construct a conflict-free PRT-Net by designing resource conflict resolution controllers. By experiments, we prove that our proposed priority strategy can ensure the execution time of global multiple projects much shorter than those without using any strategies.

Low-temperature bonding methods of optoelectronic chips, such as laser diodes (LD) and photodiode (PD) chips, have been the focus of much interest to develop highly functional and compact optoelectronic devices, such as microsensors and communication modules. In this paper, room-temperature bonding of the optoelectronic chips with Au thin film to coined Au stud bumps with smooth surfaces (Ra: 1.3nm) using argon and hydrogen gas mixture atmospheric-pressure plasma was demonstrated in ambient air. The die-shear strength was high enough to exceed the strength requirement of MIL-STD-883F, method 2019 (×2). The measured results of the light-current-voltage characteristics of the LD chips and the dark current-voltage characteristics of the PD chips indicated no degradation after bonding.

This paper deals with a beamforming and cell ID detection technique for a mobile station (MS) with multiple antenna arrays in millimeter wave (mm-wave) cellular communication systems. Multiple antenna arrays, required to cover the entire space around the MS, can be used to estimate the direction of arrivals (DoAs) and cell IDs, form beams in the direction of DoAs, select a serving cell in a cooperative manner, and improve BER performance by signal combining. However, a signal may enter the overlapped region formed by two adjacent arrays in the MS, resulting in a double-counting problem during the cell searching period. In this paper, a beamforming and cell detection technique without double-counting is proposed to handle this problem, and they are evaluated by simulation in a simple scenario of an mm-wave cellular system with spatial channel model (SCM).

The memory issue plays a very important role for the performance evaluation of a design of 2-Dimensional Discrete Wavelet Transform (2DDWT). A traditional 2DDWT architecture generally needs DRAM to store the input pixel and memory to store temporary results between the row and column processors. In this article, we present a system on a chip (SoC) for video/image processing. The chip integrates an analog-to-digital converter (ADC) with a highly efficient-memory 2DDWT. The latter one contains two main components only: a row processor and a column processor. With this integrated chip plus the use of feedback shift registers (FSR) in the column processor, the architecture we propose can disuse the DRAM and reduce the memory. The pipelined technique is also utilized in the proposed 2DDWT to shorten the critical path to an adder delay. Our architecture outperforms the existing architectures in that it uses less memory size and has low control complexity. It needs only a 2N register instead of a 3.5N register of traditional architectures for a one-level 2DDWT of the 5/3 Lifting-based Discrete Wavelet Transform (LDWT) in an N x N image. Our 2DDWT architecture is coded in VerilogHDL and the Synopsys Design Compiler is employed to synthesize the design with the standard-cell from TSMC 0.18 µm cell library for verification. The ADC is designed by a full-custom methodology, plays as an IP of the SoC. With the integrated SoC, based on the mix-mode design flow, the proposed work requires no external memory, which accordingly reduces the power consumption by memory access and 20 I/O PADs, it also reduces the printed circuit board (PCB) size. Moreover, the proposed SoC supports the resolution of 10 bits and can easily integrate further with the CMOS image sensor (CIS) or other IPs. This, then, completes a single chip and which is ready for a real-time wavelet-based video coding.

We propose a cooperative spectrum sensing scheme based on sub-Nyquist sampling in cognitive radios. Our main purpose is to understand the uncertainty caused by sub-Nyquist sampling and to present a sensing scheme that operates at low sampling rates. In order to alleviate the aliasing effect of sub-Nyquist sampling, we utilize cooperation among secondary users and the sparsity order of channel occupancy. The simulation results show that the proposed scheme can achieve reasonable sensing performance even at low sampling rates.

In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ1)c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.

In this paper we propose an adaptive bitrate (ABR) algorithm that selects the video rates by observing and controlling the playback buffer. In a Hypertext Transfer Protocol (HTTP) adaptive streaming session, buffer dynamics largely depend on the chunk sizes. First, we present the algorithm that selects the next video rates based on the current buffer level, while considering the upcoming chunk sizes. We aim to exploit the variation of chunk sizes of a variable bitrate (VBR) encoded video to optimize the tradeoff between the video rate and buffer underflow events while keeping a low frequency of video rate changes. To evaluate the performance of the proposed algorithm, we consider three scenarios: (i) the video flow does not compete with any cross traffic, (ii) the video flow shares the bottleneck link with competing TCP traffic, and (iii) two HTTP clients share the bottleneck. We show that the proposed algorithm selects a high playback video rate and avoids unnecessary rebuffering while keeping a low frequency of video rate changes. Furthermore, we show that the proposed algorithm changes the video quality gradually to guarantee the user's viewing experience.

The individual steps of UV imprint lithography have been explained in detail from the points of manufacturing nano-structures. The applications to photonic devices have been also introduced.

In the field of education such as elementary and middle schools, teachers want to take care of schoolchildren during physical trainings and after-school club activities. On the other hand, in the field of sports such as professional and national-level sports, physical or technical trainers want to manage the health, physical and physiological conditions of athletes during exercise trainings in the grounds. In this way, it is required to monitor vital signs for persons during exercises, however, there are several technical problems to be solved in its realization. In this paper, we present the importance and necessity of vital monitoring for persons during exercises, and to make it possible periodically, reliably and in real-time, we present the solutions which we have so far worked out and point out remaining technical challenges in terms of vital/physical sensing, wireless transmission and human interface.

In this paper, we formulate an optimal stabilization problem of quantitative discrete event systems (DESs) under partial observation. A DES under partial observation is a system where its behaviors cannot be completely observed by a supervisor. In our framework, the supervisor observes not only masked events but also masked states. Our problem is then to synthesize a supervisor that drives the DES to a given target state with the minimum cost based on the detected sequences of masked events and states. We propose an algorithm for deciding the existence of an optimal stabilizing supervisor, and compute it if it exists.

To overcome the privacy limitations of conventional PKI (Public Key Infrastructure) systems, combinatorial certificate schemes assign each certificate to multiple users so that users can perform anonymous authentication. From a certificate pool of N certificates, each user is given n certificates. If a misbehaving user revokes a certificate, all the other users who share the revoked certificate will also not be able to use it. When an honest user shares a certificate with a misbehaving user and the certificate is revoked by the misbehaving user, the certificate of the honest user is said to be covered. To date, only the analysis for the worst scenario has been conducted; the probability that all n certificates of an honest user are covered when m misbehaving users revoke their certificates is known. The subject of this article is the following question: how many certificates (among n certificates) of an honest user are covered on average when m misbehaving users revoke their certificates? We present the first average-case analysis of the cover probability in combinatorial certificate schemes.

In previous papers by the authors, a new scheme for diagnosis of stochastic discrete event systems, called sequence profiling (SP), is proposed. From given event logs, N-gram models that approximate the behavior of the target system are extracted. N-gram models are used for discovering discrepancy between observed event logs and the behavior of the system in the normal situation. However, when the target system is a distributed system consisting of several subsystems, event sequences from subsystems may be interleaved, and SP cannot separate the faulty event sequence from the interleaved sequence. In this paper, we introduce wildcard characters into event patterns. This contributes to removing the effect by subsystems which may not be related to faults.

This paper investigates a signal area (SA) estimation method for wideband and long time duration spectrum measurements for dynamic spectrum access. SA denotes the area (in time/frequency domain) occupied by the primary user's signal. The traditional approach, which utilizes only Fourier transform (FT) and energy detector (ED) for SA estimation, can achieve low complexity, but its estimation performance is not very high. Against this issue, we apply post-processing to improve the performance of the FT-based ED. Our proposed method, simple SA (S-SA) estimation, exploits the correlation of the spectrum states among the neighboring tiles and the fact that SA typically has a rectangular shape to estimate SA with high accuracy and relatively low complexity compared to a conventional method, contour tracing SA (CT-SA) estimation. Numerical results will show that the S-SA estimation method can achieve better detection performance. The SA estimation and processing can reduce the number of bits needed to store/transmit the observed information compared to the FT-based ED. Thus, in addition to improved detection performance it also compresses the data.