Abstract
This article presents an original analytical expression for an upper bound on the optimum joint decoding capacity of Wyner circular Gaussian cellular multiple access channel (C-GCMAC) for uniformly distributed mobile terminals (MTs). This upper bound is referred to as Hadamard upper bound (HUB) and is a novel application of the Hadamard inequality established by exploiting the Hadamard operation between the channel fading matrix G and the channel path gain matrix Ω. This article demonstrates that the actual capacity converges to the theoretical upper bound under the constraints like low signal-to-noise ratios and limiting channel path gain among the MTs and the respective base station of interest. In order to determine the usefulness of the HUB, the behavior of the theoretical upper bound is critically observed specially when the inter-cell and the intra-cell time sharing schemes are employed. In this context, we derive an analytical form of HUB by employing an approximation approach based on the estimation of probability density function of trace of Hadamard product of two matrices, i.e., G and Ω. A closed form of expression has been derived to capture the effect of the MT distribution on the optimum joint decoding capacity of C-GCMAC. This article demonstrates that the analytical HUB based on the proposed approximation approach converges to the theoretical upper bound results in the medium to high signal to noise ratio regime and shows a reasonably tighter bound on optimum joint decoding capacity of Wyner GCMAC.
Highlights
The ever growing demand for communication services has necessitated the development of wireless systems with high bandwidth and power efficiency [1,2]
The analytical framework of this article is inspired by analytically tractable model for multicell processing (MCP) as proposed in [7], where Wyner incorporated the fundamental aspects of cellular network into the framework of the well known Gaussian multiple access channel (MAC) to form a Gaussian cellular MAC (GCMAC)
Numerical examples and discussions we present Monte Carlo simulation results in order to validate the accuracy of the analytical analysis based on approximation approach for upper bound on optimum joint decoding capacity of circular GCMAC (CGCMAC) with Uniformly distributed mobile terminals (MTs)
Summary
The ever growing demand for communication services has necessitated the development of wireless systems with high bandwidth and power efficiency [1,2]. We derive a non-asymptotic analytical upper bound on the optimum joint decoding capacity of Wyner C-GCMAC by exploiting the Hadamard inequality for finite cellular network-MIMO setup. A novel application of the Hadamard inequality is employed to derive the theoretical upper bound on optimum joint decoding capacity This is followed by the several simulation results for a single-user and the multi-user scenarios that validate the analysis and illustrate the effect of various time sharing schemes on the performance of the optimum joint decoding capacity for the system under consideration. The following standard matrix function are defined as follows: (·)T denotes the non-Hermitian transpose; (·)H denotes the Hermitian transpose; tr (·) denotes the trace of a square matrix; det (·) and | · | denote the determinant of a square matrix; ||A|| denotes the norm of the matrix A; E[·] denotes the expectation operator and (∘) denotes the Hadamard operation (element wise multiplication) between the two matrices
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.