This paper presents a new design of spread spectrum signals with the minimally sufficient dimension from the view point of frequency diversity. Letting the signature signal duration and the bandwidth be denoted by T and B, respectively, we can nominally represent a signature signal of either Direct Sequence (DS) or MultiCarrier (MC) spread spectrum system as the sum of N=BT sinusoidal signal units with their frequencies separated by 1/T or its multiples. In our design,assuming the maximum expected channel delay spread σd « T as usual, one signature signal viewed in the frequency domain is made up of the minimum number K 2πσdB of sinusoidal signal units which are arranged so as there is placed at least one unit in coherence bandwidth 1/(2πσd) in which the fading channel transfer function has strong correlation. Although the signature signal does not make use of all the units in the given frequency domain as in the ordinary spread spectrum systems, but uses only skipped units, it can be shown that almost the same frequency diversity effect is attained. And it is also shown that the immunity to the external interfering signals is by no means inferior. If every L=N/K T/(2πσd) consecutive sinusoidal signal units are assigned to the K signal units of a signature signal, L different signature signals are simultaneously available mutually orthogonal when the synchronous demodulation is performed in the same T period. We call each of the orthogonal sinusoidal signal sets a Frequency Devision (FD) signal set. Now, CDMA can be independently realized on each of the L FD signal sets provided the operation is synchronous or quasi-synchronous with respect to the symbol demodulation (or signature) period. Partitioning the simultaneous users among the FD sets, it is possible to decrease the number of CDMA users to be processed, retaining the total number of simultaneous users. Owing to this effect, the multiple access performance for the FD/CDMA system is shown to be superior to that of the ordinary DS or MC/CDMA system, assuming matched filter reception based on the complete estimation of the channel characteristics for the both cases. The decrease of the number of CDMA users per FD set makes it practical for the receiver to employ multiple access interference cancellation and even the maximum likelihood detection. Curiously, any FD signal set can be represented in the time domain as L repetition of a sequence with its period equal to K in the number of 1/B duration time chips.

A novel adaptive algorithm based on pilot channel (PCA) for MMSE multiuser detection in downlink CDMA is proposed in this paper. This algorithm uses the information in pilot channel to compute the desired weight vector directly. Compared with conventional adaptive algorithms and blind algorithms, it does not require training sequences nor channel estimation. Analysis shows that the weight vector obtained by the PCA algorithm converges to the Wiener solution globally and its computational complexity is O(N2). Simulation results show that the PCA algorithm can adapt rapidly to the changing environment. The steady state performance can be enhanced by increasing the transmitted power in pilot channel, but is worse than that of conventional recursive least-square (RLS) algorithm in decision-directed mode. Also, performance of the adaptive MMSE detector is much better than that of conventional RAKE receiver.

This paper investigates noise enhancement factors of a zero-forcing detector and a decision feedback detector for synchronous Multiple Input Multiple Output (MIMO) channels. It is first shown that the zero-forcing and decision feedback detectors can be implemented in a vector digital filter form, and the noise enhancement factors with the detectors can easily be calculated by using the vector digital filter form. This paper then applies the zero-forcing and decision feedback detectors to the signal detection of a frequency-overlapped multicarrier signaling (FOMS) system. The normalized noise enhancement factor, which is given as a product of the noise enhancement and bandwidth reduction factors, is shown to be smaller with the decision feedback detector than the zero-forcing detector. Results of computer simulations conducted to evaluate bit error rate (BER) performances with the two detectors are also shown together with the BER performance with a conventional channel-by-channel detector.

A new carrier based dynamic channel assignment for FDMA/TDMA cellular systems, called borrowing with directional carrier locking strategy, is proposed in this paper. When a call arrives at a cell and finds all voice channels busy, a carrier which consists of multiple voice channels can be borrowed from its neighboring cells for carrying the new call if such borrowing will not violate the cochannel interference constraint. Two analytical models, cell group decoupling analysis and phantom cell analysis, are constructed for evaluating the performance of the proposed strategy. Using cell group decoupling (CGD) analysis, a cell is decoupled together with its neigbors from the rest of the network for finding its call blocking probability. Unlike conventional approaches, decoupling enables the analysis to be confined to a local/small problem size and thus efficient solution can be found. For a planar cellular system with three-cell channel reuse pattern, using CGD analysis involves solving of seven-dimenional Markov chains. It becomes less efficient as the number of carriers assigned to each cell increases. To tackle this, we adopt the phantom cell analysis which can simplify the seven-dimensional Markov chain to two three-dimentional Markov chains. Using phantom cell analysis for finding the call blocking probability of a cell, two phantom cells are used to represent its six neighbors. Based on extensive numerical results, we show that the proposed strategy is very efficient in sharing resources among base stations. For low to medium traffic loads and small number of voice channels per carrier, we show that both analytical models provide accurate prediction on the system call blocking probability.

Multi-user uniquely decodable (UD) k-ary coding for the multiple-access adder channel is investigated. It is shown that a Tf+g+1-user UD k-ary affine code with code length f+g+1 can be obtained from two Tf-user and Tg-user UD k-ary affine codes. This leads to construct recursively a Tn-user UD k-ary affine code with arbitrary code length n. The total rate of the code tends to be higher than those of all the multi-user UD k-ary codes reported previously as the number of users increases.

Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.

Cellular Digital Packet Data (CDPD) provides wireless data communication services to mobile users by sharing unused RF channels with AMPS on a non-interfering basis. To prevent interference on the voice activities, CDPD makes forced hop to a channel stream when a voice request is about to use the RF channel occupied by the channel stream. The number of forced hops is affected by the voice channel selection policy. We propose analytic models to investigate the CDPD channel holding time for the the least-idle and random voice channel selection policies. Under various system parameters and voice channel selection policies, we provide guidelines to reduce the number of forced hops.

We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.

This paper proposes a novel configuration of an elevated base station using an adaptive array for TDMA systems, which can simultaneously decrease the CCI (co-channel interference) and form a circular cell. The proposed base station comprises two sets of transceivers and antenna arrays, and an adaptive beam control unit. The transceivers work in different time slots. The circular cell that suppresses the interference is achieved by integrating the pattern control of the two antenna arrays. The effectiveness of the proposed base station configuration is evaluated by field measurements using an adaptive array testbed. We confirm that the proposed base station achieves a channel capacity that is approximately 30% greater than that of a base station employing an omni-directional antenna and generates an omni-zone with reduced CCI in an actual microcell system. Furthermore, we confirm by computer simulation that the proposed base station establishes a communicable area that is approximately 1.8 times larger than that of a base station employing an omni-directional antenna.

In this paper, we propose a projection based design of near perfect reconstruction QMF banks. An advantage of this method is that additional design specifications are easily implemented by defining new convex sets. To apply convex projection technique, the main difficulty is how to approximate the design specifications by some closed convex sets. In this paper, introducing a notion of Magnitude Product Space where a pair of magnitude responses of analysis filters is expressed as a point, we approximate design requirements of QMF banks by multiple closed convex sets in this space. The proposed method iteratively applies a convex projection technique, Hybrid Steepest Descent Method, to find a point corresponding to the optimal analysis filters at each stage, where the closed convex sets are dynamically improved. Design examples show that the proposed design method leads to significant improvement over conventional design methods.

A blind technique for adaptive signal suppression in multipath DS-CDMA communication channels for the downlink is considered. Its performance is degraded when mismatch problem occurs when multipath components arrive with fractional-chip delays. In order to surmount this problem, Multiple Finger Expansion Optimal Filter (MFE-OF) was recently proposed to estimate the received desired signal subspace using fractionally delayed despreading fingers. However, MFE-OF requires much computational complexity for good performance. In this paper, a modification to the MFE-OF is introduced by utilizing decision-directed steering vector to reduce the number of fingers required by MFE-OF down to that of the conventional OMF-RAKE without much performance degradation. This modified receiver is called Decision-Directed Optimal Filter (DDOF). Computer simulation validates the effectiveness of the new receiver to increase the downlink capacity of DS-CDMA systems.

In this paper the novel method of "weighted OFDM" is addressed. Different types of weighting factors (including Rectangular, Bartlett, Gaussian, Raised cosine, Half-sin and Shanon) are considered. The impact of weighting of OFDM on the peak-to-average power ratio (PAPR) is investigated by means of simulation and is compared for the above mentioned weighting factors. Results show that by weighting of the OFDM signal the PAPR reduces. Bit error performance of weighted multicarrier transmission over a multipath channel is also investigated. Results indicate that there is a trade off between PAPR reduction and bit error performance degradation by weighting.

The Infostation concept has been proposed to provide convenient and cost effective access to high-speed mobile data services. An efficient IP packet transmission protocol is required to compensate for the high error rate inherent to fading radio channels. In this paper, a novel link layer retransmission scheme is proposed. Using the channel state and fading state estimators, the scheme adjusts the retransmission parameters dynamically in order to achieve the optimum performance under time-varying channel conditions. A theoretical analysis is presented for the case of a random error channel. Furthermore, a simulation tool is developed for evaluating the performance of the scheme in a fading channel with various parameters. The analysis and simulation results show that this new retransmission scheme can provide substantial improvement over traditional schemes. It gives a robust performance in both slow and fast fading conditions. In addition, the algorithm's sensitivity to parameter values and channel characteristics, such as Doppler frequency and fading statistics, is investigated. A unique attribute of this algorithm and performance analysis is that throughput is evaluated in IP packets rather than in physical layer packets.

In this work, distributed dynamic channel assignment strategies with violation to the reuse pattern using vehicular mobility information for highway microcellular environments are proposed. It is shown that, when vehicular mobility information is included in the acquisition channel policy, the outage probability degradation because of the use of channels with one violation to the reuse pattern is negligible. Also, it is shown that, using different moving direction strategies it is possible to control the tradeoff between capacity and quality of service. The local packing algorithm (LP), was modified to allow the use of two different moving direction strategies with violation to the reuse pattern, resulting the VDLP1 and VDLP2 algorithms. The characteristics of user mobility are considered and a free-flowing vehicular traffic is assumed. Simulation results show that the use of vehicular mobility information in the distributed dynamic channel algorithms with violation to the reuse pattern, produce a considerable increase in the system capacity at the expense of an insignificant degradation of the quality of service. For a grade of service (GOS) of 0.1, the VDLP1 and VDLP2 carry 4% and 1.5% more traffic than the maximum packing algorithm, respectively. For the same GOS, the VDLP1 and VDLP2 carry 68% and 64% more traffic than the fixed channel assignment algorithm, respectively.

The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement exhaustive strategy is more suitable for systems with less non-uniformly distributed traffic; and (iii) the combined frequency and requirement exhaustive strategy with node-color re-ordering is the most efficient algorithm. The frequency spans obtained using the proposed algorithms are much lower than that reported in the literature, and in many cases are equal to the theoretical lower bounds.

In this paper, we propose an effective SOI yield engineering methodology by practical usage of 2D simulations. Process design for systematic yield of Fully-Depleted SOI MOSFET requires specific consideration of floating-body effects and parasitic channel leakage currents. The influence of varied SOI layer thickness to such phenomena is also complicated and substantial. Instead of time-consuming 3D simulators, 2D simulators are used to optimize the process considering these effects in acceptable turn around time. Our methodology is more effective in future scaled-down process with decreased SOI layer thickness.

Channel-state-dependent (CSD) radio-resource scheduling algorithms for wireless message transport using a framed ALOHA-reservation access protocol are presented. In future wireless systems that provide Mbps-class high-speed wireless links using high frequencies, burst packet errors, which last a certain number of packets in time, would cause serious performance degradation. CSD resource scheduling algorithms utilize channel-state information for increasing overall throughput. These algorithms were comparatively evaluated in terms of average allocation plus transfer delay, average throughput, variance in throughput, and utilization of resources. Computer simulation results showed that the CSD mechanism has a good effect, especially on equal sharing (ES)-based algorithms, and also CSD-ES provides low allocation plus transfer delay, high average throughput, low variance in throughput, and efficient utilization of radio resources.

We propose a novel adaptive multiple-symbol differential detection (MSDD) scheme that has excellent performance over frequency selective fading (FSF) channels. The adaptive MSDD scheme consists of an adaptive noncoherent least mean square channel estimator that can accomplish channel estimation without any decision delay and the MSDD. The M-algorithm is introduced into this detection scheme to reduce the complication of computation due to increasing observed sequence length in the MSDD. Because of the application of the adaptive channel estimator and the M-algorithm, this adaptive MSDD make it possible that channel estimation is accomplished for every symbol along M surviving paths without any decision delay. And the SER performance of this adaptive MSDD is not affected by phase fluctuation introduced by a channel because the MSDD and the noncoherent channel estimator are applied. The adaptive MSDD scheme is applied to typical constellation of 16APSK, the (4,12) QAM and the star QAM. The excellent tracking performance of this adaptive MSDD scheme over FSF channels is confirmed by computer simulations.

This paper presents the results on IF/baseband up/down direct digital conversion and multiple channel analysis/synthesis software defined radio modules which are implemented using high speed ADC, DAC and FPGA, for IS-95 code division multiple access (CDMA) systems. The implemented system can directly down-convert multiple channel IS-95 CDMA IF signals to the baseband, and selectively analyze specific channel signals based on polyphase analysis filter bank techniques. Moreover, the analyzed baseband signals of multiple channels can be directly up-converted and synthesized in the same system. We have deployed the implemented system in IS-95 CDMA optical digital repeaters for PCS applications.

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.