Mohammad Mahdi Naghsh

Learn More
—In this paper, we study the problem of code design to improve the detection performance of multi-static radar in the presence of clutter (i.e., a signal-dependent interference). To this end, we briefly present a discrete-time formulation of the problem as well as the optimal detector in the presence of Gaussian clutter. Due to the lack of analytical(More)
—In this paper, we study the joint design of Doppler robust transmit sequence and receive filter to improve the performance of an active sensing system dealing with signal-dependent interference. The signal-to-noise-plus-interference (SINR) of the filter output is considered as the performance measure of the system. The design problem is cast as a max-min(More)
Keywords: Autocorrelation Binary sequences Complementary sets Cyclic minimization Peak-to-average-power ratio (PAR) Sidelobe level a b s t r a c t In this paper, we introduce a fast computational frequency-domain approach for designing complementary sets of sequences. Following the basic idea of CAN-based algorithms, we propose an extension of the CAN(More)
In this paper, we study the problem of optimal pulsed-radar transmit code design for detection of moving targets in the presence of clutter. To this end, a new data modeling is introduced and optimal detectors for known and unknown target Doppler shift are presented. In the case of unknown Doppler shift, the expressions of the optimal detector and its(More)
Orthogonal frequency division multiplexing (OFDM) is a mature and one of the most popular multicarrier modulation (MCM) techniques. Also, it is the main candidate for physical layer of cognitive radio (CR) networks. CR is a new method to satisfy ubiquitous demand for wireless services while there is no enough unlicensed spectrum. However, the most important(More)
In this paper, we study the problem of approaching peak periodic or aperiodic correlation bounds for complex-valued sets of sequences. In particular, novel algorithms based on alternating projections are devised to approach a given peak periodic or aperiodic correlation bound. Several numerical examples are presented to assess the tightness of the known(More)
—In this paper, we study the problem of meeting peak periodic or aperiodic correlation bounds for complex-valued sets of sequences. To this end, the Welch, Levenstein, and Exponential bounds on the peak inner-product of sequence sets are considered and used to provide compound peak correlation bounds in both periodic and aperiodic cases. The peak aperiodic(More)