• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.164-168
• /
• 2001

The Multiple Recursive Generator(MRG) has been considered by many scholars as a very good Random Number generator. For the long period and excellent statistical properties, the method of the combination with random number generators are used. In this paper, for two-combined MRGs, we examine the statistical properties and show the importance of the seeds likewise other random number generators. And we modify the two-combined MRGs and verify the statistical superiority.

• Journal of the Korea Society for Simulation
• /
• v.10 no.2
• /
• pp.25-32
• /
• 2001

The Multiple Recursive Generator(MRG) has been considered by many scholars as a very good random number generator. For the long period md excellent statistical properties, the method of the combination with random number generators is used. In this paper, we thought the two-combined MRGs. Using the frequency and serial test, and runs test, we studied the importance of the initial seeds likewise other random number generators.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.464-467
• /
• 2001

A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But, there is no theoretical guideline for using the initial seeds. Therefore, random number generator is usually used with the arbitrary initial seed. Through the empirical tests, we show that the choice of the initial values for the seed is important to generate good random numbers.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.222-229
• /
• 2010

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{\times}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.