An analysis of the performance of adaptive infinite impulse response (AIIR) filters with fixed poles is presented. Thirty digital bandpass filters (BPFs) from 100 to 3000 Hz, each centered at 100 Hz increments with a bandwidth of 100 Hz, are configured in parallel to form an adaptive filter bank. When a signal, corrupted by noise, is applied to the filter bank, it adapts to the desired (uncorrupted) signal. It has been determined that the AIIR BPF bank will provide a better response to an input when compared with an adaptive finite impulse response (AFIR) filter with 32 coefficients but will remain inherently stable in contrast to an IIR filter bank with adaptive zeros and poles. Also, an AIIR BPF with an adaptive center frequency was also derived and tested.>

A stack random access algorithm for CSMA (carrier sense multiple access) and CSMA/CO (CSMA with collision detection) channels is presented. The algorithm adapts its operation to the characteristics of the channel at hand by means of two parameters. Utilizing the regenerative character of the induced packet delay process, a lower bound on the algorithm's maximum stable throughput and very tight upper and lower bounds on the mean packet delay are derived. The packet delay distribution is estimated using the regenerative simulation method. The proposed algorithm is inherently stable, easy to implement, and combines high performance with modest channel monitoring requirements.>

The interconnection of two local area networks, each of which connects a large population of users via a carrier-sense multipleaccess (CSMA) channel is considered. In each network, a bridge node receives internetwork packets from the local users and forwards them to the bridge node of the other network via a point-to-point link; the bridge node of the destination network queues these internetwork packets for subsequent broadcasting to the local users. For the multiplexing of the user transmissions and the bridge node transmissions on the available broadcast channel in each network, frequency division, and contention are considered. The throughput-delay characteristics of the interconnected system operating under the above multiplexing techniques are found and comparisons are made. It is shown that contention multiplexing can yield system performance comparable to that of frequency division multiplexing, while requiring no hardware or software modification of either network in the interconnected system.

This paper considers the interconnection of two local area networks, each of which connects a large population of users via a carrier-sense multiple-access (CSMA) channel. In each network a bridge node receives internetwork packets from the local users and forwards them to the bridge node of the other network via a point-to-point link; the bridge node of the destination network queues these internetwork packets for subsequent broadcasting to the local users. The available broadcast channel in each of the two networks is frequency divided into a bridge node subchannel, used for bridge node transmissions, and a CSMA user subchannel, used for user transmissions. For the interconnected system, stability conditions, optimal bandwidth allocations, and throughput delay characteristics are found. Also it is shown that the performance of a single CSMA network can be substantially improved by partitioning it into smaller interconnected networks.