Majlesi Journal of Telecommunication Devices <p>The scope of MJTD includes all aspects of telecommunication device technology, from mathematical modeling to practical engineering. The editorial board is international and original unpublished papers are welcome from throughout the world. The journal is devoted primarily to research papers, but very high quality survey and tutorial papers are also published.</p> <p>There is no publication charge for the authors.</p> en-US (Dr. Mohsen Ashourian) (Behzad Aghababaie) Tue, 02 Apr 2019 15:40:16 +0000 OJS 60 Designing a Photonic Crystal Based Optical Wavelength Division Demultiplexer for Communication Applications <p>We design and simulate an efficient wavelength division demultiplexer (WDDM) based on photonic crystal without using either specific materials or complexities in the fabrication process. The photonic crystal consists of a square lattice of Chalcogenide glass with &nbsp;embedded in air in two dimensions. The structure involves three cavities around the boundary of the waveguide with specified distance from each other for wavelength selection. For obtaining resonant frequencies of the cavities, two dimensional Finite-Difference-Time-Domain (FDTD) simulation is used. Through simulations<em>,</em> characteristic resonant wavelengths of the cavities are obtained in terms of the size of the coupling rods and the inner rod of the cavity. To show the design flexibility of the proposed structure, a WDDM is designed to divide a common input containing wavelengths &nbsp;and&nbsp;into three distinct ports with a high efficiency..</p> <p>&nbsp;</p> Yadollah Shahamat, Mohammad Vahedi ##submission.copyrightStatement## Fri, 21 Dec 2018 00:00:00 +0000 Decimal Convolutional Code and its Decoder for Low-Power applications <p>P. Elias proposed convolutional coding at 1955. Convolutional encoders have very simple structure but their decoders are very complex and power consumer. Power consumption and error correction of Convolutional Codes, will be enhanced by increase in their constrain length, therefore there is always a trade-off between Power consumption and error correction. In Convolutional Codes, the code specifications remain constant in each frame. If the specifications are changed during each frame in a code, a new code with new performance and specifications is created. This paper, aims to evaluate this issue for the first time and compare its performance with Convolutional Codes. This new code is named “Decimal Convolutional”. If in a decimal convolutional code, constrain length is changed during each frame, the generated code will be a convolutional code with “decimal constrain length”. In this paper, a convolutional code with decimal constrain length is introduced, encoder and Viterbi decoder structure is explained for it and its specification is compared with convolutional code. Using this code, an optimized constrain length can be obtained and relative power consumption of decoder can be also reduced. The proposed design blocks are described by VHDL and they are implemented on Xilinx Spartan3, Xc3s400 FPGA chip.</p> Ali Ghasemi khah, Yosef Seifi Kavian ##submission.copyrightStatement## Wed, 26 Dec 2018 00:00:00 +0000 Optimization of Human Recognition from the Iris Images using the Haar wavelet <p>Today, biometric recognition (based on biological signs) is a common and reliable method for recognizing and identity confirmation based on their behavioral and physiological characteristics. Physiological characteristics are consistent with the physical characteristics of individuals such as fingerprints, iris pattern, facial features, and the like. This type of property often does not change without external exertion. Behavioral characteristics such as signature, spoken pattern and iris are also a scale for identification and identity confirmation. In this study, using the wavelet method, the efficiency of human identification was increased by 75%.</p> Nahal Avazpour, Mehran Emadi ##submission.copyrightStatement## Fri, 28 Dec 2018 00:00:00 +0000 Introducing a Two-step Strategy based on Deep Learning Enhance the Accuracy of Intrusion Detection Systems in the Network <p>Intrusion Detection System is one of the most important security features of modern computer networks that can detect network penetration through a series of functions. This system is independently used (e.g. Snort) or with various security equipment (such as Antivirus, UTM, etc.) on the network and detects an attack based on two techniques of abnormal detection and signature-based detection. Currently, most of the researches in the field of intrusion detection systems have been done based on abnormal behavior using a variety of methods including statistical techniques, Artificial Intelligence (AI), data mining, and machine learning. In this study, we can achieve an effective accuracy using a candidate class of the KDD dataset and deep learning techniques.</p> Ali Bahmani, Amirhassan Monajemi ##submission.copyrightStatement## Wed, 13 Mar 2019 00:00:00 +0000 Detection Of Brain Tumors From Magnetic Resonance Imaging By Combining Superpixel Methods And Relevance Vector Machines Classification <p>The production of additional cells often forms a mass of tissue that is referred to as a tumor. Tumors can disrupt the proper functioning of the brain and even lead to the patients' death. One of the non-invasive diagnostic methods for this disease is Magnetic Resonance Imaging (MRI). The development of an automated or semi-automatic diagnostic system is required by the computer in medical treatments. Several algorithms have been used to detect a tumor, each with its own advantages and disadvantages. In the present study, an automatic method has been developed by the combination of new methods in order to find the exact area of the tumor in the MRI image. This algorithm is based on super pixel and RVM classification. The algorithm used in the super pixel method is the SLIC algorithm, which calculates for each super pixel 13 statistical characteristics and severity. Finally, an educational method introduced from the RVM classification algorithm that can detect the tumor portion from non-tumor in each brain MRI image. BRATS2012 dataset and FLAIR weights have been utilized in this study The results are compared with the results of the BRATS2012 data and The overlap coefficients of Dice, BF score, and Jaccard were 0.898, 0.697 and 0.754, respectively.</p> Ebrahim Akbari, Mehran Emadi ##submission.copyrightStatement## Tue, 09 Apr 2019 00:00:00 +0000 Beyond Half Synchronized Systems <p><span style="font-size: small;"><span class="fontstyle0">In irreducible subshifts, a word </span><span class="fontstyle2"><em>m </em></span><span class="fontstyle0">is synchronizing if whenever </span></span><span style="font-size: small;"><span class="fontstyle2"><em>vm </em></span><span class="fontstyle0">and </span><span class="fontstyle2"><em>mw </em></span><span class="fontstyle0">are admissible words, then </span><span class="fontstyle2"><em>vmw </em></span><span class="fontstyle0">is admissible as well. A word </span><span class="fontstyle2"><em>m </em></span></span><span class="fontstyle0"><span style="font-size: small;">is </span><span style="font-size: small;">(left) half (resp. weak) synchronizing, when there is a left transitive ray (resp. a left ray) </span></span><em><span class="fontstyle2"><span style="font-size: small;">x</span></span><span class="fontstyle3"><span style="font-size: xx-small;">- </span></span></em><span style="font-size: small;"><span class="fontstyle0">such that if </span><span class="fontstyle2"><em>x</em></span></span><em><span class="fontstyle3"><span style="font-size: xx-small;">-</span></span><span class="fontstyle2"><span style="font-size: small;">m </span></span></em><span style="font-size: small;"><span class="fontstyle0">and </span><span class="fontstyle2"><em>mw </em></span><span class="fontstyle0">are admissible, then </span><span class="fontstyle2"><em>x</em></span></span><em><span class="fontstyle3"><span style="font-size: xx-small;">-</span></span><span class="fontstyle2"><span style="font-size: small;">mw </span></span></em><span class="fontstyle0"><span style="font-size: small;">is also </span><span style="font-size: small;">admissible. The respective subshifts are called half (resp. weak) synchronized. K. Thomsen in [On the structure of a sofc shift space, American Mathematical Society, 356, Number 9, p. 557-3619] considers a synchronized component of a&nbsp; general subshift and investigates the approximation of entropy from inside of this component by some certain SFT’s. We, using a rather different approach, show how this result extends to weak synchronized systems.</span></span></p> Dawoud Ahmadi Dastjerdi, Manouchehr Shahamat ##submission.copyrightStatement## Tue, 02 Apr 2019 15:39:55 +0000