Hamed Mirghasemi

Learn More
We consider the MIMO wiretap channel, where a legitimate transmitter (Alice) wishes to communicate a confidential message to the legitimate receiver (Bob) over a MIMO channel, while its messages are being eavesdropped by Eve through another MIMO channel. Supposing that Alice uses the nested lattice code proposed in [8], we characterize the expected value of(More)
In this paper, the performance of five classifiers in P300 speller paradigm are compared. Theses classifiers are Linear Support Vector Machine (LSVM), Gaussian Support Vector Machine (GSVM), Neural Network (NN), Fisher Linear Discriminant (FLD), and Kernel Fisher Discriminant (KFD). In classification of P300 waves, there has been a trend to use SVM(More)
Artifact removal is an essential part in electroencephalogram (EEG) recording and the raw EEG signals require preprocessing before feature extraction. In this work, we implemented three filtering methods and demonstrated their effects on the performance of different classifiers. Bandpass digital filtering, median filtering and facet method are three(More)
The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of l ≥ 1 bits which experiences a deletion with probability p, a duplication with probability q, and remains unchanged with probability 1 - p - q. For this channel a capacity expression is obtained in the asymptotic regime where p + q =(More)
This paper presents a scalp eletroencephalogram (EEG) rhythmic pattern detection scheme based on neural networks. rhythmic discharges detection is applicable to the majority of seizures seen in newborns, and is listed as detecting 90% of all the seizures. In this approach some features based on various methods are extracted and compared by a modified(More)
In this paper, we investigate the achievable semantic secrecy rate of existing lattice coding schemes, proposed in [6], for both the mod-Λ Gaussian wiretap and the Gaussian wiretap channels. For both channels, we propose new upper bounds on the amount of leaked information which provide milder sufficient conditions to achieve semantic secrecy. These(More)
Polar coding theorems state that as the number of channel use, n, tends to infinity, the fraction of un-polarized bit-channels (the bit-channels whose Z parameters are in the interval (&#x03B4;(n), 1- &#x03B4; (n)), tends to zero. Consider two BEC channels W(z<sub>1</sub>) and W(z<sub>2</sub>). Motivated by polar coding scheme proposed for the wiretap(More)
  • 1