Interference is usually viewed as an obstacle for any communication network. In this paper, performance of an amplify-and-forward (AF) relay network is analyzed when interference is present at the relay. It is assumed that no obstacles are located between interferes and the relay, thus line-of-sight (LOS) interference is possible. We consider the general case of distributed interferers with arbitrary power. To evaluate the performance, we derive the exact closed form expression for outage probability and a tight bound to the average symbol error rate (SER). In order to understand the depth of the system performance, we analyze the system in high signal to noise ratio (SNR) and derive simple asymptotic results for outage probability and average SER. Monte Carlo simulations are performed to verify the analytical results.
With the finalization of new series of IEEE 802.11 and ETSI HIPERLAN standards, it becomes very important and interesting to study the methods to integrate geolocation functionalities into the next generation wireless LANs. We investigate geolocation methods and system architectures using OFDM signals in HIPERLAN/2 wireless LANs. We propose a novel method to measure geolocation metrics by exploiting the HIPERLAN/2 MAC frame structure. Computer simulation results are presented to show the performance of the geolocation systems using OFDM signals.
In this paper, candidate coding schemes are investigated for the new radio access technology (RAT) of the fifth generation (5G) mobile communication standard. Enhanced mobile broadband(eMBB) scenario of the 5G standard corresponding the activities in the third generation partnership project (3GPP) is considered. The coding schemes are evaluated in terms of block error rate (BLER), bit error rate (BER), computational complexity, and flexibility. These parameters comprise a suitable set to assess the performance of different services and applications. Turbo, low density parity check (LDPC), and polar codes are considered as the candidate schemes. These are investigated in terms of obtaining suitable rates, block lengths by proper design for a fair comparison. The simulations have been carried out in order to obtain BLER / BER performance for various code rates and block lengths, in additive white Gaussian noise (AWGN) channel. It can be seen from the simulations that although polar codes perform well at short block lengths, LDPC has a relatively good performance at all the block lengths and code rates. In addition, complexity of the LDPC codes is relatively low.
We consider the problem of multicasting from a single source to multiple destinations over an erasure channel model. We are interested in energy-efficient communication. Our performance metric is the number of bits that the source delivers successfully to all destinations per joule of the overall energy spent. We compare the performance of Random Linear Network Coding (RLNC) and Automatic Repeat reQuest (ARQ) with respect to the above performance metric in the presence and absence of Forward Error Correction (FEC). Our numerical results illustrate that RLNC is more energy-efficient than ARQ when the links are highly unreliable. However, as the reliability protection provided to the links through FEC increases the energy-efficiency performance of RLNC deteriorates and it becomes suboptimal compared to ARQ methods.
Polar codes have been receiving increased attention for application in beyond 5G networks. They offer low-complexity decoding algorithm and can achieve symmetric channel capacity. However, the majority of research works have focused on the codes constructed by the binary kernel ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2 \times 2$ </tex-math></inline-formula> polarization matrix) which bounds the code length to an integer power of 2. Multi-kernel polar codes have been proposed as a method that allows the construction of polar codes with sizes different from powers of 2 by mixing multiple kernels of different dimensions. A hardware implementation based on the successive cancellation (SC) algorithm found in the literature shows that it suffers from a long decoding latency. In this paper, we design and implement a multi-kernel decoder based on the fast-simplified SC (fast-SSC) algorithm to decrease the decoding latency. It can decode any code constructed by binary and ternary ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$3 \times 3$ </tex-math></inline-formula> ) kernels featuring flexible code length, code rate, and kernel sequence. FPGA implementation results reveal that a polar code of length <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N = 1536$ </tex-math></inline-formula> , rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {R} = 1/2$ </tex-math></inline-formula> with Processing Element ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$P_{e}$ </tex-math></inline-formula> ) value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$P_{e} = 240$ </tex-math></inline-formula> , gains 84.6% lower latency compared to the original algorithm. Also, the architecture supports polar codes constructed by purely-binary and purely-ternary kernels. A polar code of length <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N = 1024$ </tex-math></inline-formula> , rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {R} = 1/2$ </tex-math></inline-formula> , and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$P_{e} = 120$ </tex-math></inline-formula> achieves an information throughput of 432 Mbps.
This paper examines the capacity of a CDMA system which supports multiple data rates and traffic types. The system uses a version of the slotted ALOHA protocol. An adaptive linear, minimum mean-square error (LMMSE) receiver implemented by a modified least-mean squares (LMS) algorithm is used in the system. The modifications to the adaptive LMMSE receiver overcome the well-known limitations of slow convergence and allow it to operate efficiently over fast fading channels. The modifications to the basic LMS algorithm are outlined and the performance of a system with multiple traffic types is investigated. Traffic types are distinguished by data rates and bit error-rate requirements. The performance of a single cell system with various number of users of each traffic type is investigated. The performance of the total system is calculated from the maximum number of users of each traffic type which the system can support and the total system throughput. The effect of limited power control of the user's signals is also investigated.
The effect of frequency offset on the performance of asynchronous MC-CDMA systems in a correlated Rayleigh fading channel is investigated. Numerical results show that MC-CDMA systems can allow a frequency offset of up to 10 percent of the frequency spacing between adjacent subcarriers without significant performance loss. We also find that maximal ratio combining (MRC) performs better than equal gain combining (EGC) for asynchronous MC-CDMA systems with frequency errors.