In this letter, a new joint precoding and decoding design scheme for multiuser MIMO downlink is proposed which dispenses with iterative operations and can achieve better performance. This scheme introduces zero-force processing into minimum mean square error (MMSE) design scheme to avoid iterative operations. We derived closed-form precoders and decoders and transmit power allocation strategy of proposed design scheme, validated performance of proposed design scheme by computer simulation. The simulation results show that the proposed design scheme can achieve better bit error rate (BER) and sum capacity performance compared to an existing non-iterative design scheme.

The proposed quasi-resonant (QR) zero current switching (ZCS) switched-capacitor (SC) converter is a new type of bidirectional power flow control conversion scheme. The proposed converter is able to provide voltage conversion ratios from -3/- (triple-mode/ trisection-mode) to -n/- (-n-mode/--mode) by adding a different number of switched-capacitors and power MOSFET switches with a small series connected resonant inductor for forward and reverse power flow control schemes. It possesses the advantages of low switching losses and current stress in this QR ZCS SC converter. The principle of operation, theoretical analysis of the proposed triple-mode/ trisection-mode bidirectional power conversion scheme is described in detail with circuit model analysis. Simulation and experimental studies are carried out to verify the performance of the proposed inverting type ZCS SC QR bidirectional converter. The proposed converters can be applied to battery equalization for battery management system (BMS).

We describe a channel-vector quantization scheme that is suitable for multiple stream transmission per user in zero-forcing beamforming (ZFBF) multiuser multiple-input and multiple output (MU-MIMO) systems with finite rate feedback. Multiple subsets of a channel matrix are quantized to vectors from random vector codebooks for finite rate feedback. The quantization vectors with an angle difference that is closer to orthogonal are then selected and their indexes are fed back to the transmitter. Simulation results demonstrate that the proposed scheme achieves a better average throughput than that serving a single stream per user when the number of active users is smaller than the number of transmit antennas and that it provides an average throughput close to that serving a single stream per user when the number of users is equal to the number of transmit antennas.

In this letter, we propose a novel singular value decomposition zero-forcing beamforming (SVD-ZFBF) relaying scheme in the multiuser downlink MIMO broadcasting channel with fixed relays. Based on the processing scheme, we apply SUS [5] to select users at the relay station (RS) and develop a joint power allocation strategy at the base station (BS) and RS. By increasing the power at RS or selecting active users to obtain more multiuser diversity, SVD-ZFBF can approach an upper bound and outperform SVD-ZFDPC [1] with much lower complexity. Moreover, we show that the noise power ratio of RS to users significantly impacts the performance.

GPS is an efficient identification (ID) scheme based on Schnorr ID scheme designed for applications where low cost devices with limited resources are used and a very-short authentication time is required. Let P and V be a prover and a verifier in GPS and < g > be a multiplicative group. P holds a secret key S∈[0,S) and publishes I=g-s. In each elementary round: (1) P sends to Vx=gr where r is chosen randomly from [0,A), (2) V sends to P a random C∈[0,B), and (3) P sends y=r+cs (no modulus computation). Since there is no modular reduction on y, a key issue is whether GPS leaks information about s. It has been proved that GPS is statistical zero-knowledge, if in asymptotic sense, BS/A is negligible, where is the number of elementary rounds in one complete identification trial. In this paper, first we will show the followings. (1) We can construct a concrete attack procedure which reveals one bit of secret key s from the specified value range of y unless BS/A is negligible. We reconfirm that we must set A extremely large compared to BS. (2) This drawback can be avoided by modifying GPS into a new scheme, GPS+, in which P does not send the value of y in the specified range where y reveals some information about s. GPS+ ensures perfect ZK only by requiring both A > BS and A being a multiple of the order of g, while it allows an honest P to be rejected with probability at most BS/(2A) in one elementary round. Under the standard recommended parameters for 80-bit security where =1, |S|=160, and |B|=35, |A|=275 is recommended for GPS in GPS' paper. On the other hand, GPS+ can guarantee 80-bit security and less than one false rejection on average in 100 identifications with only |A|=210 with the same parameters as above. In practice, this implies 275-210=65 bits (≈24%) reductions on storage requirement. We have confirmed that the reduce of A also reduces approximately 4% of running time for online response using a certain implementation technique for GPS+ by machine experiment.

This paper presents a high performance and hardware efficient packet detection structure, which employs a cross correlator for the M-sample time delayed correlation operation and a signal power calculator using the received input samples less than or equal to a zero-padded suffix of length M. We investigate the detailed characteristics of the proposed packet detector. In this paper, the performance of a class of packet detection algorithms in the ultra-wideband (UWB) channel environments is also studied. The best packet detection algorithm for the multi-band orthogonal frequency division multiplexing (MB-OFDM) UWB transmission is determined through analysis and extensive simulations. The results of analysis show that the proposed packet detection structure has advantages in the hardware complexity as well as performance when compared with the existing packet detection structures. In order to effectively conduct the packet detection before the automatic gain control (AGC) mode, we investigate the effects of both a frequency offset and the initial gain level of a variable gain amplifier (VGA) on the performance of the packet detection. We also suggest a VGA gain control technique to enhance the performance of packet detection.

A class of zero-correlation zone (ZCZ) sequences constructed by the recursive procedure from a perfect sequence and a unitary matrix was proposed by Torii, Nakamura, and Suehiro [1] . In the reference [1] , three parameters, s.t., the sequence length, the family size and the length of the ZCZ, were evaluated for a general estimate of the performance of the ZCZ sequences. In this letter, we give more detailed distributions of that correlation values are zero on their ZCZ sequence sets.

In this paper, based on interleaved technique, we present a new method of constructing zero correlation zone (ZCZ) sequence sets. For any perfect sequence of length m(2k+1) with m > 2, k ≥ 0 and an arbitrary Hadamard matrix of order T > 2, the proposed construction can generate new optimal ZCZ sequence sets in which all the sequences are cyclically distinct.

In approximately synchronous CDMA (AS-CDMA) systems, zero correlation zone (ZCZ) sequences are known as the sequences to eliminate co-channel and multi-path interferences. Therefore, numerous constructions of zero correlation zone (ZCZ) sequences have been introduced e.g. based on perfect sequences and complete complementary codes etc. However, the previous construction method which based on complete complementary code is lacking for merit figures when none of whose elements are zero. In this paper, a new construction method of ZCZ sequences based on complete complementary codes is proposed. By proposed method, non zero elements ZCZ sequences whose merit figure is greater than 1/2 are constructable.

A modified successive interference cancellation (SIC) algorithm for orthogonal frequency division multiplexing (OFDM) system is presented. The presented modified SIC algorithm makes use of an index sequence to avoid the subcarriers re-ordering calculation. Furthermore, by combining the SIC with the conventional zero-forcing (ZF) detection, computation complexity of the presented algorithm can be significantly reduced and meanwhile excellent performance can be maintained.

Embedded zero-tree image coding in wavelet domain has drawn a lot of attention. Among noteworthy algorithms is the set partitioning in hierarchical trees (SPIHT). Typically, most of images' energy is concentrated in low frequency subbands. For an image with textures, however many middle-high frequency wavelet coefficients are likely to become significant in the early passes of SPIHT; thus the coding results are often insufficient. Middle and high frequency subbands of images may demand further decompositions using adaptive basis functions. As wavelet packet transform offers a great diversity of basis functions, we propose a quad-tree based adaptive wavelet packet transform to construct adaptive wavelet packet trees for zero-tree image coding. Experimental results show that coding performances can be significantly improved especially for fingerprints images.

The present paper introduces the construction of a class of sequence sets with zero-correlation zones called zero-correlation zone sequence sets. The proposed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence and an arbitrary Golay complementary sequence pair. The proposed construction is a generalization of the zero-correlation zone sequence construction previously reported by the present author. The proposed sequence set can successfully provide CDMA communication without co-channel interference.

Two dual-band bandpass filters (BPFs) based on the doubly parallel-coupled stepped impedance resonators (SIRs) structures have been proposed in this paper. The coupled-SIRs with/without open-stub-loads are introduced in the filter design. The dual-band filters exhibiting multiple zeros design operate at 2.45/5.2-GHz for the WLAN applications. Two three-staged filters composed of four SIRs have been proposed with the tapped-line adapted in the I/O sections. A five-staged filter is constructed based on the same design principle to achieve a better band-rejection. The proposed filters have the advantages of a much wider bandwidth in both the passbands without sacrificing the passband's insertion loss and passband flatness. The design procedure for a conventional parallel-coupled microstrip lines model is still suitable to design the proposed filters. The proposed filters have achieved almost twice the bandwidth of a conventional parallel-coupled lines configuration under the same design parameters. The experiments have been conducted to verify filter performance. Measured results are in good agreement with the full-wave simulation results.

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

The present paper describes a method for the construction of a zero-correlation zone sequence set from a perfect sequence. Both the cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence sets are zero for phase shifts within the zero-correlation zone. These sets can be generated from an arbitrary perfect sequence, the length of which is the product of a pair of odd integers ((2n+1)(2k+1) for k ≥ 1 and n ≥ 0). The proposed sequence construction method can generate an optimal zero-correlation zone sequence set that achieves the theoretical bounds of the sequence member size given the size of the zero-correlation zone and the sequence period. The peak in the out-of-phase correlation function of the constructed sequences is restricted to be lower than the half of the power of the sequence itself. The proposed sequence sets could successfully provide CDMA communication without co-channel interference, or, in an ultrasonic synthetic aperture imaging system, improve the signal-to-noise ratio of the acquired image.

This paper proposes a channel estimation technique which uses a postfixed pseudo-noise (PN) sequence combined with zero padding to accurately estimate the channel impulse response for mobile orthogonal frequency division multiplexing (OFDM) communications. The major advantage of the proposed techniques is the periodical insertion of PN sequences after each OFDM symbol within the original guard interval in conventional zero-padded OFDM or within the original cyclic prefix (CP) in conventional CP-OFDM. In addition, the proposed technique takes advantage of null samples padded after the PN sequences for reducing inter-symbol interference occurring with the information detection in conventional pseudo-random-postfix OFDM. The proposed technique successfully applies either (1) least-squares algorithm with decision-directed data-assistance, (2) approximate least-squares estimation, or (3) maximum-likelihood scheme with various observation windows for the purpose of improving channel estimation performance. Some comparative simulations are given to illustrate the excellent performance of the proposed channel estimation techniques in mobile environments.

A packet detection method for zero-padded orthogonal frequency division multiplexing (OFDM) transmission is presented. The proposed algorithm effectively conducts packet detection by employing both an M-sample time delayed cross correlation value, and a received signal power calculated by using the received input samples corresponding to the zero padding (ZP) intervals or less.

A rate control scheme is described for zero-forcing beamforming (ZFBF) multiuser multiple-input and multiple-output (MU-MIMO) systems with a QR-decomposition maximum likelihood detector (MLD) at the receiver. For selected users, a modulation-and-coding set is selected for each substream by estimating the per-substream post-MLD signal-to-interference-plus-noise ratio. Iterative modified QR-decomposition MLD is employed at the receiver to achieve the throughput expected from the transmitter. The simulation results demonstrated that the proposed rate-control scheme achieved the target packet error rate while increasing the throughout for ZFBF-MU-MIMO systems as the number of user candidates increases.

This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IP's clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC- or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.

A novel low insertion-loss and wideband microstrip bandpass filter has been designed and tested. The basic configuration of this novel dual-mode filter is a square ring resonator with direct-connected orthogonal feed lines, and dual-perturbation elements are introduced within the resonator at symmetrical location. The effects of the size of the perturbation element are studied. A new filter having wider bandwidth and transmission zeros are presented. The proposed filter responses are in good agreement with the simulations and experiments.