Low Complexity V-BLAST MIMO-OFDM Detector by Successive Iterations Reduction

V-BLAST detection method suffers large computational complexity due to its successive detection of symbols. In this paper, we propose a modified V-BLAST algorithm to decrease the computational complexity by reducing the number of detection iterations required in MIMO communication systems. We begin by showing the existence of a maximum number of iterations, beyond which, no significant improvement is obtained. We establish a criterion for the number of maximum effective iterations. We propose a modified algorithm that uses the measured SNR to dynamically set the number of iterations to achieve an acceptable bit-error rate. Then, we replace the feedback algorithm with an approximate linear function to reduce the complexity. Simulations show that significant reduction in computational complexity is achieved compared to the ordinary V-BLAST, while maintaining a good BER performance.Comment: 6 pages, 7 figures, 2 tables. The final publication is available at www.aece.r

Visualization on colour based flow vector of thermal image for movement detection during interactive session

Recently thermal imaging is exploited in applications such as motion and face detection. It has drawn attention many researchers to build such technology to improve lifestyle. This work proposed a technique to detect and identify a motion in sequence images for the application in security monitoring system or outdoor surveillance. Conventional system might cause false information with the present of shadow. Thus, methods employed in this work are Canny edge detector method, Lucas Kanade and Horn Shunck algorithms, to overcome the major problem when using thresholding method, which is only intensity or pixel magnitude is considered instead of relationships between the pixels. The results obtained could be observed in flow vector parameter and the segmentation colour based image for the time frame from 1 to 10 seconds. The visualization of both the parameters clarified the movement and changes of pixel intensity between two frames by the supportive colour segmentation, either in smooth or rough motion. Thus, this technique may contribute to others application such as biometrics, military system, and surveillance machine

Techniques to Improve the Efficiency of Data Transmission in Cable Networks

The cable television (CATV) networks, since their introduction in the late 1940s, have now become a crucial part of the broadcasting industry. To keep up with growing demands from the subscribers, cable networks nowadays not only provide television programs but also deliver two-way interactive services such as telephone, high-speed Internet and social TV features. A new standard for CATV networks is released every five to six years to satisfy the growing demands from the mass market. From this perspective, this thesis is concerned with three main aspects for the continuing development of cable networks: (i) efficient implementations of backward-compatibility functions from the old standard, (ii) addressing and providing solutions for technically-challenging issues in the current standard and, (iii) looking for prospective features that can be implemented in the future standard. Since 1997, five different versions of the digital CATV standard had been released in North America. A new standard often contains major improvements over the previous one. The latest version of the standard, namely DOCSIS 3.1 (released in late 2013), is packed with state-of-the-art technologies and allows approximately ten times the amount of traffic as compared to the previous standard, DOCSIS 3.0 (released in 2008). Backward-compatibility is a must-have function for cable networks. In particular, to facilitate the system migration from older standards to a newer one, the backward compatible functions in the old standards must remain in the newer-standard products. More importantly, to keep the implementation cost low, the inherited backward compatible functions must be redesigned by taking advantage of the latest technology and algorithms. To improve the backward-compatibility functions, the first contribution of the thesis focuses on redesigning the pulse shaping filter by exploiting infinite impulse response (IIR) filter structures as an alternative to the conventional finite impulse response (FIR) structures. Comprehensive comparisons show that more economical filters with better performance can be obtained by the proposed design algorithm, which considers a hybrid parameterization of the filter's transfer function in combination with a constraint on the pole radius to be less than 1. The second contribution of the thesis is a new fractional timing estimation algorithm based on peak detection by log-domain interpolation. When compared with the commonly-used timing detection method, which is based on parabolic interpolation, the proposed algorithm yields more accurate estimation with a comparable implementation cost. The third contribution of the thesis is a technique to estimate the multipath channel for DOCSIS 3.1 cable networks. DOCSIS 3.1 is markedly different from prior generations of CATV networks in that OFDM/OFDMA is employed to create a spectrally-efficient signal. In order to effectively demodulate such a signal, it is necessary to employ a demodulation circuit which involves estimation and tracking of the multipath channel. The estimation and tracking must be highly accurate because extremely dense constellations such as 4096-QAM and possibly 16384-QAM can be used in DOCSIS 3.1. The conventional OFDM channel estimators available in the literature either do not perform satisfactorily or are not suitable for the DOCSIS 3.1 channel. The novel channel estimation technique proposed in this thesis iteratively searches for parameters of the channel paths. The proposed technique not only substantially enhances the channel estimation accuracy, but also can, at no cost, accurately identify the delay of each echo in the system. The echo delay information is valuable for proactive maintenance of the network. The fourth contribution of this thesis is a novel scheme that allows OFDM transmission without the use of a cyclic prefix (CP). The structure of OFDM in the current DOCSIS 3.1 does not achieve the maximum throughput if the channel has multipath components. The multipath channel causes inter-symbol-interference (ISI), which is commonly mitigated by employing CP. The CP acts as a guard interval that, while successfully protecting the signal from ISI, reduces the transmission throughput. The problem becomes more severe for downstream direction, where the throughput of the entire system is determined by the user with the worst channel. To solve the problem, this thesis proposes major alterations to the current DOCSIS 3.1 OFDM/OFDMA structure. The alterations involve using a pair of Nyquist filters at the transceivers and an efficient time-domain equalizer (TEQ) at the receiver to reduce ISI down to a negligible level without the need of CP. Simulation results demonstrate that, by incorporating the proposed alterations to the DOCSIS 3.1 down-link channel, the system can achieve the maximum throughput over a wide range of multipath channel conditions

Quantifying Potential Energy Efficiency Gain in Green Cellular Wireless Networks

Conventional cellular wireless networks were designed with the purpose of providing high throughput for the user and high capacity for the service provider, without any provisions of energy efficiency. As a result, these networks have an enormous Carbon footprint. In this paper, we describe the sources of the inefficiencies in such networks. First we present results of the studies on how much Carbon footprint such networks generate. We also discuss how much more mobile traffic is expected to increase so that this Carbon footprint will even increase tremendously more. We then discuss specific sources of inefficiency and potential sources of improvement at the physical layer as well as at higher layers of the communication protocol hierarchy. In particular, considering that most of the energy inefficiency in cellular wireless networks is at the base stations, we discuss multi-tier networks and point to the potential of exploiting mobility patterns in order to use base station energy judiciously. We then investigate potential methods to reduce this inefficiency and quantify their individual contributions. By a consideration of the combination of all potential gains, we conclude that an improvement in energy consumption in cellular wireless networks by two orders of magnitude, or even more, is possible.Comment: arXiv admin note: text overlap with arXiv:1210.843

Timing Recovery for DOCSIS 3.1 Upstream OFDMA Signals

Data-Over-Cable Service Interface Specification (DOCSIS) is a global standard for cable communication systems. Before version 3.1, the standard has always specified single-carrier (SC) quadrature-amplitude modulation (QAM) as the modulation scheme. Given that the multi-carrier orthogonal frequency-division multiplexing (OFDM) technique has been increasingly popular and adopted in many wired/wireless communications systems, the newest cable communication standard, DOCSIS 3.1, also introduces OFDM as a major upgrade to improve transmission efficiency. In any digital communication systems, timing synchronization is required to determine and compensate for the timing offset from the transmitter to the receiver. This task is especially crucial and challenging in an OFDM system due to its very high sensitivity to synchronization errors. Although there have been many studies on the topic of OFDM timing synchronization, none of the existing methods are not directly applicable to DOCSIS 3.1 systems. Therefore, the main objective of this research is to develop effective and affordable timing synchronization algorithms for the DOCSIS 3.1 upstream signal. Specifically, three timing synchronization algorithms are proposed to comply and take advantage of the structure of the ranging signal (i.e., the signal used for synchronization purpose) specified in DOCSIS 3.1 standard. The proposed methods are evaluated under a realistic multipath uplink cable channel using computer simulation. The first algorithm makes use of the repetitive pattern of the symbol pairs in the ranging signal. The locations of the symbol pairs are determined by calculating a correlation metric and identifying its maximum value. The second and third algorithms are developed so that they exploit the mirrored symmetry of the binary phase-shift keying (BPSK)-modulated time-domain samples, corresponding to the first non-zero symbol in the ranging signal, and look for the exact location of the symmetry point. The first algorithm, with very low hardware complexity, provides reasonable performance under normal traffic and channel conditions. However its performance under a severe channel condition and heavy traffic is not satisfactory. The second and third algorithms provide much more accurate timing estimation results, even under the severe channel condition and heavy traffic flow. Since the second algorithm requires an enormous increase in hardware complexity, a few options are proposed to reduce the hardware complexity but it is still much higher than the complexity of the first algorithm. Applying the same complexity reduction techniques it is demonstrated that the third algorithm has similar hardware complexity to the first algorithm, while its timing estimation performance remains excellent

Channel Sounding for the Masses: Low Complexity GNU 802.11b Channel Impulse Response Estimation

New techniques in cross-layer wireless networks are building demand for ubiquitous channel sounding, that is, the capability to measure channel impulse response (CIR) with any standard wireless network and node. Towards that goal, we present a software-defined IEEE 802.11b receiver and CIR estimation system with little additional computational complexity compared to 802.11b reception alone. The system implementation, using the universal software radio peripheral (USRP) and GNU Radio, is described and compared to previous work. By overcoming computational limitations and performing direct-sequence spread-spectrum (DS-SS) matched filtering on the USRP, we enable high-quality yet inexpensive CIR estimation. We validate the channel sounder and present a drive test campaign which measures hundreds of channels between WiFi access points and an in-vehicle receiver in urban and suburban areas

Power Line Communication (PLC) Impulsive Noise Mitigation: A Review

Power Line Communication (PLC) is a technology which transforms the power line into pathways for the conveyance of broadband data. It has the advantage for it can avoid new installation since the current installation used for electrical power can also be used for data transmission. However, this power line channel presents a harsh environment for data transmission owing to the challenges of impulsive noise, high attenuation, selective fading and etc. Impulsive noise poses a severe challenge as its Power Spectral Density (PSD) is between 10–15dB above background noise. For good performance of the PLC system, this noise must be mitigated.  This paper presents a review of the techniques for the mitigation of impulsive noise in PLC which is classified into four categories, namely time domain, time/frequency domain, error correction code and other techniques. Time domain technique is a memoryless nonlinear technique where the signal's amplitude only changes according to a specified threshold without changing the phase.  Mitigation of impulsive noise is carried out on the received time domain signal before the demodulation FFT operation of the OFDM. Time/Frequency technique is a method of mitigating impulsive noise on the received signal at both before FFT demodulation and after FFT demodulation of the OFDM system. Error correction code technique is the application of forward error correction code by adding redundancy bits to the useful data bits for detection and possibly correction of error occurring during transmission.  Identifying the best performing technique will enhance the deployment of the technique while exploring the PLC channel capacity enhancement in the future. The best performing scheme in each of the category were selected and their BER vs SNR curves were compared with respect to the impulsive noise + awgn curve. Amongst all of these techniques, the error correction code technique had a performance that presents almost an outright elimination of impulsive noise in power line channel. Keywords: Impulsive noise, time domain, time/frequency domain, error correction code, sparse Bayesian learning, recursive detection and modified PLC-DMT

Resource allocation technique for powerline network using a modified shuffled frog-leaping algorithm

Resource allocation (RA) techniques should be made efficient and optimized in order to enhance the QoS (power & bit, capacity, scalability) of high-speed networking data applications. This research attempts to further increase the efficiency towards near-optimal performance. RA’s problem involves assignment of subcarriers, power and bit amounts for each user efficiently. Several studies conducted by the Federal Communication Commission have proven that conventional RA approaches are becoming insufficient for rapid demand in networking resulted in spectrum underutilization, low capacity and convergence, also low performance of bit error rate, delay of channel feedback, weak scalability as well as computational complexity make real-time solutions intractable. Mainly due to sophisticated, restrictive constraints, multi-objectives, unfairness, channel noise, also unrealistic when assume perfect channel state is available. The main goal of this work is to develop a conceptual framework and mathematical model for resource allocation using Shuffled Frog-Leap Algorithm (SFLA). Thus, a modified SFLA is introduced and integrated in Orthogonal Frequency Division Multiplexing (OFDM) system. Then SFLA generated random population of solutions (power, bit), the fitness of each solution is calculated and improved for each subcarrier and user. The solution is numerically validated and verified by simulation-based powerline channel. The system performance was compared to similar research works in terms of the system’s capacity, scalability, allocated rate/power, and convergence. The resources allocated are constantly optimized and the capacity obtained is constantly higher as compared to Root-finding, Linear, and Hybrid evolutionary algorithms. The proposed algorithm managed to offer fastest convergence given that the number of iterations required to get to the 0.001% error of the global optimum is 75 compared to 92 in the conventional techniques. Finally, joint allocation models for selection of optima resource values are introduced; adaptive power and bit allocators in OFDM system-based Powerline and using modified SFLA-based TLBO and PSO are propose