Sharif Digital Repository

In this paper, we explore some of the fundamentals of synchronous Code Division Multiple Access (CDMA) as applied to wireless and optical communication systems under very general settings (of any size) for the user symbols and the signature matrix entries. The channel is modeled by real/complex additive noise of arbitrary distribution. Two problems are addressed. The first problem concerns whether uniquely detectable overloaded matrices exist in the absence of additive noise under these general settings, and if so, whether there are any practical optimum detection algorithms. The second one is about the bounds for the sum channel capacity when user data and signature matrices employ any real... 

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain, and the noise distribution. The derivation methods for the noiseless and the noisy channels are different but when the noise variance goes to zero, the noisy channel bound approaches the noiseless case. The behavior of the lower bound shows that for small noise power, the number of users can be much more than the spreading gain without any... 

In this paper, we introduce a new class of codes for overloaded synchronous wireless and optical code-division multiple-access (CDMA) systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for the maximum number of users for a given number of chips is derived. Also, lower and upper bounds for the sum channel capacity of a binary overloaded CDMA are derived that can predict the existence of such overloaded codes. We also propose a simplified maximum likelihood method for decoding these types of... 

In this paper, enhanced spatial and temporal shifts in the reflection of Gaussian wave packets from twodimensional photonic crystal waveguides supporting above-the-light-line leaky modes are studied, for the first time to our best knowledge. Particular attention is given to two important special cases, namely, harmonic Gaussian beams and Gaussian-pulse uniform plane waves. Analytical expressions are given for enhanced spatial and temporal shifts when the stationary phase approximation holds and the incident wave excites above-the-light-line leaky modes. The enhanced spatial and temporal shifts of Gaussian wave packets are thereby related to each other via the group velocity of the excited... 

The spherical ensemble is a well-studied determinantal process with a fixed number of points on $2. The points of this process correspond to the generalized eigenvalues of two appropriately chosen random matrices, mapped to the surface of the sphere by stereographic projection. This model can be considered as a spherical analogue for other random matrix models on the unit circle and complex plane such as the circular unitary ensemble or the Ginibre ensemble, and is one of the most natural constructions of a (statistically) rotation invariant point process with repelling property on the sphere. In this paper we study the spherical ensemble and its local repelling property by investigating the... 

A new, fast, and efficient approach based on the differential transfer matrix idea, is proposed for analysis of nonuniform nonlinear distributed feedback structures. The a priori knowledge of the most-likely electromagnetic field distribution within the distributed feedback region is exploited to speculate and factor out the rapidly varying portion of the electromagnetic fields. In this fashion, the transverse electromagnetic fields are transformed into a new set of envelope functions, whereupon the numerical difficulty of solving the nonlinear coupled differential equations is partly imparted to the analytical factorization of the fields. This process renders a new set of well-behaved... 

This paper is devoted to the study of some asymptotic behaviors of Poisson-Voronoi tessellation in the Euclidean space as the space dimension tends to ∞. We consider a family of homogeneous Poisson-Voronoi tessellations with constant intensity λ in Euclidean spaces of dimensions n = 1, 2, 3,... First we use the Blaschke-Pètkantschin formula to prove that the variance of the volume of the typical cell tends to 0 exponentially in dimension. It is also shown that the volume of intersection of the typical cell with the co-centered ball of volume u converges in distribution to the constant λ-1 (1-e-λu). Next we consider the linear contact distribution function of the Poisson-Voronoi tessellation... 

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel (BSC). The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the literature are not proved to be capacity achieving for channels other than Binary Erasure Channel. As opposed to the existing results in the literature, which are based on optimal maximum a posteriori decoders, the proposed approach is based on a different decoder... 

We introduce a refinement of the Ozsváth-Szabó complex associated by Juhósz [Ju1] to a balanced sutured manifold (X,τ). An algebra (Formula Presented)τ is associated to the boundary of a sutured manifold. For a fixed class s of a Spinc structure over the manifold X, which is obtained from (Formula Presented) by filling out the sutures, the Ozsvóth-Szabó chain complex CF(X, τ, s) is then defined as a chain complex with coefficients in (Formula Presented)T and filtered by the relative Spinc classes in Spinc(X, τ). The filtered chain homotopy type of this chain complex is an invariant of (X,τ) and the Spinc class s Є Spinc(Formula Presented). The construction generalizes the construction of...