We propose a p-persistent protocol for slow-frequency-hopped slotted random access networks, assuming that all the users know the number of backlog users in a slot. The proposed protocol delays new packet transmission until the number of users with a packet to be retransmitted decreases to the threshold or less. Performance of the proposed protocol is evaluated with a two-dimensional Markov chain for systems with finite population in terms of throughput efficiency and the average transmission delay. Numerical results show that the proposed protocol can achieve better performance by suppressing new packet transmission, compared to the conventional frequency-hopped slotted ALOHA. The optimum value of the threshold is also numerically derived.

This paper discusses a communication system with a multiple-access channel where two users simultaneously send complex-valued signals in the same frequency-band. In this channel, ambiguity in decoding occurs when receiver trying to estimate each users' signal. In order to solve the ambiguity problem, a family of uniquely decodable code is derived in this paper. The uniquely decodable code is designed by using trellis-coded modulation (TCM) pair where the trellis structure of one TCM is a transformation of the other in the pair. It is theoretically proved that, with the proposed coding scheme, the composite received signal can be uniquely decomposed into the two constituent signals for any power ratio and any phase difference between the received two users' signals. Improvement of BER performance over non-uniquely decodable code is illustrated by computer simulation.

This paper compares the packet error rate (PER) performance of three access schemes, i.e., single-carrier (SC)/DS-CDMA, multi-carrier (MC)/DS-CDMA, and MC-CDMA assuming an 80-MHz bandwidth in order to achieve an optimum broadband packet wireless access scheme. In a broadband propagation channel, severe multipath interference degrades the accuracy of timing detection of multipath components (path search) and channel estimation required for coherent detection. Computer simulation results show that, in the reverse link, SC/DS-CDMA achieves better performance than MC/DS-CDMA because the pilot signal power in one sub-carrier required for path search and channel estimation decreases as the number of sub-carriers increases. The superiority of MC-CDMA to MC (SC)/DS-CDMA in the forward link is also demonstrated, because frequency diversity is effectively utilized in association with the mitigation of a much longer symbol duration than the delay spread in MC-CDMA, meanwhile a higher degree of multipath interference offsets the Rake time diversity in MC (SC)/DS-CDMA in a broadband multipath fading channel.

The recent trend towards highly parallel on-chip data processing, as e.g. in single-chip processors with parallel execution capability of multiple instructions, leads to the requirement of on-chip data storage with high random-access bandwidth, parallel access capability and large capacity. The first two requirements call for the application of multi-ported memories. However, the conventional architecture, based on multi-port storage cells for each bit, cannot efficiently realize the large storage capacity, because cell area explodes due to a quadratic increase with port number (N). A promising method for obtaining area efficiency is to increase the size of the smallest unit with N-port capability, e.g. by introducing N-port capability on the level of blocks of 1-port cells and not for each cell. We report a quantitative analysis of this method for the SRAM case, which is based on design data in a 0.5 µm, 2-metal CMOS technology. Achievable area-reduction magnitudes in comparison to the conventional architecture are found to be enormous and to accelerate as a function of N. Reduction factors to areas < 1/2, < 1/5, < 1/14 and < 1/30 are estimated for 4, 8, 16 and 32 ports, respectively. Since the demerit of the proposed approach is an increased access-rejection probability, a trade-off between area reduction and allowable access-rejection probability is always necessary for practical applications. This is discussed for the application of multi-port cache memories.

This paper proposes an autonomous relay access algorithm that provides an intelligent wireless network structure for inter-vehicle communication systems. The proposed algorithm introduces a special classification among mobile terminals and assigns terminals to one of several terminal groups, which are adaptively and autonomously constructed according to traffic conditions. The proposed algorithm uses the terminal groups to conduct relay access transmission among terminals, and achieves a high rate of successful inter-terminal transmission. Computer simulation confirms that the proposed algorithm can achieve a lower blocking probability than that without a relay access scheme.

A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset can not recover the secret. It can be used to protect important secret data, such as cryptographic keys, from being lost or destroyed without accidental or malicious exposure. In this paper, we consider secret sharing schemes based on interpolating polynomials. We show that, by simply increasing the number of shares held by each participant, there is a multiple assignment scheme for any monotone access structure such that cheating can be detected with very high probability by any honest participant even the cheaters form a coalition in order to deceive him.

We have proposed a current-cut switched-current matched filter (CC-SIMF) for direct-sequence code-division multiple-access (DS-CDMA). The 256-chip CC-SIMF can achieve low power consumption of less than 10 mW under high-speed operation of more than 16 Mcps. To reduce the current transfer error accumulation, we propose a parallel SIMF configuration. A 128-chip SIMF using 0.8-µm Complementally Metal Oxide Semiconductor (CMOS) process has been designed and fabricated. Optimization of the current memory cell structure has been described. The correlation operation at 16 Mcps has been obtained using a 128-chip orthogonal m-sequence. The code phase separation performance for path diversity has been clearly observed. The power consumption has been significantly reduced using the current-cut method.

A compact optically-fed radio access point module was developed that consists of a uni-traveling-carrier refracting-facet photodiode, a patch antenna, and an optical input interface. An output power from the photodiode was 1.4 dBm at a frequency of 5.88 GHz without any bias voltage.

This paper describes the results of a series of laboratory experiments for performance evaluations of our proposed Maximum Likelihood Sequence Estimation (MLSE) based interference canceller, the Interference Canceling Equalizer (ICE), which can cancel both co-channel interference (CCI) and inter-symbol interference (ISI). To verify the feasibility of ICE for the Japanese cellular communications system, a standard of which has been released under the name of Personal Digital Cellular (PDC) system, a prototype system was constructed using 27 TI TMS320C40 Digital Signal Processor (DSP) chips. The ICE prototype works in real-time on the PDC air interface, major specifications of which are π/4 QDPSK 21 k symbols/s 3-channel time-division multiple-access (TDMA). Two-branch diversity reception is used to enhance the signal detection performance of ICE. In the experiments, BER performances were evaluated using the prototype system. Under a single-path Rayleigh fading and a single CCI condition, the ICE receiver attains the BER of less than 310-2 with the negative values of the average CIR: for fD = 5 Hz and 40 Hz, the average CIR more than -20 dB and -10 dB, respectively. Under a double-path Rayleigh fading and a single CCI condition, the ICE receiver attains the BER of less than 1.510-2 with the negative values of the average CIR: for fD = 5 Hz and 40 Hz, the average CIR more than -20 dB and -10 dB, respectively. The laboratory test results suggest that the ICE receiver has potential for system capacity enhancement.

In most access control systems, authorization is specified using binary decisions, "yes" or "no," to the access requests resulting in access being permitted or denied respectively. We argue that emerging Internet applications require that this binary decision be extended to "allow access provided some actions are taken. " We propose the notion of provisional actions that specifies the necessary actions to be performed in addition to the binary decision and introduce an access control model for it. We also provide an administrative model for policy management purpose.

This paper proposes a new construction of the visual secret sharing scheme for the (n,n)-threshold access structure applicable to color images. The construction uses matrices with n rows that can be identified with homogeneous polynomials of degree n. It is shown that, if we find a set of homogeneous polynomials of degree n satisfying a certain system of simultaneous partial differential equations, we can construct a visual secret sharing scheme for the (n,n)-threshold access structure by using the matrices corresponding to the homogeneous polynomials. The construction is easily extended to the cases of the (t,n)-threshold access structure and more general access structures.

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.

In this paper, we discuss the access control in multimedia CDMA ALOHA protocol. We introduce a new algorithm for the access control based on Modified Channel Load Sensing Protocol (MCLSP) in an integrated voice and two different classes of data users, high bit rate and low bit rate, exist in a multi-code CDMA Slotted ALOHA system. With our new algorithm, we show that the throughput of high bit rate data users, as well as, the total throughput of the data medium can be optimized and take a maximum value even at high values of offered loads. We also investigate the performance when voice activity detection (VAD) is considered in voice transmission.

We propose a new interference cancellation technique using reference signals for optical synchronous code-division multiple-access (CDMA) systems. In the proposed system, we use the signature code sequences composed of the group information codes and the modified prime code sequences. The group information codes are added in the forefront of the signature code sequences to estimate the amount of the multiple access interference (MAI). The proposed cancellation scheme can be realized with the simpler structure than the conventional canceller using the time division reference signal, because it can reduce the number of optical correlators from P to two where P is the prime number. We analyze the performance of the proposed system with considering the effects of the MAI, avalanche photodiode (APD) noise, and thermal noise. We show that the proposed canceller has better bit error probability than the conventional canceller.

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.

The non-collision packet reservation multiple access (NC-PRMA) protocol has been proposed for wireless voice communications. In that protocol, although it can avoid any collision by using control minislot, the terminal which generates its talkspurt in a current frame has to wait till a next frame to transmit an asking packet to obtain reservation. Furthermore, under integrated voice and data traffic, in the conventional NC-PRMA the voice packet dropping probability becomes worse, because of the number of slots that voice terminals can access are limited. In this paper, we propose the NC-PRMA with random transmission to idle slots. First, we evaluate the mean access delay and the voice packet dropping probability under only voice traffic by the theoretical analysis and the computer simulation. It is shown that the proposed scheme attains lower mean access delay than the conventional NC-PRMA. Next, we evaluate the data packet delay and the voice packet dropping probability under integrated voice and data traffic by the computer simulation. It is shown that the proposed scheme attains lower packet dropping probability than the PRMA and the conventional NC-PRMA.

Session length and group size are two most significant factors in achieving efficient scheduling for unicast and multicast traffic in single-hop wavelength division multiplexing (WDM) local area networks (LANs). This paper presents a hybrid protocol to schedule both unicast and multicast traffic in broadcast WDM networks. The protocol makes an important assumption that unicast traffic is the major portion of the overall traffic and is usually scheduled with a pre-allocation-based protocol. On the other hand, multicast traffic is a smaller portion of the overall traffic with multicast sessions and multicast groups, and is scheduled with a reservation-based protocol. The concept of multicast threshold, a function of random variables including the multicast session length and the multicast group size, is also proposed to partition the multicast traffic into two types. If the transmission threshold of a multicast request is larger than the multicast threshold, the request is handled with a reservation-based protocol. Otherwise, the multicast request is handled similar to unicast traffic; that is, each packet in the multicast session is replicated and sent to the unicast queues of destinations. The results show that the hybrid protocol can achieve better channel utilization efficiency and packet delay for unicast traffic under the multicast scenarios with moderate session length and group size. However, separate scheduling or broadcasting will be more suitable for a multicast scenario with very large session length and group size, which is not common on most realistic networks.

This paper proposes the technology of wide passband wavelength-division multiplexing (WWDM) for access networks offering multiplexed services. The technology greatly relaxes the wavelength setting accuracy requirements of the WDM light source and the multiplexer/demultiplexer (MUX/DEMUX) compared to dense WDM (DWDM) technology. A WWDM optical converter that offers the Internet protocol (IP) service is implemented and its performance assessed at temperatures ranging from 0C to 45C. In addition, we assess three channel transmission (cable television (CATV) and IP services) in the 1.5 µm region as a multiplexed service example. Using the proposed WWDM, we confirm the feasibility of a service multiplexing system that offers simultaneous CATV and IP services in access networks. This WWDM technology is expected to provide cost effective service multiplexing systems for access networks.

An optical spectral coding scheme is devised for fiber-optic code-division multiple-access (FO-CDMA) networks. The spectral coding is based on the pseudo-orthogonality of FO-CDMA codes properly written in the fiber Bragg grating (FBG) devices. For an incoming broadband optical signal having spectral components equal to the designed Bragg wavelengths of the FBG, the spectral components will be reflected and spectrally coded with the written FO-CDMA address codes. Each spectral chip has different central wavelength and is distributed over the spectrum of the incoming light source. Maximal-length sequence codes (m-sequence codes) are chosen as the signature or address codes to exemplify the coding and correlation processes in the FO-CDMA system. By assigning the N cycle shifts of a single m-sequence code to N users, we get an FO-CDMA network that can theoretically support N simultaneous users. To overcome the limiting factor of multiple-access interference (MAI) on the performance of the FO-CDMA network, an FBG decoder is configured on the basis of orthogonal correlation functions of the adopted pseudo-orthogonal codes. An intended receiver user that operates on the defined orthogonal correlation functions will reject any interfering user and obtain quasi-orthogonality between the FO-CDMA users in the network. Practical limiting issues on networking performance, such as non-flattened source spectra, optical path delay, and asynchronous data accesses, are evaluated in terms of the bit-error-rate versus the number of active users. As expected, the bit-error-rate will increase with the number of active users. Increasing the flatness parameter of optical signal will lead to a lower average error probability, since we are working in a part of the more flattened optical spectrum. In contrast, reducing the encoded bandwidth will reduce the total received power, and this will necessitate higher resolution of fiber Bragg gratings.

This paper focuses on a single BSA (Basic Service Area) in an infrastructure network and studies the performance of the IEEE 802.11 standard MAC protocol by means of simulation. The MAC protocol supports DCF (Distributed Coordination Function) and PCF (Point Coordination Function). The simulation model includes both data transmission with the DCF and H.263 video transmission with the PCF. In the simulation we assume that the channel transmission rate is 2 Mbps and use the system parameters specified in the standard for the DSSS (Direct Sequence Spread Spectrum) physical layer. We evaluate the performance of this protocol in terms of throughput and MPDU (MAC Protocol Data Unit) delay for various values of the CFP (Contention Free Period) repetition interval and the CFP maximum duration. Numerical results show that if the CFP repetition interval is set too long, video MPDU delay becomes very large periodically; therefore, average video MPDU delay deteriorates. We also find that as the CFP maximum duration decreases, the number of video terminals that can be accommodated in the system decreases. Furthermore, how channel transmission errors affect the performance of the protocol is examined. A two-state continuous-time Markov model is used as a burst error model. As a result, we see that for a small number of video terminals, the average video-MPDU-delay performance does not deteriorate drastically for larger values of bit error rate.