کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4636280 1340721 2007 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Permutation and sampling with maximum length CA or pseudorandom number generation
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Permutation and sampling with maximum length CA or pseudorandom number generation
چکیده انگلیسی
In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation is shown using a two CA model. Three different schemes that incorporate these two operations are suggested - weighted permutation vector sampling with controlled multiplexing, weighted permutation vector sampling with irregular decimation and permutation programmed CA sampling. The experiment results show that the resulting sequences have varying degrees of improvement in DIEHARD results and linear complexity compared to the CA.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 185, Issue 1, 1 February 2007, Pages 312-321
نویسندگان
, , ,