Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Mohammad Reza Zahabi is active.

Publication


Featured researches published by Mohammad Reza Zahabi.


communication systems and networks | 2008

Joint ML time-frequency synchronisation and channel estimation algorithm for MIMO-OFDM systems

Amir Saemi; Vahid Meghdadi; Jean-Pierre Cances; Mohammad Reza Zahabi

The maximum-likelihood (ML) time-frequency synchronisation algorithm combined with channel estimation for multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems in frequency selective fading channels is addressed. In the proposed algorithm, the authors use two steps to maximise an ML metric to obtain first the frequency offset and then timing. A fast Fourier transform algorithm is used to estimate the frequency offset. Using these two estimates, the channel is identified. A simple iterative algorithm is proposed to improve the frequency offset estimation. The performance of the proposed synchronisation approach, in terms of timing failure probability and mean square error of the estimated frequency offset and bit error rate, is compared with others in the literature. Comparison of simulation results with the Cramer-Rao lower bound clearly illustrates the accuracy of the proposed algorithm, which outperforms the state-of-the-art synchroniser devices in the open literature.


personal, indoor and mobile radio communications | 2006

ML Time-Frequency Synchronization for MIMO-OFDM Systems in Unknown Frequency Selective Fading Channels

Amir Saemi; Vahid Meghdadi; Jean-Pierre Cances; Mohammad Reza Zahabi; Jean-Michel Dumas

This paper addresses maximum-likelihood (ME) time-frequency synchronization algorithm joint with channel estimation for MIMO-OFDM systems in frequency selective fading channels. In proposed algorithm, we use two steps to maximize a proposed metric to obtain first frequency offset and then timing. Using these two estimates, the channel is identified. An iterative algorithm is proposed to improve frequency offset estimation. The performance of the proposed synchronization approach, in terms of timing failure probability and mean square error of the estimated frequency offset, was compared with literature. Based on simulation results, the Cramer-Rao lower bound is obtained with a few iterations


Iet Communications | 2008

Iterative (turbo) expectation - maximisation-based time and frequency synchronisation for multiple-input multiple-output-orthogonal frequency-division multiplexing systems

Amir Saemi; Vahid Meghdadi; Jean-Pierre Cances; Mohammad Reza Zahabi

An iterative expectation-maximisation time-frequency synchronisation algorithm joint with channel estimation for multiple-input multiple-output-orthogonal frequency-division multiplexing (OFDM) systems in frequency-selective fading channels is addressed. The receiver iterates between detection and estimation stages. For each iteration, the expectation of ODFM symbols is calculated first by using a posteriori probabilities provided by maximum a posteriori (MAP) decoder, and second, a proposed metric is maximised to obtain both frequency offset and symbol timing. The channel can be identified by means of these estimates. This algorithm can work in transmission mode, and thus, can be used to estimate the residual errors or track the change of the parameters. The performance of the proposed synchronisation approach, in terms of bit-error rate and mean-square error, is shown.


global communications conference | 2007

Mixed Analog and Digital Matched-Filter Design for High Rate WLAN

Mohammad Reza Zahabi; Vahid Meghdadi; Jean-Pierre Cances; Amir Saemi

A mixed-signal programmable filter suitable for high- rate WLAN is addressed in this work. The proposed filter has analog input and analog-sampled outputs. The filter taps are stored in a digital memory and can be changed easily to meet any receiver requirements. The filter structure is based on a bank of digitally controlled transconductors realized by simple CMOS inverters and thus can be integrated efficiently with digital parts. A cosine rolloff filter is designed and investigated by simulation in frequency domains. Comparison with other recent works shows that the proposed structure has a good speed-complexity-consumption trade-off.


personal, indoor and mobile radio communications | 2007

Mixed-Signal Realization of Matched-Filters for High Rate Communication Systems

Mohammad Reza Zahabi; Vahid Meghdadi; Jean-Pierre Cances; Amir Saemi

A mixed-signal programmable filter suitable for high-rate communication systems is addressed in this work. The proposed filter has analog input and analog-sampled outputs. The filter taps are stored in a digital memory and can be changed on the fly which is desirable in many practical applications such as adaptive filtering. The filter structure is based on a bank of digitally controlled transconductors along with small capacitors. The employed transconductors are based on simple CMOS transistors and thus can be integrated efficiently with the digital parts of systems. A cosine rolloff filter is designed and investigated by simulation in frequency domains. The results show that the proposed structure has a good speed-complexity-consumption trade-off.


international conference on digital signal processing | 2007

A Mixed-Signal Matched-Filter Design and Simulation

Mohammad Reza Zahabi; Vahid Meghdadi; Jean-Pierre Cances; Amir Saemi

A 0.35 mu-CMOS mixed-signal programmable filter suitable for high-rate communication systems is designed and investigated. The proposed filter has analog input and analog-sampled outputs. Filter taps are stored in a digital memory and can be changed on the fly. The filter structure is based on a bank of digitally controlled transconductors along with small capacitors. The employed transconductors are based on simple inverter and thus can be integrated efficiently with the digital parts of a system. A FIR cosine rolloff filter is designed and investigated by simulation in time and frequency domains. The results show that the proposed structure has a good speed-complexity-consumption trade-off.


international symposium on circuits and systems | 2008

Versatile graphs for tail-biting convolutional codes

Mohammad Reza Zahabi; Vahid Meghdadi; Hamid Meghdadi; Jean-Pierre Cances

A unified method to derive Tanner graph related to tail-biting convolutional codes (CCs) is presented. The graphs obtained by this method have low complexity even for codes with a large number of states. It is shown that under certain conditions, a unique graph can be used for decoding of recursive and non-recursive CCs. Analog realization of such a graph employing MOS transistors is discussed and its circuit-level simulation results are given.


international symposium elmar | 2006

ML MIMO-OFDM Time Synchronization/Channel Estimation for Unknown Frequency Selective Fading Channels

Amir Saemi; Vahid Meghdadi; Jean-Pierre Cances; Mohammad Reza Zahabi; Jean-Michel Dumas

This paper addresses maximum-likelihood (ML) time synchronization algorithm joint with channel estimation for MIMO-OFDM systems in frequency selective fading channels. For this purpose a SISO joint maximum likelihood (ML) synchronization algorithm with channel estimation is extended and generalised to MIMO systems. Timing failure probability is presented as a criterion to illustrate the robustness of the algorithm. The performance of the proposed synchronization approach, in terms of timing failure probability, was compared with SISO systems. Based on simulation results, the performance of the proposed algorithm is quite satisfying


international symposium on wireless communication systems | 2008

Analog decoding of tail-biting convolutional codes on graphs

Mohammad Reza Zahabi; Vahid Meghdadi; Hamid Meghdadi; Jean Pierre Cances

A general method to develop Tanner graphs from tail-biting convolutional codes (CC) is proposed. Recursive systematic convolutional (RSC) and non-RSC codes are considered consistently and it is shown that the elimination of redundant states leads to a graph with low complexity. In addition the graphical representation is extended to derive the condition for which the tail-biting termination is valid. This analysis also leads to a unique graph applicable for decoding of both RSC and non-RSC codes. This graph is realized by exploiting the analog decoding scheme and MOS transistors. The circuit-level simulation is performed and the effect of important design parameters such as decoding latency, consumption and input dynamic range are considered.


personal, indoor and mobile radio communications | 2007

MIMO-OFDM Iterative Time - Frequency Synchronization

Amir Saemi; Vahid Meghdadi; Jean-Pierre Cances; Mohammad Reza Zahabi

This paper addresses an iterative expectation-maximization (EM) time-frequency synchronization algorithm joint with channel estimation for MIMO-OFDM systems in frequency selective fading channels. The receivers iterates between detection and estimation. For each iteration, we calculate first the expectation of ODFM symbols by using a posteriori probabilities provided by MAP decoder and second we maximise a proposed metric to obtain both frequency offset and then symbol-timing. The channel can be identified by means of these estimates. This algorithm can work in transmission mode and thus can be used to estimate the residual errors or track the change of the parameters. The performance of the proposed synchronization approach, in terms bit error rate and mean square error of the estimated frequency offset, is shown.

Collaboration


Dive into the Mohammad Reza Zahabi's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

A. Korah

University of Limoges

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge