اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsynchronous CDMA Systems with Random Spreading-Part I: Fundamental Limits
72
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal to interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows even for statistics obtained by under-sampling the received signal. All performance measures are given as a function of the chip waveform and the delay distribution of the users in the large system limit. It turns out that synchronizing users on a chip level impairs performance for all chip waveforms with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off factors. For example, with the pulse shaping demanded in the UMTS standard, user synchronization reduces spectral efficiency up to 12% at 10 dB normalized signal-to-noise ratio. The benefits of asynchronism stem from the finding that the excess bandwidth of chip waveforms actually spans additional dimensions in signal space, if the users are de-synchronized on the chip-level. The analysis of linear MMSE detectors shows that the limiting interference effects can be decoupled both in the user domain and in the frequency domain such that the concept of the effective interference spectral density arises. This generalizes and refines Tse and Hanlys concept of effective interference. In Part II, the analysis is extended to any linear detector that admits a representation as multistage detector and guidelines for the design of low complexity multistage detectors with universal weights are provided.
قيم البحث
اقرأ أيضاً
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In Part I, the fundamental limits of asynchronous CDMA systems are analyzed in terms of spectral efficiency and SINR at the output of the optimum linear detector. The fo
cus of Part II is the design of low-complexity implementations of linear multiuser detectors in systems with many users that admit a multistage representation, e.g. reduced rank multistage Wiener filters, polynomial expansion detectors, weighted linear parallel interference cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay distribution on CDMA with suboptimum linear receiver structures are investigated. Recursive expressions for universal weight design are given. The performance in terms of SINR is derived in the large-system limit and the performance improvement over synchronous systems is quantified. The considerations distinguish between two ways of forming discrete-time statistics: chip-matched filtering and oversampling.
We propose an improvement of the random spreading approach with polar codes for unsourced multiple access. Each user encodes its message by a polar code, and the coded bits are then spread using a random spreading sequence. The proposed approach divi
des the active users into different groups, and employs different power levels for each group in such a way that the average power constraint is satisfied. We formulate and solve an optimization problem to determine the number of groups, and the number of users and power level of each group. Extensive simulations show that the proposed approach outperforms the existing methods, especially when the number of active users is large.
In general coding theory, we often assume that error is observed in transferring or storing encoded symbols, while the process of encoding itself is error-free. Motivated by recent applications of coding theory, in this paper, we consider the case wh
ere the process of encoding is distributed and prone to error. We introduce the problem of distributed encoding, comprising of $Kinmathbb{N}$ isolated source nodes and $Ninmathbb{N}$ encoding nodes. Each source node has one symbol from a finite field and sends it to all encoding nodes. Each encoding node stores an encoded symbol, as a function of the received symbols. However, some of the source nodes are controlled by the adversary and may send different symbols to different encoding nodes. Depending on the number of adversarial nodes, denoted by $betainmathbb{N}$, and the number of symbols that each one generates, denoted by $vinmathbb{N}$, the process of decoding from the encoded symbols could be impossible. Assume that a decoder connects to an arbitrary subset of $t inmathbb{N}$ encoding nodes and wants to decode the symbols of the honest nodes correctly, without necessarily identifying the sets of honest and adversarial nodes. In this paper, we study $t^*inmathbb{N}$, the minimum of $t$, which is a function of $K$, $N$, $beta$, and $v$. We show that when the encoding nodes use linear coding, $t^*_{textrm{linear}}=K+2beta(v-1)$, if $Nge K+2beta(v-1)$, and $t^*_{textrm{linear}}=N$, if $Nle K+2beta(v-1)$. In order to achieve $t^*_{textrm{linear}}$, we use random linear coding and show that in any feasible solution that the decoder finds, the messages of the honest nodes are decoded correctly. For the converse of the fundamental limit, we show that when the adversary behaves in a particular way, it can always confuse the decoder between two feasible solutions that differ in the message of at least one honest node.
In CDMA systems, the received user powers vary due to moving distance of users. Thus, the CDMA receivers consist of two stages. The first stage is the power estimator and the second one is a Multi-User Detector (MUD). Conventional methods for estimat
ing the user powers are suitable for underor fully-loaded cases (when the number of users is less than or equal to the spreading gain). These methods fail to work for overloaded CDMA systems because of high interference among the users. Since the bandwidth is becoming more and more valuable, it is worth considering overloaded CDMA systems. In this paper, an optimum user power estimation for over-loaded CDMA systems with Gaussian inputs is proposed. We also introduce a suboptimum method with lower complexity whose performance is very close to the optimum one. We shall show that the proposed methods work for highly over-loaded systems (up to m(m + 1) =2 users for a system with only m chips). The performance of the proposed methods is demonstrated by simulations. In addition, a class of signature sets is proposed that seems to be optimum from a power estimation point of view. Additionally, an iterative estimation for binary input CDMA systems is proposed which works more accurately than the optimal Gaussian input method.
We consider the coded caching problem with an additional privacy constraint that a user should not get any information about the demands of the other users. We first show that a demand-private scheme for $N$ files and $K$ users can be obtained from a
non-private scheme that serves only a subset of the demands for the $N$ files and $NK$ users problem. We further use this fact to construct a demand-private scheme for $N$ files and $K$ users from a particular known non-private scheme for $N$ files and $NK-K+1$ users. It is then demonstrated that, the memory-rate pair $(M,min {N,K}(1-M/N))$, which is achievable for non-private schemes with uncoded transmissions, is also achievable under demand privacy. We further propose a scheme that improves on these ideas by removing some redundant transmissions. The memory-rate trade-off achieved using our schemes is shown to be within a multiplicative factor of 3 from the optimal when $K < N$ and of 8 when $Nleq K$. Finally, we give the exact memory-rate trade-off for demand-private coded caching problems with $Ngeq K=2$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
