Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Annual Meeting Optical Society of America

Encoding for error correction in optical computing

Scott A. Ellett, John F. Walkup, Thomas F. Krile

Published Jan 1, 1990• 0 citations
Publisher

Abstract

Optical processors can perform complex calculations in parallel at high speeds. They commonly suffer, however, from low accuracy, which currently hinders their widespread use. Various models for the noise in optical processors have been developed.1 In addition, various techniques have been developed to improve their accuracy. One technique involves the use of error-detection and correction codes to improve the accuracy of optical linear algebra processors.2 This allows some of the errors that occur during computation to be detected and possibly corrected. These codes, developed earlier for data transmission and fault tolerance in electronic processors, can thus be used to improve accuracy. Many of the required encoding and decoding operations can be performed optically. Computer simulations of optical matrix-vector multipliers employing various error codes will be presented. They indicate that a significant improvement in accuracy can be obtained when they are compared with processors not employing error codes.

DOI
10.1364/oam.1990.ft3

Related papers

Error codes applied to optical algebraic processors

Scott A. Ellett, John F. Walkup, Thomas F. Krile

Optical algebraic processors can perform complex calculations in parallel and at high speeds. However, they commonly suffer from a low analog accuracy which hinders their widespread application. Error detection and correction codes provide one technique for improving the accuracy of optical algebraic processors. The use of these codes would allow some of the errors that may occur during a computation to be detected and possibly corrected. This paper describes the results of various computer simulations of optical matrix-vector multipliers employing error-correction codes. It discusses the application of convolutional codes to optical matrix-vector multipliers along with several block codes. Both binary and nonbinary codes are considered. The results indicate that a significant improvement in performance can be obtained when compared with processors not employing error-correction codes. Also, the type of noise, whether signal-independent or signal-dependent noise, has a significant effect on the performance of a matrix-vector multiplier employing an error code. The encoding and decoding operations required for the error codes can be performed optically.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 1, 1991•1 citation

Pacifist's guide to optical computers

H. John Caulfield

Optical algebraic processors can perform complex calculations in parallel and at high speeds. However, they commonly suffer from a low analog accuracy which hinders their widespread application. Error detection and correction codes provide one technique for improving the accuracy of optical algebraic processors. The use of these codes would allow some of the errors that may occur during a computation to be detected and possibly corrected. This paper describes the results of various computer simulations of optical matrix-vector multipliers employing error-correction codes. It discusses the application of convolutional codes to optical matrix-vector multipliers along with several block codes. Both binary and nonbinary codes are not employing error-correction codes. Also, the type of noise, whether signal-independent or signal-dependent, has a significant effect on the performance of a matrix-vector multiplier employing an error code. The encoding and decoding operations required for the error codes can be performed optically.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 1, 1991•2 citations

Error-correcting codes for optical matrix processors

Scott A. Ellett

Many disciplines, such as antenna beam-forming and \nadaptive optics, require the ability to perform high \nspeed matrix operations, which often can be reduced to a \nseries of matrix-vector products. Analog optical matrixvector \nprocessors (OMVP's) take advantage of the high \nspeed and parallelism of optics to rapidly compute \nmatrix-vector products. However, OMVP's suffer from a \nlow accuracy which currently hinders their widespread \napplication. Over the past decade, various techniques \nhave been introduced to achieve high accuracy computation \nwith OMVP's. This dissertation studies the application \nof error-correcting codes (ECC's) and the union of ECC's \nwith digital partitioning to achieve high accuracy computation. \nThe ability of ECC's to improve the performance \nof OMVP's is studied through the use of computer simulations. \nThe effect ECC's have on system throughput is \nalso studied. Digital partitioning is a new technique \nfor achieving high accuracy computations on analog \nOMVP's. One potential drawback of digital partitioning \nis its sensitivity to errors. Error-correcting codes can \nenhance the performance of the digital partitioning algorithm \nby reducing this sensitivity to errors. Computer \nsimulation results are presented showing the benefits of \nusing ECC's with digital partitioning. In addition, an \nanalysis of the time requirements for encoding and decoding \nthe ECC's and the effect on system throughput is \npresented.

•Aug 1, 1994•0 citations

Multiple error-correction coding for optical matrix-vector multipliers

Ahmet Tankut Caglar

Optical matrix-vector multipliers are known to suffer from low computational accuracy which is the major drawback preventing them from becoming a practical force in real world applications. Error-correction coding is one technique proposed to overcome this problem of low level accuracy. In this thesis, the effects of the application of multiple error-correction codes to optical matrix-vector multipliers are studied. For this purpose, many different cases were simulated on a computer. Noting that an optical matrix-vector multiplier performs the product y = Ax, basically four cases were considered; signal independent and signal dependent noise in the matrix A, and signal independent and signal dependent noise in the vector x. Two different error-correcting codes were simulated; one being a binary, multiple error-correcting BCH code and other being a non-binary, multiple error-correcting Reed-Solomon code, which is basically an extension of the binary BCH code. The advantages and disadvantages of switching from binary BCH codes to non-binary Reed-Solomon codes were investigated. Based on the results obtained from the simulations, the conditions under which the use of error-correction coding is feasible in optical matrix-vector multipliers are discussed.

•Jan 1, 1995•0 citations

Composite matched filtering with error correction

Robert J. Marks, Les Atlas

Information theory shows that one can communicate with arbitrarily low error probability over a noisy channel. By recognizing that some types of computations can be cast as communications problems, it may be possible to compute accurately with an inexact processor. Traditional analog optical processors, for example, offer advantages of parallelism and speed but suffer from significant inaccuracies. We propose an algorithm whereby the accuracy of matched filter processors can be improved significantly at the cost of a modest increase in computational resources. Errors that are due to noisy data and/or inexact computing can be detected and in some cases corrected.

Optics Letters•Feb 1, 1987•10 citations

Fault Tolerance Enhancements for Quantum Data Encodings

Aviraj Sinha, Mitchell Aaron Thornton

Data quality is an important factor in quantum computation, since quantum algorithms need high quality representations in order to run with low error rates. In addition, quantum algorithms benefit from different types of quantum data encodings that are tailored to specific applications. In order to improve data quality while maintaining data variety, this work applies fault tolerance techniques specific to different types of data encodings. Thus, fault tolerance improvements, aimed at reducing both noise and bias errors, are applied to two types of data encodings. The first type, angle encoding, benefits from an enhanced dynamic range representation. The second type, distribution encoding, is enhanced through the use of error correcting states. Our experiments encode classical data as a quantum state, apply noise simulations, and provide error analyses on the decoded data. Experimental results are assessed by comparing the post-processed output statistics to those of the original encodings and show improved accuracy through the inclusion of fault tolerance methods.

IEEE Dallas Circuits and Systems Conference (DCAS)•Apr 11, 2025•1 citation
Optical processors can perform complex calculations in parallel at high speeds. They commonly suffer, however, from low accuracy, which currently hinders their widespread use. Various models for the noise in optical processors have been developed.1 In addition, various techniques have been developed to improve their accuracy. One technique involves the use of error-detection and correction codes to improve the accuracy of optical linear algebra processors.2 This allows some of the errors that occur during computation to be detected and possibly corrected. These codes, developed earlier for data transmission and fault tolerance in electronic processors, can thus be used to improve accuracy. Many of the required encoding and decoding operations can be performed optically. Computer simulations of optical matrix-vector multipliers employing various error codes will be presented. They indicate that a significant improvement in accuracy can be obtained when they are compared with processors not employing error codes.
Optical algebraic processors can perform complex calculations in parallel and at high speeds. However, they commonly suffer from a low analog accuracy which hinders their widespread application. Error detection and correction codes provide one technique for improving the accuracy of optical algebraic processors. The use of these codes would allow some of the errors that may occur during a computation to be detected and possibly corrected. This paper describes the results of various computer simulations of optical matrix-vector multipliers employing error-correction codes. It discusses the application of convolutional codes to optical matrix-vector multipliers along with several block codes. Both binary and nonbinary codes are considered. The results indicate that a significant improvement in performance can be obtained when compared with processors not employing error-correction codes. Also, the type of noise, whether signal-independent or signal-dependent noise, has a significant effect on the performance of a matrix-vector multiplier employing an error code. The encoding and decoding operations required for the error codes can be performed optically.
Optical algebraic processors can perform complex calculations in parallel and at high speeds. However, they commonly suffer from a low analog accuracy which hinders their widespread application. Error detection and correction codes provide one technique for improving the accuracy of optical algebraic processors. The use of these codes would allow some of the errors that may occur during a computation to be detected and possibly corrected. This paper describes the results of various computer simulations of optical matrix-vector multipliers employing error-correction codes. It discusses the application of convolutional codes to optical matrix-vector multipliers along with several block codes. Both binary and nonbinary codes are not employing error-correction codes. Also, the type of noise, whether signal-independent or signal-dependent, has a significant effect on the performance of a matrix-vector multiplier employing an error code. The encoding and decoding operations required for the error codes can be performed optically.
Many disciplines, such as antenna beam-forming and \nadaptive optics, require the ability to perform high \nspeed matrix operations, which often can be reduced to a \nseries of matrix-vector products. Analog optical matrixvector \nprocessors (OMVP's) take advantage of the high \nspeed and parallelism of optics to rapidly compute \nmatrix-vector products. However, OMVP's suffer from a \nlow accuracy which currently hinders their widespread \napplication. Over the past decade, various techniques \nhave been introduced to achieve high accuracy computation \nwith OMVP's. This dissertation studies the application \nof error-correcting codes (ECC's) and the union of ECC's \nwith digital partitioning to achieve high accuracy computation. \nThe ability of ECC's to improve the performance \nof OMVP's is studied through the use of computer simulations. \nThe effect ECC's have on system throughput is \nalso studied. Digital partitioning is a new technique \nfor achieving high accuracy computations on analog \nOMVP's. One potential drawback of digital partitioning \nis its sensitivity to errors. Error-correcting codes can \nenhance the performance of the digital partitioning algorithm \nby reducing this sensitivity to errors. Computer \nsimulation results are presented showing the benefits of \nusing ECC's with digital partitioning. In addition, an \nanalysis of the time requirements for encoding and decoding \nthe ECC's and the effect on system throughput is \npresented.
Optical matrix-vector multipliers are known to suffer from low computational accuracy which is the major drawback preventing them from becoming a practical force in real world applications. Error-correction coding is one technique proposed to overcome this problem of low level accuracy. In this thesis, the effects of the application of multiple error-correction codes to optical matrix-vector multipliers are studied. For this purpose, many different cases were simulated on a computer. Noting that an optical matrix-vector multiplier performs the product y = Ax, basically four cases were considered; signal independent and signal dependent noise in the matrix A, and signal independent and signal dependent noise in the vector x. Two different error-correcting codes were simulated; one being a binary, multiple error-correcting BCH code and other being a non-binary, multiple error-correcting Reed-Solomon code, which is basically an extension of the binary BCH code. The advantages and disadvantages of switching from binary BCH codes to non-binary Reed-Solomon codes were investigated. Based on the results obtained from the simulations, the conditions under which the use of error-correction coding is feasible in optical matrix-vector multipliers are discussed.
Information theory shows that one can communicate with arbitrarily low error probability over a noisy channel. By recognizing that some types of computations can be cast as communications problems, it may be possible to compute accurately with an inexact processor. Traditional analog optical processors, for example, offer advantages of parallelism and speed but suffer from significant inaccuracies. We propose an algorithm whereby the accuracy of matched filter processors can be improved significantly at the cost of a modest increase in computational resources. Errors that are due to noisy data and/or inexact computing can be detected and in some cases corrected.
Data quality is an important factor in quantum computation, since quantum algorithms need high quality representations in order to run with low error rates. In addition, quantum algorithms benefit from different types of quantum data encodings that are tailored to specific applications. In order to improve data quality while maintaining data variety, this work applies fault tolerance techniques specific to different types of data encodings. Thus, fault tolerance improvements, aimed at reducing both noise and bias errors, are applied to two types of data encodings. The first type, angle encoding, benefits from an enhanced dynamic range representation. The second type, distribution encoding, is enhanced through the use of error correcting states. Our experiments encode classical data as a quantum state, apply noise simulations, and provide error analyses on the decoded data. Experimental results are assessed by comparing the post-processed output statistics to those of the original encodings and show improved accuracy through the inclusion of fault tolerance methods.