Robert Morelos-Zaragoza
San Jose State University, Electrical Engineering, Faculty Member
- Robert H. Morelos-Zaragoza was born in Houma, Louisiana, U.S.A. He received the BSEE and MSEE degrees from the Nation... moreRobert H. Morelos-Zaragoza was born in Houma, Louisiana, U.S.A. He received the BSEE and MSEE degrees from the National Autonomous University of Mexico (UNAM) in 1985 and 1987, respectively, and the PhD degree in Electrical Engineering from the University of Hawaii at Manoa, in 1992. He was an Assistant Professor at Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM) of Mexico in 1992-1993. In 1993-1995, he held postdoctoral positions at Osaka University, Japan, and Nara Instutue of Science and Technology, Japan. Robert was a research associate of Imai Laboratory of the University of Tokyo, in 1995-1997. During the period 1997-1999, he was a staff member of the Channel Coding Group of LSI Logic Corporation. In 1999-2002, he was a researcher of Sony Computer Science Laboratories (Sony CSL) in Tokyo, Japan. Robert joined the faculty of the Department of Electrical Engineering of SJSU, as an associate professor, in August 2002. Since 2004, he has been a consultant for companies such as Intel, SanDisk and Iberium on applications of error correcting coding to high-reliability memory servers, flash memories and digital TV broadcast receivers. His research interests include error correcting coding (ECC/FEC), advanced digital communication receiver design, software-defined radio (SDR), space-time signal processing techniques and ultra-wideband (UWB) communication systems. Prof. Morelos-Zaragoza is a senior member of IEEE, and member of IEICE (Japan) and of Eta Kappa Nu.edit
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
The purpose of this paper is to present the design of a Viterbi decoder, for moderate data transmission rates (hundreds of bits/sec), using a serial implementation based on a 16/32-bit microprocessor.
Research Interests:
Research Interests: Mathematics and BCH Code
Research Interests:
Abstract: Let Cex(n, k, d) (or simply Cex(n, k)) denote the extended code of an (n, k) binary primitive BCH code with designed distance d. We have proposed a method for computing the number of codewords of weight less than or equal to a... more
Abstract: Let Cex(n, k, d) (or simply Cex(n, k)) denote the extended code of an (n, k) binary primitive BCH code with designed distance d. We have proposed a method for computing the number of codewords of weight less than or equal to a given integer in a block code by using its ...
Research Interests:
Research Interests: Engineering, Computer Science, Distributed Computing, Signal Processing, Digital Signal Processing, and 15 moreSoftware Architecture, Digital Circuits, Reconfigurable architectures, Software Defined Radio, Software, Hardware, Software Radio, Design Methodology, Mmic, Qam, Electrical And Electronic Engineering, Quadrature Amplitude Modulation, Electrical and Computer Engineering, Cognitive Radio Network, and Phase shift keying
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
In our previous work, pseudo random binary sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristics... more
In our previous work, pseudo random binary sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation, and linear complexity. However, it has a major drawback also that is the appearance of 0 and 1 are inconsistent in each period. For this reason, in the periodic autocorrelation graph except the peak values other parts always consists some values and that is not 0. When we apply this type of binary sequence in any security applications, it will lead some security vulnerabilities. In this paper, the authors have proposed a new approach to generate pseudo random signed binary sequence. An important point about our proposed sequence is, it overcomes the drawback of our previous work. Our proposed sequence includes 0,1, and −1 values. Its features, such as the period and periodic autocorrelation are also explained in this paper. According to the results, this has interesting feature such as the appearance of 0, 1 and − 1 are identical in each period.
Research Interests:
In our previous work, k-value pseudo random sequence generated by power residue symbol has been researched. The sequence is generated by applying a primitive polynomial over odd characteristics field, trace function, and power residue... more
In our previous work, k-value pseudo random sequence generated by power residue symbol has been researched. The sequence is generated by applying a primitive polynomial over odd characteristics field, trace function, and power residue symbol. The sequence has some important features such as period, periodic autocorrelation, and linear complexity. In this paper, by applying an additional process to the previous procedure, an extended multi-value sequence is generated. Its features, such as the period, periodic autocorrelation, periodic crosscorrelation, and linear complexity are examined in this paper. According to the results, the new sequence also has some interesting features.
Research Interests:
In our previous work, the k-value pseudo random sequence generated by power residue symbol has been researched. The sequence is generated by applying a primitive polynomial over odd characteristics field, trace function, and power residue... more
In our previous work, the k-value pseudo random sequence generated by power residue symbol has been researched. The sequence is generated by applying a primitive polynomial over odd characteristics field, trace function, and power residue symbol. And the sequence has some interesting features such as period, periodic autocorrelation, and linear complexity. In this paper, by applying a new step into the process of generating sequence, a new generating method of k-value sequence is derived. As with the previous work, it also has some interesting features such as period, periodic autocorrelation, and periodic crosscorrelation. From the experimental results, these features are examined.
Research Interests:
Research Interests:
The authors of this paper have observed the distribution of bit patterns property of a binary sequence which is generated by using a primitive polynomial, trace function, and Legendre symbol over the sub extension field. However, one of... more
The authors of this paper have observed the distribution of bit patterns property of a binary sequence which is generated by using a primitive polynomial, trace function, and Legendre symbol over the sub extension field. However, one of the most important measure for evaluating the randomness of a sequence which is so called the distribution of bit patterns still has not been investigated. This paper focused on the distribution of bit patterns based on some experimental results. After observing many experimental results, the authors found that the number of appearance of each bit pattern is related to the number of zeros contained in each bit pattern. Furthermore, the authors formulated an equation to explain the distribution of bit patterns in a binary sequence.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
This paper focuses on the Maximum Order Complexity of a pseudorandom sequence for security applications called NTU sequence. It shows the maximum feature on the nonlinear property and several properties have been theoretically proven.... more
This paper focuses on the Maximum Order Complexity of a pseudorandom sequence for security applications called NTU sequence. It shows the maximum feature on the nonlinear property and several properties have been theoretically proven. However, the NTU sequence requires a uniformization technique to overcome the drawback on its bits distribution. The technique has already proposed but the non-liear feature still has not investigated. Therefore, this paper evaluates the affects on the non-linear feature of the original NTU sequence by using Maximum Order Complexity.
Research Interests:
The authors have proposed an approach for generating a pseudo random binary sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random binary... more
The authors have proposed an approach for generating a pseudo random binary sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random binary sequence in security applications. The linear complexity of a sequence is considered as the most important property to be analyzed in these types of applications. In this paper, the authors have restricted the discussion on the linear complexity and linear complexity profile properties of the proposed sequence based on some experimental results. According to the results, the proposed sequence always holds a maximum value of the linear complexity.
Research Interests:
The authors in this paper have proposed a multi-value sequence generated by a primitive polynomial, trace function, k-th power residue symbol, and a certain mapping function over the proper sub extension field. Here, the trace function... more
The authors in this paper have proposed a multi-value sequence generated by a primitive polynomial, trace function, k-th power residue symbol, and a certain mapping function over the proper sub extension field. Here, the trace function actually maps an element of the extension field to an element of the proper sub extension field, which is actually a vector space. The distribution of numbers within the sequence becomes more balanced by considering the proper sub extension field. In addition, its period and autocorrelation properties also observed in this paper.
Research Interests:
Research Interests:
... On Trellis Structure of LUEP Block Codes and a Class of UEP QPSK Block Modulation CodesRobert MORELOS-ZARAGOZA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E77-A No.8... more
... On Trellis Structure of LUEP Block Codes and a Class of UEP QPSK Block Modulation CodesRobert MORELOS-ZARAGOZA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E77-A No.8 pp.1261-1266 ...
Research Interests:
... On Trellis Structure of LUEP Block Codes and a Class of UEP QPSK Block Modulation CodesRobert MORELOS-ZARAGOZA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E77-A No.8... more
... On Trellis Structure of LUEP Block Codes and a Class of UEP QPSK Block Modulation CodesRobert MORELOS-ZARAGOZA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E77-A No.8 pp.1261-1266 ...
Research Interests:
Modern wireless networks use QAM modulation with mappings that are derived from square signal constellations in which the number of signal points is an even power of two. In the particular case of IEEE 802.11 networks, these mappings are... more
Modern wireless networks use QAM modulation with mappings that are derived from square signal constellations in which the number of signal points is an even power of two. In the particular case of IEEE 802.11 networks, these mappings are 4-QAM, 16-QAM and 64-QAM and are hereto referred as evenpower QAM mappings. This paper considers the performance improvements that are obtained by adding odd-power QAM mappings (obtained from cross QAM constellations) to the set of available mappings. These odd-power mappings are associated with 2-QAM cross constellations that are carved out from larger 2-QAM square constellations. For the specific cases of 8QAM, 32-QAM and 128-QAM mappings, the improvements in throughput are quantified assuming a Rayleigh fading condition. Furthermore, in order to illustrate the use of bit metrics generated by a demapper, also examined is the performance of bit-interleaved 8-QAM and 32-QAM mappings with binary codes over an AWGN channel.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests: Engineering, Computer Science, Signal Processing, Channel Coding, Digital Communication, and 15 moreEqualization, Hamming Code, Uwb, Fuzzy Adaptive Equalizer, Forward Error Correction, Adaptive Equalization, Indoor Environment, Bandwidth, Channel model, Turbo Codes, Decision Feedback Equalizer, Block Codes, Electrical and Computer Engineering, Hamming codes, and Adaptive Equalizer
Research Interests:
Research Interests:
ABSTRACT In this paper, the error performance of the tag-to-reader link of a passive UHF (Electronic Product Code - EPC - Generation 2) RFID system is examined. An error-correcting technique is introduced that is based on the cyclic... more
ABSTRACT In this paper, the error performance of the tag-to-reader link of a passive UHF (Electronic Product Code - EPC - Generation 2) RFID system is examined. An error-correcting technique is introduced that is based on the cyclic redundancy check (CRC) bits transmitted by the tag with backscatter biphase-M (or FM0) modulation. The proposed technique uses a look-up table that allows the correction of single errors in the received EPC. Numerical results, using additive white Gaussian noise (AWGN) and flat Rayleigh fading channel models, show that a better performance is obtained, in the sense of either reducing the error rate or increasing the distance between tag and reader.