Siamak Talebi
Siamak Talebi
1- Shahid Bahonar University of Kerman, Kerman. 2- Advanced Communications Research Institute
Verified email at uk.ac.ir
Title
Cited by
Cited by
Year
Efficient algorithms for burst error recovery using FFT and other transform kernels
F Marvasti, M Hasan, M Echhart, S Talebi
IEEE Transactions on Signal Processing 47 (4), 1065-1075, 1999
841999
Dynamic fuzzy logic-ant colony system-based route selection system
H Salehinejad, S Talebi
Applied Computational Intelligence and Soft Computing 2010, 2010
442010
Performance comparison of chaotic spreading sequences generated by two different classes of chaotic systems in a chaos-based direct sequence-code division multiple access system
N Rahnama, S Talebi
IET Communications 7 (10), 1024-1031, 2013
332013
Cognitive radio networks spectrum allocation: An ACS perspective
F Koroupi, S Talebi, H Salehinejad
Scientia Iranica 19 (3), 767-773, 2012
322012
A new ant algorithm based vehicle navigation system: a wireless networking approach
H Salehinejad, S Talebi
2008 International Symposium on Telecommunications, 36-41, 2008
302008
A new route selection system: multiparameter ant algorithm based vehicle navigation approach
H Salehinejad, F Pouladi, S Talebi
2008 International Conference on Computational Intelligence for Modelling …, 2008
232008
A metaheuristic approach to spectrum assignment for opportunistic spectrum access
H Salehinejad, S Talebi, F Pouladi
2010 17th International Conference on Telecommunications, 234-238, 2010
202010
A full-rate full-diversity 2x2 space-time block code with linear complexity for the maximum likelihood receiver
SSH Bidaki, S Talebi, M Shahabinejad
IEEE Communications Letters 15 (8), 842-844, 2011
182011
A novel technique for steganography method based on improved genetic algorithm optimization in spatial domain
M Soleimanpour-Moghadam, S Talebi
Iranian Journal of Electrical and Electronic Engineering 9 (2), 67-75, 2013
172013
Evaluation of stress distribution of implant-retained mandibular overdenture with different vertical restorative spaces: A finite element analysis
B Ebadian, M Farzin, S Talebi, N Khodaeian
Dental research journal 9 (6), 741, 2012
172012
PAPR reduction of OFDM signals using harmony search algorithm
EM Kermani, H Salehinejad, S Talebi
2011 18th International Conference on Telecommunications, 90-94, 2011
142011
Full-diversity space-time-frequency coding with very low complexity for the ML decoder
M Shahabinejad, S Talebi
IEEE communications letters 16 (5), 658-661, 2012
132012
A new approach to fast decode quasi-orthogonal space-time block codes
A Ahmadi, S Talebi, M Shahabinejad
IEEE transactions on wireless communications 14 (1), 165-176, 2014
122014
Optimum and reliable routing in VANETs: An opposition based ant colony algorithm scheme
B Kazemi, M Ahmadi, S Talebi
2013 International Conference on Connected Vehicles and Expo (ICCVE), 926-930, 2013
112013
Two novel chaos-based algorithms for image and video watermarking
S Mohammadi, S Talebi, A Hakimi
Iranian Journal of Electrical and Electronic Engineering 8 (2), 97-107, 2012
112012
New full-diversity space-frequency block codes based on the OSTBCs
Z Mohammadian, M Shahabinejad, S Talebi
IEEE communications letters 16 (10), 1620-1623, 2012
102012
PAPR reduction of OFDM signals by novel global harmony search in PTS scheme
H Salehinejad, S Talebi
International Journal of Digital Multimedia Broadcasting 2012, 2012
92012
Comprehensive study on a 2× 2 full-rate and linear decoding complexity space–time block code
SS Hosseini, S Talebi, J Abouei
IET Communications 9 (1), 122-132, 2014
82014
A pistachio nuts classification technique: An ann based signal processing scheme
S Mahdavi-Jafari, H Salehinejad, S Talebi
2008 International Conference on Computational Intelligence for Modelling …, 2008
82008
Two quasi orthogonal space-time block codes with better performance and low complexity decoder
A Lotfi-Rezaabad, S Talebi, A Chizari
2016 10th International Symposium on Communication Systems, Networks and …, 2016
72016
The system can't perform the operation now. Try again later.
Articles 1–20