A broadband and flexible receiver architecture is investigated for the handheld software defined radio (SDR). The proposed SDR architecture is based on the direct conversion and low intermediate frequency (low-IF) principle with digital channel filtering, which provides the receiver with flexibility for the multi-standard application. This architecture also enables analog-to-digital converter activating essentially in baseband or low frequency so that the clock jitter, which serves as an important subject in the well-known IF sampling method, can be reduced. Basic performance of the proposed architecture has been confirmed by the experimental model.

The transmission performance of WDM transmission systems is influenced by many effects according to the type of optical fiber employed in the system. Japanese high-speed transmission systems use dispersion-shifted fiber (DSF). It is well known that the transmission distance of WDM systems employing DSF is restricted by fiber four-wave mixing (FWM). Unequally spaced channel allocation (USCA) was proposed to mitigate the FWM effect. However, if no FWM light is allowed to fall on any optical channel, the number of channels is limited. This paper proposes a new method to extend the number of USCA channels to more than 16 under the optical bandwidth limitation. This method determines channel allocation by considering the distribution of the zero-dispersion wavelength of the optical fiber. The transmission performance of a WDM transmission system employing the proposed USCA methodology is clarified by numerical simulation to confirm that the optical bandwidth requirements can be reduced without degrading transmission performance. As a result, for 16 2.5 Gbit/s, if the fiber input power ranges from -3 dBm/ch to 3 dBm/ch, the achievable transmission distance is 700 km; the fluctuation in zero-dispersion wavelength is assumed to have the standard deviation of 5 nm. For 16 10 Gbit/s, if the fiber input power ranges from 0 dBm/ch to 3 dBm/ch, the achievable transmission distance is 400 km.

A new type of Meteor Burst Communication (MBC) network is developed. Each unit of the network is based on a DSP board running a modem software. All the fundamental blocks and functions of a modem are implemented in software. Unlike hardware modems, this software modem has flexibility of system configuration and operation. The system implements adaptability in terms of modulation type (number of phases in MPSK) using a unique dynamic channel estimation scheme appropriate for MBC channel. An MBC network protocol is implemented within the modem software. Some preliminary experiments were carried out for differential BPSK and differential QPSK modulations over a practical meteor burst link, and the results are presented.

While the secure concurrency controllers (SCCs) in multilevel secure database systems (MLS/DBMSs) synchronize transactions cleared at different security levels, they must consider the problem of covert channel. We propose a new SCC, named Verified Order-based secure concurrency controller (VO) that founds on multiversion database. VO maintains elaborated information about ordering relationships among transactions in a way of actively investigating and renewing the ordering relationships whenever it receives operations. With the elaborated information, it becomes capable of aborting transactions selectively whose non-interfered executions definitely violate one-copy serializability and providing more recent data versions to read requests than the other multiversion-based SCCs. Therefore, it comes to reduce the abort ratio and provide data versions of improved trustworthiness to transactions. By virtue of the elaborated information, moreover, VO is able to distinguish worthful versions and worthful transactions from worthless ones, so that it is capable lightening the burdens of maintaining multiple versions and accumulated transaction ordering relationships. For the aborts that are inevitable for preserving one-copy serializability, VO achieves security by deriving the conflicts to occur between transactions that have been cleared at the same security level.

In cellular systems, autonomous reuse partitioning (ARP) is one of the channel assignment strategy which attains the high spectral efficiency. In the strategy, the movement of mobile stations (MSs) causes the disturbance of reuse partition. Furthermore the smaller cell size causes the spectral efficiency worse. In this paper, we propose a new ARP strategy with reuse partitioning reconstructing, named RP-reconstructing ARP strategy, for microcellular systems. We evaluate the performance of the proposed strategy with blocking rate and forced call termination rate by the computer simulation. The results show that the system with the proposed strategy accommodates 1.5 times as many users as the system with ARP does.

Coding scheme for a noisy multiple-access adder channel is proposed. When a T-user δ-decodable affine code C is given a priori, a qT-user λ δ-decodable affine code C* is produced by using a q q matrix B satisfying BA=λ Iq q, e. g. , a Hadamard matrix or a conference matrix. In particular, the case of δ=1 is considered for the practical purposes. A (2n-1)-user uniquely decodable (δ=1) affine code Cn with arbitrary code length n is recursively constructed. When Cn plays a role of C, a q(2n-1)-user λ-decodable affine code C* is obtained. The code length and the number of users of C* are more flexible than those of the Wilson's code. The total rate of the λ-decodable code in this paper tends to be higher than that of the λ-decodable code by Wilson as the number of users increases.

It is well known that the electromagnetic interference (EMI) radiated from industrial, scientific and medical (ISM) apparatus seriously degrades the performance of wireless communication systems. In this paper, an ISM-band wireless local area network (WLAN) which employs a direct sequence-spread spectrum (DS-SS) system is designed to be sufficiently robust and reliable to operate in the presence of this EMI. To satisfy this goal, a technique to suppress EMI in the DS-SS system using a multicode transmission and an EMI observation channel is proposed. In the study, the EMI radiated from switching-type microwave ovens (MWO interference) which are ISM apparatus is concerned, and for a tractable investigation, a statistical model to represent MWO interference based on experimental measurement results is employed. As well known that MWO interference exhibits a bursty impulsive characteristic in time, a technique to transmit multiple long spreading codes (multicode transmission) is introduced for the DS-SS system to overcome the burstness of the interference. Moreover, inspired by the broadband in frequency of MWO interference, a technique to estimate the channel MWO interference by means of observing its levels in an adjacent channel is proposed, and this technique is applied to construct a multicode DS-SS receiver which can suppress the channel MWO interference. An evaluation of the bit error rate performance of the proposed multicode DS-SS system is conducted by computer simulation, and the numerical results demonstrate that the proposed DS-SS system can operate effectively even in the presence of MWO interference.

This paper presents the bit-error rate (BER) performance of the RAKE receiver over a multipath Rayleigh fading channel. The closed-form BER in the downlink single-cell environment is obtained through the analysis of the imperfect channel estimation. We compute the BER as a function of energy-to-noise ratio per bit including the effect of multiple access interference and multipath interference, with channel and system parameters: number of diversity channels L = 1, 3, 6, 12; Doppler frequency shift with fD T = 0.008333, 0.0167, 0.025; residual carrier frequency offset Δ f = -600 600 Hz; averaging length of the channel estimator Np = 128-1536 chips. This analysis allows predicting the system's performance and helps to optimize the parameter setting for the channel estimation process. We show that even if the optimal system parameters are used, the BER performance results in a minimal 4dB degradation in comparison to the perfect channel estimation. Finally, the theoretical results are verified by using the Monte-Carlo computer simulations.

This paper presents a 7th-order channel-select filter for a spread-spectrum wireless receiver operating with a minimum power supply of 2.5 V. The channel-select filter implements a sharp transition from 2 MHz to 4 MHz and a stopband attenuation of 50 dB. The 7th-order filter is realized by a cascade of a passive RC integrator, a 3rd-order leapfrog filter, an operational amplifier based differentiator, a 2nd-order notch filter, and a 1st-order allpass filter. It is designed in a 0.35 µm single-poly BiCMOS process. Simulation results show feasibility of the proposed filter.

The genetic algorithm is used to synthesize the directional circular arc array as a sectored antenna. Then, the performance of this sectored antenna in indoor wireless millimeter wave channel is investigated. Based on the desired pattern and the topography of the antennas, the synthesis problem can be reformulated into an optimization problem and solved by the genetic algorithm. The genetic algorithm will always converge to global extreme instead of local extreme and achieves a good approximation to the desired pattern. Next, the impulse responses of the indoor channel for any transmitter-receiver location are computed by shooting and bouncing ray/image techniques. By using the impulse response of multipath channel, the performance of the sectored antenna on BPSK (binary phase shift keying) system with phase and timing recovery circuits is presented. Numerical results show that the synthesized sectored antenna is effective to combat the multipath fading and can increase the transmission rate of indoor millimeter wave system.

In this paper, we present an access scheme for packet-typed wireless networks, called DQRUMA/PAR (Distributed-Queueing Request Update Multiple Access with Periodically Automatic Reservation), which can transmit multimedia traffic efficiently. Here, we deal with three kinds of traffic i. e. voice, data and still picture. DQRUMA/PAR introduces the transmission scheme that mobile stations for voice communications reserve the transmission capacity periodically during their talkspurts. The transmission control process of DQRUMA/PAR will become easier than the one of DQRUMA, and the delay characteristic of voice is improved. Furthermore, we study two enforced protocols on DQRUMA/PAR. One is the more enforced protocol for voice communications. We call this as Voice Enforced mode (VE mode) on DQRUMA/PAR. The other is the more enforced protocol for data communications. We call this as Data Enforced mode (DE mode) on DQRUMA/PAR. The transmission delay of voice will become reduced significantly by introducing VE mode. On the other hand, the transmission delay characteristic of data will be improved by introducing DE mode. We carry out the performance comparisons of pure DQRUMA/PAR with PRMA and DQRUMA and show the considerable improvement of the protocol numerically. Next we make the performance comparisons between pure DQRUMA/PAR and two enforced modes on DQRUMA/PAR and show the considerable improvements of these enforced protocols, respectively.

This paper use a site-specific model to characterize the performance of millimeter wave BPSK system with single cochannel interference. Shooting and bouncing ray/image techniques are applied to compute the impulse responses for concrete-wall-partition rooms and plasterboard-wall-partition rooms. By using the impulse responses of these multipath channels, the BERs (Bit Error Rates) for high-speed BPSK (binary phase shift keying) systems with phase and timing recovery circuits are calculated. In addition, the carrier-to-interference ratio is also computed. Numerical results show that the interference for the plasterboard-wall-partition rooms is more severe than that for the concrete-wall-partition rooms.

This paper proposes a short delay, error-resilient video transmission scheme for mobile radio channels. Compressed video data are sensitive to channel error. Video coding schemes such as H. 263 use variable length coding so channel error can cause synchronization failure in the decoder and fatally degrade the reconstructed video sequence by triggering intra- and inter-frame error propagation. ARQ prevents all forms of error propagation but significantly increases the transmission delay of the video frame. We propose a new error control scheme to reduces the delay incurred by ARQ; the receiving buffer can transmits the video frame data to the video decoder even if not all ARQ frames containing the video frame are received. The encoder transmits additional information, the Macro Block (MB) size, in the video frame header. Upon receiving this information, the receiving buffer can determine MB length which allows MB de-synchronization to be prevented. For example, if an ARQ frame is lost, the decoder determines the position of the missing MB and replace this MB with the equivalent block in the previous video frame; this prevents intra-frame error propagation. When all ARQ frames are received and decoded correctly, the video frame in the reference video memory is replaced with the correctly decoded one. Simulation results show that the proposed scheme can minimize the delay and the reduction in frame rate caused by retransmission control without intra- and inter-error propagation.

This paper proposes a simple adaptive channel estimation scheme for orthogonal frequency division multiplexing (OFDM) in order to realize high-rate wireless local area networks (LANs). The proposed estimator consists of simple frequency-domain FIR filters, which are adaptively selected according to the difference vector between adjacent subcarriers and channel amplitude of the subcarrier. No precomputation or matrix signal processing is required in the derivation of these characteristics. Computer simulations show that the packet error rate performance of the proposed scheme is superior to that of the least-squares scheme by 1.1 dB in terms of required Eb/N0 at PER=0.1 in AWGN channels. They also show, for the same criterion, a 0.7 dB improvement in a frequency selective fading channel with delay spread values of 100 ns.

While higher chip rate can provide better performance for Direct Sequence/Code Division Multiple Access (DS/CDMA) systems due to larger process gain, it may also induce spectrum emission to adjacent channels, i. e. , adjacent channel interference. Especially, if different operators use adjacent channels in the same area with uncoordinated power levels, such interference becomes large, and excessively higher chip rate will decrease the efficiency of a system. In this context, this paper evaluates the relation between chip rate and capacity in DS/CDMA cellular communication systems considering adjacent channel interference from other systems. First, the classification of adjacent channel interference between two independent DS/CDMA systems is described, and the concrete interference levels are calculated for several chip rates. Then, by using computer simulation, the system CDMA capacity is evaluated under adjacent channel interference. From these results, we can find that the excessively higher chip rate can not always provide the larger system CDMA capacity in spite of the larger process gain, and there exists the appropriate chip rate for a certain given bandwidth.

A T-user uniquely decodable (UD) code {C1,C2,,CT} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.

Recently, the quantum information theory attracts much attention. In quantum information theory, the existence of superadditivity in capacity of a quantum channel was foreseen conventionally. So far, some examples of codes which show the superadditivity in capacity have been clarified. However in present stage, characteristics of superadditivity are not still clear up enough. The reason is as follows. All examples were shown by calculating the mutual information by quantum combined measurement, so that one had to solve the eigenvalue and the eigenvector problems. In this paper, we construct a simplification algorithm to calculate the mutual information by using square-root measurement as decoding process of quantum combined measurement. The eigenvalue and the eigenvector problems are avoided in the algorithm by using group covariancy of binary linear codes. Moreover, we derive the analytical solution of the mutual information for parity check codes with any length as an example of applying the simplification algorithm.

A new UEP technique for image transmission using trellis code based on Hamming distance criterion has been proposed. The simulation results comparing the image quality and bit-rate for UEP and EEP have been provided. The results show that UEP performs better than EEP in terms of bit-rate without any significant depreciation in image quality.

The subliminal channel is one of the methods for hiding a message in other messages. Simmons has shown conjectures on the upper bound to the bandwidth of a subliminal channel. This paper proposes a new broad-band subliminal channel embedded in the ESIGN. The bandwidth of the proposed subliminal channel is wider than that of the previous one, and it exceeds the upper bound that Simmons has conjectured. Namely, we disprove the conjectures due to Simmons. We also show that it is possible to construct the subliminal channel even if the transmitter and the subliminal receiver do not have any key in common.

In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.