Efficient Implementation of a Pseudorandom Sequence Generator for High-Speed Data Communications

Abstract

A conventional pseudorandom sequence generator creates only 1 bit of data per clock cycle. Therefore, it may cause a delay in data communications. In this paper, we propose an efficient implementation method for a pseudorandom sequence generator with parallel outputs. By virtue of the simple matrix multiplications, we derive a well-organized recursive formula and realize a pseudorandom sequence generator with multiple outputs. Experimental results show that, although the total area of the proposed scheme is 3% to 13% larger than that of the existing scheme, our parallel architecture improves the throughput by 2, 4, and 6 times compared with the existing scheme based on a single output. In addition, we apply our approach to a 2×2 multiple input/multiple output (MIMO) detector targeting the 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) system. Therefore, the throughput of the MIMO detector is significantly enhanced by parallel processing of data communications.Keywords: pseudorandom sequence generator, linear feedback shift register, matrix multiplication, 3GPP LTE system, MIMO detector. Manuscript received Sept. 4, 2009; revised Dec. 17, 2009; accepted Jan. 4, 2010. This work was supported by the IT R&D program of MKE/KEIT, Rep. of Korea [2006-S-001-04 I. IntroductionPseudorandom sequences [1] have been widely used in various fields, including communications, navigation, radar technology, cipher technologies, remote control, measurements, and industrial automation [2]. For example, pseudorandom sequences have been used in error-correcting codes [3], spread spectrum communication [4], [5], and system identification and parameter measurements [6], [7]. Other example applications are found in surface characterization and 3D scene modeling [8]. The design of a general purpose pseudorandom sequence generator has matured and has already been commercialized [9]-[11].Pseudorandom sequences are series of 1's and 0's that lack any definite pattern and look statistically independent and uniformly distributed. The sequences are deterministic, but exhibit noise properties similar to randomness [12]. In particular, a pseudorandom sequence generator is usually made up of shift registers with feedback. By linearly combining elements from taps of the shift register and feeding them back to the input of the generator, we can obtain a sequence of much longer repeat length using the same number of delay elements in the shift register. Therefore, these blocks are also referred to as a linear feedback shift register (LFSR) [13], [14]. The length of the shift register, the number of taps, and their positions in the LFSR are important to generate pseudorandom sequences with desirable auto-correlation properties [15]. However, the output of the conventional pseudorandom sequence generator is limited to 1 bit per clock cycle. This restriction can be a bottleneck for data communications and may cause a delay. have been proposed [16], [17]. The approaches describe a parallel architecture implementation of a pseudorandom...

Chaos based PN sequence generator for cryptographic applications

“…The set of equations given in eqn (3) really define the states of four one-dimensional chaotic maps employed in the generator. But, to start the generator, the x 1 (1), x 2 (1), x 3 (1) and x 4 (1) are generated from x 1 (0), x 2 (0), x 3 (0) and x 4 (0) respectively, in the first iteration. On each iteration, the realvalued state variable x i of chaotic map i is captured and preprocessed/quantized as: If real-valued variable x i is less than 0.5 then b i = 0 else b i = 1.…”

“…A lot of LFSR based pseudo-random sequence generators have been suggested in the literature [1,3,[7][8][9][10]. However, the disadvantage with LFSR based design is that the feedback tapings can be determined under Berleykamp Massey attack.…”

High-performance computing VLSI system for bit-parallel exponentiation inGF(2m)

“…Operations in GFð2 m Þ are widely used for applications in digital communication such as error-correcting codes, digital signal processing, pseudorandom sequence generation and cryptography (Daly, Marnane, Kerins, & Popovici, 2004;Yoo, Kotturi, Pan, & Blizzard, 2005;Pionteck, Staake, Stiefmeier, Kabulepa, & Geisner, 2004;Hwang, Park, Kim, & Jhang, 2010;Mathew, Jabir, Rahaman, & Pradhan, 2009). With an enormous number of people across the world connected to the Internet, information security using cryptography has become a top priority.…”

Analysis, Design, and Test of CDMA LFSR with Offset Mask Using Standard ICs

“…LFSR is also helpful for generating quasi-random sequences and is used in hardware Built-In Self-Test (BIST) [1] [2], and security for Radio Frequency Identification (RFID) technologies [3]. However, their design is often done using only FPGA [4] [5]. Our goal in this work is not only to make a circuit board using standard integrated electronics components, but also to be able to move quickly on FPGA boards.…”