PERFORMANCE ANALYSIS OF DIFFERENT SCHEMES FOR TRANSMISSION OF WATERMARKED MEDICAL IMAGES OVER FADING CHANNELS

ABSTRACT Performance Analysis of Different Schemes for Transmission of Watermarked Medical images over Fading Channels Praveen Kumar Korrai In this thesis, we investigate different types of robust schemes for transmission of medical images with concealed patient information as a watermark. In these schemes, spatial domain digital watermarking technique is adapted to embed the patient information as a watermark into the lower order bits of the medical images to reduce the storage and transmission overheads. The watermark, which comprises text data, is encrypted to prevent unauthorized access of data. To enhance the robustness of the embedded information, the encrypted watermark is coded by concatenation of Reed Solomon (RS) and low density parity check (LDPC) codes. A robust scheme for transmission of watermarked images over impulsive noisy wireless channels is first proposed and its performance analyzed. In this scheme, the bursty wireless channel is simulated by adding impulse noise to the watermark embedded image. Furthermore, turbo channel coding is used to correct the transmission errors over impulsive noisy wireless channels. However, single input single output (SISO) channel capacity is not enough to provide modern wireless services such as data and multimedia messaging services. Further, it is not reliable due to multipath fading. To overcome these problems, a multiple-input multiple-output (MIMO) transmission scheme in which multiple antennas are used at both the transmitter and the receiver has emerged as one of the most significant technical breakthroughs in modern wireless communications. MIMO can improve the channel capacity and provide diversity gain. Hence, a scheme with a MIMO channel is proposed for the transmission of watermarked medical images over Rayleigh flat fading channels and its performance analyzed using MIMO maximum likelihood detector at the receiver. We present another scheme, namely, MIMO space frequency block coded OFDM (MIMO SFBC OFDM) in this thesis for transmission of watermarked medical images over Rayleigh fading channels to mitigate the detrimental effects due to frequency selective fading. The performance of this MIMO SFBC OFDM scheme is analyzed and compared with that of SISO-OFDM using minimum mean square error V-BLAST- based detection at the receiver. The efficacy of the different proposed schemes is illustrated through implementation results on watermarked medical images

Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols

In this paper, we describe direct-sequence code-division multiple-access (DS-CDMA) systems with quadriphase-shift keying in which channel estimation, coherent demodulation, and decoding are iteratively performed without the use of any training or pilot symbols. An expectation-maximization channel-estimation algorithm for the fading amplitude, phase, and the interference power spectral density (PSD) due to the combined interference and thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate codes. After initial estimates of the fading amplitude, phase, and interference PSD are obtained from the received symbols, subsequent values of these parameters are iteratively updated by using the soft feedback from the channel decoder. The updated estimates are combined with the received symbols and iteratively passed to the decoder. The elimination of pilot symbols simplifies the system design and allows either an enhanced information throughput, an improved bit error rate, or greater spectral efficiency. The interference-PSD estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

An application of the chase algorithm to multiuser detection

With various added services in future wireless communication systems, the demand for fast and highly reliable data transmissions is continuously increasing. Multiple access interference (MAI) in direct-sequence code division multiple access (DS-CDMA) and constrained capacity in single-input single-output (SISO) are the major obstacles to achieve this purpose. For overcoming these limitations, the use of multiuser detection (MUD) and multiple-input multiple-output (MIMO) is necessary. In the area of error control coding, the Chase algorithm, which takes advantage of the different reliabilities of the received symbols and focuses on correcting the error in the weakest symbols, can achieve a near maximum-likelihood (ML) performance and with significant complexity reduction. In this thesis, we discuss the application of the Chase algorithm in multiuser detectors for the SISO-CDMA and MIMO-CDMA systems. In the SISO-CDMA systems, we develop a parallel interference cancellation (PIC) scheme using the Chase algorithm after the matched filters (MFs). This scheme is called Chase-PIC. Instead of optimizing the weight of each user as most of PIC detectors do, this detector provides a new optimizing approach right after the MFs. Based on the analysis of the complexity and performance over the flat and frequency-selective Rayleigh fading channels, we also propose a new Chase based multistage PIC that uses the normalized least-mean-square (NLMS) algorithm at the earlier stages and the Chase algorithm at the later stages. This proposed scheme can achieve a better performance than NLMS-PIC but with less complexity. In the MIMO-CDMA systems, we proposed a new Chase based multiuser detector over the flat Rayleigh fading channels. This detector focuses on correcting the error of the weakest detected symbol in the layered space-time multiuser detector (LAST-MUD). Compared to another Chase based detector, B-Chase, the proposed scheme has less complexity but with the tendency of achieving better performance at high signal-to-noise ratio (SNR)

Dispensing with channel estimation: differentially modulated cooperative wireless communications

As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

Successive interference cancellation schemes for time-reversal space-time block codes

In this paper, we propose two simple signal detectors that are based on successive interference cancellation (SIC) for time-reversal space-time block codes to combat intersymbol interference in frequency-selective fading environments. The main idea is to treat undetected symbols and noise together as Gaussian noise with matching mean and variance and use the already-detected symbols to help current signal recovery. The first scheme is a simple SIC signal detector whose ordering is based on the channel powers. The second proposed SIC scheme, which is denoted parallel arbitrated SIC (PA-SIC), is a structure that concatenates in parallel a certain number of SIC detectors with different ordering sequences and then combines the soft output of each individual SIC to achieve performance gains. For the proposed PA-SIC, we describe the optimal ordering algorithm as a combinatorial problem and present a low-complexity ordering technique for signal decoding. Simulations show that the new schemes can provide a performance that is very close to maximum-likelihood sequence estimation (MLSE) decoding under time-invariant conditions. Results for frequency-selective and doubly selective fading channels show that the proposed schemes significantly outperform the conventional minimum mean square error-(MMSE) like receiver and that the new PA-SIC performs much better than the proposed conventional SIC and is not far in performance from the MLSE. The computational complexity of the SIC algorithms is only linear with the number of transmit antennas and transmission rates, which is very close to the MMSE and much lower than the MLSE. The PA-SIC also has a complexity that is linear with the number of SIC components that are in parallel, and the optimum tradeoff between performance and complexity can be easily determined according to the number of SIC detectors

On Optimal Turbo Decoding of Wideband MIMO-OFDM Systems Under Imperfect Channel State Information

We consider the decoding of bit interleaved coded modulation (BICM) applied to both multiband and MIMO OFDM systems for typical scenarios where only a noisy (possibly very bad) estimate of the channel is provided by sending a limited number of pilot symbols. First, by using a Bayesian framework involving the channel a posteriori density, we adopt a practical decoding metric that is robust to the presence of channel estimation errors. Then this metric is used in the demapping part of BICM multiband and MIMO OFDM receivers. We also compare our results with the performance of a mismatched decoder that replaces the channel by its estimate in the decoding metric. Numerical results over both realistic UWB and theoretical Rayleigh fading channels show that the proposed method provides significant gain in terms of bit error rate compared to the classical mismatched detector, without introducing any additional complexity