Based on the characteristics of the thresholds of two detection schemes employing locally optimum test statistics, a sequential detection design procedure is proposed and analyzed. The proposed sequential test, called the sequential locally optimum test (SLOT), inherently provides finite stopping time (terminates with probability one within the finite horizon), and thereby avoids undesirable forced termination. The performance of the SLOT is compared with that of the fixed sample-size test, sequential probability ratio test (SPRT), truncated SPRT, and 2-SPRT. It is observed that the SLOT requires smaller average sample numbers than other schemes at most values of the normalized signal amplitude while maintaining the error performance close to the SPRT.

Signals received at the interrogator of an RFID system always suffer from various kinds of channel deformation factors, such as the path loss of the wireless channel, insufficient channel bandwidth resulted from the multipath propagation, and the carrier frequency offset between tags and interrogators. In this paper we proposed a novel Viterbi-based algorithm for joint detection of data sequence and compensation of distorted signal waveform. With the assumption that the transmission clock is exactly synchronized at the reader, the proposed algorithm takes advantage of the structured data-encoded waveform to represent the modulation scheme of the RFID system as a trellis diagram and then the Viterbi algorithm is applicable to perform data sequence estimation. Furthermore, to compensate the distorted symbol waveform, the proposed Jiggle-Viterbi algorithm generates two substates, each corresponding to a variant structure waveform with adjustable temporal support, so that the symbol waveform deformation can be compensated and therefore yield a significant better performance in terms of bit error rate. Computer simulations shows that even in the presence of a moderate carrier frequency offset, the proposed approach can work out with an acceptable accuracy on data sequence detection.

Let n,k,e,m be positive integers such that n≥ 3, 1 ≤ k ≤ n-1, gcd(n,k)=e, and m= is odd. In this paper, for an odd prime p, we derive a lower bound for the minimal distance of a large class of p-ary cyclic codes Cl with nonzeros α-1, α-(pk+1), α-(p3k+1), …, α-(p(2l-1)k+1), where 1 ≤ l ≤ and α is a primitive element of the finite field Fpn. Employing these codes, p-ary sequence families with a flexible tradeoff between low correlation and large size are constructed.

Spreading sequences with appropriate negative auto-correlation can reduce average multiple access interference (MAI) in asynchronous DS/CDMA systems compared with the conventional Gold Sequences generated by linear feedback shift registers (LFSRs). We design spreading sequences with negative auto-correlation based on Gold sequences and the chaos theory for the Bernoulli map. By computer simulations, we evaluate BER performances of asynchronous DS/CDMA systems using the proposed sequences.

This report describes a quantification method for luminance non-uniformity of a large LED backlight. In experiments described herein, participants subjectively evaluated artificial indistinct Mura images that simulated luminance non-uniformity of an LED backlight. We measured the luminance distribution of the Mura images. Then, the measured luminance distribution was converted into S-CIELAB, in which anisotropic properties of the spatial frequency response of human vision were considered. Subsequently, some indexes for the quantification model were extracted. We conducted multiple regression analyses using the subjective evaluation value and the index values obtained from measured luminance of Mura image. We proposed a quantification model consisting of four indexes: high and low luminance area, number of Mura edges, sum of Mura edge areas, and maximum luminance difference.

We investigate the secret key agreement from correlated Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show a closed form expression of the optimal trade-off between the rate of key generation and the rate of the public communication. Our results clarify an essential difference between the key agreement from discrete sources and that from continuous sources.

In quasi-synchronous frequency-hopping multiple access (QS-FHMA) systems, no-hit-zone frequency-hopping sequence (NHZ-FHS) sets are commonly employed to minimize multiple access interference. Several new constructions for optimal NHZ-FHS sets are presented in this paper, which are based on interleaving techniques. Two types of NHZ-FHS sets of length 2N for any integer N ≥ 3 are constructed, whose NHZ sizes are some even integers. An optimal NHZ-FHS set of length 2N with odd NHZ size for any integer N ≥ 6 is also presented. And then, optimal NHZ-FHS sets of length kN are given by generalizing one of the proposed constructions for NHZ-FHS sets of length 2N, where k and N are any positive integers such that 2 ≤ k < N. All the FHSs in the new NHZ-FHS sets are non-repeating FHSs which are optimal with respect to the Lempel-Greenberger bound. Our constructions give new parameters which are flexible in the selection of NHZ size and set size.

In this paper, we proposed the compact construction of a matched filter for integrand code, which do not require the high-rate clock pulse in two-valued PWM (pulse width modulation) code, using a real-valued shift-orthogonal finite-length sequence, which has a sharp aperiodic autocorrelation function with zero sidelobes except at left and right shift-ends. This matched filters are implemented on a field programmable gate array (FPGA) corresponding to 400,000 logic gates. A proposed matched filter for the sequence of length 129 can be constructed by the circuit scale of about 47% compared with conventional filter.

The authors focus on the improvement of Visible Light Communication Identification (VLID) system that provides positioning information via LED light bulb, which is a part of Visible Light Communication (VLC) system. The conventional VLID system provides very low positioning estimation accuracy at room level. In our approach, neither additional infrastructure nor modification is required on the transmitter side. On the receiver side, 6-axis sensor is embedded to provide 3-axis of Azimuth and 3-axis of Tilt angulations information to perform positioning estimation. We verify the proposed system characteristics by making both empirical and numerical analysis, to confirm the effectiveness of proposed system. We define two words to justify the characteristic of the proposed system, which are Field-of-View (FOV: ψc) Limit and Sensitivity (RXS) Limit. Both FOV and Sensitivity Limits have crucial impact on positioning estimation accuracy. Intuitively, higher positioning accuracy can be achieved with smaller FOV configuration in any system that has FOV. Conversely, based on system characteristics of VLID, we propose a positioning estimation scheme, namely Switching Estimated Receiver Position (SwERP) yields high accuracy even with wide FOV configuration. Cumulative Distribution Function (CDF) of error distance and Root Mean Square of Error Distance (RMSED) between experimental positions and estimated receiver positions are used to indicate the system performance. We collected 440 samples from 3 receivers' FOV configurations altogether 1320 samples within the experimental area of 1200 mm5000 mm2050 mm. The results show that with the proposed scheme, the achievable RMSEDs are in the range of 298 and 463 mm under different FOV configurations, which attained the maximum accuracy improvement over 80% comparing to the one without positioning estimation scheme. The proposed system's achievable accuracy does not depend on transmitters' orientation; only one transmitter is required to perform positioning estimation.

Binary sequence pairs as a class of mismatched filtering of binary sequences can be applied in radar, sonar, and spread spectrum communication system. Binary sequence pairs with two-level periodic autocorrelation function (BSPT) are considered as the extension of usual binary sequences with two-level periodic autocorrelation function. Each of BSPT consists of two binary sequences of which all out-phase periodic crosscorrelation functions, also called periodic autocorrelation functions of sequence pairs, are the same constant. BSPT have an equivalent relationship with difference set pairs (DSP), a new concept of combinatorial mathematics, which means that difference set pairs can be used to research BSPT as a kind of important tool. Based on the equivalent relationship between BSPT and DSP, several families of BSPT including perfect binary sequence pairs are constructed by recursively constructing DSP on the integer ring. The discrete Fourier transform spectrum property of BSPT reveals a necessary condition of BSPT. By interleaving perfect binary sequence pairs and Hadamard matrix, a new family of binary sequence pairs with zero correlation zone used in quasi-synchronous code multiple division address is constructed, which is close to the upper theoretical bound with sequence length increasing.

In this letter, an NB RCP LDPC (Non-Binary Rate-Compatible-Punctured Low Density Parity Check) code has been designed over the extended Galois Field. The designed code enables us to change the code rate easily by properly puncturing the appropriate symbols from the LDPC mother code. The designed NB RCP LDPC code has been applied to the Type II HARQ (Hybrid Automatic Repeat reQuest) scheme using OFDM (Orthogonal Frequency Division Multiplexing) modulation. The throughput characteristics of the proposed HARQ scheme are evaluated through computation simulation.

An adaptive dimming technique controls both LCD panel transmittance and its backlight luminance adequately and locally according to the input TV signal. The technique reduces the power consumption and also improves the picture quality. However, a steep change in backlight luminance distribution due to the application of the technique causes image degradation around the boundary of the segments when the LCD is viewed from an angle. The main factor of image degradation is the illumination of a pixel by neighboring pixel's corresponding backlight when the LCD is viewed from an angle rather than normal direction. From the subjective evaluation of image quality and computer simulation, it is found that the gradient of the backlight luminance variation to luminance at the border of the segment should be less than 0.022 per pixel in order to suppress the image degradation.

Image registration is an important topic in medical image analysis. It is usually used in 2D mosaics to construct the whole image of a biological specimen or in 3D reconstruction to build up the structure of an examined specimen from a series of microscopic images. Nevertheless, owing to a variety of factors, including microscopic optics, mechanisms, sensors, and manipulation, there may be great differences between the acquired image slices even if they are adjacent. The common differences include the chromatic aberration as well as the geometry discrepancy that is caused by cuts, tears, folds, and deformation. They usually make the registration problem a difficult challenge to achieve. In this paper, we propose an efficient registration method, which consists of a feature-based registration approach based on analytic robust point matching (ARPM) and a refinement procedure of the feature-based Levenberg-Marquardt algorithm (FLM), to automatically reconstruct 3D vessels of the rat brains from a series of microscopic images. The registration algorithm could speedily evaluate the spatial correspondence and geometric transformation between two point sets with different sizes. In addition, to achieve subpixel accuracy, an FLM method is used to refine the registered results. Due to the nonlinear characteristic of FLM method, it converges much faster than most other methods. We evaluate the performance of proposed method by comparing it with well-known thin-plate spline robust point matching (TPS-RPM) algorithm. The results indicate that the ARPM algorithm together with the FLM method is not only a robust but efficient method in image registration.

This paper presents a method of expanding the operating frequency band of a Reverberating TEM Cell (RTC) for electromagnetic compatibility (EMC) testing. To expand the operating frequency band of an RTC, this paper places a wire septum inside the cell instead of a solid septum. The maximum usable frequency (MUF) for TEM cell operation and the lowest usable frequency (LUF) for reverberating chamber operation with the wire septum are studied and compared with a conventional solid septum. The E field strengths inside the RTC are measured and evaluated. The measurement results show that the RTC with the wire septum have similar MUF to the RTC with a solid septum at TEM mode, but have much lower LUF at a reverberating mode, which proves that the operating frequency band of the RTC can be expanded by using the wire septum.

Portable sensory devices such as sensors equipped mobile phones enable convenient sensing and monitoring of urban areas. Such devices, which are always carried by humans, are referred to as Human Probes. Instead of carrying out sensing activities independently, cooperation of Human Probes helps in realizing efficient urban sensing environments. In this paper, we propose an Architecture of Qualitative Urban Information Blending and Acquisition (Aquiba), in which the sensing activities are adjusted autonomously according to cooperation of Human Probes. Aquiba introduces a cooperative sensing approach which aims to maintain desired sensing resolution efficiently while minimizing overall energy consumption. To study the performance of Aquiba, we have conducted comprehensive simulations ranging from small- to large-scale scenarios along with applying three different movement patterns of human. The simulation results demonstrate that Aquiba is capable of providing high sensing resolution and reducing overall energy consumption.

This paper proposes a cross layer wireless VoIP service which integrates an Adaptive QoS Playout (AQP) algorithm, E-model, Stream Control Transmission Protocol (SCTP), IEEE 802.21 Media Independent Handover (MIH) middleware and two user motion detection services. The proposed AQP algorithm integrates the effect of playout control and lost packet retransmission based on the E-model. Besides, by using the partial reliable transmission service from SCTP and the handoff notification from MIH services in a cross layer manner, AQP can reduce the lateness loss rate and improve speech quality under high frame error rates. In the simulations, the performance of AQP is compared with a fixed playout algorithm and four adaptive playout strategies. The simulation results show that the lateness loss rate of AQP is 2% lower than that of existing playout algorithms and the R-factor is 16% higher than the compared algorithms when a network has 50 ms wired propagation delay and 2.5% frame error rate.

For an odd prime p, two new families of p-ary sequences of period pn-1 are constructed for odd n = 2l+1=(2m+1)e and even n = 2l = 2me, respectively. It is shown that, for a given integer ρ with 1 ≤ ρ ≤ m, the proposed sequence families both have maximum correlation magnitude , family size (pn-1)p(ρ-1)n+1, and maximum linear span .

In this letter, we propose a novel frequency-domain equalization (FDE) scheme for single-carrier multiple-input multiple-output (MIMO) systems over time-varying channels. Based on frequency-domain decision-feedback equalization (FD-DFE), we design a feedforward filter with constraint such that the equalization can be easily realized segment-by-segment with the help of the overlap-save (OLS) method. Since the segment length and block length can be designed independently, our proposal sets relatively short segment length to obtain good performance in time-varying environments, and very long block length to achieve high spectral efficiency. Furthermore, we present two scenarios in the design of filters for MIMO systems.

Data query is one of the most important issues in wireless ad hoc networks, since the ultimate goal of these networks is to support efficient data sharing among wireless nodes. In this paper, we study the issue of data query for delay-sensitive applications in dense wireless ad hoc networks. We focus our attention on step-by-step expanding ring-based data query, which provides an upper bound on query delay to any expanding ring based query strategies. Two replication strategies including Index Replication (IR) and Data Replication (DR) are considered, to improve the delay performance of data query. We analyze the probabilistic behavior of query delay for both DR and IR by theoretical methods, and develop analytical models to approximate the minimum number of replicas required for both query strategies if an application-specified delay bound is imposed. Our work is validated through extensive simulations.

Fractional sampling (FS) and Doppler diversity equalization in OFDM receivers can achieve two types of diversity (path diversity and frequency diversity) simultaneously on time-varying multipath channels. However FS with a higher sampling rate requires the large amount of complexity in demodulation. In this paper, a novel sampling point selection (SPS) scheme with MMSE equalization in FS-OFDM receivers is proposed. On fast time-varying multipath channels, the proposed scheme selects the appropriate samples from the fractionally sampled signals. Through the computer simulation, it is demonstrated that with the proposed scheme, both path diversity gain and Doppler diversity gain can increase as compared to a conventional non-SPS scheme.