English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/116517
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


Fast random bit generation using a chaotic laser: Approaching the information theoretic limit

AuthorsOliver, Neus ; Soriano, Miguel C. ; Sukow, David W. ; Fischer, Ingo
Issue Date5-Sep-2013
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE Journal of Quantum Electronics 49(11): 910-918 (2013)
AbstractWe design and implement a chaotic-based system, enabling ultra-fast random bit sequence generation. The potential of this system to realize bit rates of 160 Gb/s for 8-bit digitization and 480 Gb/s for 16-bit digitization is demonstrated. In addition, we provide detailed insight into the interplay of dynamical properties, acquisition conditions, and post-processing, using simple and robust procedures. We employ the chaotic output of a semiconductor laser subjected to polarization-rotated feedback. We show that not only dynamics affect the randomness of the bits, but also the digitization conditions and postprocessing must be considered for successful random bit generation. Applying these general guidelines, extensible to other chaos-based systems, we can define the optimal conditions for random bit generation. We experimentally demonstrate the relevance of these criteria by extending the bit rate of our random bit generator by about two orders of magnitude. Finally, we discuss the information theoretic limits, showing that following our approach we reach the maximum possible generation rate. © 1965-2012 IEEE.
Identifiersdoi: 10.1109/JQE.2013.2280917
issn: 0018-9197
Appears in Collections:(IFISC) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.