949 resultados para Optical Orthogonal Codes


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new control algorithm with reduced mode-hopping is demonstrated for uncooled WDM C-band channel generation from a DS-DBR laser with 100GHz spacing and low thermal drift up to 70°C. 10Gb/s external modulation with transmission over a 25km link is achieved. ©2010 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Reconfigurable shutter-based free-space optical switching technologies using fiber ribbon and multiple wavelengths per fiber for Storage Area Networks (SANs) application are presented and demonstrated. ©2009 SPIE-OSA-IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Reconfigurable shutter-based free-space optical switching technologies using fiber ribbon and multiple wavelengths per fiber for Storage Area Networks (SANs) application are presented and demonstrated. ©2009 Optical Society of America.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, the architecture of a vector-matrix multiplier (MVM) is simulated. The optical design can be made compact by the use of GRIN lenses for the optical fan-in. The intended application area was in storage area networks (SANs) but the concept can be applied to a neural network. © 2011 Allerton Press, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. © 2004 Elsevier B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. © 2004 Elsevier B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. ©2003 Published by Elsevier Science B. V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. ©2003 Published by Elsevier Science B. V.