The capacity of the white Gaussian multiple access channel with feedback

Since the appearance of [10] by Gaarder and Wolf, it has been well known that feedback can enlarge the capacity region of the multiple access channel. In this paper a deterministic feedback code is presented for the two-user Gaussian multiple access channel, which is shown to allow reliable communication at all points inside a region larger than any previously obtained. An outer bound is given which is shown to coincide with the achievable region, thus yielding the capacity region of this channel exactly.     

On multiple access channels with feedback (Corresp.)

For the binary erasure multiple access channel, van der Meulen showed in his survey paper that the symmetrical rate pair(0.79113,0.79113)is achievable in the ease of feedback. Here we prove that this rate point is on the boundary of the feedback capacity region. Subsequently we apply this result to demonstrate the fact that the feedback capacity region of the product of two multiple access channels can be strictly larger than the (Minkowski)sum Of the feedback capacity regions for the separate channels.     

An achievable rate region and a capacity outer bound for 3‐user Gaussian multiple access channel with feedback

Extension of the Ozarow capacity theorem for 2‐transmitter Gaussian multiple access channel (MAC) with feedback to the channels with more than 2 transmitters is a widely studied and long standing problem (for example, see the Kramer sum‐capacity region). In this paper, we investigate and analyze this possible extension. Specifically, exploiting a class of Schalkwijk‐Kailath linear feedback codes, we obtain an achievable rate region for 3‐user Gaussian MAC with full feedback and also a capacity outer bound. Then the results are extended for a case where there is no feedback link for one user, and the corresponding achievable rate region and capacity outer bound are computed. Furthermore, the gap between the derived rates and the sum capacity of 3‐user Gaussian MAC with full and partial feedback is computed under special assumptions.     

Partial feedback for the discrete memoryless multiple access channel (Corresp.)

The region Cover and Leung found for the discrete memoryless multiple access channel with feedback to both encoders is proved achievable also with feedback to only one encoder. The novel ideas of nonrandom partitions and restricted decoding are used to avoid list coding techniques.     

Multiple-access channels with different generalized feedback signals

This paper is concerned with a communication channel with two senders and one receiver, in which each sender observes a private feedback signal. The two feedback signals are not necessarily equivalent to or derived from the signal observed by the receiver. An achievable rate region is demonstrated for this multiple-access channel by means of a new superposition coding scheme. In particular it is shown that a rate region, previously obtained for the multiple-access channel with "perfect" feedback to both senders, remains achievable when the feedback connection to one of the senders is eliminated.     

带有广义反馈的多址接入中继信道的可达速率区域的研究

多址接入中继信道是含有多个接入节点、1个中继节点和1个目的接收节点的无线多用户信道,同时考虑接入节点之间能够接收彼此含噪的广义反馈信息,此种模型存在于接入节点之间协作通信能力较差的多跳无线网络和无线传感器网络。论文给出了带有此种广义反馈的离散无记忆多址接入中继信道的可达速率区域,并将这一结果推广到高斯信道。提出一个新的编码方案,主要基于速率划分和译码前传策略,并通过采用分组Markov叠加编码建立各接入源节点之间以及源节点和中继节点之间的协作通信,在可达性证明中还采用规则编码和反向译码策略。结果表明,在离散无记忆信道环境下可达速率区域相比较以往结果更具一般性,在高斯信道环境下可达速率区域被扩展。     

Fractionally spaced decision feedback joint detection for multitoneCDMA systems

We consider a fractionally spaced decision feedback joint detector (FS-DFJD) for multitone code division multiple access (CDMA) systems. We first derive the structure of the receiver for an minimum mean-squared error (MMSE) criterion. Then we investigate the bit-error rate (BER) performance achieved by this detector for binary phase-shift keying (BPSK) modulation in steady-state conditions. We consider an asynchronous scenario where the signal of each user propagates over a two-path channel. The resistance of the detector against timing errors is studied, and the resistance against a near-far scenario is also demonstrated     

Comparison of novel coding techniques for a fixed wavelength hopping SAC-OCDMA

The optical code division multiple access (OCDMA), the most advanced multiple access technology in optical communication has become significant and gaining popularity because of its asynchronous access capability, faster speed, efficiency, security and unlimited bandwidth. Many codes are developed in spectral amplitude coding optical code division multiple access (SAC-OCDMA) with zero or minimum cross-correlation properties to reduce the multiple access interference (MAI) and Phase Induced Intensity Noise (PIIN). This paper compares two novel SAC-OCDMA codes in terms of their performances such as bit error rate (BER), number of active users that is accommodated with minimum cross-correlation property, high data rate that is achievable and the minimum power that the OCDMA system supports to achieve a minimum BER value. One of the proposed novel codes referred in this work as modified random diagonal code (MRDC) possesses cross-correlation between zero to one and the second novel code referred in this work as modified new zero cross-correlation code (MNZCC) possesses cross-correlation zero to further minimize the multiple access interference, which are found to be more scalable compared to the other existing SAC-OCDMA codes. In this work, the proposed MRDC and MNZCC codes are implemented in an optical system using the optisystem version-12 software for the SAC-OCDMA scheme. Simulation results depict that the OCDMA system based on the proposed novel MNZCC code exhibits better performance compared to the MRDC code and former existing SAC-OCDMA codes. The proposed MNZCC code accommodates maximum number of simultaneous users with higher data rate transmission, lower BER and longer traveling distance without any signal quality degradation as compared to the former existing SAC-OCDMA codes.     

Power Control for Fading Cooperative Multiple Access Channels

For a fading Gaussian multiple access channel with user cooperation, we obtain the power allocation policies that maximize the average rates achievable by block Markov superposition coding, subject to average power constraints. The optimal policies result in a coding scheme that is simpler than the one for a general multiple access channel with generalized feedback. This simpler coding scheme also leads to the possibility of formulating an otherwise non-concave optimization problem as a concave one. Using the perfect channel state information available at the transmitters to adapt the powers, we demonstrate gains over the achievable rates for existing cooperative systems.     

Pilot symbol aided coherent decorrelating detector for up-link CDMAmobile radio communication

A new decorrelating arrangement for asynchronous up-link direct sequence code division multiple access communication, which employs coherent detection with pilot symbol aided channel estimation, is proposed. The proposed coherent scheme improves the bit error rate (BER) and exhibits no error floor compared to the previous noncoherent schemes. The BER performance for BPSK is obtained by simulations over a frequency-nonselective Rayleigh fading channel     

Adaptive receiver structures for asynchronous CDMA systems

Adaptive linear and decision feedback receiver structures for coherent demodulation in asynchronous code division multiple access (CDMA) systems are considered. It is assumed that the adaptive receiver has no knowledge of the signature waveforms and timing of other users. The receiver is trained by a known training sequence prior to data transmission and continuously adjusted by an adaptive algorithm during data transmission. The proposed linear receiver is as simple as a standard single-user detector receiver consisting of a matched filter with constant coefficients, but achieves essential advantages with respect to timing recovery, multiple access interference elimination, near/far effect, narrowband and frequency-selective fading interference suppression, and user privacy. An adaptive centralized decision feedback receiver has the same advantages of the linear receiver but, in addition, achieves a further improvement in multiple access interference cancellation at the expense of higher complexity. The proposed receiver structures are tested by simulation over a channel with multipath propagation, multiple access interference, narrowband interference, and additive white Gaussian noise     

Information theoretic considerations for cellular mobile radio

We present some information-theoretic considerations used to determine upper bounds on the information rates that can be reliably transmitted over a two-ray propagation path mobile radio channel model, operating in a time division multiplex access (TDMA) regime, under given decoding delay constraints. The sense in which reliability is measured is addressed, and in the interesting eases where the decoding delay constraint plays a significant role, the maximal achievable rate (capacity), is specified in terms of capacity versus outage. In this case, no coding capacity in the strict Shannon sense exists. Simple schemes for time and space diversity are examined, and their potential benefits are illuminated from an information-theoretic stand point. In our presentation, we chose to specialize to the TDMA protocol for the sake of clarity and convenience. Our main arguments and results extend directly to certain variants of other multiple access protocols such as code division multiple access (CDMA) and frequency division multiple access (FDMA), provided that no fast feedback from the receiver to the transmitter is available     

Throughput of unslotted direct-sequence spread-spectrummultiple-access channels with block FEC coding

An analysis of unslotted random-access direct-sequence spread-spectrum multiple-access (DS/SSMA) channels with block forward error correction (FEC) coding is presented. Extending a methodology that was introduced in an earlier paper on unslotted packet code-division multiple access (CDMA) without coding, a procedure for calculating the error probability of an L-bit packet in the variable message length, FEC-coded, DS/SSMA environment is described. This procedure is then used in conjunction with appropriate flow equilibrium traffic models to compute channel throughput. Using BCH block coding as an example, the analytical model is exercised to obtain throughput versus channel traffic curves over a range of code rates, leading to an assessment of maximum achievable throughput and the associated optimum FEC code rate. The results show that the use of block FEC coding provides a significant improvement in the bandwidth-normalized channel throughput (utilization), approaching values competitive with those for comparable narrowband ALOHA channels     

Achievable QoS in an interference/resource limited shared wirelesschannel

In this work, the region of achievable quality-of-service (QoS) is precisely described for a system of real-time heterogeneous variable bit rate (VBR) sources competing for slots (packet transmission times) of a time division multiple access (TDMA) frame. The QoS for each application is defined in terms of a maximum tolerable packet-dropping probability. Packets may be dropped due to delay violations and channel induced errors. The region of achievable QoS is precisely described for an interference/resource limited network by considering the underlying TDMA-multiple access control (TDMA-MAC) structure and the physical channel. A simple QoS-sensitive error-control protocol that combats the effects of the wireless channel while satisfying the real-time requirements is proposed and its impact on the region of achievable QoS is evaluated. The results presented here clearly illustrate the negative impact of a poor channel and the positive impact of the employed error-control protocol on the achievable QoS. The region of achievable QoS vectors is central to the call admission problem, and in this work, it is used to identify a class of scheduling policies capable of delivering any achievable performance     

Wideband DS-CDMA for next-generation mobile communications systems

Wideband wireless access based on direct sequence code division multiple access aimed at third-generation mobile communications systems is reviewed. W-CDMA is designed to flexibly offer wideband services which cannot be provided by present cellular systems, with various data rates as high as 2 Mb/s. The important concept of W-CDMA is the introduction of intercell asynchronous operation and the pilot channel associated with individual data channels. Intercell asynchronous operation facilitates continuous system deployment from outdoors to indoors. Other technical features of W-CDMA include fast cell search under intercell asynchronous operation, fast transmit power control, coherent spreading code tracking, a coherent RAKE receiver, orthogonal multispreading factor forward link, and variable-rate transmission with blind rate detection. The introduction of the data-channel-associated pilot channel allows W-CDMA to support interference cancellation and adaptive antenna array techniques that can significantly increase the link capacity and coverage. This article presents the radio link performance evaluated by computer simulation. Field experiment radio link performance results are also presented     

Design and analysis of three-dimensional OCDMA code families

A new code design algorithm for application in three-dimensional (3D) optical code division multiple access (OCDMA) for asynchronous optical fiber communication is proposed. 3D refers to space-wavelength-time codes. The performance analysis of the proposed algorithm in 3D multiple pulses per plane (MPP) codes is shown. This design ensures a maximum cross-correlation of ‘1’ between any two codes. The performance metrics that have been investigated are the bit error rate due to multiple access interference (MAI) for different values of the number of simultaneous users and, cardinality for different values of temporal length.     

On the throughput, capacity, and stability regions of random multiple access

This paper studies finite-terminal random multiple access over the standard multipacket reception (MPR) channel. We characterize the relations among the throughput region of random multiple access, the capacity region of multiple access without code synchronization, and the stability region of ALOHA protocol. In the first part of the paper, we show that if the MPR channel is standard, the throughput region of random multiple access is coordinate convex. We then study the information capacity region of multiple access without code synchronization and feedback. Inner and outer bounds to the capacity region are derived. We show that both the inner and the outer bounds converge asymptotically to the throughput region. In the second part of the paper, we study the stability region of finite-terminal ALOHA multiple access. For a class of packet arrival distributions, we demonstrate that the stationary distribution of the queues possesses positive and strong positive correlation properties, which consequently yield an outer bound to the stability region. We also show the major challenge in obtaining the closure of the stability region is due to the lack of sensitivity analysis results with respect to the transmission probabilities. Particularly, if a conjectured "sensitivity monotonicity" property held for the stationary distribution of the queues, then equivalence between the closure of the stability region and the throughput region follows as a direct consequence, irrespective of the packet arrival distributions.     

Optimum rate Reed-Solomon codes for frequency-hoppedspread-spectrum multiple-access communication systems

The authors consider a multiple-access frequency-hopped spread-spectrum communication system with Reed-Solomon codes. The performance measures of interest are an achievable region and the channel throughput. The achievable rate region is the set of all pairs of code rate and number of users for which communication is possible with error probability below a fixed value. The throughput measures the expected number of successful codeword transmissions per unit bandwidth. Two models of interference are considered. For these two models, the authors determine the optimal number of users for a given bandwidth and the optimal rate Reed-Solomon code that maximize the throughput. They also determine the achievable region for these models     

Performance of UWB SSMA using orthogonal PPM-TH over dense multipath channels

In this work we study ultra wideband (UWB) communications over dense multipath channels using orthogonal pulse position modulation (PPM) for data modulation and time-hopping (TH) for code modulation. We consider the effects of the multiple access interference (MUI) in asynchronous spread spectrum multiple access (SSMA) based on random TH codes. We use a realistic multipath channel to analyze the effects of the transmission rate in the number of users for different bit error rate (BER) values.     

Some families of zero- error block codes for the two-user binary adder channel with feedback

Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two families of zero-error block codes are given for the case in which only one of the two senders receives feedback about the channel output. In the first of these families, the uninformed sender transmits at a rate of nearly one bit per symbol and the informed sender transmits slightly less that1/2bit per symbol. The second family is designed for the case in which the informed sender sends at or near one bit per symbol and the uninformed one sends nearly1/2bit per symbol. A family of zero-error codes is introduced, based on the Fibonacci recursion; these codes are readily implemented by means of a simple square-dividing strategy. The Fibonacci codes achieveR_{1}=R_{2}=log_{2} [(1 + sqrt{5})/2]in the limit of large block length. Time-sharing between members of these three code families is used to obtain an achievable rate region, or inner bound, to the zero-error capacity region for block coding. For the case in which the feedback is available to both senders, a variant of the Fibonacci difference equation is used to generate zero-error block codes with slightly higher asymptotic rateR_{1}=R_{2}=0.717.