Due to the computational complexity of the optimum maximum likelihood detector (OMD) growing exponentially with the number of users, suboptimum techniques have received significant attention. We have proposed the particle swarm optimization (PSO) for the multiuser detection (MUD) in asynchronous multicarrier code division multiple access (MC-CDMA) system. The performance of PSO based MUD is near optimum, while its computational complexity is far less than OMD. Performance of PSO-MUD has also been shown to be better than that of genetic algorithm based MUD (GA-MUD) at practical SNR.

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc 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.

This paper presents a processor architecture for high-speed and reliable trinocular stereo matching based on adaptive window-size control of SAD (Sum of Absolute Differences) computation. To reduce its computational complexity, SADs are computed using images divided into non-overlapping regions, and the matching result is iteratively refined by reducing a window size. Window-parallel-and-pixel-parallel architecture is also proposed to achieve to fully exploit the potential parallelism of the algorithm. The architecture also reduces the complexity of an interconnection network between memory and functional units based on regularity of reference pixels. The stereo matching processor is designed in a 0.18 µm CMOS technology. The processing time is 83.2 µs@100 MHz. By using optimal scheduling, the increases in area and processing time is only 5% and 3% respectively compared to binocular stereo vision although the computational amount is double.

This paper presents discussion about channel fluctuation on channel estimation in digital terrestrial television broadcasting. This channel estimation uses a two-dimensional (2D) filter. In our previous work, only a structure of a lattice is considered for generation of nonrectangular 2D filter. We investigate generation of nonrectangular 2D filter with adaptive method, because we should refer to not only a lattice but also channel conditions. From the computer simulations, we show that bit error rate of the proposed filter is improved compared to that of the filter depending on only lattices.

This paper presents a novel high-speed, low-complexity two-parallel 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed high-speed, low-complexity FFT architecture can provide a higher throughput rate and low hardware complexity by using a two-parallel data-path scheme and a single-path delay-feedback (SDF) structure. The radix-24 FFT algorithm is also realized in our processor to reduce the number of complex multiplications. The proposed FFT/IFFT processor has been designed and implemented with 0.18-µm CMOS technology in a supply voltage of 1.8 V. The proposed two-parallel FFT/IFFT processor has a throughput rate of up to 900 Msample/s at 450 MHz while requiring much smaller hardware complexity and low power consumption.

In this paper, we analyze the effects of IQ (In-phase/Quadrature-phase) imbalance at both transmitter and receiver of OFDM (Orthogonal Frequency Division Multiplexing) system and show that more diversity gain can be achieved even though there are unwanted IQ imbalance. When mixed sub-carriers within an OFDM symbol due to the IQ imbalance undergo frequency selective channels, additional diversity effects are expected during the demodulation process. Simulation results on the symbol error rate (SER) performance with ML (Maximum Likelihood) and OSIC (Ordered Successive Interference Cancellation) receiver show that significant performance gain can be achieved with the diversity gain caused by the IQ imbalance combined with the frequency selective channels.

This letter investigates the effects of using multiple transmit antennas on code acquisition for preamble search in the CDMA uplink when MIMO is used for signal transmission and reception. The performance of a ML code acquisition technique in the presence of MIMO channel is analyzed by considering the detection and miss probabilities. The acquisition performance is numerically evaluated on a frequency selective fading channel. It is found that the performance of code acquisition scheme for a SIMO system is better than that for the case of MIMO on the low thresholds in terms of detection performance and MAT.

This paper extends previous analytical approaches for the study of CDMA systems to the relevant case of multipath environments where users can operate at different bit rates. This scenario is of interest for the Wideband CDMA strategy employed in UMTS, and the model permits the performance comparison of classic and more innovative spreading signals. The method is based on the characteristic function approach, that allows to model accurately the various kinds of interferences. Some numerical examples are given with reference to the ITU-R M.1225 Recommendations, but the analysis could be extended to different channel descriptions.

We demonstrate a wavelength division multiplexing passive optical network (WDM-PON) based on wavelength-locked Fabry-Perot laser diodes and thin-film filters. Twelve Fast Ethernet signals are bi-directionally transmitted over the multi-branch optical distribution network (ODN). The ODN has distributed branch nodes and bus networks.

We describe the transmission characteristics of a wavelength independent wavelength division multiplexing passive optical network (WDM-PON) based on a wavelength channel data rewriter (WCDR). The WCDR is composed of a linear amplifier (LA) and a saturated semiconductor optical amplifier (SOA), and by using the WCDR in optical network units (ONUs), we can erase the downstream signal and modulate the same wavelength channel with the upstream signal. In this paper, we analyze the data rewriting characteristic, the frequency chirp characteristic and the bit error rate (BER) degradation occasioned by the use of saturated SOAs. Furthermore, we report high-speed transmission with power penalty of less than 1 dB at bit rates of 1.25 Gbit/s, 2.5 Gbit/s and 10 Gbit/s for downstream signals and 1.25 Gbit/s for upstream signals after transmission through 40 km of single-mode fiber.

The time division duplex cellular system can support various downlink and uplink traffic ratios by setting the downlink and uplink transmission periods appropriately. However, it causes severe co-channel interference problem when some cells are active in the downlink while the others are in the uplink [2]. To mitigate this problem, a resource allocation scheme combined with sectorization is proposed for orthogonal frequency division multiple access. Simulations demonstrate that the proposed scheme improves both spectral efficiency and outage performance compared to the conventional allocation schemes.

We consider power and rate adaptations in multicarrier (MC) direct-sequence code-division multiple-access (DS/CDMA) communications under the assumption that channel state information is provided at both the transmitter and the receiver. We propose, as a power allocation strategy in the frequency domain, to transmit each user's DS waveforms over the user's sub-band with the largest channel gain, rather than transmitting identical DS waveforms over all sub-bands. We then adopt channel inversion power adaptation in the time domain, where the target user's received power level maintains at a fixed value. We also investigate rate adaptation in the time domain, where the data rate is adapted such that a desired transmission quality is maintained. We analyze the BER performance of the proposed power and rate adaptations with fixed average transmission power, and show that power adaptation in both the frequency and the time domains or combined power adaptation in the frequency domain and rate adaptation in the time domain make significant performance improvement over the power adaptation in the frequency domain only. We also compare the performance of the proposed power and rate adaptation schemes in MC-DS/CDMA systems to that of power and rate adapted single carrier DS/CDMA systems with RAKE receiver.

The performance of multiuser MIMO downlink systems with block diagonalization (BD) relies on the channel state information (CSI) at the transmitter to a great extent. For time division duplex TDD systems, the transmitter estimates the CSI while receiving data at current time slot and then uses the CSI to transmit at the next time slot. When the wireless channel is time-varying, the CSI for transmission is imperfect due to the time delay between the estimation of the channel and the transmission of the data and severely degrades the system performance. In this paper, we propose a linear method to suppress the interferences among users and data streams caused by imperfect CSI at transmitter. The transmitter first sends pilot signals through a linear spatial precoding matrix so as to make possible that the receiver can estimate CSI of other users, and then the receiver exploits a linear prefilter to suppress the interference. The numerical results show that the proposed schemes achieve obvious performance enhancement in comparison to the BD scheme with imperfect CSI at the transmitter.

This letter deals with adaptive array beamforming based on a minimum variance distortionless response (MVDR) technique with robust capabilities for code-division multiple access signals. It has been shown that the MVDR beamformer suffers from the drawback of being very sensitive to pointing error over the eigenspace-based beamformers. For the purpose of efficient estimation and calibration, a highly efficient approach has been proposed that is implemented on polynomial rooting rather than spectral searching. However, this rooting method is suboptimal in the presence of the noise and multiple access interference (MAI). In this letter, we propose an improved polynomial rooting calibration method that is robust in both of the low signal-to-noise ratio and large MAI scenarios. Several computer simulations are provided for illustrating the effectiveness of the proposed method.

A novel low-complexity iterative receiver for coded multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems is proposed in this letter. The iterative receiver uses the parallel interference cancellation (PIC)-maximum ratio combining (MRC) detector for MIMO-OFDM detection, which is a popular alternative to the minimum mean square error (MMSE) detector due to its lower computational complexity. However, we have found that the conventional PIC-MRC detector tends to underestimate the magnitude of its output log likelihood ratios (LLRs). Based on this discovery, we propose to multiply these LLRs by a constant factor, which is optimized according to the extrinsic information transfer (EXIT) chart of the soft-in soft-out (SISO) detector. Simulation results show that the proposed scheme significantly improves the performance of the PIC-MRC-based receiver with little additional cost in computational complexity, allowing it to closely approach the performance of receiver using the much more complex MMSE detector.

The computational complexity of the optimum maximum likelihood detector (OMLD) does not allow its utility for multi-user detection (MUD) in code division multiple access (CDMA) systems. As proposed in this letter, particle swarm optimization (PSO) with soft decision offers a much more efficient option with few parameters to be adjusted, flexibility to implement, that gives a much faster convergence compared to OMLD. It outperforms the conventional detector, the genetic algorithm approach and the standard suboptimal detectors considered in the literature.

In a frequency-selective multiple-input multiple-output (MIMO) channel, the optimum transmission is achieved by beamforming with eigenvectors obtained at each discrete frequency point, i.e., an extension of eigenbeam-space division multiplexing (E-SDM). However, the calculation load of eigenvalue decomposition at the transmitter increases in proportion to the number of frequency points. In addition, frequency-independent eigenvectors increase the delay spread of the effective channel observed at the receiver. In this paper, we propose a pseudo eigenvector scheme for the purpose of mitigating the calculation load and maintaining frequency continuity (or decreasing the delay spread). First, we demonstrate that pseudo eigenvectors reduce the delay spread of the effective channels with low computational complexity. Next, the practical performance of the pseudo E-SDM (PE-SDM) transmission is evaluated. The simulation results show that PE-SDM provides almost the same or better performance compared with E-SDM when the receiver employs a time-windowing-based channel estimation available in the low delay spread cases.

In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To verify the proposed algorithm, a 2048-point pipelined FFT processor is designed using a 0.18 µm CMOS process. By combining the proposed algorithm and the radix-22 algorithm, the table size is reduced to 34% and 51% compared to the radix-2 and radix-22 algorithms, respectively. The FFT processor occupies 1.28 mm2 and achieves a signal-to-quantization-noise ratio (SQNR) of more than 50 dB.

A 128128 pixel functional image sensor was implemented. The sensor was able to capture images at 1,000 frame/s and extract the sizes and positions of 10 objects/frame when clocked at 8 MHz. The size of each pixel was 18 µm18 µm and the fill factor was 28%. The chip, 3.24 mm3.48 mm in size, was implemented with a 0.35 µm CMOS sensor process; the power consumption was 29.7 mW at 8 MHz.