Hossein Falsafain

Hossein Falsafain
Isfahan University of Technology | IUT · Department of Electrical and Computer Engineering

PhD

About

11
Publications
419
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
41
Citations
Citations since 2016
7 Research Items
33 Citations
20162017201820192020202120220246810
20162017201820192020202120220246810
20162017201820192020202120220246810
20162017201820192020202120220246810

Publications

Publications (11)
Article
Railway companies can improve their achievement through the efficient management of locomotives in the network, even in the case of severe limitations in number of available locomotives. To reach the mentioned goal, this study addresses a Locomotive Assignment Problem (LAP) for freight trains. It simultaneously considers timetable flexibility, loco...
Article
The number of devices connected to the internet is increasing at a tremendous rate. Connecting intelligent devices has created a new paradigm called the Internet of Things (IoT). Due to the significant volume of data generated in the IoT, cloud infrastructure alone cannot process this data. Thus, fog computing has been proposed to supplement the cl...
Preprint
Full-text available
Radio-frequency portion of the electromagnetic spectrum is a scarce resource. Cognitive radio technology has emerged as a promising solution to overcome the spectrum scarcity bottleneck. Through this technology, secondary users (SUs) sense the spectrum opportunities free from primary users (PUs), and opportunistically take advantage of these (tempo...
Article
Radio-frequency portion of the electromagnetic spectrum is a scarce resource. Cognitive radio (CR) technology has emerged as a promising solution to overcome the spectrum scarcity bottleneck. Through this technology, secondary users (SUs) sense the spectrum opportunities free from primary users (PUs), and opportunistically take advantage of these (...
Article
Train marshalling is the process of reordering the railcars of a train in such a way that the railcars with the same destination appear consecutively in the final, reassembled train. The process takes place in the shunting yard by means of a number of classification tracks. In the train marshalling problem (TMP), the objective is to perform this re...
Article
An effective branch-and-bound (B&B) algorithm for exhaustively enumerating the elementary trapping sets (ETSs) in an arbitrary given Tanner graph is described. Given a Tanner graph G and a positive integer ? , we introduce a novel 0-1 integer linear programming (ILP) formulation of the {NP} -hard problem of finding the minimum ? for which there exi...
Article
A generator matrix (GM)-based approach for adaptively deriving cut-inducing redundant parity checks (RPCs) during the adaptive linear programming decoding algorithm is presented. More precisely speaking, if the decoder gets stuck in a non-integral pseudocodeword, then the resulting RPCs are likely to provide violated forbidden-set inequalities that...
Article
Error-rate floor phenomenon is known to be a serious impediment to the use of low-density parity-check (LDPC) codes for some practical applications that demand high data reliability. In the case of binary erasure channels (BECs), certain error-prone patterns, known as stopping sets, are proven to cause this performance degradation. A possible appro...
Article
Human haplotypes include essential information about SNPs, which in turn provide valuable information for such studies as finding relationships between some diseases and their potential genetic causes, e.g., for Genome Wide Association Studies. Due to expensiveness of directly determining haplotypes and recent progress in high throughput sequencing...
Article
A new combinatorial technique for constructing girth-6 structured binary regular low-density parity-check (LDPC) codes based on special types of t-designs is given. A very large number of well-known t-designs can be used by this method for code construction. Based on this method, a t-(v,k,λ) design D=(X,B) can be exploited for code construction if...
Article
This paper presents a novel method for constructing structured regular low-density parity-check (LDPC) codes based on a special type of combinatorial designs, known as Steiner systems. This code design approach can be considered as a generalization of the well-known method which uses the point-block incidence matrix of a Steiner 2-design for the co...

Network

Cited By