The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.

When there are multiple component predictors, it is promising to integrate them into one predictor for advanced reasoning. If each component predictor is given as a stochastic model in the form of probability distribution, an exponential mixture of the component probability distributions provides a good way to integrate them. However, weight parameters used in the exponential mixture model are difficult to estimate if there is no training samples for performance evaluation. As a suboptimal way to solve this problem, weight parameters may be estimated so that the exponential mixture model should be a balance point that is defined as an equilibrium point with respect to the distance from/to all component probability distributions. In this paper, we propose a weight parameter estimation method that represents this concept using a symmetric Kullback-Leibler divergence and generalize this method.

The dramatic growth in wireless data traffic has triggered the investigation of fifth generation (5G) wireless communication systems. Small cells will play a very important role in 5G to meet the 5G requirements in spectral efficiency, energy savings, etc. In this paper, we investigate low complexity millimeter-wave communication systems with uniform circular arrays (UCAs) in line-of-sight (LOS) multiple-input multiple-output (MIMO) channels, which are used in fixed wireless access such as small cell wireless backhaul for 5G. First, we demonstrate that the MIMO channel matrices for UCAs in LOS-MIMO channels are circulant matrices. Next, we provide a detailed derivation of the unified optimal antenna placement which makes MIMO channel matrices orthogonal for 3×3 and 4×4 UCAs in LOS channels. We also derive simple analytical expressions of eigenvalues and capacity as a function of array design (link range and array diameters) for the concerned systems. Finally, based on the properties of circulant matrices, we propose a high performance low complexity LOS-MIMO precoding system that combines forward error correction (FEC) codes and spatial interleaver with the fixed IDFT precoding matrix. The proposed precoding system for UCAs does not require the channel knowledge for estimating the precoding matrix at the transmitter under the LOS condition, since the channel matrices are circulant ones for UCAs. Simulation results show that the proposed low complexity system is robust to various link ranges and can attain excellent performance in strong LOS environments and channel estimation errors.

In this letter, we present a meet-in-the-middle attack on the 5-round reduced Kuznyechik cipher which has been recently chosen to be standardized by the Russian federation. Our attack is based on the differential enumeration approach. However, the application of the exact approach is not successful on Kuznyechik due to its optimal round diffusion properties. Accordingly, we adopt an equivalent representation for the last round where we can efficiently filter ciphertext pairs and launch the attack in the chosen ciphertext setting. We also utilize partial sequence matching which further reduces the memory and time complexities. For the 5-round reduced cipher, the 256-bit master key is recovered with an online time complexity of 2140.3, a memory complexity of 2153.3, and a data complexity of 2113.

A novel high common-mode (CM) suppression wideband balanced passband filter (BPF) is proposed using the stub centrally loaded slotline resonators (SCLSR) which have two resonant frequencies (odd- and even-modes) in the desired passband. The odd-mode resonant frequency of the slotline SCLSR can be flexibly controlled by the stub, whereas the even-mode one is fixed. Meanwhile, a transmission zero near the odd-mode resonant frequency can be generated due to the main path signal counteraction. First, the wideband single-ended BPF and corresponding balanced BPF are designed based on the slotline SCLSR with the parallel coupled microstrip line input/output (I/O). Ultra wideband high CM suppression that can be achieved for the slotline resonator structure has no resonant mode under CM excitation. Furthermore, by folding the parallel coupled microstrip line I/O, the source-load coupling is effectively decoupled to improve the CM suppression within the passband. The high suppression wideband balanced BPF is fabricated and measured, respectively. Good agreement between simulation and measurement results is obtained.

OSEK/VDX, a standard for an automobile OS, has been widely adopted by many manufacturers to design and develop a vehicle-mounted OS. With the increasing functionalities in vehicles, more and more complex applications are be developed based on the OSEK/VDX OS. However, how to ensure the reliability of developed applications is becoming a challenge for developers. To ensure the reliability of developed applications, model checking as an exhaustive technique can be applied to discover subtle errors in the development process. Many model checkers have been successfully applied to verify sequential software and general multi-threaded software. However, it is hard to directly use existing model checkers to precisely verify OSEK/VDX applications, since the execution characteristics of OSEK/VDX applications are different from the sequential software and general multi-threaded software. In this paper, we describe and develop an approach to translate OSEK/VDX applications into sequential programs in order to employ existing model checkers to precisely verify OSEK/VDX applications. The value of our approach is that it can be considered as a front-end translator for enabling existing model checkers to verify OSEK/VDX applications.

Traditional sparse representation-based methods for human action recognition usually pool over the entire video to form the final feature representation, neglecting any spatio-temporal information of features. To employ spatio-temporal information, we present a novel histogram representation obtained by statistics on temporal changes of sparse coding coefficients frame by frame in the spatial pyramids constructed from videos. The histograms are further fed into a support vector machine with a spatial pyramid matching kernel for final action classification. We validate our method on two benchmarks, KTH and UCF Sports, and experiment results show the effectiveness of our method in human action recognition.

Potential games form a class of non-cooperative games where the convergent of unilateral improvement dynamics is guaranteed in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.

The expressions for the reset noise in capacitive-transimpedance-amplifier (CTIA) readout circuits are theoretically derived and confirmed experimentally. The contributions to the reset noise from the thermal current and amplifier noise are considered. The thermal reset noise is found to depend only on the feedback capacitance among the circuit parameters.

In this study, we propose a two-step approach to evaluate electromagnetic interference (EMI) with a wearable vital signal sensor. The two-step approach combines a quasi-static electromagnetic (EM) field analysis and an electric circuit analysis, and is applied to the EMI evaluation at frequencies below 1 MHz for our developed wearable electrocardiogram (ECG) to demonstrate its usefulness. The quasi-static EM field analysis gives the common mode voltage coupled from the incident EM field at the ECG sensing electrodes, and the electric circuit analysis quantifies a differential mode voltage at the differential amplifier output of the ECG detection circuit. The differential mode voltage has been shown to come from a conversion from the common mode voltage due to an imbalance between the contact impedances of the two sensing electrodes. When the contact impedance is resistive, the induced differential mode voltage increases with frequency up to 100kHz, and keeps constant after 100kHz, i.e., exhibits a high pass filter characteristic. While when the contact impedance is capacitive, the differential mode voltage exhibits a band pass filter characteristic with the maximum at frequency of around 150kHz. The differential voltage may achieve nearly 1V at the differential amplifier output for an imbalance of 30% under 10V/m plane-wave incident electric field, and completely mask the ECG signal. It is essential to reduce the imbalance as much as possible so as to prevent a significant interference voltage in the amplified ECG signal.

The MPEG-1 layer-III compressed audio format, which is widely known as MP3, is the most popular for audio distribution. However, it is not equipped with security features to protect the content from unauthorized access. Although encryption ensures content security, the naive method of encrypting the entire MP3 file would destroy compliance with the MPEG standard. In this paper, we propose a low-complexity partial encryption method that is embedded during the MP3 encoding process. Our method reduces time consumption by encrypting only the perceptually important parts of an MP3 file rather than the whole file, and the resulting encrypted file is still compatible with the MPEG standard so as to be rendered by any existing MP3 players. For full-quality rendering, decryption using the appropriate cryptographic key is necessary. Moreover, the effect of encryption on audio quality can be flexibly controlled by adjusting the percentage of encryption. On the basis of this feature, we can realize the try-before-purchase model, which is one of the important business models of Digital Rights Management (DRM): users can render encrypted MP3 files for trial and enjoy the contents in original quality by purchasing decryption keys. From our experiments, it turns out that encrypting 2-10% of MP3 data suffices to generate trial music, and furthermore file size increasing after encryption is subtle.

In this paper, we propose a tightly coupled asymmetrically tapered bend to suppress differential-to-common mode conversion caused by bend discontinuity in a pair of differential lines. Tightly coupled symmetrically tapered bends have been so far proposed to suppress the mode conversion by decreasing the path difference in the bend. This approach makes the path difference shorter so that the differential lines are coupled more tightly but the path difference of twice the sum of the line width and the line separation still remains. To suppress the remaining path difference, this paper introduces the use of asymmetric tapers. In addition, two-section tapers are applied to reduce differential-mode reflection increased by the tapers and hence improve differential-mode propagation. A full-wave simulation of a right-angled bend demonstrates that the forward differential-to-common mode conversion is decreased by almost 30 dB compared to the symmetrically tapered bend and that the differential-mode reflection coefficient is reduced to the same amount as that of the classic bend. Also, the generality of the proposed bend structure is discussed.

The deployment of small cells is one of the most effective means to cope with the traffic explosion of cellular mobile systems. However, a small cell system increases the inter-cell interference, which limits the capacity and degrades the cell-edge user throughput. Inter-cell interference coordination (ICIC), such as fractional frequency reuse (FFR), is a well-known scheme that autonomously mitigates inter-cell interference. In the Long Term Evolution (LTE)-Advanced, the three-dimensional (3D) beamforming, which combines conventional horizontal beamforming and vertical beamforming, has been gaining increasing attention. This paper proposes a novel centralized ICIC scheme that controls the direction of narrow 3D beam for each frequency band of each base station. The centralized controller collects information from the base stations and calculates sub-optimum combinations of narrow beams so as to maximize the proportional fair (PF) utility of all users. This paper describes the throughput of the new centralized ICIC scheme as evaluated by computer simulations and shows it has a significant gain in both average user throughput and cell-edge user throughput compared with the conventional ICIC scheme. This paper also investigates the feasibility of the scheme by assessing its throughput performance in a realistic deployment scenario.

In this paper, we propose a method for reconstructing 3D sequential patterns from multiple images without knowing exact image correspondences and without calibrating linear camera sensitivity parameters on intensity. The sequential pattern is defined as a series of colored 3D points. We assume that the series of the points are obtained in multiple images, but the correspondence of individual points is not known among multiple images. For reconstructing sequential patterns, we consider a camera projection model which combines geometric and photometric information of objects. Furthermore, we consider camera projections in the frequency space. By considering the multi-view relationship on the new projection model, we show that the 3D sequential patterns can be reconstructed without knowing exact correspondence of individual image points in the sequential patterns; moreover, the recovered 3D patterns do not suffer from changes in linear camera sensitivity parameters. The efficiency of the proposed method is tested using real images.

A new approach to reconstructing antenna far-field patterns from the missing part of the pattern is presented in this paper. The antenna far-field pattern can be reconstructed by utilizing the iterative Hilbert transform, which is based on the relationship between the real and imaginary part of the Hilbert transform. A moving average filter is used to reduce the errors in the restored signal as well as the computation load. Under the constraint of the causality of the current source in space, we could successfully reconstruct the data. Several examples dealing with line source antennas and antenna arrays are simulated to illustrate the applicability of this approach.

Due to low signal-to-carrier ratio and high dynamic, the frequency deviation affects the bit synchronization in GNSS receiver. This paper proposes a balance differential coherent bit synchronization algorithm, which uses the differential coherent method to eliminate the influence of the frequency deviation. By enlarging the differential distance, the proposed algorithm achieves higher bit synchronization rates. Combining two complementary differential coherent parts, the proposed algorithm avoids the unbalance problem and the attenuation of accumulation. Furthermore, a general architecture is presented to reduce the system complexity. Experimental results show that the proposed algorithm improves the sensitivity of bit synchronization by 3∼7dB compared with the previous method.

To ensure the security of image transmission, this paper presents a new image encryption algorithm based on a genetic algorithm (GA) and a piecewise linear chaotic map (PWLCM), which adopts the classical diffusion-substitution architecture. The GA is used to identify and output the optimal encrypted image that has the highest entropy value, the lowest correlation coefficient among adjacent pixels and the strongest ability to resist differential attack. The PWLCM is used to scramble pixel positions and change pixel values. Experiments and analyses show that the new algorithm possesses a large key space and resists brute-force, statistical and differential attacks. Meanwhile, the comparative analysis also indicates the superiority of our proposed algorithm over a similar, recently published, algorithm.

In this paper, we investigate iterative detection and decoding, a.k.a. turbo detection, for multiple-input multiple-output (MIMO) transmission. Specifically, we consider using a low complexity soft-in/soft-out MIMO detector based on belief propagation over a pair-wise graph that accepts a priori information feedback from a channel decoder. Simulation results confirm that considerable performance improvement can be obtained with only a few detection-and-decoding iterations if convolutional channel coding is used. A brief estimate is given of the overall complexity of turbo detectors, to verify the key argument that the performance of a maximum a posteriori (MAP) detector (without turbo iteration) can be achieved, at much lower computation cost, by using the low complexity soft-in/soft-out MIMO detector under consideration.

We have demonstrated tunable extit{n}-channel fullerene and extit{p}-channel pentacene OFETs and CMOS inverter circuit based on a bilayer-dielectric structure of CYTOP (poly(perfluoroalkenyl vinyl ether)) electret and SiO$_{2}$. For both OFET types, the $V_{mathrm{th}}$ can be electrically tuned thanks to the charge-trapping at the interface of CYTOP and SiO$_{2}$. The stability of the shifted $V_{mathrm{th}}$ was investigated through monitoring a change in transistor current. The measured transistor current versus time after programming fitted very well with a stretched-exponential distribution with a long time constant up to 10$^{6}$ s. For organic CMOS inverter, after applying the program gate voltages for extit{n}-channel fullerene or extit{p}-channel pentacene elements, the voltage transfer characteristics were shifted toward more positive values, resulting in a modulation of the noise margin. We realized that at a program gate voltage of 60,V for extit{p}-channel OFET, the circuit switched at 4, 8,V, that is close to half supply voltage $V_{mathrm{DD}}$, leading to the maximum electrical noise immunity of the inverter circuit.

Recently, Gan and Luo have proposed a direction-of-arrival estimation method for uncorrelated and coherent signals in the presence of multipath propagation [3]. In their method, uncorrelated and coherent signals are distinguished by rotational invariance techniques and the property of the moduli of eigenvalues. However, due to the limitation of finite number of sensors, the pseudo-inverse matrix derived in this method is an approximate one. When the number of sensors is small, the approximation error is large, which adversely affects the property of the moduli of eigenvalues. Consequently, the method in [3] performs poorly in identifying uncorrelated signals under such circumstance. Moreover, in cases of small number of snapshots and low signal to noise ratio, the performance of their method is poor as well. Therefore, in this letter we first study the approximation in [3] and then propose an improved method that performs better in distinguishing between uncorrelated signals and coherent signals and in the aforementioned two cases. The simulation results demonstrate the effectiveness and efficiency of the proposed method.