Patent Grant
12223294
The disclosure relates to a computer language and code for software application development, data compression, and use with conventional, optical, hybrid electro-optical and quantum computers.
For many years, computer languages and codes have used the binary number system and different series of zeros (0's) and ones (1's) to represent, manipulate, communicate, and store data and information. In 1963, the American Standard Code For Information Exchange (ASCII) developed the original ASCII code which included 128 characters and used 7 bit character encodings. The ASCII code was later succeeded in 1986 by the ISO/IEC 8859 code which expanded ASCII and used 8 bit character encodings. In 1991, the Unicode Consortium then published the first Universal Coded Character Set (USC) Unicode standard which has over 1.1 million possible code points available for use. The Unicode standard has since been updated many times and it is also synchronized with the work of the International Organization for Standardization (ISO) which develops and publishes international standards, and while not being identical with Unicode which is updated more frequently, the current version of ISO/IEC 10646 is largely consistent with Unicode.
In this regard, when using the binary number system each letter of the alphabet as well as other numbers, symbols, and operations are typically identified using at least 8 bits made of zeros (0's) and ones (1's) something which is known as one byte of information. Accordingly, to reproduce and communicate the simple phrase “Run Tag Run” requires at least 72 bits or 9 bytes of digital information. This digital information is most often communicated digitally in the form of a series of square waves with the top of the square wave which corresponds to its maximum amplitude being used to represent the number 1, whereas a portion of the signal having less amplitude or resting at zero is used to represent the value 0. The data is typically communicated, manipulated, and stored with the use of switches which can be either placed in an “on” and closed state which is typically represented by the number 1, or an “off” and open state which is often represented by the value 0 by using millions of small transistors which are included on a Central Processing Unit (CPU) logic chip or memory chip, or alternatively by using capacitors which can store an electrical charge. These transistor switches or capacitors are typically configured to indicate one of three different states or conditions, namely, an “and” state, an “or” state, or a “not” state. In this regard, typical laptop computers and other home computers are not configured today so as to be able to provide a state that represents the possibility of both 1 and 0, “and” and “or”, “yes” and “no”, or “maybe” at the same time. As a result, the use of the binary system in digital communication is associated in a long string or series of bits which are typically communicated and processed sequentially which can take considerable time and also consume substantial memory. Further, the use of the binary system for representing numbers and mathematical operations can result in certain inaccuracies. The present disclosure is directed to a computer language, and code for software application development which can replace and/or work in association with the binary number system and digital forms of communication.
The ability to make smaller and faster computer chips in order to enhance the performance of computers is beginning to hit certain limitations or barriers having to do with limited space. In this regard, one MegaHerz (MHz) equals 1,000,000 or one million cycles per second. One GigaHerz (GHz) equals 1,000,000,000 or one trillion cycles per second, one TeraHerz (THz) equals 1,000,000,000,000 cycles per second, and one PicoHerz (PHz) equals 0.000000000001_cycles per second. One picosecond is 10−12 and 000000000001 second, and one femtosecond is 10−15 and 0.000000000000001 second. The speed of light is 299,792,458 meters/second, thus light travels 299.792458 meters in one MHz cycle. One mm equals 1,000,000 nanometers (nm). A petabit equals a terabit times 1,000 which is 1,000,000,000,000,000 bits. A gigabyte contains 8,000,000,000 bits, and a terabyte equals 1,000.
Some individuals are calling the next stage of evolution in computer technology quantum computing. The quantum computing market is anticipated to reach 65 billion by 2030. In order to perform quantum computing various complex structures such as artificial neural networks composed of artificial neurons or nodes are being created which attempt to reproduce or emulate the complex structure and function of the human brain. A simple neural network typically includes an input layer, and hidden layer, and an output layer. Some neural networks and other structures associated with present efforts to create artificial intelligence can permit what is called quantum entanglement which is known to be the exchange of quantum information between two particles at a distance. Quantum superposition is different principle of quantum physics which holds that somewhat like waves in classical physics it is possible for two or more quantum states to be added together and superposed to create another valid quantum state, and that the resultant quantum state can be represented as a sum of two or more quantum states. In this regard, superposition is held to be the uncertainly of a particle being in several states at once which is called a superposition state. Accordingly, quantum computers which can include neural networks and are capable of producing entanglement and/or superposition can not only represent and process a “yes” or “no,” and/or “1” or “0” like conventional computers, but rather they can also process the possibility of “yes” and “no,” “1” and “0”, or “maybe.” The condition associated with both of these possibilities is called a superposition state. Accordingly, the data and information obtained from these quantum states is typically referred to as a quantum bit, or “qubit(s).” As the scale of conventional transistor making on silicon CPU's approaches the molecular and atomic level, and the desire for faster computing speeds using electrons in metal wires results in increases in heat production and energy use, the introduction of optical computers, hybrid electro-optical computers, and quantum computers holds promise for the future.
Optical computers which are sometimes also called photonic computers are being developed for performing complex and high speed quantum computing. In order to perform optical computing, it is necessary to have an optical processor, fiber optic cable, and optical storage. Instead of using electrons, an optical computer uses photons, that is, a form of light in the electromagnetic spectrum to communicate data and information, perform calculations, and to persist and store information in memory. In this regard, photons can move about 20 times faster than electrons, and photons do not suffer the resistance of electrons which instead move in metallic wires something which produces heat and requires greater energy consumption. There are two kinds of optical computers, that is, pure or complete optical computers, and electro-optical hybrid computers.
Visible light falls in the range of the electromagnetic spectrum between ultraviolet and infrared light. Visible light frequencies are between about 4×1014 and 8×1014 cycles per second (Hz) which is about 430-750 trillion Hz (THz) and have wavelengths in the range between approximately 380-740 nanometers (nm). The ultraviolet light spectrum includes wavelengths in the range between approximately 10 nm and 400 nm which corresponds to frequencies in the range between approximately 30 PHz-750 THz. The infrared light spectrum includes wavelengths in the range between approximately 700 nm-1 mm and corresponds to frequencies in the range between approximately 430 THz-300 GHz. In this regard, it is known that there can be some overlap as between the visible light spectrum and the infrared and ultraviolet light spectrums. Visible light frequencies and wavelengths correspond in duration of time to about 2 femtoseconds.
The University of California at Santa Barbara (UCSB) is one of the leading centers of optical computing research and development here in the United States. A number of companies including D-Wave Systems, Inc., Honeywell International, Inc., Google, IBM, Intel, Microsoft, and Xanadu Quantum Technologies, Inc. are working on making quantum computers. D-Wave Systems located in British Columbia, Canada has one of the largest patent portfolios in this subject area and can provide quantum computer products and services for the general public. At the present time, the leader in making a practical optical quantum computer is believed to be Xanadu Quantum Technologies, Inc. located in Toronto, Canada. The Xanadu X8 quantum photonic processor has been made available online. The Xanadu X8 photonic processor can be programmed using “Strawberry Fields,” which is Xanadu's Python library for simulating and running programs on photonic quantum hardware and “PennyLane” which is the company's Python library for quantum machine learning and computing. In this regard, see the article published online in the IEEE Spectrum entitled “In the Race to Hundreds of Qubits, Photons May Have Quantum Advantage, by Charles Q. Choi, on Mar. 5, 2021: https://spectrum.ieee.org/race-to-hundreds-of-photonic-qubits-xanadu-scalable-photon.
U.S. patents relating to optical computers and/or quantum computers include: U.S. Pat. Nos. 11,182,230, 11,157,817, 11,138,511, 11,127,893, 11,105,866, 11,100,418, 11,100,416, 11,093,440, 11,064,637, 11,062,227, 11,042,811, 11,038,095, 11,031,537, 11,023,821, 11,010,683, 10,991,755, 10,938,346, 10,922,381, 10,897,068, 10,891,554, 10,885,459, 10,817,796, 10,789,540, 10,789,329, 10,769,545, 10,755,190, 10,748,079, 10,700,256, 10,691,633, 10,671,937, 10,657,198, 10,621,140, 10,599,988, 10,552,757, 10,552,755, 10,528,886, 10,489,477, 10,468,793, 10,467,545, 10,467,543, 10,454,015, 10,453,894, 10,378,803, 10,346,508, 10,346,349, 10,326,071, 10,318,881, 10,290,798, 10,275,422, 10,268,622, 11,182,230, 11,157,817, 11,138,511, 11,127,893, 11,105,866, 11,100,418, 11,100,416, 11,093,440, 11,064,637, 11,062,227, 11,042,811, 11,038,095, 11,031,537, 11,023,821, 11,010,683, 10,991,755, 10,938,346, 10,922,381, 10,897,068, 10,891,554, 10,885,459, 10,817,796, 10,789,540, 10,789,329, 10,769,545, 10,755,190, 10,748,079, 10,700,256, 10,691,633, 10,671,937, 10,657,198, 10,621,140, 10,599,988, 10,552,757, 10,552,755, 10,528,886, 10,489,477, 10,468,793, 10,467,545, 10,467,543, 10,454,015, 10,453,894, 10,378,803, 10,346,508, 10,346,349, 10,326,071, 10,318,881, 10,290,798, 10,275,422, 10,268,622, 8,032,474, 8,018,244, 8,008,991, 8,008,942, 7,990,662, 7,984,012, 7,969,805, 7,932,515, 7,899,852, 7,898,282, 7,880,529, 7,877,333, 7,876,248, 7,870,087, 7,844,656, 7,843,209, 7,800,395, 7,788,192, 7,687,938, 7,639,035, 7,624,088, 7,619,437, 7,613,765, 7,613,764, 7,605,600, 7,533,068, 7,418,283, 7,335,909, 7,332,738, 7,307,275, 7,268,576, 7,253,654, 7,230,266, 7,135,701, 7,042,005, 7,018,852, 7,015,499, 7,002,174, 6,987,282, 6,979,836, 6,960,780, 6,943,368, 6,936,841, 6,930,320, 6,919,579, 6,911,664, 6,905,887, 6,900,456, 6,900,454, 6,897,468, 6,885,325, 6,822,255, 6,812,484, 6,803,599, 6,791,109, 6,784,451, 6,753,546, 6,728,131, 6,670,630, 6,627,916, 6,627,915, 6,614,047, 6,605,822, 6,580,102, 6,576,951, 6,573,202, 6,563,311, 6,563,310, 6,537,847, 6,504,172, and 6,459,097 which are assigned to D-Wave Systems, Inc.; U.S. Pat. Nos. 10,997,522, 10,951,002, 10,804,871, 10,760,954, 10,733,524, 10,340,052, 10,145,792, 9,766,071, 9,715,950, 9,588,047, 8,426,871, and 4,128,843 which are assigned to Honeywell International, Inc.; U.S. Pat. Nos. 11,177,912, 11,177,375, 11,158,731, U.S. 11, 158,714, 11,107,891, U.S. Pat. Nos. 11,101,352, 11,075,293, 11,063,138, 10,991,802, 10,992,166, 10,635,990, and 6,661,943 which are assigned to the Intel Corporation; U.S. Pat. No. 8,064,065 assigned to Lawrence Livermore National Security, LLD.; U.S. Pat. Nos. 11,188,842, 11,170,302, 11,157,828, 11,151,470, 11,138,354, 11,132,617, 11,127,820, 11,121,303, 11,120,359, 11,119,773, 11,113,084, 11,081,634, 11,010,684, 11,010,682, 11,010,450, 11,004,008, 10,997,337, 10,990,677, 10,972,133, 10,963,125, 10,879,464, 10,860,759, 10,846,608, 10,811,587, 10,777,605, 10,740,689, 10,699,209, 10,699,208, 10,692,010, 10,665,701, 10,664,761, 10,664,249, 10,651,808, 10,635,988, 10,574,268, 10,546,621, 10,496,933, 10,490,600, 10,469,087, 10,430,162, 10,423,887, 10,417,370, 10,411,713, 10,374,610, 10,366,339, 10,346,761, 10,346,348, 10,331,163, 10,320,394, 10,320,360, 9,256,834, 9,152,924, 8,581,227, 7,598,514, 7,566,896, 7,518,138, 7,394,092, 7,376,547, 7,321,131, 7,250,624, and 7,109,593 which are assigned to the Microsoft corporation also known as Microsoft Technology Licensing, LLC.; U.S. Pat. No. 10,586,566 which is assigned to Sony Interactive Entertainment, Inc.; U.S. Pat. Nos. 9,246,602, and 8,744,075 which are assigned to the Sony Corporation; U.S. Pat. No. 6,823,140 assigned to Sun Microsystems, Inc.; U.S. Pat. Nos. 11,125,773, 11,003,046, 10,809,592, 10,520,024, and 10,272,400 assigned to Xanadu Quantum Technologies, Inc. of Toronto, Canada; and all of the patents recited in this paragraph are hereby incorporated by reference herein.
The JAVA computer language is believed to be one of the best for software program application development, and so the following list of U.S. patents originally assigned to Sun Microsystems, Inc. which developed JAVA is provided: U.S. Pat. Nos. 7,685,430, 7,650,505, 7,647,415, 7,634,779, 7,584,302, 7,574,710, 7,565,647, 7,548,946, 7,546,605, 7,543,288, 7,533,156, 7,451,393, 7,426,721, 7,421,687, 7,409,439, 7,398,533, 7,370,322, 7,318,128, 7,305,671, 7,296,235, 7,290,045, 7,266,822, 7,266,816, 7,246,345, 7,246,134, 7,243,356, 7,228,533, 7,219,331, 7,210,127, 7,209,960, 7,197,750, 7,181,724, 7,177,934, 7,167,894, 7,165,108, 7,162,711, 7,159,213, 7,155,501, 7,131,120, 7,131,111, 7,130,773, 7,117,489, 7,096,467, 7,069,554, 7,065,747, 7,058,934, 7,055,133, 7,054,890, 7,043,738, 7,043,732, 7,039,904, 7,016,966, 7,003,778, 7,000,235, 6,996,824, 6,996,587, 6,986,129, 6,983,465, 6,981,246, 6,980,979, 6,978,456, 6,978,401, 6,976,061, 6,964,033, 6,961,933, 6,961,843, 6,959,430, 6,957,428, 6,957,427, 6,951,014, 6,934,946, 6,934,726, 6,922,796, 6,918,109, 6,912,569, 6,901,591, 6,898,786, 6,889,227, 6,886,157, 6,877,111, 6,862,674, 6,850,953, 6,839,647, 6,823,504, 6,804,681, 6,799,185, 6,772,178, 6,766,349, 6,754,796, 6,751,790, 6,745,387, 6,742,006, 6,721,777, 6,711,739, 6,651,140, 6,637,021, 6,633,876, 6,542,900, 6,466,974, 6,446,084, 6,430,567, 6,427,153, 6,418,444, 6,407,759, 6,401,134, 6,366,898, 6,349,333, 6,308,315, 6,282,568, 6,260,078, 6,260,077, 6,253,256, 6,233,582, 6,223,346, 6,216,227, 6,141,794, 6,134,627, 6,134,600, 6,122,745, 6,070,239, 6,061,520, 6,058,482, 6,044,218, 6,026,485, 6,003,038, 5,966,542, 5,925,123, 5,815,718, 5,754,857, 5,706,502, 5,692,047, U.S. RE 38104, and all of these U.S. patents are hereby incorporated by reference herein.
In 2010, Sun Microsystems, Inc. was purchased by the Oracle Corporation which has continued to develop the JAVA computer language and related software program applications and the following list of U.S. patents relating to JAVA which are assigned to the Oracle Corporation is provided: U.S. Pat. Nos. 10,826,975, 10,558,434, 10,547,664, 10,476,938, 10,474,998, 10,373,139, 10,324,692, 10,268,456, 10,229,032, 10,225,323, 10,133,827, 10,127,259, 10,103,946, 10,049,127, 9,971,618, 9,930,129, 9,880,938, 9,875,122, 9,843,629, 9,811,359, 9,740,597, 9,667,430, 9,648,084, 9,626,488, 9,600,546, 9,588,742, 9,552,277, 9,542,222, 9,519,466, 9,509,745, 9,467,355, 9,448,928, 9,430,222, 9,417,992, 9,411,566, 9,239,814, 9,231,995, 9,213,562, 9,185,054, 9,183,013, 9,177,033, 9,171,096, 9,160,749, 9,141,539, 9,058,471, 9,043,768, 9,037,542, 8,978,023, 8,959,485, 8,959,106, 8,924,789, 8,881,099, 8,875,113, 8,875,094, 8,863,126, 8,856,805, 8,856,460, 8,856,294, 8,850,412, 8,838,669, 8,832,710, 8,826,246, 8,813,031, 8,806,493, 8,805,896, 8,799,885, 8,793,670, 8,776,053, 8,732,191, 8,713,546, 8,695,006, 8,639,787, 8,635,660, 8,635,185, 8,627,328, 8,615,734, 8,601,447, 8,572,579, 8,566,826, 8,555,264, 8,533,383, 8,495,107, 8,490,120, 8,463,852, 8,429,650, 8,387,076, 8,365,157, 8,332,835, 8,321,450, 8,316,083, 8,261,269, 8,255,680, 8,250,572, 8,245,206, 8,219,609, 8,196,128, 8,195,721, 8,180,746, 8,156,482, 8,082,489, 8,046,772, 8,032,872, 7,962,925, 7,962,902, 7,962,527, 7,953,773, 7,949,760, 7,925,952, 7,921,169, 7,873,979, 7,873,951, 7,870,112, 7,840,967, 7,840,939, 7,827,535, 7,814,472, 7,802,240, 7,802,239, 7,793,255, 7,788,489, 7,784,043, 7,752,626, 7,730,523, 7,730,492, 7,720,877, 7,716,339, 7,716,274, 7,644,403, 7,490,330, 7,461,395, 7,454,428, 7,346,889, 7,032,216, 6,873,984, 6,854,114, and all of these U.S. patents are hereby incorporated by reference herein.
The following patents which relate to the JAVA computer language and related software programs are assigned to the Intel Corporation, Inc.: U.S. Pat. Nos. 7,191,453, 6,928,456, 6,854,122, 6,611,864, 6,484,188, 6,370,685, 6,317,869, 6,289,506, 6,289,504, 6,170,083, 6,158,048, 6,131,191, 6,093,216, and all of these U.S. patents are hereby incorporated by reference herein.
The following patents which relate to the JAVA computer language and related software programs are assigned to the Microsoft Corporation: U.S. Pat. Nos. 10,115,116, 8,965,950, 8,661,407, 7,739,665, 7,546,590, 7,480,921, 7,194,729, 6,996,826, 6,981,255, 6,748,588, 6,665,865, 6,625,803, 6,522,343, 6,504,554, 6,499,035, 6,484,312, 6,484,311, 6,415,334, 6,367,012, 6,349,344, 6,230,172, 6,229,537, 6,173,317, 6,035,119, 6,006,241, 6,003,050, 5,920,720, 5,892,904, and all of these U.S. patents are hereby incorporated by reference herein.
The following patents several of which relate to computer languages, software programs and the enforcement of licensing agreements are assigned to Apple, Inc.: U.S. Pat. Nos. 9,952,841, 8,781,971, 8,452,712, 8,027,925, 7,900,215, 7,448,042, and 6,188,995, and all of these U.S. patents are hereby incorporated by reference herein.
Other patents relating to computer languages include: U.S. Pat. No. 10,606,568 assigned to Alibaba Group Holding Limited, U.S. Pat. No. 9,804,946 assigned to Oracle International Corporation, U.S. Pat. No. 7,509,631 originally assigned to Bea Systems, Inc., U.S. Pat. No. 7,240,338 assigned to ITT Manufacturing Enterprises, Inc., U.S. Pat. No. 7,047,524 assigned to Hyperformix, U.S. Pat. No. 6,230,182 assigned to the Hewlett-Packard Company, U.S. Pat. No. 6,031,993 assigned to the Tandem Company, and U.S. Pat. No. 5,247,693 assigned to the Foxboro Company, and all of the U.S. patents are hereby incorporated by reference herein.
In the future, whether computing will include and be called optical computing, electro-optical computing, or quantum computing, and the information which is communicated be called waves, vibes, or qubits, that is, instead of bits which have been associated with digital information, there is need for a computer language for software application development which can communicate data and information optically using photons in sine wave form. Further, there is a need for a computer language which can communicate information using a hybrid combination of optical and digital signals. In addition, there is a need for a computer language which can represent and communicate words, numbers, and operations using fewer bits than the binary digital system, and also for data compression which can permit faster communication and processing of data and information. Moreover, there is need for a computer language and related computer software application that is easy for members of the public to understand and use.
Human beings do not normally process information in a binary manner with the input and output being communicated in a string of information one bit at a time. Seeing, hearing and speaking are things which all happen in a frequency domain. We constantly process information from multiple sensory sources, actions, and events at the same time. Accordingly, a computer language which permits similar multitasking is conducive to optical and quantum computing, the use of neural networks which can permit entanglement, superposition, and the making and use of artificial intelligence. The present disclosure is directed in to a computer language and code for software application development, data compression, and computers which can perform conventional, but also optical, hybrid electro-optical, and/or quantum computing. This language can permit data and information to be converted to and from other existing computer languages which are typically communicated using the binary number system, and also devices, methods, and processes which presently use electronic signals and digital means of communication.
A first aspect of the present disclosure is a method of making a computer language which includes providing a dictionary including a list including a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each member of the plurality being represented by a corresponding wave form having a specific frequency and wavelength.
Optionally, the wave form is in the electromagnetic spectrum.
Optionally, the wave form is a photonic wave in the visible light spectrum and/or invisible portion of the infrared light spectrum.
Optionally, the wave form is a sine wave.
Optionally, the wave form is an electronic wave.
Optionally, the wave form is a square wave.
Optionally, the wave form is a product of data compression.
Optionally, the list of alphabetic letters and/or words further includes a plurality of sub-lists including the following categories: noun, verb, adjective, adverb, pronoun, preposition, conjunction, determiner, and exclamation.
Optionally, the plurality of member numbers are represented by a first wave form having a first frequency and wavelength which represents the base portion of a specific number, and a second wave form having a second frequency and wavelength which represents the exponent portion of the specific number, whereby the value of the specific number can be represented and communicated.
Optionally, a difference exists in time and/or space between the start of the first wave form and the second wave form and the second wave form is substantially identical in amplitude and shape to the first wave form, but the second wave form is phase shifted relative to the first wave form, and the first wave form represents the base portion of the specific number, and the amount to which the second wave form is phase shifted in time and/or space represents the value of the exponent corresponding to the specific number, whereby the value of the specific number can be represented and communicated.
Optionally, the absence of a break between two of the plurality of member numbers which are represented and/or communicated in a series represents a mathematic function of addition.
Optionally, the absence of a break between two of the plurality of member numbers which are represented and/or communicated in a series represents a mathematical function of multiplication.
Optionally, a break between two of the plurality of member letters and/or words and/or numbers and/or symbols represents a separation between the plurality member letters and/or words and/or numbers and/or symbols.
Optionally, the presence of a wave form representing a symbol disposed between two of the plurality of member numbers represents a mathematical function and operation between the member numbers.
A second aspect of the present disclosure includes a method of making a computer language for representing any positive number using the values and numbers 0, 1, 2, 2nth exponential power, 3, and 3nth exponential power and/or a sum of two or more of these values and numbers.
A third aspect of the present disclosure includes a method of making a computer language for representing and communicating values or numbers, each of the values or numbers including a base portion consisting of one or more of the following 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, and an exponent portion, the base portion being represented and communicated by a wave form having a first frequency and wavelength, said exponent portion being represented by a second wave form having a second frequency and wavelength, wherein a difference exists in time and/or space between the start of the first wave form and the second wave form, and the second wave form is substantially identical in amplitude and shape to the first wave form, and the second wave form is phase shifted relative to the first wave form, and the amount to which the second wave form is phase shifted in time and/or space represents and communicates the exponent, whereby said values or numbers can be represented and communicated.
Optionally, the first wave form and the second wave form comprise square waves.
Optionally, the first wave form and the second wave form comprise sine waves.
Optionally, the first wave form and the second wave form have different frequencies and wavelengths.
A fourth aspect of the present disclosure includes a method of making a computer language for representing and communicating a value or number in a known base number system, the value or number having a base portion equal to the known base number in the known base number system and an exponent portion having a value obtained from a list in a table of algorithms, the known base number in the known base number system and the exponent portion being configured to be manipulated by a mathematical function by which a resultant wave form having a specific wavelength is derived to represent and communicate the value or number.
Optionally, the base number in the known base number system is the number 10 in the base 10 number system.
Optionally, the base number in the known base number system is the natural logarithm value e.
A fifth aspect of the present disclosure includes an optical keyboard configured to communicate data and information using visible light and/or infrared light.
A sixth aspect of the present disclosure includes an optical game controller configured to communicate data and information using visible light and/or infrared light.
A seventh aspect of the present disclosure includes a computer keyboard including means for producing an output including photons and a plurality of sine waves in the visible light spectrum and/or invisible portion of the infrared light spectrum, the output including representations of a plurality of alphabetical letters and/or words and/or numbers and/or symbols and/or commands and/or functions and/or operations, the output being communicated by fiber optic cable to a computer selected from the group of computers consisting of an electronic computer, an optical computer, an electro-optical computer, and a quantum computer.
An eighth aspect of the present disclosure includes a method of communicating a computer language including providing a dictionary including a list including a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each of the plurality of member alphabetical letters and/or words and/or numbers and/or symbols being represented by a corresponding wave form having a specific frequency and wavelength.
A ninth aspect of the present disclosure includes a computer language including a dictionary including a list of a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each of the plurality of member alphabetical letters and/or words and/or numbers and/or symbols being represented by a corresponding wave form having a specific frequency and wavelength.
A tenth aspect of the present disclosure includes a method of making a computer language including selecting a value or number X in a base number system consonant with a logarithmic function and expression Logbn=X, where b is the base portion of a number in the base number system, and where n is the exponent portion of the number in the base number system to which b is raised to produce the value or number X, taking and using n as a first factor, and multiplying n by at least a second factor to yield a specific frequency and associated wavelength in a portion of the electromagnetic spectrum.
An eleventh aspect of the present disclosure includes a method of making a computer language including selecting a value or number X in a base number system consonant with a logarithmic function and expression Logbn=X, where b is the base portion of a number in the base number system, and where n is the exponent portion of the number in the base number system to which b is raised to produce the value or number X, taking and using n as a first factor, and randomly generating a third factor, and multiplying n as the first factor by a second factor and the third factor to yield a specific frequency and associated wavelength in a portion of the electromagnetic spectrum. Further, the portion of the electromagnetic spectrum can be a portion of the visible light spectrum and/or infrared light spectrum.
A twelfth aspect of the present disclosure includes a method of making a computer language including selecting a plurality of wave forms corresponding to specific frequencies and associated wavelengths in the visible light spectrum and/or invisible portion of the infrared light spectrum, and combining at least two of the plurality of wave forms corresponding to specific frequencies and wavelengths to create a coding point. Alternatively, at least four of the plurality of wave forms can be combined to create a coding point. In this regard, a coding point can be used to represent at least one of an alphabetical letter, a word, a number, a symbol, a command, a function, and an operation. Further, at least two of the plurality of wave forms can be combined to form a plurality of sets, and the plurality of sets can be disposed in series and/or in parallel to provide a plurality of coding points. In addition, the number of permutations of the plurality of coding points can correspond to the formula: Permutations=(Number of Sets)!/(Number of Sets-2)!, and the number of combinations of the coding points can correspond to the formula: Combinations=(Number of Sets)!/2!×(Number of Sets-2)!
When using the binary system in digital communication each letter of the alphabet, as well as other numbers, symbols, and operations, are each identified using at least 8 bits made of zeros (0's) and ones (1's) which is also known as one byte of information. Accordingly, to reproduce and communicate the simple phrase “Run Tag Run” requires at least 72 bits or 9 bytes of digital information. This digital information is most often communicated in the form of a series of square waves with the top of a square wave which corresponds to its maximum amplitude being used to represent the number 1, whereas a portion having less amplitude or resting at zero is used to represent the value 0. As a result, the use of the binary system in digital communication can result in a long string or series of bits which are communicated sequentially and this can consume substantial memory.
Morse Code is an example of a different binary system which uses only 5 bits to represent numbers between 1-10 as shown below:
Morse code is a different binary system than the one which is typically being used today in digital communication which uses ones (1's) and zeros (0's). However, it is possible to send morse code using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a single sine wave or a short burst and transmission of sine waves to represent a dot, and either a longer burst and transmission of sine waves or no burst and transmission of light to represent a dash, or vice-versa. Alternatively, when using a conventional electronic computer, morse code can be sent using wires and a digital system to a computer by using a single square wave or a short burst and transmission of square waves to represent a dot, and either a longer burst or no burst of square waves to represent a dash. This method of communication resembles sending morse code by using a flashlight and turning it on and off for different durations of time.
Further, it is possible to send morse code using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a sine wave having greater amplitude or intensity to represent a dot, and a sine wave having the same frequency and wavelength, but having less amplitude or intensity to represent a dash, or vice-versa. Alternatively, when using a conventional electronic computer, morse code can be sent using wires and the digital system to a computer by using a single square wave or a short burst and transmission of square waves having greater amplitude or intensity to represent a dot, and a square wave or a short burst and transmission of square waves having the same frequency and wavelength, but having less amplitude or intensity to represent a dash, or vice-versa. This method of communication would resemble sending morse code using two flashlights with one being noticeably brighter than the other, or using one flashlight which has two different brightness settings.
In addition, it is possible to send morse code using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a sine wave having a specific frequency and wavelength of light to represent and communicate a dot, and a different sine wave having a different specific frequency and wavelength of light to represent and communicate a dash. Alternatively, when using a conventional electronic computer, morse code can be sent using wires and the digital system to a computer by using a single square wave or a short burst and transmission of square waves having one frequency and wavelength to represent a dot, and a different square wave or a short burst and transmission of square waves having a different frequency and wavelength to represent a dash, or vice-versa. This method of communication would resemble using two flashlights having two different colors.
Generally similar methods to those just described with reference to morse code can also be used to communicate the ones (1's) and zeros (0's) associated with the binary number system which is typically being used in digital communication. In this regard, it is possible send digital information using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a single sine wave or a short burst and transmission of sine waves and light to represent a one (1), and either a longer burst and transmission of light or no burst and transmission of sine waves to represent a zero (0), or vice-versa. Alternatively, when using a conventional electronic computer, digital information can be sent using wires to a computer by using a single square wave or a short burst and transmission of square waves to represent a one (1), and either a longer burst or no burst of square waves to represent a zero (0). This method resembles sending digital information by using a flashlight and turning it on and off for different durations of time.
Further, it is possible to send digital information using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a sine wave having greater amplitude or intensity to represent a one (1), and a sine wave having the same frequency and wavelength, but having less amplitude or intensity to represent a zero (0), or vice-versa. Alternatively, when using a conventional electronic computer, digital information can be sent using wires to a computer by using a single square wave or a short burst and transmission of square waves having greater amplitude or intensity to represent a one (1), and a square wave or a short burst and transmission of square waves having the same frequency and wavelength, but having less amplitude or intensity to represent a zero (0), or vice-versa. This method of communication would resemble sending digital information using two flashlights with one being noticeably brighter than the other, or using one flashlight which has two different brightness settings.
In addition, it is possible to send digital information using visible light or invisible light in the infrared portion or other invisible portion of the electromagnetic spectrum to a computer using fiber optical cable by using a sine wave having a specific frequency and wavelength of light to represent and communicate a one (1), and a different sine wave having a different specific frequency and wavelength of light to represent and communicate a zero (0). Alternatively, when using a conventional electronic computer, digital information can be sent using metal wires to a computer by using a single square wave or a short burst and transmission of square waves having one frequency and wavelength to represent a one (1), and a different square wave or a short burst and transmission of square waves having a different the frequency and wavelength to represent a zero (0), or vice-versa. This method of communication would resemble using two flashlights having two different colors.
If and when values or conditions other than 1 or 0 are desired or required when using digital communication, it can be possible to use three or more square waves having different positive amplitudes to represent those different values or conditions. For example, 1=yes or true can be communicated by a square wave having an amplitude “a”, and 0=no or false can be communicated by a flat line having no amplitude resting at 0 or other amplitude “b”, and maybe and the expression and/or can be communicated by a square wave having a different amplitude “c.” However, this method would take more time and energy for a computer to process. Alternatively, it is possible to communicate 1, 0, and maybe and/or by using sine waves having different amplitudes and/or different frequencies and wavelengths using photons and light in the visible light spectrum and/or the infrared light spectrum, or other portion of the invisible electromagnetic light spectrum, as discussed below.
Instead of flashlights, LED lights and lasers are typically used to communicate information over fiber optical cables in modern digital communication. In this regard, there are three basic ways of modulating binary data including ones (1's) and zeros (0's), namely, amplitude shift keying (ASK), phase shift keying (PSK), and frequency shift keying (FSK). As discussed in the article entitled “Understanding Modern Digital Modulation Techniques,” by Lou Frenzel, published Jul. 14, 2021 on the ElectronicDesign website: https://www.electronicdesign.com/technologies/communications/article/21798737/understanding-modern-digital-modulation-techniques, and also the article “Coherent Binary Modulation techniques” published online by an unknown author, date unknown, on the website: https://ee/eng.usm.my/eeacad/mandeep/EEE436/Chp%204.pdf, with reference to radio frequency communication and digital communication, there are two types of amplitude modulation, namely on-off keying (OOK) which is like turning a flashlight on and off to communicate morse code, and in this case ones (1's) and zeros (0's) associated with the binary number system, and amplitude shift keying (ASK) which resembles sending digital information using two flashlights with one being noticeably brighter than the other or using one flashlight which has two different brightness settings. The latter kind of modulation is sometimes called intensity modulation or amplitude modulation (AM).
Another form of digital communication is frequency shift keying (FSK) and a popular version of this is called minimum shift keying (MSK) in which a higher frequency is used to indicate and represent what is called a mark which could identify a one (1), and another lower frequency is used to indicate and represent what is called a space which can be used to identify a zero (0). The use of Gaussian low pass filters with (MSK) which is sometimes indicated as (GMSK) has been used to improve the spectral efficiency of communication on cell phones.
Other methods of digital modulation include binary phase shifting keying (BPSK) which shifts the carrier wave 180 degrees for each change in the binary state when indicating ones (1's) and zeros (0's) so that the starting and ending points of the different values begin and end at zero on the reference line, and differential (BPSK) or (DPSK) which compares the phase of the received bit of information with the phase of the previously received one. Alternatively, a variation of BPSK known as quadrature PSK (QPSK) produces two carrier signals orientated 90 degrees apart, and the binary data then modulates each phase to produce four sine signals shifted by 45 degrees from one another. This permits twice as much data to be transmitted.
Quadrature amplitude modulation (QAM) uses four carrier phases and two amplitude levels, and there exist 16QAM, 64QAM, and 256QAM variations which can transmit more bits per symbol by using a mix of different amplitudes and phases. In this regard, see the document entitled: “Lesson 21, Digital Modulation U.S. Naval Academy,” published by an unknown author, date unknown, on the website: http://www.usna.edu/ECE/ec312/Lessons/wireless/EC312_Lesson_21_Digital_Modulation_Course_No tes.pdf, which provides a discussion and illustrations showing the different basic ways of modulating binary data including ones (1's) and zeros (0's) in modern digital communication. The QAM method has been used with regards to cable television, and also with wireless communication such as cell phones. A hybrid form of PSK and QAM known as amplitude phase shift keying (APSK) which uses two different amplitudes and 16 different phase positions has been used in satellite communication. Orthogonal frequency division multiplexing (OFDM) is a combination of modulation and also multiplexing which creates many different sub-channels which are orientated in an orthogonal configuration within a given transmission channel, and this is one of the most widely used forms of digital communication being used today in digital subscriber line (DSL) and 4G cellular systems.
Representing Letters and Words
The current Webster's dictionary includes about 470,000 words, and the concise Oxford dictionary includes between about 171,476 words. However, it has been estimated that most individuals only have knowledge of about 15,000-20,000 word families which are called lemmas in their native language, and individuals seldom have knowledge of more than 2,000-3,000 word families in a foreign language. Accordingly, a concise dictionary for use with a computer language can include less than 20,000 lemmas, and even less than 5,000 lemmas. If even only 1,000 or 2,000 and certainly less than 3,000-5,000 alphabetical letters, words, symbols, and numbers are each individually assigned and coded in order to be represented and communicated in the form of a square wave or a sine wave having a specific frequency and wavelength, then the amount of data in bits, waves, vibes, qubits, or whatever name or form would be given to the data and information, can possibly be decreased by over 75%. The following two websites having 1000 and 3000 word lists include the most commonly used words in English: https://gonaturalenglish.com; and, http://basicenglishspeaking.com. According to the website http:/lbasicenglishspeaking.com: “If you know these 3000 most common words, you can understand at least 95% of all conversations, e-mails, newspapers, and books.” This is one way to create faster computers which do not consume as much time and energy as they do today, that is, if the desire is to make computers 20 times faster, then one way to accomplish this is to make a new computer language which uses a lot less data in order to communicate the same information.
The following word classes exist in the English language: noun, verb, adjective, adverb, pronoun, preposition, conjunction, determiner, and exclamation. In this regard, a list of words which can be subdivided into these subclasses can be selected, and also a list of symbols, a list of numbers, and a list of key words or terms relating to computer programming language and operations can be selected, listed, and compiled for making the computer language. In this regard, a formal computer language can include and/or be used to create a construction language, a command language, a configuration language, a programming language, a query language, a transformation language, a data exchange language, a markup language, a modeling language, an architecture description language, a hardware description language, a printed page language, a simulation language, a specification language, a sheet style language, a domain-specific language, a general-purpose language, a natural language processing language.
In the Java computer programming language, the following words are keywords which have a special meaning: abstract, assert, Boolean, break, byte, case, char, class, const, continue, default, do, double, else, enum, extends, false, final, finally, float, for, goto, if, implements, import, instanceof, int, interface, long, native, new, null, package, synchronized, this, throw, throws, transient, true, try, void, volatile, while, and these and other keywords and terms can be coded in order to be represented by individual square or sine wave forms having a specific frequency and wavelength. Further, in the JAVA computer programming language the following operators are used to perform arithmetic, assign values, and compare values: +, −,*, /, %, ++, −, +, +=, −=,*=, /=, %=, ==, =, >, >=, <, =, and these and other operators can be coded in order to be represented by individual square or sine wave forms having a specific frequency and wavelength.
The present disclosure is directed to a computer language for software application development which is not dependent or necessarily based on the binary system that is now commonly being used in electronic digital communication. The computer language which is being disclosed can be communicated with the use of photons and sine waves in the visible and/or invisible portion of the electromagnetic light spectrum. Alternatively, the computer language can be communicated with the use of electrons and in an electronic form using square waves, or other wave forms. Alternatively, the computer language can be communicated in a hybrid form with the use of photons and sine waves in the visible and/or invisible portion of the electromagnetic light spectrum, and in combination with electrons using electronic square waves, or other wave forms.
When the amplitude of a wave is being modulated using square or sine waves it can be thought of as a form of amplitude modulation (AM), that is, even though the signal may not be broadcast using radio waves which is the most common association that most people would have with the term amplitude modulation. It is possible to communicate capital letters and the other symbols on a keyboard which are normally made with the use of the shift, alt, ctrl, and function keys by using amplitude modulation, and to have this method and process match to the character map and ROM, RAM, and/or Flash memory, Solid State Drive (SSD) memory, or other means of persisting data and information associated with the integrated circuit present on a keyboard and/or computer.
Again, the simple phrase “Run Tag Run” requires at least 72 bits or 9 bytes of digital information using conventional 0's and 1's. However, the letter “r” can be alternatively be represented using a square wave or sine wave having an amplitude and a specific frequency and wavelength. In this regard, the same amplitude of a square wave or sine wave can be used to represent all of the letters, capital letters, symbols, numbers, and operations normally provided on a keyboard, but the frequency and wavelength of the wave can be varied to represent and identify the specific letter, capital letter, symbol, number, or operation. Moreover, frequency modulation can not only be used to identify letters, capital, letters, symbols, numbers, and operations, but also entire words. An entire word can be communicated by a single square or sine wave. As shown in
If the desire is to operate at high speeds in the MHz, GHz, or THz range, or even faster, the frequency and wavelength of the square wave or sine wave to be used is configured to provide information within the desired frequency range and the intended or desired speed of communication. For example, the letter “a” can be identified and encoded by a square or sine wave having a frequency of 1 MHz. All of the words included in a selected dictionary which is listed in the associated software program that would start with the letter “a” can also be assigned square or sine waves having different frequencies between 2 and let's say 200 hundred MHz. Alternatively, a different range could be used to include however many words will be included in the dictionary which begin with the letter “a.” The same thing can also be done for every other letter and word in the dictionaryB-Z. Alternatively, the listing, assignment and encoding of alphabetical letters, words, symbols, numbers, and operations, can be done at higher frequencies and shorter wavelengths in the GHz or THz range. When using photons in the visible or invisible light spectrum to communicate data and information and possibly then also perform optical and quantum computing, the typical frequencies for use can be in the GHz and THz range.
When one square wave is being used to communicate one piece of information using a digital process it is normally called one bit of information. Alternatively, when a photon and sine wave corresponding to the visible light spectrum or an invisible portion of the infrared light spectrum in the larger electromagnetic spectrum is being used to communicate data or information, it can possibly be called a wave, a vibe, or a qubit of information. As a result, the three words or phrase “run tag run” could then only require 3 waves, vibes, or qubits to be communicated instead of at least 72 bits of information. The ratio 3/72=X/100, and solving for X equals 4.16%. Accordingly, the amount of data being communicated could be reduced by about 95%. This can result in faster communication speeds, less heat production during operation which is something often associated with the fatigue and failure of electronic components, and also less energy use.
The speed of communication can also be increased by recognizing that certain letters and words are typically used more frequently than others. For example, the letters q, j, z, and x are used relatively infrequently in the English language. Letters, words, or symbols which are used less frequently can be assigned to square or sine waves having lower frequencies withing the range of frequencies and wavelengths being used for communication relative to other letters or words which are more often used. This can be related to a form of data compression which is known as Huffman Coding. In this regard, a Huffman Coding like algorithm can be made and used with letters of the alphabet, words, and also numbers. For example, the following list which was derived from an analysis of letters occurring in the main entries of the “Concise Oxford Dictionary,” 9th Edition, 1995 which can be found on the website: https://www3.nd.edu/˜busiforc/handouts/cryptography/letterfrequencies.html, ranks the frequency of use of the individual letters of the alphabet from most frequent to least frequent use: E, A, R, I, O, T, N, S, L, C, U, D, P, M, H, G, B, F, Y, W, K, V, X, Z, J, and Q. However, other rankings of alphabetical letters are possible and could be more suitable in view of the nature of the subject matter which is expected to be communicated and most common letter and word usage of a given population of users.
In the making of the associated computer software, the desired letters, words, numbers, symbols, and operations which are to be included can be provided in lists which can be included in the software application and/or the data and information and lists can be embedded or otherwise included in RAM, ROM, Flash-memory, Solid State Drive (SSD) memory, optical memory, or other form of memory in which the information can be persisted, and then be readily accessed by a computer or other data storage and communication device and user.
It is possible to communicate data and information using electronic input devices which use metal wire and digital electronic signals which are connected to a typical silicon based CPU and memory chip in a conventional electronic computer. In this regard, an oscillator circuit such as a 555 or 955 timer circuit, a quartz crystal integrated circuit, a vacuum tube oscillator, or other oscillator can be used to generate a baseline or carrier signal in the desired frequency range, and each of the possible keystrokes on a keyword or other input device can be routed to a capacitor, resistor, or other electronic component that is in communication with the oscillator circuit and which can change the frequency and wavelength of its baseline output to communicate the specific frequency and wavelength which has been assigned, coded, and mapped to the specific letter, word, number, symbol, operation or function, and then communicate this data and information to the silicon based CPU and memory chip of a conventional electronic computer which includes one or more software applications including necessary and sufficient programs, commands, and algorithms to communicate and process the data and information for a user. However, photonic and optical forms of communication, and optical, electro-optical, and/or quantum computers are capable of performing more complex computations and at faster speeds. In this regard, photons in the visible portion of the light spectrum and/or infrared light in the invisible portion of the electromagnetic spectrum can be used to communicate letters, words, symbols, numbers, operations, and functions.
Visible light falls in the range of the electromagnetic spectrum between ultraviolet and infrared light. Visible light frequencies are between about 4×1014 and 8×1014 cycles per second (Hz) or about 430-750 trillion Herz (THz), wavelengths in the range between approximately 380-740 nm. One cycle of visible light associated with wavelengths between 400-700 nm corresponds to durations in time in the range between about 1.3 and 2.3 femtoseconds. The ultraviolet light spectrum includes wavelengths in the range between approximately 10 nm and 400 nm which corresponds to frequencies in the range between approximately 30 PHz-750 THz. The infrared light spectrum includes wavelengths in the range between approximately 700 nm-1 mm and corresponds to frequencies in the range between approximately 430 THz-300 GHz. In this regard, it is known that there can be some overlap as between the visible light spectrum and the infrared and ultraviolet light spectrums. The invisible portion of the infrared light spectrum which includes near infrared has a wavelength between approximately 0.75-1.4 micrometers, short infrared has a wavelength between approximately 1.4-3 micrometers, mid-length infrared has a wavelength between approximately 3-8 micrometers, long wavelength infrared has a wavelength between approximately 8-15 micrometers, and far infrared has a wavelength between approximately 15-1,000 micrometers.
LED diodes and laser diodes can be used as a source of photons and light in the visible light spectrum and/or invisible portion of the infrared light spectrum or other invisible portion of the electromagnetic spectrum such as the ultraviolet spectrum. LED diodes emit light by spontaneous emission can be made from a semiconductor compound, e.g., gallium arsenide phosphide which can provide infrared radiation having a wavelength of approximately 850 nm. Other semiconductor compounds can be used in making LED diodes which can provide photons and light in other portions of the visible light and/or infrared light spectrums. LED diodes are available from https://www.mouser.com. Laser diodes emit light by stimulated emission and are also available in different wavelengths in the ultraviolet, visible, and infrared light spectrums. In this regard, see https://www.thorlabs.com which is the website for Thorlabs which makes many laser diodes having different wavelengths in the range between 375-2000 nm.
Lasers can be used as a source of photons and light in the visible light spectrum and/or invisible portion of the infrared light spectrum or other invisible portion of the electromagnetic spectrum. For example, so-called ultrafast lasers, femtosecond lasers, picosecond lasers, mode-locked lasers, mode-locked fiber lasers, mode-locked diode lasers, and titanium-sapphire lasers can possibly be used as a source of photons and light, and some of these lasers are capable of generating photon and light pulses which have a duration of less than five femtoseconds. In the field of optics, femtosecond pulse shaping is used to manipulate and configure the temporal domain of an ultra-short laser pulse, and/or the frequency domain of an ultra-short laser pulse the latter being obtained using the Fast Fourier Transform (FFT). In this regard, a Michelson interferometer is one example of a direct space to time pulse shaper which uses a moving mirror. Femtosecond pulse shapers can be collinear or transverse and either static or programmable. Collinear static shapers typically use a chirped mirror, whereas programmable collinear shapers use an Acousto-optic programmable dispersive filter (AOPDF). Static transverse pulse shapers typically use a stretcher/compressor, whereas programmable transverse pulse shapers use a spatial light modulator. Another method and technique for manipulating and configuring an ultrashort laser pulse is called a multiphoton intrapulse interference phase scan which can use a liquid crystal, a diffractive grating, and a spatial light modulator (SLM).
One cycle of visible light associated with wavelengths between 400-700 nm corresponds to durations in time which are the range between about 1.3 and 2.3 femtoseconds. Accordingly, some of the aforementioned lasers can possibly generate between one to four complete cycles of visible light in less than 5 femtoseconds depending of the specific visible light wavelengths. There are numerous types of lasers being used today for fiber optic transmitters, e.g., Vertical-Cavity Surface-Emitting Lasers (VCSEls), Fabry-Perot (FP) lasers, and Distributed Feedback (DFP) lasers. In this regard, diode pumped solid state which include fibers doped with dysprosium, erbium, holmium, neodymium, praseodymium, thulium, and ytterbium can be used. For manufacturers of lasers for optical communications, see, e.g., https://www.TeraXion.com, https://www.Quantifiphotonics.com, https://www.modulight.com, and, https://www.Vitextech.com.
As previously discussed, a portion of the invisible infrared light spectrum is being used today by members of the telecom industry to transmit signals through optical fiber cable. Fiber optical cable can transmit about 100 terabytes (Tb)/second in C and L bands: the C band is between 1530-1565 nm; the L band is between 1565-1625 nm; the O band is between 1260-1360 nm, the E band is between 1360-1460 nm, the S band is between 1460-1530 nm, and the U band is between 1625-1675 nm. Digital to optical converters, and optical to digital converters, and what are often called optical transceivers are used in order to convert binary digital data into light and back again. Optical transceivers use a plurality of lasers having different specific wavelengths to convert digital signals from data switches to optical signals which can be transmitted used fiber optic cables and typically using the wavelengths between 1260-1675 nm which is an invisible portion of the infrared light spectrum.
Different types of optical transceivers which are made in different forms in accordance with the multisource agreement include, e.g., Gbic, SFP, SFP+, CFP, CFP2, CFP4, and QSFP28. In brief, there are two main kinds of optical transceivers, namely, grey or standard transceivers which are single channel devices, and single fiber bi-directional transceivers which use two different wavelength channels one to transmit and the other to receive data and information over a single optical fiber strand. Grey transceivers come in different types: short range (SR) 850 nm, long range (LR) 1310 nm, extended range 1550 nm, and further extended reach (ZR) also 1550 nm. Single fiber bi-directional transceivers typically have two channels at 1310 nm and 1550 nm, but for long distance transmission typically the two channels are at 1510 nm and 1570 nm.
The ultraviolet light spectrum is approximately between 10-400 nm. In this regard, UV-A is between 315-400 nm, UV-B is between 280-315 nm, UV-C is between 100-280 nm, near ultraviolet (N-UV) is between 300-400, middle ultraviolet (M-UV) is between 200-300 nm, far ultraviolet (F-UV) is between 122-200 nm, hydrogen Lyman-alpha is between 121-122 nm, extreme ultraviolet (E-UV) is between 10-121 nm, and vacuum ultraviolet (G) is between 10-200 nm. It is possible to use a portion of the ultraviolet spectrum to communicate data and information.
When making a computer language for use with a conventional electronic computer, an optical computer, a hybrid optical/electronic computer, and/or a quantum computer, the letters of the alphabet, words, symbols and at least some numbers can be coded and assigned different specific frequencies and wavelengths. Whether the signal is an electronic one and includes square waves, or the signal is made using sine waves which are being communicated in the visible light spectrum, invisible infrared light spectrum, or other portion of the electromagnetic spectrum, the different wave forms can be made distinguishable and separated by one or more nanometers in wavelength, picoseconds, femtoseconds, MHz, GHz, THz, PHz, or other detectable difference in waveform, amplitude, phase, frequency and wavelength, and/or speed so they can be detected with desired accuracy. It is possible to detect a single photon. Further, differences in color which correspond to differences in frequency and wavelength can be easily detected with an accuracy between 5-10 nanometers (nm), and even differences of a single nanometer (nm) can be detected using a light sensor and/or spectrometer. In this regard, the difference in frequency and wavelength which can be detected with a required or desired level of accuracy will here be called the desired detectable wavelength difference and be indicated in the drawing figures as (DAD). Alternately, the difference in frequency and wavelength which can be detected with a required or desired level of accuracy could also be called the desired detectable difference in frequency DDF. The desired separation in space and/or time between the end and start of different alphabetical letters, words, symbols, numbers, or commands which can be detected with a required or desired level of accuracy will here be called the desired detectable separation and be indicated in the drawing figures as (DS), and the desired difference in amplitude which can be detected with a required or desired level of accuracy will here be called the desired detectable amplitude and be indicated in the drawing figures as (DA). Communication of different letters of the alphabet, words, symbols, and numbers in the form of photons and sine waves can be made using fiber optic cables which are known to have little or no impedance.
As previously discussed, there are many different forms and means of frequency modulation which have been used with radio communication and/or digital communication including, but not limited to the following: Slope detection; Ratio detection; Foster-Seeley FM discriminator; Phased Locked-Loop demodulator (PLL); Quadrature detector/demodulator; Minimum Shift Keying Modulation (MSK); and, Gaussian Minimum Shift Keying (GMSK). RF frequency synthesizers are widely used in radio communications and these include but are not limited to: Direct Analogue frequency synthesizers; Direct Digital frequency synthesizers (DDS); Indirect Analogue frequency synthesizers (analogue PPL frequency synthesis); Indirect Digital frequency synthesizers (digital PPL frequency synthesis); and Multiloop PLL Frequency Synthesizers. Some of these methods, techniques, and devices can be applied to photonic communication using the visible light spectrum and/or invisible infrared light spectrum, or other invisible portion of the electromagnetic spectrum.
In brief, instead of using the amplitude of square waves to communicate binary digital data and information in the form of a series of 0's and 1's, the frequency and wavelength of square waves or other wave forms are being changed and/or modulated to communicate data and information. It is possible to detect the start or rise and end or fall of a square wave or other wave form, e.g., using an oscilloscope which can include an adjustable trigger threshold, and so the length of any given wave form can be detected and known. At this time, there are a number of software applications for oscilloscopes which can be installed and used on Windows PCs, e.g., “Winscope,” “Soundcard Oscilloscope,” “Oscilloscope,” “Real-Time Spectrum,” “VisualAnalyser,” “Analog Discovery 2,” and “Frequency Analyser,” which are reviewed in the article entitled: “7 Best Oscilloscope Software for Windows,” by Ivan.Jenic, published Apr. 15, 2020, on the website: https://windowsreport.com/oscilloscope-software-pc-laptop. Other forms of frequency modulation have been used with radio communication, and similar techniques can be applied to the detection of electronic wave forms and/or photonic or optical wave forms which can be used to communicate data and information in a computer environment. Note: For the sake of simplicity, the negative portion of the square waves which could possibly appear on or below what is called the 0 and/or reference line are not shown in the drawing figures which are provided and discussed in this disclosure.
Representing Numbers
The use of the binary number system and digital communication for representing numbers and operations in computer languages can result in certain inaccuracies, and also consume substantial memory. When using the binary number system with a computer each number between 1-10 requires 8 bits or one byte of information. Most individuals do not use many large numbers in their daily communications, but scientists often do so and computers now use the binary system and digital methods in order to communicate numbers and perform calculations. In order to improve the speed of transmission and processing of the large numbers of bits which are typically used in digital communication, various means and methods of bit-rate reduction and/or data compression have been created and used. For example, Lempel-Ziv-Welch (LZW), MP3, discrete cosine transform (DCT), JPEG, Blue Ray, and Dolby True HD are some examples of communication formats which use different forms of data compression.
It is possible to assign to each commonly used value or number in a given base number system a specific frequency and wavelength which can then serve as its code to represent and communicate the individual value or number. Most individuals do not often use numbers having a value greater than one million, and numbers having a value less than 1,000 are the most commonly used. Accordingly, for some software applications and user populations encoding a relatively small and finite number of values and numbers can be efficacious. However, because there are infinite numbers in the mathematical universe, assigning to each number a specific frequency and wavelength of a square or sine wave in order to identify and code a number could be impractical or impossible, that is, depending on how many numbers are to be represented and encoded. Accordingly, there is a need for other efficient ways to represent and communicate numbers.
Before modern electronic calculators and computers were made available to the general public in the 1970's, slide rule devices, and logarithms which were first developed by John Napier in 1614 were commonly used to simplify mathematical calculations. In brief, a logarithm is the inverse function to exponentiation. The logarithm of a number x is the exponent to which another number which is known as the base must be raised to produce that number x. For example, the notation log2 8=3 which is 2×2×2 or 23=8 is an example of a binary logarithm. The logarithm which uses base number 10 is called the decimal or common logarithm and is often used in science and engineering. The so-called natural logarithm uses the base number e=2.718 and it is often used in the fields of mathematics and physics. Many calculations can be simplified by using logarithms. For example, the multiplication or product of logb (xy)=logbx+logby; the division or quotient of logb x/y=logbx−logby; the power of logb xp=plogbx; and the root of logbp√/x=logbx/p. Tables of logarithms were created by Henry Biggs in 1617, and then were later greatly expanded. Logarithms, and various mathematical equations and operations using them, as well as large tables of logarithms can be written and placed into a computer language, code, and related algorithms. As discussed earlier in the background section, the speed and efficiency of modern computer chips and computers is beginning to encounter certain limitations. Accordingly, the use of exponential and/or logarithm representation of numbers and also simple mathematical operations such as addition, subtraction, multiplication, and division can help to provide for the development of methods and processes for reducing the amount of data which is presently required and commonly being used to represent and communicate numbers.
In number theory, the decomposition of a composite number into a product of smaller integers is called integer factorization. If and when these factors are restricted to prime numbers the process is called prime factorization. When the numbers being factored are sufficiently large, there is currently no known efficient algorithm which can run on a classical computer in order to calculate these factors in polynomial time, that is, in a timely manner. In order to introduce this subject and disclose an alternative method of compressing data and representing numbers, here are some values and/or numbers between 0-100: 0; 1; and there exist 26 prime numbers between 0-100, namely, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, and 97. All of the rest of the numbers between 0-100 are composite numbers. In this regard, the composite numbers between 0-100 can be expressed by 14 prime numbers, namely, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 41, 43, and 47, as discussed and shown below. In brief, besides the values or numbers 0 and 1 only 24 prime numbers are required to express all values and numbers between 0-100, which is a total of 26 values and/or numbers. This can be used to perform what is here called prime number data compression. 101 values or numbers minus 26 values or numbers equals a reduction of 75 values or numbers which is approximately 75%. Accordingly, it is possible to use a form of prime factorization to reduce what can be seen as the redundancy associated with having to express each individual composite number. While classical computers have lacked the computing power and speed to perform integer and/or prime factorization in polynomial time, something which is typically calculated using what is called Big O Notation, quantum computers which can use Peter Shor's Algorithm created in 1994 are capable of performing such tasks, e.g., see the article “How Peter Shor's Algorithm Dooms RSA Encryption To Failure,” by. John Loeffler, published May 2, 2019, on the website: https://interestingengineering.com/how-peter-shors-algorithm-dooms-rsa-encrytion-to-failure. In this regard, the numbers 2 and 3 are the most often used prime number factors when expressing composite numbers up to 100. For example, here are some of the possible factors that can be used to represent and produce composite numbers up to 100.
Prime Number Data Compression
Even if and when the desire is to express composite numbers in the binary base 2 number system, that is, instead of the decimal base 10 number system, this same method of data compression can be used.
Data Compression Using the Values and/or Numbers: 0, 1, 2, 2n, 3, 3n
All of the values and numbers between 0-100 can be expressed by the following: 0, 1, 2, 22, 23, 24, 25, 26, 3, 32, 33, 34, and the use of addition. Here are the values and numbers between 0-100 showing some of the possible prime number combinations which provide solutions:
In fact, all positive whole numbers can be expressed by the values and numbers 0, 1, 2, 2n, 3, 3n, and the use of addition. For example, here is the number 678=35+33+28+27+24+23. The number 678 can be represented by 6 sine waves, vibes, or qubits, plus 5 more for the plus signs for a total of 11 waves, vibes, or qubits. However, when it would be understood and/or programmed with computer software that the series of numbers or values would be added then only 6 waves, vibes, or qubits would be required, whereas the same number in binary is 01010100110 which is 11 bits. It is common to represent very large numbers by indicating their nth exponential power in base 10, e.g., one million=1×106. The above discussion and the provided examples show that it is possible to represent a positive number in some combination of the values or numbers 0, 1, 2, 2n, 3, 3n. For example, in order to represent all numbers between 0-678, only the values and/or numbers 0, 1, 2, 22 23, 24, 25,26, 27, 28, 3, 32, 33, 34 (and perhaps a few more exponential powers of 2 and 3) would be required, thus a total of only about 14 different values and numbers. Accordingly, it is possible to use 0, 1, 2, 2n, 3, 3n in order to represent positive numbers and the number of bits and amount of processing time and memory normally required to do so can sometimes then be reduced relative to the current at least 8 bit per number method that is being widely used today.
210=1,024
310=59,049
320=3,486,784,401
In binary language, this last number 3,486,784,401 is: 0110011111110101000001101110010001 which is 34 bits. Each of these values and/or numbers can be communicated using either a square wave having a specific frequency and wavelength which is conducive to digital communication, and/or a sine wave having a specific frequency and wavelength which is conducive to optical communication and also optical and quantum computing. In either case, only 1 or 2 photonic or optical waves, vibes, or qubits would be required to represent 320 which is equal to 3,486,784,401 and coded as 0110011111110101000001101110010001 in binary notation. Instead of only using of the values and numbers 0, 1, 2, 2n, 3, 3n, the prime number 5, 5n, or other larger numbers could also be used in order to reduce the number of bits required to express larger numbers.
510=9,765,625
520=95,367,431,600,000
Accordingly, it is possible to represent very large numbers without using exponents which have values greater than 20. The numbers 0, 1, 2, 2n, 3, 3n, 5, 5n with n up to the 20th power can be placed into ROM, RAM, Flash, Solid State Drive (SSD) and/or optical memory, or other means of persisting data and information. This does not require the listing or storage of many different values and numbers. Obviously, other prime numbers and their exponential forms can be used to represent large numbers. Accordingly, the present disclosure relates to the development of a language and code for software development to perform mathematical computations on a conventional CPU logic chip, an optical CPU logic chip, a hybrid CPU logic and memory chip, a hybrid optical CPU logic and memory optical chip, or a hybrid CPU logic chip and optical memory chip, or vice-versa, using a form of data compression. As a result, the length of resulting digital and/or optical communications and the power required to make calculations can be reduced and processing speed increased. In this regard, one example of a hybrid and combined logic and memory chip is now being called a processing in memory (PIM) circuit or chip which uses neural networks and resistive random access memory (RRAM-PIM) to process and persist data and information, as discussed in the article “Research Brings Analog Computers Just One Step From Digital,” by Brandie Jefferson published by Techxplore.com on Dec. 8, 2021: htts-/techxolore.com/news/2021-12-analog-digital.html.
Square waves or sine waves can be used to represent both the base portion of a number and also the exponent portion. In drawing
When multiple individual wave forms are combined to derive and create a resultant wave form the frequencies of the individual wave forms can nevertheless be known, represented and communicated using the Fast Fourier Transform (FFT) Algorithm which computes the discrete Fourier Transform (DFT) of a sequence, or its inverse which is called the inverse discrete Fourier Transform (IDFT). The Faster Fourier Transform FFT is widely used in engineering, mathematics, music, and science, e.g., see https://en.wikipedia.org/wiki/Fast (Fourier Transform), https://youtu.be/h7apO7q16V0, and the Lecture Collection entitled “The Fourier Transforms and Its Applications,” by Professor Brad Osgood of Stanford University which includes 30 lectures, the following Youtube links being to Lectures 1-5: https://youtu.be/gZNm7L96pfY, https://youtu.be/1rcqJI7Rs6ps, https://youtu.be/BjBb5llrNsQ, https://youtu.be/n5lBM7nn2eA, and https://youtu.be/X5qRpgfQld4. For information on using the Fast Fourier Transform FFT Algorithm with the Java computer language, see, e.g., the article “Fun With Java, Understanding the Fast Fourier Transform (FFT) Algorithm,” by Richard G. Baldwin published Jan. 5, 2005, on the website, https://developer.com/java/fun-with-Java-understanding-the-fast-fourier-transform-fft-algorithm/; “FFT.java,” published on the website, https://introcs.cs.princeton.edu/iava/97data/FFT.java.html, by Princeton University, author unknown, on Jan. 14, 2020; and, “FFT in Java,” published on the website, https://www.imaging.utk.edu/research/inarvaez/ece572/reports/FFT_java%20tips.pdf, by Ingrid Narvaez, of the University of Tennessee.
Accordingly, data and information in wave form can be represented and communicated with the amplitude being shown on the vertical axis and time being shown on the horizontal axis of a graph, and the data and information can possibly include a plurality of individual wave forms which may overlap one another and then form one or more resultant wave forms, but with the use of the Fast Fourier Transform the data and information can be processed and represented to show amplitude on the x axis and frequency on the y axis of a graph, or another other tangible medium of expression in order to represent and show the individual frequencies of the plurality of individual wave forms which are included in the resultant wave forms. For example, see drawing
Alternatively, it is possible to combine both a square wave and sine wave in communication and then use, e.g., a sine wave to represent the base portion of a number and a square wave to represent the exponent portion, or vice-versa. In this regard,
As shown in
As shown in
As shown in
As shown in
Again, 320=3,486,784,401. In binary, this number is coded and represented as: 0110011111110101000001101110010001 which is 34 bits. However, a sine wave having a specific frequency and wavelength could be used to represent and communicate the base number 3 in 320, and a different sine wave having a specific frequency and wavelength which can be communicated nearly or actually simultaneously could be used to represent the exponent 1020. This would only require one or two waves, vibes or qubits of information, as opposed to the 34 bits of information required when using the binary system.
Algorithms, data structures, and other methods and techniques used in computer science include but are not limited to the following: Aho Corasick String Matching; Algebraic-Group Factorization Algorithms; Algorithm to Detect Cycle; Articulation Points in a Graph; AKS Primality Test; Bach's Algorithm; Backpropagation Through A Neural Network; Beam Search Algorithm; Bell Ford Algorithm; Big O Notation; Binary Search Algorithm; Binary Indexed Tree or Fenwick Tree; Binary Search Trees; Boyer-Moore Majority Vote Algorithm; Breadth First Search Algorithm; Bridges in a Graph; Bubble Sort Algorithm; Bucket Sort Algorithm; Buchberger's Algorithm; Canonical Representation OF A Positive Number; Catalan Numbers; Convex Hull/Jarvis's Algorithm; Compression; Continued Fraction Factorization (CFRAC); Counting Inversions; Counting Sort Algorithm; Data Compression; Depth First Search Algorithm; Diffie-Hellman Key Exchange; Dijkstra's Algorithm; Dinic's Algorithm; Discrete Differentiation; Disjoint-Set Data Structure; Distance-Vector Routine Protocol Algorithm (DVRPA); Dixon's Algorithm; Dynamic Programming; Euclid's Algorithm; Euler's Factorization Method; Euler's Totient Function; Expectation-Maximization Algorithm; Factorial Calculation; Factorization; Fermat's Factorization Method; Ferrers Diagrams; Finite Automata Algorithm for Pattern Searching; Flood Fill Algorithm; Fast Fourier Transform (FFT) Aigorithm; Floyd's Cycle Detection Aigorithm; Floyd Warshall Algorithm; Ford-Fulkerson Algorithm; Gaussian Elimination to Solve Linear Equations; General Number Field Sieve (GNFS); Graham Scan; Gradient Decent Aigorithm; Graphs; Graph Search Aigorithm; Hashing; Heap Sort Algorithm; Hopcroft-Karp Algorithm for Maximum Matching; Huffman Coding Compression Algorithm; Hungarian Algorithm; Insertion Sort Algorithm; Interval Tree; Introsort Algorithm; Johnson's Algorithm; Kadane's Algorithm; Karatsuba Multiplication; Kahn's Topological Sort Algorithm; K Dimensional Tree; Key Exchange Encryption Algorithm; KMP Algorithm; Kraitchik Family Algorithm; Kruskal's Algorithm; Lee Algorithm; Lenstra Elliptical Curve Factorization; Link Cut; Linked List; Link-State Routing Protocol Algorithm (LSRPA); Logarithmic Exponentiation; Lowest Common Ancestor; LLL Algorithm; Matrix Exponentiation; Matrix Rank; Merge Sort Algorithm; Minimum Spanning Tree Algorithms; Modular Exponentiation; Modular Multiplicative Inverse; Mo's Algorithm; Multiplicative Partition; Newton's Method; Order Statistics; PageRank Algorithm, P-ADIC Order; Partition In Number Theory; Pollard's P-1 Algorithm; Pollard's Rho Algorithm; Primality Testing Algorithms such as the Sieve of Eratosthenes, the Fermat Primality Test and the Miller-Rabin Primality Test; Prime Factorization; Q Learning; Quadratic Sieve Algorithm; Queues; Quick Select Algorithm; Quick Sort Algorithm; Rabin Karp Algorithm; Random Sample Consensus Algorithm; Range Minimum Query; Rational Sieve; Recursion Functions; Regular Expression; RSA Algorithm; Schonhage-Strassen Algorithm; Segmented Sieve; Segment Tree; Selection Sort Algorithm; Shank's Square Forms Factorization (SQUFOF); Shor's Algorithm; Simplex Algorithm; Singular Value Decomposition (SVD); Solving a System of Linear Equations; Square Root of an Integer; Stacks; String Matching and Parsing; Transmission Control Protocol/Internet Protocol (TCP/IP) Algorithms; Trial Division Factorization Method; Trie; Trees; Topological Sort Algorithm; Union Find Algorithm; Viterbi Algorithm; Wheel Factorization; William's p+1 Algorithm; Wilson's Theorem; Young Diagrams; and, Z's Algorithm, and these and other algorithms, data structures, and methods and techniques used in computer science can be used in the development of software applications which can represent and communicate alphabetical letters, words, numbers, symbols, operations, and other processes including the communication of data and information and the use of computers and other devices for processing, manipulating, and storing data and information.
Representation of Numbers in Base 10
It is also possible to use and represent the common values and numbers associated with base 10, namely, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, by representing the base portion of these value or numbers with a square or sine wave, and also the exponent portion of these and other numbers with another square or sine wave. For example, it is possible to represent the base portion of values or numbers and the exponent portion of those values or numbers using photons and sine waves in the visible light spectrum and/or visible or invisible portion of the infrared light spectrum, or other invisible portion of the electromagnetic spectrum.
For example:
The number 124 in base 10 can be thought of as being a compressed expression with there being 1 of 10 in the hundreds column, 2 of 10 in the tens column, and 4 of 10 in the ones column, which are added together to represent and provide the value and number 124. In order to represent 124, a first sine wave having a specific frequency and a wavelength to communicate the base number 1 can be communicated nearly or actually simultaneously with a second sine wave having a specific frequency and wavelength to communicate the exponent for representing 102 to represent the value and number 100, a third sine wave having a different specific frequency and wavelength can communicate the base number 2 nearly or actually simultaneously with a fourth sine wave having a different frequency and wavelength to communicate the exponent 101 and represent the value and number 20, and a fifth sine wave having a different frequency and wavelength to communicate the base number 4=22 nearly or actually simultaneously can be communicated with a sixth sine wave having a different frequency and wavelength to communicate the exponent 100 to represent the value and number 4. All of the sine waves to represent the number 124 can be communicated nearly or actually simultaneously when photons and sine waves in the visible spectrum and/or infrared electromagnetic light spectrum are used.
With the use of optical means of communication and optical logic and memory chips and/or other photonic devices the number 124 can then require only 3 or 6 waves, vibes, or qubits which can be communicated and processed nearly or actually simultaneously instead of using the binary representation of 124 which is 1111100 and requires 7 bits of information which are processed sequentially and also considerably slower by electrons moving in wire and conventional silicon CPU and memory chips. In this regard, it is possible for a conductive wire and also optical fiber cable to communicate hundreds or thousands of signals, but optical fiber cable can communicate faster at THz speeds without a significant amount of impedance, and also uses less energy. In contrast, the use of the binary system and its relatively narrow and slow stream of digital 0's and 1's can be like trying to drink a river with a straw.
Again, one of the ways to communicate and process more information at higher speeds is to decrease the number of bits, waves, vibes, or qubits that are required to communicate a phrase like “Run Tag Run” from 72 bits to 3 waves, vibes, or qubits, or depending on the software application can program being run, perhaps it would be 5 waves, vibes, or qubits counting the spaces between the words. In this regard, fiber optic cable can be used to carry photons and sine waves in the visible light spectrum, and the visible and/or invisible portion of the infrared electromagnetic light spectrum to communicate alphabetical letters, words, symbols, and the base portion and also the exponent portion of a value or number in base 10, or any other number system. If desired, optical fiber cable can communicate a plurality of alphabetical letters, words, paragraphs, and documents nearly or actually simultaneously in the range of THz speeds. Accordingly, optical fiber cable and optical computing can potentially provide faster communication and processing speeds than can conventional electronic digital communication and computing because of its ability to nearly or actually simultaneously communicate data and information and also because photons and light can typically travel about 20 times faster in optical cable and optical chips than digital electronic signals can travel in metal wire and conventional computer chips made of silicon. Once again, the number 3,486,784,401 expressed in binary form is 0110011111110101000001101110010001 which is 34 bits. However, the above discussion shows that 3,486,784,401 could be represented in base 10 in 10-20 waves, vibes, or qubits that could be communicated nearly or actually simultaneously as though only one bit was somehow alternatively being communicated digitally. The previous discussion also shows that 3,486,784,401 can be represented as 320 which could require the use of only one or two waves, vibes, or qubits. While the introduction of abbreviations and specialized vocabulary can make computer languages harder for individuals to learn and communicate in different spoken languages, the abbreviation or representation of 3,486,784,401 by using 320 is not problematic because the use of base 10 is widely accepted and understood. Accordingly, the use of photons and sine waves to communicate data and information and optical computers which can facilitate quantum computing has the potential to surpass the performance of conventional electronic computers for many tasks and purposes.
Moreover, it is possible for many different values and numbers to be represented and communicated by using the base 10 number system or a different base number system as the base portion of a number and using values or numbers derived from a logarithm table as the exponent portion of the number. For example, the first sine wave shown on the left in
In this regard, in
At this time, different models exist and are being used to communicate data in various telecommunications and computer networking environments. The Open Systems Interconnection Model (OSI model) includes seven layers and characterizes and attempts to standardize the communication of data and information. The OSI model was defined in ISO/IED 7498 which includes the following parts: ISO/IED 7498-1 which is the basic model; ISO/IED 7498-2 which relates to security architecture; ISO/IEC 7498-3 which relates to naming and addressing; and, ISO/IEC 7498-4 relating to management framework. However, various other designs and models for data and information communication have been developed such as the Internet Protocol Suite which includes four layers and is commonly known as the Transmission Control Protocol (TCP) and Internet Protocol (IP), or more simply, the TCP/IP protocols which are being widely used today. Lists of existing network protocols can be found on the website: https://wkipedia.org/wiki/Lists_of_network_protcols. When data is being communicated in telecommunications and computer networking, the data and other related information is typically configured in what is called a packet which is a formatted unit of data. A packet is sometimes also called a block, a cell, a datagram, or a frame, that is, depending on the data communication protocol which is being used. In this regard, the packet typically contains control information, and also user data and information which is called the payload. The control information is typically located in headers and footers or trailers and these portions can contain, e.g., the source and destination network addresses, error detection codes, and sequencing information. In this regard, error detection and correction can be performed at different layers of a protocol stack, and the packets can contain checksum, parity bits or cyclic redundance checks to detect for errors. One or more of the different models, methods, and processes which are being used to communicate data and information in various telecommunication and computer network environments can be configured and adapted to be used with one or more of the structures, methods, and processes discussed and shown in the present disclosure, and vice-versa, that is, the structures, methods, and processes relating to making a computer language and code for software application development, data compression, and use with conventional, optical, hybrid electro-optical and quantum computers can be configured and adapted to be used with one or more of the different models, methods, and processes which are being used to communicate data and information in various telecommunication and computer network environments.
With reference to
The detailed structures, methods, and processes associated with making and operating optical computers, hybrid electro-optical computers, and quantum computers are recited in the prior art patents that have been previously incorporated by reference herein above, and the recited documents speak for themselves. A brief discussion of just a few of the structures and methods recited in some of these patents is provided here for those individuals who may not be familiar with or have time to review the prior art. Lasers from III and V groups on the periodic table using indium phosphide and silicon nitride, or LED's can be used as light sources. One or more optical microresonators can be included on or near an optical chip to generate at least one microcomb which can squeeze photons into small circular loops about the size of a millimeter in order convert the photons from a single wavelength to many different wavelengths or modes and so facilitate multiplexing, quantum entanglement, superposition, and quantum computing. In order to make an optical computer chip, transistors which utilize constructive or destructive light interference can be used to create optical or digital/optical logic gates. In this regard, liquid crystal structures, or nano-crystals made, e.g., from diamond, germanium, quartz, ruby, salt, sapphire, silicon, or other crystalline materials which have desired lattice structures and other physical properties can be used to make logic gates which can be connected to neural networks. Prisms, filters, mirrors, diffraction gratings, and other structures can be used to manipulate and process photonic data and information. Some crystalline materials can be encoded by a laser, LED, or other light source to make holographic optical memory chips. The following articles provide information on optical CPU's and/or memory chips: “Light-Based Memory Chip Is the First To Permanently Store Data, by Robert F. Service, published on Sep. 25, 2015 on the website: https://www.science.org/content/article/light-based-memorv-chip-first-permanently-store-data; “Optical RAM And Integrated Optical Memories: A Survey/Light: Science & Applications,” by Theoni Alexoudi, George Theodore Kanellos & Nikos Pleros, published on May 25, 2020 on the website: https://www.google.com/url?sa=t&source=web&rct=j&url=https://www.nature.com/articles/s41377-020-0325-9&ved-2ahUKEwjOx46w9af1AhUdk4kEHaxvBewQFnoECAUQAQ&usg=AOvVaw3AP8OD47MCuab0pvB2 Kkqr; and, “New Optical Memory Cell Achieves Record Data-Storage Density,” published by the Oxford News Blog on Dec. 21, 2018 on the website: https://www.ox.ac.uk/news/science-blog/new-optical-memory-cell-achieves-record-data-storage-density-0.
Optical computers can send and receive photonic and optical sine waves in multiple frequencies and wavelengths in order to communicate data and information in series or parallel and near or at the speed of light. Hybrid electro-optical computers can include one or more structures which require the conversion of information in an optical form to binary and digital form and/or vice-versa, and this requirement can reduce processing speeds and require more energy.
Keyboards and vocal means of data and information input are relatively slow processes, and so when these means would be used to input data and information using conventional digital devices and the binary number system, it would not greatly affect the processing speed of an optical computer, a hybrid electro-optical computer and/or quantum computer. However, somewhere in the chain of equipment and data and information flow those digital signals would need to be converted into analog photonic or optical signals. Digital to optical and also optical to digital converters exist, but converting data and information back and forth takes time, and it is also associated with the production of heat and use of energy.
An optical keyboard, microphone or other voice recognition device which can use fiber optical cables to communicate photons and sine waves in the visible light spectrum and/or invisible portion of the infrared electromagnetic light spectrum to an optical computer which uses an optical CPU and memory chip or other means of persisting data and information can be used to enable and facilitate quantum computing. Whether using a keyboard with mechanical switches or a capacitive keyboard, a keystroke can be linked to a circuit associated with a light source and which changes the light output from either no output or from a baseline output to a different output by changing, e.g., the resistance or capacitance of the relevant portion of the associated integrated circuit and/or by changing, e.g., the transmittance, absorbance, filtering, reflection, scattering and/or dispersion of the light source so that the frequency and wavelength of the photonic output can be selectively changed. Instead of using electrons and the binary digital number system to make and communicate a signal, a source of light photons such as one or more LEDs, liquid crystals, or lasers can be used to generate the optical signal. In this regard, light sources which can generate photons and light in the visible light spectrum and/or invisible portion of the infrared electromagnetic spectrum can be used.
A conventional keyboard having mechanical switches or a capacitive keyboard will typically have an integrated circuit including a character map which identifies each individual keystroke. These keyboards send the information, e.g., that the letter “a” has been actuated, by sending the data and information using the binary system of 0's and 1's which is then communicated digitally using a conductive metal wire to a computer. The following discussion will address how to make a keyboard which can be used to communicate information in the form of photons and sine waves having frequencies and wavelengths in the visible light spectrum and/or invisible portion of the infrared electromagnetic spectrum. In this regard, a discussion will be provided regarding how television screens produce and represent different colors.
Computer keyboard commands, functions, operations and/or shortcuts typically include, but are not limited to: Alt, Backspace, Caps Lock, Ctrl, Delete, End, Enter, Esc, Fn, Home, Insert, Num LK, Pgdn, Pgup, Pause Break, Prt SC SYSRQ, Scr Lk, Shift, Spacebar, Tab, Windows, Ctrl+A, Ctrl+C (or Ctrl+Insert), Ctrl+X, Ctrl+V (or Shift+Insert), Ctrl+Z, Ctrl+Y, Ctrl+Shift+N, Alt+F4, Ctrl+D (Del), Shift+Delete, Alt+Tab, PrtScn, Windows key+I, Windows key+E, Windows key+A, Windows key+D, Windows key+L, Windows key+V, Windows key+Period (.) or semicolon (;), Windows key+PrtScn, Windows key+Shift+S, Windows key+Left arrow key, Windows key+Right arrow key, Keyboard shortcut, Windows key (or Ctrl+Esc), Ctrl+Arrow keys, Ctrl+Shift+Esc, Ctrl+Shift, Alt+F4, Ctrl+F5 (or Ctrl+R), Ctrl+Alt+Tab, Ctrl+Arrow keys (to select)+Spacebar, Alt+Underlined letter, Alt+Tab, Alt+Left arrow key, Alt+Right arrow key, Alt+Page Up, Alt+Page Down, Alt+Esc, Alt+Spacebar, Alt+F8, Shift+Click app button, Ctrl+Shift+Click app button, Shift+Right-click app button, Ctrl+Click a grouped app button, Shift+Right-click grouped app button, Ctrl+Left arrow key, Ctrl+Right arrow key, Ctrl+Up arrow key, Ctrl+Down arrow key, Ctrl+Shift+Arrow key, Ctrl+Spacebar, Shift+F10, Shift+Arrow keys, Windows key+X, Windows key+Number (0-9), Windows key+T, Windows key+Alt+Number (0-9), Windows key+D, Windows key+M, Windows key+Shift+M, Windows key+Home, Windows key+Shift+Up arrow key, Windows key+Shift+Down arrow key, Windows key+Shift+Left arrow key, Windows key+Shift+Right arrow key, Windows key+Left arrow key, Windows key+Right arrow key, Windows key+S (or Q), Windows key+Alt+D, Windows key+Tab, Windows key+Ctrl+D, Windows key+Ctrl+F4, Windows key+Ctrl+Right arrow, Windows key+Ctrl+Left arrow, Windows key+P, Windows key+A, Windows key+I, Windows key+E, Alt+D, Ctrl+E (or F), Ctrl+N, Ctrl+W, Ctrl+F (or F3), Ctrl+Mouse scroll wheel, Ctrl+Shift+E, Ctrl+Shift+N, Ctrl+L, Ctrl+Shift+Number (1-8), Alt+P, Alt+Enter, Alt+Right arrow key, Alt+Left arrow key (or Backspace), Alt+Up arrow, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, Ctrl+Tab, Ctrl+Shift+Tab, Ctrl+number of tab, Tab, Shift+Tab, Alt+underline letter, Spacebar, Arrow keys, Ctrl+A, Ctrl+C (or Ctrl+Insert), Ctrl+V (or Shift+Insert), Ctrl+M, Ctrl+Up arrow key, Ctrl+Down arrow key, Ctrl+F, Left or right arrow keys, Up or down arrow keys, Page Up, Page Down, Ctrl+Home, Ctrl+End, Windows key, Windows key+A, Windows key+S (or Q), Windows key+D, Windows key+L, Windows key+M, Windows key+B, Windows key+C, Windows key+F, Windows key+G, Windows key+Y, Windows key+O, Windows key+T, Windows key+Z, Windows key+J, Windows key+H, Windows key+E, Windows key+I, Windows key+R, Windows key+K, Windows key+X, Windows key+V, Windows key+W, Windows key+U, Windows key+P, Windows key+Ctrl+Enter, Windows key+Plus (+), Windows key+Minus (−), Windows key+Esc, Windows key+Forward-slash (/), Windows key+Comma (,), Windows key+Up arrow key, Windows key+Down arrow key, Windows key+Home, Windows key+Shift+M, Windows key+Shift+Up arrow key, Windows key+Shift+Down arrow key, Windows key+Shift+Left arrow key, Windows key+Shift+Right arrow key, Windows key+Left arrow key, Windows key+Right arrow key, Windows key+Number (0-9), Windows key+Shift+Number (0-9), Windows key+Ctrl+Number (0-9), Windows key+Alt+Number (0-9), Windows key+Ctrl+Shift+Number (0-9), Windows key+Ctrl+Spacebar, Windows key+Spacebar, Windows key+Tab, Windows key+Ctrl+D, Windows key+Ctrl+F4, Windows key+Ctrl+Right arrow, Windows key+Ctrl+Left arrow, Windows key+Ctrl+Shift+B, Windows key+PrtScn, Windows key+Shift+S, Windows key+Shift+V, Windows key+Ctrl+F, Windows key+Ctrl+Q, Windows key+Alt+D, Windows key+Period (.) or semicolon (;), Windows key+Pause. All of these different commands, functions, operations, and/or shortcuts can be communicated using visible light and/or infrared light in the invisible portion of the electromagnetic spectrum.
Modern television screens include only blue, green, and red pixels. Depending on whether one or more of these three blue, green, and red color pixels are being provided with power, or how much relative electrical energy is being provided to the individual pixels, that is, the amplitude of the color pixels, it is possible to reproduce or render all of the colors in the visible light spectrum. A television set does not require thousands of individual pixels having different unique colors in order to provide color rendering. The human eye also has cones which can see blue, green, and red light, but we can nevertheless see thousands of different unique colors. Likewise, it is possible to use relatively few values and numbers to represent and communicate data whether the data consists of words, numbers, symbols, or operations.
In this regard, here is one example how different values and numbers can be represented using light. Number 0 can represent and be analogous to black on a television screen. In modern television screens, black is typically rendered with the use of a controllable second polarizer which absorbs all light. Number 1 can represent and be analogous to white on a television screen. In modern television screens, white is rendered by all three red, green, and blue light pixels being on. Number 2 can represent and be analogous to the color blue on a television screen. Number 3 can represent and be analogous to the color green on a television screen. Number 5 can represent and be analogous to the color red on a television screen. As previously discussed, using the values and numbers 0, 1, 2, 2n, 3, 3n, 5, and 5n we can represent all positive numbers just as the modern television set can represent all colors by using only blue, green, and red pixels. Other types of numbers such as negative numbers, fractions, imaginary numbers, complex numbers, and mathematical operations besides addition, such as subtraction, multiplication, and division can be represented using a relatively small collection of colors.
The caveat with respect to this discussion being that while old cathode ray tube televisions use the excitement of different colored phosphors to generate blue, green, and red colors, the rendering of other colors was done using the RGB color model which is an additive process. For example, the RGB white point was often rendered by combining 464 nm blue with 549 nm green with 612 nm red. Many modern LED, liquid crystal, and plasma screens still use a generally similar RGB color model and additive process. As a result, humans may perceive, e.g., the color violet because of the addition of red and blue, but the screen may not be emitting light having the specific frequency and wavelength associated with the color violet. The web-safe color palette used with many early computer screens only included 63=216 colors, but now millions of colors are being supported by modern computers. However, when the desire is to communicate information using the visible light spectrum or invisible portion of the infrared light spectrum using a wide bandwidth it can be necessary to actually generate and use the frequencies and wavelengths of light in the desired bandwidth and not rely upon an additive process. As previously discussed, the different colors used to indicate and represent or encode data and information, that is, the different frequencies and wavelength can correspond to a portion of the visible light spectrum, and/or invisible portion of the infrared light spectrum, or other invisible portion of the electromagnetic spectrum.
For example, a light source can be used to produce different colors of light for generating photons and sine waves in the visible and/or invisible portion of the electromagnetic light spectrum. The different colors and associated frequencies and wavelengths of light can be produced by LED's, liquid crystals, lasers, or other light sources. Again, visible light falls in the range of the electromagnetic spectrum between ultraviolet and infrared light. Visible light frequencies are between about 4×1014 and 8×1014 cycles per second (Hz) which is about 430-750 trillion Hz (THz) and have wavelengths in the range between approximately 380-740 nanometers (nm). The ultraviolet light spectrum includes wavelengths in the range between approximately 10 nm and 400 nm which corresponds to frequencies in the range between approximately 30 PHz-750 THz. The infrared light spectrum includes wavelengths in the range between approximately 700 nm-1 mm and corresponds to frequencies in the range between approximately 430 THz-300 GHz. In this regard, it is known that there can be some overlap as between the visible light spectrum and the infrared and ultraviolet light spectrums. Visible light frequencies and wavelengths correspond in duration of time to about 2 femtoseconds. The keyboard(s) or other input devices and/or the computer can possibly include an integrated circuit, a character map, a linear or circular light accelerator, a microcomb, a prism, a filter, a diffraction grating, an optical CPU, an optical memory chip or other means of data storage, a neural network, an interface, a compiler, and connections for coupling with fiber optical cable. In this regard, a laser or other light source can be scattered or dispersed with the use of a prism, a diffraction grating, a filter, a microcomb, and/or other photonic or optical devices. When a keystroke is made on a keyboard which either includes or is connected to the light source a specific frequency and wavelength of light can then be generated and communicated using fiber optical cable to an optical CPU and optical memory chip or other device which is capable of persisting data and information. In this regard, fiber optical cable can transmit about 100 terabytes (tb)/second in C and L bands: the C band is between 1530-1565 nm; the L band is between 1565-1625 nm; the O band is between 1260-1360 nm, the E band is between 1360-1460 nm, the S band is between 1460-1530 nm, and the rarely used U band is between 1625-1675 nm. These wavelengths fall into the invisible portion of the electromagnetic light spectrum. The visible portion of the light spectrum is between 380-740 nm or about 400-700 nm. Lasers which use sapphire can render between 670-1100 nm and are very efficient at around 800 nm, but other materials can be used in the making of lasers to generate other frequencies and wavelengths. Alternatively, the other semiconductor materials which are typically used to make light emitting diodes (LEDs) are recited in the article: “Light-Emitting Diode Physics” on the website: https://en.wikipedia.org/wiki/Light-emitting_diode_physics.
When a prism is made from a crystalline material such as germanium, ruby, sapphire, diamond, quartz, salt, silicon, or other crystalline material, and in particular when the crystalline material is sensitive to a piezoelectric effect or can otherwise be caused to vibrate and change modes and so its optical and/or electrical properties, the prism can be adapted or tuned to communicate data using the electromagnetic light spectrum, that is, it is possible to make a tunable prism. Sapphire lasers are capable of providing between 670 nm-1100 nm, and is most efficient at about 800 nm in this range, and such lasers are sometimes used in spectroscopy. U.S. Pat. No. 2,212,845 by Alexander M. Nicolson discloses piezoelectric effects using Rochelle salt crystals. U.S. Pat. Nos. 1,450,246 and 1,472,583 by Walter Guyton Cady disclose crystal controlled oscillators, and these U.S. patents are hereby incorporated by reference herein. Quartz is silicon dioxide, and so-called AT cut quartz crystals can be used to make oscillators or resonators having a frequency between 800 KHz and 300 MHz. Synthetic quartz is made for this purpose, and it can be used in a crystal oscillator circuit. Mode locked oscillators can produce short pulses in the range of picoseconds and femtoseconds. The Seiko Epson 56-8003 series provides an example of a modern programmable quartz crystal oscillator, e.g., the Epson SG-8003CG. The aforementioned structures, devices, and methods of communicating data and information can be included in or used with one or more of the devices shown in
When information is sent wirelessly from a remote keyboard, mouse, game controller, or microphone to a computer using the binary system and digital communication, the electromagnetic signal can be received by the computer and processed by a digital to analog converter and then sent to an optical CPU and be stored in an optical memory chip, or alternatively, using other means of data storage such as ROM, RAM, Flash, Solid State Drive (SSD) memory, spintronics memory or DNA coding memory. Conversely, data and information that is processed and stored optically can be communicated by using an optical analog to digital converter to external devices which use electronic means and digital communication. For information on the subject of spintronics memory, see, e.g., the articles “Highly Efficient Spintronics Memory Offer High Speeds at Low Power,” published Dec. 7, 2020, on the website: https://www.hpcwire.com/off-the-wire/lighly-efficient-spintronics-memory-offersohigh-speeds-at-low-power/; and, “Spintronic Devices: A Promising Alternative to CMOS Devices,” by Prashanth Barla, Vinod Kumar Joshi, and Somashekara Bhat, published on Jan. 21, 2021 on the website: https://www.google.com/url?sa=t&source=web&rct=i&url=https:/link.springer.com/article/10.1007/s1 0825-020-01648-6&ved=2ahUKEw375bakKr1AhVxk4EHVfDtoQx7wDegQIBhAB&us=AOVaw0jCGYZC-CUXQ7cgBTSQsVO. For information on DNA coding memory, see, e.g., the articles “DNA Digital Data Storage” published on the Wikipedia website: https://g.co/kas/sna3Fj; “DNA: The Ultimate Data-Storage Solution-Scientific American,” by Latchesar Lonkov and Bradley Settlemyer, published on May 28, 2021 on the website: https://www.scientificamerican.com/article/dna-the-ultimate-data-storage-solution/?amp=true.
When a microphone 3 or one or more of the other devices shown in
As shown in
In this regard, when integer factorization and prime factorization is made possible on a routine basis with the use of quantum computers which could then possibly use Shor's Algorithm, there will be a need for other means and methods besides the presently widely used Rivest-Shamir-Adleman (RSA) public-key cryptosystem for providing security to data communication. The RSA public-key cryptosytem is disclosed in U.S. Pat. No. 4,405,829 which was granted to Ronald L Rivest, Adi Shamir, and Leonard M. Adleman of the Massachusetts Institute of Technology on Sep. 20, 1983, and this patent is hereby incorporated by reference herein. When using “mn” to represent and communicate a number such as 5 in the base 10 number system, the exponent “n” which in this case has the value 0.698970004 is a relatively small nine digit number. If and when a frequency and wavelength of light which is in the THz range is to be encoded to represent the number 5, it is possible to take the value “n” which is equal to 0.698970004 and use it as a first factor, and then multiply it by a second factor in order to derive the value of the frequency of the photonic sine wave which is to be encoded to represent the number 5. Alternatively, three or more factors could be used in order to derive the value of the frequency of the sine wave which would be encoded to represent the number 5. In this way, the ability to perform integer factorization and prime factorization would be flipped and instead of being used to break a code, it can be used to help create a code and then derive one or more factors which can serve as the key to arriving at a known numerical solution, and which in this case would correspond to the frequency of a sine wave. If and when the value of one or more of the factors would also be randomized then it would be even more difficult for a hacker or other unauthorized party or form of artificial intelligence to interpret and understand the data and information which would be contained in a communication.
The assignment and encoding of specific wavelengths to represent and communicate specific values, numbers, mathematical functions and operations can be stored in computer memory or other data and information, communication, manipulation and storage system. Other numerical values which are often used in the field of science, e.g., the speed of light which is 299,792,458 meters per second, Avogadro's number which is 6.022140857×1023, and Planck's constant which is 6.62607004×10−34 joule seconds can each be represented and communicated by different wave forms each having a different specific frequency and wavelength. As previously discussed, a software application can be used to access lists of numbers and other information which in the past have typically been included in hard copy tables of algorithms, but which can instead be stored in computer memory, and the software application can then execute and run programs which have been compiled which can include commands and algorithms to perform mathematical computations and other processes.
Visible light falls in the range of the electromagnetic spectrum between ultraviolet and infrared light. Visible light wavelengths have frequencies between approximately 4×1014 and 8×1014 cycles per second (Hz) which corresponds to frequencies in the range approximately between 405-790 THz and wavelengths in the range between approximately 380-740 nanometers (nm), and one cycle then has a period of about 2 femtoseconds (FS). The ultraviolet light spectrum includes wavelengths in the range between approximately 10 nm and 400 nm which corresponds to frequencies in the range between approximately 30 PHz-750 THz. The infrared light spectrum includes wavelengths in the range between approximately 700 nm-1 mm and corresponds to frequencies in the range between approximately 430 THz-300 GHz. In this regard, it is known that there can be some overlap as between the visible light spectrum and the infrared and ultraviolet light spectrums. Accordingly, in order to represent and communicate the number 5 shown in
In
In
When is possible to detect differences in the frequency and wavelength of sine waves corresponding to 1 nanometer (nm) with desired accuracy, then there would be about 360 different possible frequencies and wavelengths in the visible light spectrum, and at least 360 more in the infrared spectrum to work with in order to perform encoding. Some of the following methods and techniques can be used in order to provide for more possible code points when using wave forms to represent and communicate data and information. A first wave form having a first specific frequency and wavelength can be combined with a second wave form having a different and second specific frequency and wavelength. In this regard, the first wave form can be followed by the second in a series. Alternatively, the first wave form and second wave form can be communicated in parallel simultaneously and share the same point of origin, and could then create a single resultant wave form. Alternatively, the first wave form and second wave form can be offset and phase shifted relative to one another. Further, the many different positions to which the two wave forms can be phase shifted can each provide for different code points. The amplitude of one, the other, or both of the first wave form and the second wave form can also be changed and otherwise manipulated. Moreover, there are other methods and techniques which can be used to provide a multiplicity of possible code points, as discussed below.
Human DNA is a long molecule held together in two strands known as polynucleotides which form a double helix coil around a plurality of base pairs which are each made of two of four possible nucleobases, namely, cytosine (C), guanine (G), adenine (A), and thymine (T). In this regard, cytosine always pairs with guanine and adenine always pairs with thymine, and the human genome is made of about 3.2 billion of these base pairs which are disposed in a series in a DNA molecule. Selecting two colors from the red, blue, and green portions of the visible light spectrum, or from the red, blue, green, and yellow portions of the visible light spectrum, or selecting other specific frequencies and wavelengths in a different portion of the visible or invisible light spectrum, and then combining them as pairs and placing them in series or in parallel is one method and technique which can emulate and approximate the data and information coding and storage ability of the DNA molecule. This method, technique, and process for representing, configuring and communicating data and information will here be referred to as color coding, and/or color coded. For example, if four colors are selected from the red, blue, green, and yellow portions of the visible light spectrum, and they can all be combined with one another, that is, unlike cytosine, guanine, adenine, and thymine in human DNA, then the potential for data and information coding and storage is possibly even greater than DNA. Furthermore, there are many more combinations and permutations which are possible using approximately 360 different frequencies and wavelengths of visible light, and at least that many more different frequencies and wavelengths of invisible light in the infrared spectrum. For example, the possible number of combinations and permutations of one color having a specific frequency and wavelength being combined with another color having a different specific frequency and wavelength selected from a list or group including at least 360 members can be calculated: Permutations nPr=360!/(360−2)!=129,240, and Combinations nCr=360!/2!×(360−2)!=64,620. The possible number of combinations and permutations of four colors which each have a different specific frequency and wavelength which can be combined with one another selected from a list or group including at least 360 members can be calculated as follows: Permutations nPr=360!/(360−4)!=16,517,647,440, and Combinations nCr=360!/4!×(360−4)!=688,235,310. While it may not be possible or practical to encode infinite numbers with a finite number of coding points, this method and technique can nevertheless provide for a substantial number of coding points. Moreover, if, e.g., eight colors having different frequencies and wavelengths are selected for use then the result would be: Permutations nPr=360!/(360−8)!=260,858,210,442,628,246,400, and Combinations nCr=360!/8!×(360−8)!=6,469,697,679,132,645. As a point of reference, Unicode and ISO/IEC 10646 provide for about 1.1 million possible coding points.
As previously discussed, the current Webster's dictionary includes about 470,000 words, and the concise Oxford dictionary includes between about 171,476 words. However, it has been estimated that most individuals only have knowledge of about 15,000-20,000 word families which are called lemmas in their native language, and individuals seldom have knowledge of more than 2,000-3,000 word families in a foreign language. Accordingly, a concise dictionary for use with a computer language can include less than 20,000 lemmas, and even less than 5,000 lemmas. If even only 1,000 or 2,000 and certainly less than 3,000-5,000 alphabetical letters, words, symbols, and numbers are each individually assigned and coded in order to be represented and communicated in the form of a square wave or a sine wave having a specific frequency and wavelength, then the amount of data in bits, waves, vibes, qubits, or whatever name or form would be given to the data and information, can possibly be decreased by over 75%. The following two websites having 1000 and 3000 word lists include the most commonly used words in English: https://gonaturalenglish.com; and, http://basicenglishspeaking.com. According to the website http://basicenglishspeaking.com: “If you know these 3000 most common words, you can understand at least 95% of all conversations, e-mails, newspapers, and books.” This is one way to create faster computers which do not consume as much time and energy as they do today, that is, if the desire is to make computers 20 times faster, then one way to accomplish this is to make a new computer language which uses a lot less data in order to communicate the same information. In view of the number of coding points which can be provided by using combinations of different wave forms in the visible light spectrum, and/or invisible portion of the infrared light spectrum, or other portion of the electromagnetic spectrum, it is be possible to encode all of the words, symbols, and functions which are presently being used, and to also encode those numbers which are used by a typical user population, or a specific target population of scientists, or other users of computers or other data and information communication, manipulation, and storage devices.
As previously discussed, a number of different models such as OSI and TCP/IP are being used to communicate data and information in telecommunications and computer network environments. The method and process of combining two or more colors in the visible light spectrum or invisible portion of the infrared light spectrum associated with specific frequencies and wavelengths to configure and make a set, and further configuring and making a plurality of sets which can then be configured in series and/or parallel, can be further configured to include and/or be communicated with one or more other specific frequencies and wavelengths associated with the configuration and making of a packet which can include control information typically included in a header or footer, and also information for the possible purpose of synchronization and error detection and correction. In order to provide a visual aid by making reference to the structure of a DNA molecule, one can imagine the control information as being mostly contained in the double helix portion of the molecule or signal, but perhaps with a few breaks and/or portions in the plurality of sets being used to include control information and also the purpose of synchronization and error detection and correction, but most or all of the sets including different combinations of specific wavelengths and frequencies then being used like the cytosine (C), guanine (G), adenine (A), and thymine (T) nucleobases in the DNA molecule to deliver the payload of data and information. In this regard, various means for persisting data and information such as the use of classical electronic silicon-based memory chips, ROM, RAM, Flash-memory, Solid State Drive (SSD) memory, optical memory chips and/or other forms of photonic memory, spintronics memory, DNA memory, and what will here be referred to as a color coded memory (CCM) which is configured to process and store data and information which has been configured in various combinations and permutations of different frequencies and wavelengths of visible and/or invisible light. In this regard, the method, technique, and process of configuring data and information using various combinations and permutations of different frequencies and wavelengths of visible and/or invisible light has been discussed in the preceding paragraphs using the DNA molecule as a visual aid and this method and process has been referred to herein as color coding and/or color coded.
Again, one or more of the different models, methods, and processes which are being used to communicate data and information in various telecommunication and computer network environments can be configured and adapted to be used with one or more of the structures, methods, and processes discussed and shown in the present disclosure, and vice-versa, that is, the structures, methods, and processes relating to making a computer language and code for software application development, data compression, and use with conventional, optical, hybrid electro-optical and quantum computers can be configured and adapted to be used with one or more of the different models, methods, and processes which are being used to communicate data and information in various telecommunication and computer network environments.
Accordingly, whether data and information is communicated using visible light, invisible light, or a different portion of the electromagnetic spectrum, and whether the data and information is communicated in a series of wave forms, or a plurality of wave forms communicated in parallel, or a plurality of wave forms which are being communicated nearly or actually simultaneously, and then whether using electronic means and wires and/or photonic means using visible or invisible light and optical fiber cable or other photonic or optical communication structures, devices and methods, the data and information associated with a plurality of wave forms and signals can be communicated, identified, read and understood by a user of a computer or other data storage and processing device which includes a software application which includes a suitable compilation of programs, codes, lists, and algorithms including but not limited to the Fast Fourier Transform (FFT), and other possible commands, methods, and techniques for processing, manipulating, and storing data and information.
The following Clauses provide exemplary methods of making a computer language, and/or exemplary methods of communicating a computer language, and/or at least one exemplary computer language, but also exemplary optical keyboards and optical game controllers for use with electronic computers, optical computers, electro-optical computers, and/or quantum computers.
Clause 1: A method of making a computer language comprising providing a dictionary comprising a list comprising a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each member of said plurality being represented by a corresponding wave form comprising a specific frequency and wavelength.
Clause 2: The method of making a computer language according to clause 1, wherein said wave form is in the electromagnetic spectrum.
Clause 3: The method of making a computer language according to clause 1, wherein said wave form comprises a photonic wave in the visible light spectrum and/or invisible portion of the infrared light spectrum.
Clause 4: The method of making a computer language according to clause 1, wherein said wave form comprises a sine wave.
Clause 5: The method of making a computer language according to clause 1, wherein said wave form comprises an electronic wave.
Clause 6: The method of making a computer language according to clause 1, wherein said wave form comprises a square wave.
Clause 7: The method of making a computer language according to clause 1, wherein said wave form comprises a product of data compression.
Clause 8: The method of making a computer language according to clause 1, wherein said list of alphabetic letters and/or words further comprises a plurality of sub-lists comprising the following categories: noun, verb, adjective, adverb, pronoun, preposition, conjunction, determiner, and exclamation.
Clause 9: The method of making a computer language according to clause 1, wherein said plurality of member numbers are represented by a first wave form comprising a first frequency and wavelength which represents the base portion of a specific number, and a second wave form comprising a second frequency and wavelength which represents the exponent portion of said specific number, whereby the value of said specific number can be represented and communicated.
Clause 10: The method of making a computer language according to clause 9, wherein a difference exists in time and/or space between the start of said first wave form and said second wave form and said second wave form is substantially identical in amplitude and shape to said first wave form, but said second wave form is phase shifted relative to said first wave form, and said first wave form represents the base portion of said specific number, and the amount to which said second wave form is phase shifted in time and/or space represents the value of the exponent corresponding to said specific number, whereby the value of said specific number can be represented and communicated.
Clause 11: The method of making a computer language according to clause 1, wherein the absence of a break between two of said plurality of member numbers which are represented and/or communicated in a series represents a mathematic function comprising addition.
Clause 12: The method of making a computer language according to clause 1, wherein the absence of a break between two of said plurality of member numbers which are represented and/or communicated in a series represents a mathematical function comprising multiplication.
Clause 13: The method of making a computer language according to clause 1, wherein a break between two of said plurality of member letters and/or words and/or numbers and/or symbols represents a separation between said plurality member letters and/or words and/or numbers and/or symbols.
Clause 14: The method of making a computer language according to clause 1, wherein the presence of a wave form representing a symbol disposed between two of said plurality of member numbers represents a mathematical function and operation between said member numbers.
Clause 15: A method of making a computer language for representing any positive number using the values and numbers 0, 1, 2, 2nth exponential power, 3, and 3nth exponential power and/or a sum of two or more of said values and numbers.
Clause 16: A method of making a computer language for representing and communicating values or numbers each comprising a base portion comprising one or more of the following 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, and an exponent portion, said base portion being represented and communicated by a wave form comprising a first frequency and wavelength, said exponent portion being represented by a second wave form comprising a second frequency and wavelength, wherein a difference exists in time and/or space between the start of said first wave form and said second wave form, and said second wave form is substantially identical in amplitude and shape to said first wave form, and said second wave form is phase shifted relative to said first wave form, and the amount to which said second wave form is phase shifted in time and/or space represents and communicates the exponent, whereby said values or numbers can be represented and communicated.
Clause 17: The method of making a computer language for representing and communicating a plurality of values or numbers according to clause 16, wherein said first wave form and said second wave form comprise square waves.
Clause 18: The method of making a computer language for representing and communicating a plurality of values or numbers according to clause 16, wherein said first wave form and said second wave form comprise sine waves.
Clause 19: The method of making a computer language for representing and communicating a plurality of values or numbers according to clause 16, wherein said first wave form and said second wave form comprise different frequencies and wavelengths.
Clause 20: A method of making a computer language for representing and communicating a value or number in a known base number system, said value or number having a base portion equal to said known base number in said known base number system and an exponent portion comprising a value obtained from a list comprising a table of algorithms, said known base number in said known base number system and said exponent portion being configured to be manipulated by a mathematical function by which a resultant wave form having a specific wavelength is derived to represent and communicate said value or number.
Clause 21: The method of making a computer language according to clause 20, wherein said base number in said known base number system comprises the number 10 in the base 10 number system.
Clause 22: The method of making a computer language according to clause 20, wherein said base number in said known base number system comprises the natural logarithm value e.
Clause 23: An optical keyboard configured to communicate data and information using visible light and/or infrared light.
Clause 24: An optical game controller configured to communicate data and information using visible light and/or infrared light.
Clause 25: A computer keyboard comprising means for producing an output comprising photons and a plurality of sine waves in the visible light spectrum and/or invisible portion of the infrared light spectrum, said output comprising representations of a plurality of alphabetical letters and/or words and/or numbers and/or symbols and/or commands and/or functions and/or operations, said output being communicated by fiber optic cable to a computer, said computer selected from the group of computers consisting of an electronic computer, an optical computer, an electro-optical computer, and a quantum computer.
Clause 26: A method of communicating a computer language comprising providing a dictionary comprising a list comprising a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each of said plurality of member alphabetical letters and/or words and/or numbers and/or symbols being represented by a corresponding wave form comprising a specific frequency and wavelength.
Clause 27: A computer language comprising a dictionary comprising a list comprising a plurality of member alphabetical letters and/or words and/or numbers and/or symbols, each of said plurality of member alphabetical letters and/or words and/or numbers and/or symbols being represented by a corresponding wave form comprising a specific frequency and wavelength.
Clause 28: A method of making a computer language comprising selecting a value or number X in a base number system comprising a logarithmic function and expression Logbn=X, where b is the base portion of a number in said base number system, and where n is the exponent portion of said number in said base number system to which b is raised to produce said value or number X, taking and using n as a first factor, and multiplying n by at least a second factor to yield a specific frequency and associated wavelength comprising a portion of the electromagnetic spectrum.
Clause 29: The method according to clause 28, further including at least a third factor which is randomly generated, and the multiplication of said first factor n and said second factor and said third factor yields said frequency and associated wavelength comprising a portion of the electromagnetic spectrum.
Clause 30: The method according to clause 28, wherein said portion of the electromagnetic spectrum comprises a portion of the visible light spectrum and/or infrared light spectrum.
Clause 31: A method of making a computer language comprising selecting a plurality of wave forms corresponding to specific frequencies and associated wavelengths in the visible light spectrum and/or invisible portion of the infrared light spectrum, and combining at least two of said plurality of wave forms corresponding to specific frequencies and wavelengths to create a coding point.
Clause 32: The method according to clause 31, wherein at least four of said plurality of wave forms are combined to create a coding point.
Clause 33: The method according to clause 31, wherein said coding point is used to represent at least one of an alphabetical letter, a word, a number, a symbol, a command, a function, and an operation.
Clause 34: The method according to clause 31, wherein said at least two of said plurality of wave forms are combined to comprise a plurality of sets, said plurality of sets being disposed in series and/or in parallel to provide a plurality of coding points.
Clause 35: The method according to clause 34, wherein the number of permutations of said plurality of coding points corresponds to the formula: Permutations=(Number of Sets)!/(Number of Sets-2)!, and the number of combinations of said coding points corresponds to the formula: Combinations=(Number of Sets)!/2!×(Number of Sets-2)!
As discussed above, the computer language and code for software application development, data compression, and the communication of data and information can be used with conventional, optical, hybrid electro-optical and quantum computers. Having thus described the subject matter, it should be apparent that numerous software applications, modifications, and adaptations may be resorted to without departing from the scope and fair meaning of the subject matter as set forth hereinabove.
The present application is a continuation of and claims priority of U.S. patent application Ser. No. 17/577,922, filed Jan. 18, 2022, the content of which is hereby incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 235199 | Bell | Dec 1880 | A |
| 1450246 | Cady | Apr 1923 | A |
| 1472583 | Cady | Oct 1923 | A |
| 2212845 | Nicolson | Aug 1940 | A |
| 4128843 | Chiang | Dec 1978 | A |
| 4405829 | Rivest et al. | Sep 1983 | A |
| 4461944 | Cohen | Jul 1984 | A |
| 5247693 | Bristol | Sep 1993 | A |
| 5692047 | McManis | Nov 1997 | A |
| 5706502 | Foley et al. | Jan 1998 | A |
| 5754857 | Gadol | May 1998 | A |
| 5815718 | Tock | Sep 1998 | A |
| 5892904 | Atkinson et al. | Apr 1999 | A |
| 5920720 | Toutonghi et al. | Jul 1999 | A |
| 5925123 | Tremblay et al. | Jul 1999 | A |
| 5966542 | Tock | Oct 1999 | A |
| 6003038 | Chen | Dec 1999 | A |
| 6003050 | Silver et al. | Dec 1999 | A |
| 6006241 | Purnaveja et al. | Dec 1999 | A |
| 6026485 | O'Connor et al. | Feb 2000 | A |
| 6031993 | Andrews et al. | Feb 2000 | A |
| 6035119 | Massena et al. | Mar 2000 | A |
| 6044218 | Faustini | Mar 2000 | A |
| 6058482 | Liu | May 2000 | A |
| 6061520 | Yellin et al. | May 2000 | A |
| 6070239 | McManis | May 2000 | A |
| 6093216 | Adl-Tabatabai et al. | Jul 2000 | A |
| 6122745 | Wong-Insley | Sep 2000 | A |
| 6131191 | Cierniak et al. | Oct 2000 | A |
| 6134600 | Liu | Oct 2000 | A |
| 6134627 | Bak | Oct 2000 | A |
| 6141794 | Dice et al. | Oct 2000 | A |
| 6158048 | Lueh et al. | Dec 2000 | A |
| 6170083 | Adl-Tabatabai | Jan 2001 | B1 |
| 6173317 | Chaddha et al. | Jan 2001 | B1 |
| 6188995 | Garst et al. | Feb 2001 | B1 |
| 6216227 | Goldstein et al. | Apr 2001 | B1 |
| 6223346 | Tock | Apr 2001 | B1 |
| 6229537 | Sobeski et al. | May 2001 | B1 |
| 6230172 | Purnaveja et al. | May 2001 | B1 |
| 6230182 | Le et al. | May 2001 | B1 |
| 6233582 | Traversat et al. | May 2001 | B1 |
| 6253256 | Wollrath et al. | Jun 2001 | B1 |
| 6260077 | Rangarajan et al. | Jul 2001 | B1 |
| 6260078 | Fowlow | Jul 2001 | B1 |
| 6282568 | Sondur et al. | Aug 2001 | B1 |
| 6289504 | Cierniak et al. | Sep 2001 | B1 |
| 6289506 | Kwong et al. | Sep 2001 | B1 |
| 6308315 | Dice et al. | Oct 2001 | B1 |
| 6317869 | Adl-Tabatabai et al. | Nov 2001 | B1 |
| 6349333 | Panikatt et al. | Feb 2002 | B1 |
| 6349344 | Sauntry et al. | Feb 2002 | B1 |
| 6366898 | Taivalsaari et al. | Apr 2002 | B2 |
| 6367012 | Atkinson et al. | Apr 2002 | B1 |
| 6370685 | Robison | Apr 2002 | B1 |
| 6401134 | Razavi et al. | Jun 2002 | B1 |
| 6407759 | Kanungo et al. | Jun 2002 | B1 |
| 6415334 | Kanamori | Jul 2002 | B1 |
| 6418444 | Raduchel et al. | Jul 2002 | B1 |
| 6427153 | Nelson et al. | Jul 2002 | B2 |
| 6430567 | Burridge | Aug 2002 | B2 |
| 6446084 | Shaylor et al. | Sep 2002 | B1 |
| 6459097 | Zagoskin | Oct 2002 | B1 |
| 6466974 | Nelson et al. | Oct 2002 | B1 |
| 6484188 | Kwong et al. | Nov 2002 | B1 |
| 6484311 | Sobeski et al. | Nov 2002 | B2 |
| 6484312 | Morrison | Nov 2002 | B1 |
| 6499035 | Sobeski | Dec 2002 | B1 |
| 6504172 | Zagoskin et al. | Jan 2003 | B2 |
| 6504554 | Stone et al. | Jan 2003 | B1 |
| 6522343 | Sobeski et al. | Feb 2003 | B2 |
| 6537847 | Zagoskin et al. | Mar 2003 | B2 |
| RE38104 | Gosling | Apr 2003 | E |
| 6542900 | Xia | Apr 2003 | B1 |
| 6563310 | Zagoskin | May 2003 | B2 |
| 6563311 | Zagoskin | May 2003 | B2 |
| 6573202 | Ivanov et al. | Jun 2003 | B2 |
| 6576951 | Ivanov et al. | Jun 2003 | B2 |
| 6580102 | Ivanov et al. | Jun 2003 | B2 |
| 6605822 | Blais et al. | Aug 2003 | B1 |
| 6611864 | Putzolu et al. | Aug 2003 | B2 |
| 6614047 | Tzalenchuk et al. | Sep 2003 | B2 |
| 6625803 | Massena et al. | Sep 2003 | B1 |
| 6627915 | Ustinov et al. | Sep 2003 | B1 |
| 6627916 | Amin et al. | Sep 2003 | B2 |
| 6633876 | Heatlie | Oct 2003 | B1 |
| 6637021 | Dubey | Oct 2003 | B1 |
| 6651140 | Kumar | Nov 2003 | B1 |
| 6661943 | Li | Dec 2003 | B2 |
| 6665865 | Ruf | Dec 2003 | B1 |
| 6670630 | Blais et al. | Dec 2003 | B2 |
| 6711739 | Kutcher | Mar 2004 | B1 |
| 6721777 | Sharma | Apr 2004 | B1 |
| 6728131 | Ustinov | Apr 2004 | B2 |
| 6742006 | Raduchel et al. | May 2004 | B2 |
| 6745387 | Ng et al. | Jun 2004 | B1 |
| 6748588 | Fraser et al. | Jun 2004 | B1 |
| 6751790 | Sokolov et al. | Jun 2004 | B2 |
| 6753546 | Tzalenchuk et al. | Jun 2004 | B2 |
| 6754796 | Sokolov et al. | Jun 2004 | B2 |
| 6766349 | Belkin | Jul 2004 | B1 |
| 6772178 | Mandal et al. | Aug 2004 | B2 |
| 6784451 | Amin et al. | Aug 2004 | B2 |
| 6791109 | Tzalenchuk et al. | Sep 2004 | B2 |
| 6799185 | Wallman et al. | Sep 2004 | B2 |
| 6803599 | Amin et al. | Oct 2004 | B2 |
| 6804681 | Sokolov et al. | Oct 2004 | B2 |
| 6812484 | Tzalenchuk et al. | Nov 2004 | B2 |
| 6822255 | Tzalenchuk et al. | Nov 2004 | B2 |
| 6823140 | Davidson | Nov 2004 | B1 |
| 6823504 | Sokolov | Nov 2004 | B1 |
| 6839647 | Volkov et al. | Jan 2005 | B2 |
| 6850953 | Deshpande et al. | Feb 2005 | B1 |
| 6854114 | Sexton et al. | Feb 2005 | B1 |
| 6854122 | Sheriff et al. | Feb 2005 | B1 |
| 6862674 | Dice et al. | Mar 2005 | B2 |
| 6873984 | Campos et al. | Mar 2005 | B1 |
| 6877111 | Sharma et al. | Apr 2005 | B2 |
| 6885325 | Omelyanchouk et al. | Apr 2005 | B2 |
| 6886157 | Long et al. | Apr 2005 | B2 |
| 6889227 | Hamilton | May 2005 | B1 |
| 6897468 | Blais et al. | May 2005 | B2 |
| 6898786 | Sokolov | May 2005 | B1 |
| 6900454 | Blais et al. | May 2005 | B2 |
| 6900456 | Blais et al. | May 2005 | B2 |
| 6901591 | Sokolov | May 2005 | B1 |
| 6905887 | Amin et al. | Jun 2005 | B2 |
| 6911664 | Il'ichev et al. | Jun 2005 | B2 |
| 6912569 | Sharma et al. | Jun 2005 | B1 |
| 6918109 | Sokolov | Jul 2005 | B2 |
| 6919579 | Amin et al. | Jul 2005 | B2 |
| 6922796 | Matena et al. | Jul 2005 | B1 |
| 6928456 | Sadhasivan et al. | Aug 2005 | B2 |
| 6930320 | Blais et al. | Aug 2005 | B2 |
| 6934726 | Sokolov et al. | Aug 2005 | B2 |
| 6934946 | Sokolov et al. | Aug 2005 | B2 |
| 6936841 | Amin et al. | Aug 2005 | B2 |
| 6943368 | Amin et al. | Sep 2005 | B2 |
| 6951014 | Sokolov | Sep 2005 | B1 |
| 6957427 | Wollrath et al. | Oct 2005 | B1 |
| 6957428 | Sokolov et al. | Oct 2005 | B2 |
| 6959430 | Sokolov et al. | Oct 2005 | B2 |
| 6960780 | Blais et al. | Nov 2005 | B2 |
| 6961843 | O'Connor et al. | Nov 2005 | B2 |
| 6961933 | Sokolov | Nov 2005 | B2 |
| 6964033 | Wallman et al. | Nov 2005 | B2 |
| 6976061 | Sharma | Dec 2005 | B1 |
| 6978401 | Avvari et al. | Dec 2005 | B2 |
| 6978456 | Sokolov et al. | Dec 2005 | B1 |
| 6979836 | Zagoskin et al. | Dec 2005 | B2 |
| 6980979 | Huang et al. | Dec 2005 | B2 |
| 6981246 | Dunn | Dec 2005 | B2 |
| 6981255 | Kanamori | Dec 2005 | B2 |
| 6983465 | Mandal et al. | Jan 2006 | B2 |
| 6986129 | Arbouzov et al. | Jan 2006 | B2 |
| 6987282 | Amin et al. | Jan 2006 | B2 |
| 6996587 | Wagener et al. | Feb 2006 | B2 |
| 6996824 | Sokolov | Feb 2006 | B2 |
| 6996826 | Kanamori | Feb 2006 | B2 |
| 7000235 | Mandal et al. | Feb 2006 | B2 |
| 7002174 | Il'ichev et al. | Feb 2006 | B2 |
| 7003778 | Sokolov | Feb 2006 | B2 |
| 7015499 | Zagoskin | Mar 2006 | B1 |
| 7016966 | Saulpaugh et al. | Mar 2006 | B1 |
| 7018852 | Wu et al. | Mar 2006 | B2 |
| 7032216 | Nizhegorodov | Apr 2006 | B1 |
| 7039904 | Sokolov | May 2006 | B2 |
| 7042005 | Il'ichev et al. | May 2006 | B2 |
| 7043732 | Mandal et al. | May 2006 | B2 |
| 7043738 | Mandal et al. | May 2006 | B2 |
| 7047524 | Braddock, Jr. | May 2006 | B1 |
| 7054890 | Musante et al. | May 2006 | B2 |
| 7055133 | Plummer et al. | May 2006 | B2 |
| 7058934 | Sokolov | Jun 2006 | B2 |
| 7065747 | Sokolov et al. | Jun 2006 | B2 |
| 7069554 | Stammers et al. | Jun 2006 | B1 |
| 7096467 | Wallman et al. | Aug 2006 | B2 |
| 7109593 | Freedman et al. | Sep 2006 | B2 |
| 7117489 | Wallman et al. | Oct 2006 | B2 |
| 7130773 | Wong | Oct 2006 | B1 |
| 7131111 | Passanisi | Oct 2006 | B2 |
| 7131120 | Veselov | Oct 2006 | B2 |
| 7135701 | Amin et al. | Nov 2006 | B2 |
| 7155501 | Mandal et al. | Dec 2006 | B2 |
| 7159213 | Tock | Jan 2007 | B2 |
| 7162711 | Czajkowski et al. | Jan 2007 | B2 |
| 7165108 | Matena et al. | Jan 2007 | B2 |
| 7167894 | Boudnik et al. | Jan 2007 | B1 |
| 7177934 | Matena et al. | Feb 2007 | B2 |
| 7181724 | Sokolov et al. | Feb 2007 | B2 |
| 7191453 | Srinivasan et al. | Mar 2007 | B2 |
| 7194729 | Stone et al. | Mar 2007 | B2 |
| 7197750 | Wallman et al. | Mar 2007 | B2 |
| 7209960 | Veselov | Apr 2007 | B2 |
| 7210127 | Rangachari | Apr 2007 | B1 |
| 7219331 | Pabla | May 2007 | B2 |
| 7228533 | Sokolov | Jun 2007 | B2 |
| 7230266 | Hilton et al. | Jun 2007 | B2 |
| 7240338 | Bell et al. | Jul 2007 | B1 |
| 7243356 | Saulpaugh et al. | Jul 2007 | B1 |
| 7246134 | Kitain et al. | Jul 2007 | B1 |
| 7246345 | Sharma et al. | Jul 2007 | B1 |
| 7250624 | Freedman et al. | Jul 2007 | B1 |
| 7251066 | Chao et al. | Jul 2007 | B2 |
| 7253654 | Amin | Aug 2007 | B2 |
| 7266816 | Sharma et al. | Sep 2007 | B1 |
| 7266822 | Boudnik et al. | Sep 2007 | B1 |
| 7268576 | Amin | Sep 2007 | B2 |
| 7290045 | Mandal | Oct 2007 | B2 |
| 7296235 | Bhat et al. | Nov 2007 | B2 |
| 7305671 | Davidov et al. | Dec 2007 | B2 |
| 7307275 | Lidar et al. | Dec 2007 | B2 |
| 7318128 | Dice | Jan 2008 | B1 |
| 7321131 | Freedman et al. | Jan 2008 | B2 |
| 7332738 | Blais et al. | Feb 2008 | B2 |
| 7335909 | Amin et al. | Feb 2008 | B2 |
| 7346889 | Semenov et al. | Mar 2008 | B1 |
| 7370322 | Matena et al. | May 2008 | B1 |
| 7376547 | Meredith | May 2008 | B2 |
| 7394092 | Freedman et al. | Jul 2008 | B2 |
| 7398533 | Slaughter et al. | Jul 2008 | B1 |
| 7409439 | Raja et al. | Aug 2008 | B2 |
| 7418283 | Amin | Aug 2008 | B2 |
| 7421687 | Yellin et al. | Sep 2008 | B1 |
| 7426721 | Saulpaugh et al. | Sep 2008 | B1 |
| 7448042 | Engber et al. | Nov 2008 | B1 |
| 7451393 | Herbison et al. | Nov 2008 | B1 |
| 7454428 | Wang et al. | Nov 2008 | B2 |
| 7461395 | Ng | Dec 2008 | B2 |
| 7480921 | Vigesaa et al. | Jan 2009 | B1 |
| 7490330 | Sexton et al. | Feb 2009 | B2 |
| 7509631 | Lucas et al. | Mar 2009 | B2 |
| 7518138 | Freedman et al. | Apr 2009 | B2 |
| 7533068 | Maassen van den Brink et al. | May 2009 | B2 |
| 7533156 | Jeyaraman et al. | May 2009 | B1 |
| 7543288 | Sokolov et al. | Jun 2009 | B2 |
| 7546590 | Stone et al. | Jun 2009 | B2 |
| 7546605 | Kruger et al. | Jun 2009 | B1 |
| 7548946 | Saulpaugh et al. | Jun 2009 | B1 |
| 7565647 | Davidov et al. | Jul 2009 | B2 |
| 7566896 | Freedman et al. | Jul 2009 | B2 |
| 7574710 | Jeyaraman et al. | Aug 2009 | B1 |
| 7584302 | Pg et al. | Sep 2009 | B1 |
| 7598514 | Freedman et al. | Oct 2009 | B2 |
| 7605600 | Harris | Oct 2009 | B2 |
| 7613764 | Hilton et al. | Nov 2009 | B1 |
| 7613765 | Hilton et al. | Nov 2009 | B1 |
| 7619437 | Thom et al. | Nov 2009 | B2 |
| 7624088 | Johnson et al. | Nov 2009 | B2 |
| 7634779 | Foote et al. | Dec 2009 | B2 |
| 7639035 | Berkley | Dec 2009 | B2 |
| 7644403 | Atsatt | Jan 2010 | B2 |
| 7647415 | Sandoz et al. | Jan 2010 | B1 |
| 7650505 | Masurkar | Jan 2010 | B1 |
| 7685430 | Masurkar | Mar 2010 | B1 |
| 7687938 | Bunyk et al. | Mar 2010 | B2 |
| 7716274 | Kumar | May 2010 | B1 |
| 7716339 | Chitilian et al. | May 2010 | B2 |
| 7720877 | Kumar | May 2010 | B1 |
| 7730492 | Blaukopf et al. | Jun 2010 | B1 |
| 7730523 | Masurkar | Jun 2010 | B1 |
| 7739665 | Stone et al. | Jun 2010 | B2 |
| 7752626 | Pandey et al. | Jul 2010 | B1 |
| 7784043 | Atsatt | Aug 2010 | B2 |
| 7788192 | Amin | Aug 2010 | B2 |
| 7788489 | Ng | Aug 2010 | B2 |
| 7793255 | Kawaguchi et al. | Sep 2010 | B1 |
| 7800395 | Johnson et al. | Sep 2010 | B2 |
| 7802239 | Hamilton | Sep 2010 | B2 |
| 7802240 | Reinhold | Sep 2010 | B2 |
| 7814472 | Atsatt | Oct 2010 | B2 |
| 7827535 | Maron | Nov 2010 | B2 |
| 7840939 | Chinnici | Nov 2010 | B1 |
| 7840967 | Czajkowski et al. | Nov 2010 | B1 |
| 7843209 | Berkley | Nov 2010 | B2 |
| 7844656 | Macready et al. | Nov 2010 | B2 |
| 7870087 | Macready et al. | Jan 2011 | B2 |
| 7870112 | Karun et al. | Jan 2011 | B2 |
| 7873951 | Bissett et al. | Jan 2011 | B1 |
| 7873979 | Foote et al. | Jan 2011 | B1 |
| 7876248 | Berkley et al. | Jan 2011 | B2 |
| 7877333 | Macready | Jan 2011 | B2 |
| 7880529 | Amin | Feb 2011 | B2 |
| 7898282 | Harris et al. | Mar 2011 | B2 |
| 7899852 | Amin | Mar 2011 | B2 |
| 7900215 | Engber et al. | Mar 2011 | B2 |
| 7921169 | Jacobs et al. | Apr 2011 | B2 |
| 7925952 | Katz et al. | Apr 2011 | B1 |
| 7932515 | Bunyk | Apr 2011 | B2 |
| 7949760 | Chitilian et al. | May 2011 | B2 |
| 7953773 | Lindholm et al. | May 2011 | B2 |
| 7962527 | Simpson | Jun 2011 | B2 |
| 7962902 | Chow et al. | Jun 2011 | B2 |
| 7962925 | Fry et al. | Jun 2011 | B2 |
| 7969805 | Thom et al. | Jun 2011 | B2 |
| 7984012 | Coury et al. | Jul 2011 | B2 |
| 7990662 | Berkley et al. | Aug 2011 | B2 |
| 8008942 | van den Brink et al. | Aug 2011 | B2 |
| 8008991 | Tcaciuc et al. | Aug 2011 | B2 |
| 8018244 | Berkley | Sep 2011 | B2 |
| 8027925 | Garst et al. | Sep 2011 | B1 |
| 8032474 | Macready et al. | Oct 2011 | B2 |
| 8032872 | Violleau et al. | Oct 2011 | B2 |
| 8046772 | Upton | Oct 2011 | B2 |
| 8064065 | Bennett | Nov 2011 | B2 |
| 8082489 | Jiang | Dec 2011 | B2 |
| 8156482 | Lagergren | Apr 2012 | B2 |
| 8180746 | Somogyi et al. | May 2012 | B2 |
| 8195721 | Lindholm et al. | Jun 2012 | B2 |
| 8196128 | Susarla et al. | Jun 2012 | B2 |
| 8219609 | Bhattacharjee et al. | Jul 2012 | B1 |
| 8245206 | Lagergren et al. | Aug 2012 | B2 |
| 8250572 | Dahlstedt | Aug 2012 | B2 |
| 8255680 | Gong | Aug 2012 | B1 |
| 8261269 | Garmark | Sep 2012 | B2 |
| 8316083 | Xiao et al. | Nov 2012 | B2 |
| 8321450 | Thatte et al. | Nov 2012 | B2 |
| 8332835 | Atsatt | Dec 2012 | B2 |
| 8365157 | Lagergren | Jan 2013 | B2 |
| 8387076 | Thatte et al. | Feb 2013 | B2 |
| 8426871 | Rapoport et al. | Apr 2013 | B2 |
| 8429650 | Ferwerda et al. | Apr 2013 | B2 |
| 8452712 | Garst et al. | May 2013 | B2 |
| 8463852 | Sposetti et al. | Jun 2013 | B2 |
| 8490120 | Cable | Jul 2013 | B2 |
| 8495107 | Khanna | Jul 2013 | B2 |
| 8533383 | Ohrstrom et al. | Sep 2013 | B2 |
| 8533621 | Meddaugh | Sep 2013 | B1 |
| 8555264 | Ohrstrom | Oct 2013 | B2 |
| 8566826 | Garmark | Oct 2013 | B2 |
| 8572579 | Ashish et al. | Oct 2013 | B2 |
| 8581227 | Freedman et al. | Nov 2013 | B2 |
| 8601447 | Browne et al. | Dec 2013 | B2 |
| 8615734 | Susarla et al. | Dec 2013 | B2 |
| 8627328 | Mousseau et al. | Jan 2014 | B2 |
| 8635185 | Somogyi et al. | Jan 2014 | B2 |
| 8635660 | Ng et al. | Jan 2014 | B2 |
| 8639787 | Lagergren et al. | Jan 2014 | B2 |
| 8661407 | Siegemund et al. | Feb 2014 | B2 |
| 8695006 | Grieve et al. | Apr 2014 | B2 |
| 8713546 | Lagergren | Apr 2014 | B2 |
| 8732191 | Somogyi et al. | May 2014 | B2 |
| 8744075 | Tanaka | Jun 2014 | B2 |
| 8776053 | Lagergren et al. | Jul 2014 | B2 |
| 8781971 | Garst, Jr. et al. | Jul 2014 | B2 |
| 8793670 | Lagergren | Jul 2014 | B2 |
| 8799885 | Atsatt | Aug 2014 | B2 |
| 8805896 | Khanna | Aug 2014 | B2 |
| 8806493 | Dahlstedt | Aug 2014 | B2 |
| 8813031 | Agarwal | Aug 2014 | B2 |
| 8826246 | Lagergren et al. | Sep 2014 | B2 |
| 8832710 | Mousseau et al. | Sep 2014 | B2 |
| 8838669 | Cable | Sep 2014 | B2 |
| 8850412 | Bovet et al. | Sep 2014 | B2 |
| 8856294 | Lagergren et al. | Oct 2014 | B2 |
| 8856460 | Bihani et al. | Oct 2014 | B2 |
| 8856805 | Poore et al. | Oct 2014 | B2 |
| 8863126 | Poore et al. | Oct 2014 | B2 |
| 8875094 | Kalyanasundaram | Oct 2014 | B2 |
| 8875113 | Wagner et al. | Oct 2014 | B2 |
| 8881099 | Gallagher | Nov 2014 | B2 |
| 8924789 | Larsen et al. | Dec 2014 | B2 |
| 8959106 | de Castro Alves et al. | Feb 2015 | B2 |
| 8959485 | Kvartskhava et al. | Feb 2015 | B2 |
| 8965950 | Clinick et al. | Feb 2015 | B2 |
| 8978023 | Poore et al. | Mar 2015 | B2 |
| 9037542 | Mishra | May 2015 | B2 |
| 9043768 | Ohrstrom | May 2015 | B2 |
| 9058471 | Sastry et al. | Jun 2015 | B2 |
| 9141539 | Ahmad | Sep 2015 | B2 |
| 9152924 | Bonderson et al. | Oct 2015 | B2 |
| 9160749 | Subramanian et al. | Oct 2015 | B2 |
| 9171096 | Palanisamy et al. | Oct 2015 | B2 |
| 9177033 | Ilitchev et al. | Nov 2015 | B2 |
| 9183013 | Lagergren | Nov 2015 | B2 |
| 9185054 | Revanuru et al. | Nov 2015 | B2 |
| 9213562 | Veresov | Dec 2015 | B2 |
| 9231995 | Junnarkar et al. | Jan 2016 | B2 |
| 9239814 | Lagergren et al. | Jan 2016 | B2 |
| 9246602 | Ukita et al. | Jan 2016 | B2 |
| 9256834 | Bonderson et al. | Feb 2016 | B2 |
| 9411566 | Ohrstrom | Aug 2016 | B2 |
| 9417992 | Huang et al. | Aug 2016 | B2 |
| 9430222 | Denise et al. | Aug 2016 | B2 |
| 9448928 | Ahad et al. | Sep 2016 | B2 |
| 9467355 | Doering et al. | Oct 2016 | B2 |
| 9509745 | Gangadharan et al. | Nov 2016 | B2 |
| 9519466 | Delsart | Dec 2016 | B2 |
| 9542222 | Mousseau et al. | Jan 2017 | B2 |
| 9552277 | Deshmukh et al. | Jan 2017 | B2 |
| 9588047 | Jungwirth et al. | Mar 2017 | B2 |
| 9588742 | Shakespeare et al. | Mar 2017 | B2 |
| 9600546 | Shivarudraiah et al. | Mar 2017 | B2 |
| 9626488 | Traversat et al. | Apr 2017 | B2 |
| 9648084 | Bihani et al. | May 2017 | B2 |
| 9667430 | Connelly | May 2017 | B2 |
| 9715950 | Jungwirth et al. | Jul 2017 | B2 |
| 9740597 | Rose et al. | Aug 2017 | B2 |
| 9766071 | Compton et al. | Sep 2017 | B2 |
| 9804946 | Conlon et al. | Oct 2017 | B2 |
| 9811359 | Bansal | Nov 2017 | B2 |
| 9843629 | Abdelaziz et al. | Dec 2017 | B2 |
| 9875122 | Dahlstedt | Jan 2018 | B2 |
| 9880938 | Shivarudraiah et al. | Jan 2018 | B2 |
| 9904668 | Bruno et al. | Feb 2018 | B2 |
| 9930129 | Felts et al. | Mar 2018 | B2 |
| 9952841 | Lattner et al. | Apr 2018 | B2 |
| 9971618 | Lagergren et al. | May 2018 | B2 |
| 10049127 | Shavit et al. | Aug 2018 | B1 |
| 10103946 | Xiao et al. | Oct 2018 | B2 |
| 10115116 | Livshits et al. | Oct 2018 | B2 |
| 10127259 | Tian et al. | Nov 2018 | B2 |
| 10133827 | Then et al. | Nov 2018 | B2 |
| 10145792 | Jungwirth et al. | Dec 2018 | B2 |
| 10225323 | Revanuru et al. | Mar 2019 | B2 |
| 10229032 | Ashish et al. | Mar 2019 | B2 |
| 10268456 | Kalyanasundaram et al. | Apr 2019 | B2 |
| 10268622 | Hilton et al. | Apr 2019 | B2 |
| 10272400 | Staheli et al. | Apr 2019 | B2 |
| 10275422 | Israel et al. | Apr 2019 | B2 |
| 10290798 | Harris et al. | May 2019 | B2 |
| 10291326 | Glatfelter | May 2019 | B2 |
| 10318881 | Rose et al. | Jun 2019 | B2 |
| 10320360 | Wiebe et al. | Jun 2019 | B2 |
| 10320394 | Powell et al. | Jun 2019 | B1 |
| 10324692 | Alabes et al. | Jun 2019 | B2 |
| 10326071 | Uchaykin | Jun 2019 | B2 |
| 10331163 | Luo | Jun 2019 | B1 |
| 10340052 | Jungwirth et al. | Jul 2019 | B2 |
| 10346348 | Hastings et al. | Jul 2019 | B2 |
| 10346349 | Maassen van den Brink et al. | Jul 2019 | B2 |
| 10346508 | Amin et al. | Jul 2019 | B2 |
| 10346761 | Clarke et al. | Jul 2019 | B2 |
| 10366339 | Bocharov et al. | Jul 2019 | B2 |
| 10373139 | Traversat et al. | Aug 2019 | B2 |
| 10374610 | Braun | Aug 2019 | B1 |
| 10378803 | Uchaykin | Aug 2019 | B2 |
| 10411713 | Harms et al. | Sep 2019 | B2 |
| 10417370 | Hastings et al. | Sep 2019 | B2 |
| 10423887 | Roetteler et al. | Sep 2019 | B2 |
| 10430162 | Roetteler et al. | Oct 2019 | B2 |
| 10453894 | Ladizinsky et al. | Oct 2019 | B2 |
| 10454015 | Lanting et al. | Oct 2019 | B2 |
| 10467543 | Macready et al. | Nov 2019 | B2 |
| 10467545 | Harris | Nov 2019 | B2 |
| 10468793 | Petroff et al. | Nov 2019 | B2 |
| 10469087 | Granade et al. | Nov 2019 | B1 |
| 10474998 | Xiao et al. | Nov 2019 | B2 |
| 10476938 | Barnes et al. | Nov 2019 | B2 |
| 10489477 | Lanting | Nov 2019 | B2 |
| 10490600 | Freedman et al. | Nov 2019 | B2 |
| 10496933 | Karzig | Dec 2019 | B1 |
| 10507385 | Lyden | Dec 2019 | B2 |
| 10520024 | Jin | Dec 2019 | B2 |
| 10528886 | Boothby | Jan 2020 | B2 |
| 10546621 | Murduck et al. | Jan 2020 | B2 |
| 10547664 | Kinebuchi et al. | Jan 2020 | B2 |
| 10552755 | Lanting et al. | Feb 2020 | B2 |
| 10552757 | Amin et al. | Feb 2020 | B2 |
| 10558434 | Shakespeare et al. | Feb 2020 | B2 |
| 10574268 | Hastings | Feb 2020 | B2 |
| 10586566 | Stafford | Mar 2020 | B1 |
| 10599988 | Thom et al. | Mar 2020 | B2 |
| 10606568 | Hou | Mar 2020 | B2 |
| 10621140 | Raymond | Apr 2020 | B2 |
| 10635988 | Lutchyn et al. | Apr 2020 | B2 |
| 10635990 | Park et al. | Apr 2020 | B1 |
| 10651808 | Egan et al. | May 2020 | B2 |
| 10657198 | Amin et al. | May 2020 | B2 |
| 10664249 | Amy et al. | May 2020 | B2 |
| 10664761 | Haener et al. | May 2020 | B2 |
| 10665701 | Freedman et al. | May 2020 | B2 |
| 10671937 | Yarkoni et al. | Jun 2020 | B2 |
| 10691633 | Maassen Van Den Brink et al. | Jun 2020 | B2 |
| 10692010 | Freedman et al. | Jun 2020 | B2 |
| 10699208 | Wiebe et al. | Jun 2020 | B2 |
| 10699209 | Haener et al. | Jun 2020 | B2 |
| 10700256 | Ladizinsky et al. | Jun 2020 | B2 |
| 10733524 | Feig et al. | Aug 2020 | B1 |
| 10740689 | Kliuchnikov et al. | Aug 2020 | B2 |
| 10748079 | Boothby | Aug 2020 | B2 |
| 10755190 | Tcaciuc et al. | Aug 2020 | B2 |
| 10760954 | Lust | Sep 2020 | B2 |
| 10769545 | Amin et al. | Sep 2020 | B2 |
| 10777605 | Freedman et al. | Sep 2020 | B2 |
| 10789329 | Lanting | Sep 2020 | B2 |
| 10789540 | King et al. | Sep 2020 | B2 |
| 10804871 | Reed et al. | Oct 2020 | B1 |
| 10809592 | Dutt et al. | Oct 2020 | B2 |
| 10811587 | Braun | Oct 2020 | B2 |
| 10817796 | Macready et al. | Oct 2020 | B2 |
| 10826975 | Revanuru et al. | Nov 2020 | B2 |
| 10846608 | Haah et al. | Nov 2020 | B2 |
| 10860759 | Roetteler et al. | Dec 2020 | B2 |
| 10879464 | Krogstrup Jeppesen et al. | Dec 2020 | B2 |
| 10885459 | Biamonte et al. | Jan 2021 | B2 |
| 10891554 | Harris et al. | Jan 2021 | B2 |
| 10897068 | Tcaciuc et al. | Jan 2021 | B2 |
| 10922381 | Amin et al. | Feb 2021 | B2 |
| 10938346 | Berkley et al. | Mar 2021 | B2 |
| 10951002 | Bohn et al. | Mar 2021 | B1 |
| 10963125 | Gupta et al. | Mar 2021 | B2 |
| 10972133 | Chamberland et al. | Apr 2021 | B2 |
| 10990677 | Wiebe et al. | Apr 2021 | B2 |
| 10991755 | Ladizinsky et al. | Apr 2021 | B2 |
| 10991802 | Pillarisetty et al. | Apr 2021 | B2 |
| 10992166 | Hsieh et al. | Apr 2021 | B2 |
| 10997337 | Low et al. | May 2021 | B2 |
| 10997522 | Hayes et al. | May 2021 | B1 |
| 11003046 | Liscidini et al. | May 2021 | B2 |
| 11004008 | Bocharov et al. | May 2021 | B2 |
| 11010450 | Granade et al. | May 2021 | B2 |
| 11010682 | Bocharov et al. | May 2021 | B2 |
| 11010683 | Amin et al. | May 2021 | B2 |
| 11010684 | Pikulin | May 2021 | B2 |
| 11023821 | Harris et al. | Jun 2021 | B2 |
| 11031537 | Harris et al. | Jun 2021 | B2 |
| 11038095 | Huang et al. | Jun 2021 | B2 |
| 11042811 | Rolfe et al. | Jun 2021 | B2 |
| 11062227 | Amin et al. | Jul 2021 | B2 |
| 11063138 | Singh et al. | Jul 2021 | B2 |
| 11064637 | Sterling et al. | Jul 2021 | B2 |
| 11075293 | Roberts et al. | Jul 2021 | B2 |
| 11081634 | Lutchyn et al. | Aug 2021 | B2 |
| 11093440 | Maassen van den Brink et al. | Aug 2021 | B2 |
| 11100416 | Lanting et al. | Aug 2021 | B2 |
| 11100418 | Bunyk et al. | Aug 2021 | B2 |
| 11101352 | George et al. | Aug 2021 | B2 |
| 11105866 | Swenson et al. | Aug 2021 | B2 |
| 11107891 | Pillarisetty et al. | Aug 2021 | B2 |
| 11113084 | Kliuchnikov et al. | Sep 2021 | B2 |
| 11119773 | Soeken et al. | Sep 2021 | B1 |
| 11120359 | Granade et al. | Sep 2021 | B2 |
| 11121303 | Cassidy et al. | Sep 2021 | B2 |
| 11125773 | Guha et al. | Sep 2021 | B2 |
| 11127820 | Manfra et al. | Sep 2021 | B2 |
| 11127893 | Johnson et al. | Sep 2021 | B2 |
| 11132617 | Haah et al. | Sep 2021 | B2 |
| 11138354 | Gukelberger et al. | Oct 2021 | B2 |
| 11138511 | Yarkoni et al. | Oct 2021 | B2 |
| 11151470 | Pikulin et al. | Oct 2021 | B2 |
| 11157817 | Rolfe | Oct 2021 | B2 |
| 11157828 | Wiebe et al. | Oct 2021 | B2 |
| 11158714 | Pillarisetty et al. | Oct 2021 | B2 |
| 11158731 | Pillarisetty et al. | Oct 2021 | B2 |
| 11170302 | Wiebe et al. | Nov 2021 | B2 |
| 11177375 | Roberts et al. | Nov 2021 | B2 |
| 11177912 | Elsherbini et al. | Nov 2021 | B2 |
| 11182230 | Berkley et al. | Nov 2021 | B2 |
| 11188842 | Kliuchnikov et al. | Nov 2021 | B2 |
| 11202960 | Lyden | Dec 2021 | B2 |
| 11281972 | Shen | Mar 2022 | B2 |
| 20060262876 | LaDue | Nov 2006 | A1 |
| 20060262879 | Smith et al. | Nov 2006 | A1 |
| 20120141135 | Yang | Jun 2012 | A1 |
| 20160112141 | Rahn | Apr 2016 | A1 |
| 20160112414 | Tsou | Apr 2016 | A1 |
| 20170075660 | Zhang | Mar 2017 | A1 |
| 20170364334 | Liu | Dec 2017 | A1 |
| 20190179572 | Bradbury | Jun 2019 | A1 |
| 20220062756 | Lyden | Mar 2022 | A1 |
| Number | Date | Country |
|---|---|---|
| 2840674 | Jul 2014 | CA |
| 101833374 | Sep 2010 | CN |
| 107872289 | Apr 2018 | CN |
| 4757162 | Aug 2011 | JP |
| 7090148 | Jun 2022 | JP |
| Entry |
|---|
| Doty, S.R.., “Python Basics,” academia.edu, 2008, 20pg. (Year: 2008). |
| Frenzel, “Understanding Modern Digital Modulation Techniques,” published on Jul. 14, 2021 on ElectronicDesign website: https://www.electronicdesign.com/technologies/communications/article/21798737/understanding-modern-digital-modulation-techniques. |
| Article entitled: “Coherent Binary Modulation techniques” published online by an unknown author, date unknown, on the website: https://ee.eng.usm.my/eeacad/mandeep/EEE436/Chp%204.pdf. |
| Jenic, “7 Best Oscilloscope Software for Windows,” published on Apr. 15, 2020 on windowsreport website: https://windowsreport.com/oscilloscope-software-pc-laptop. |
| Jefferson, “Research Brings Analog Computers Just One Step From Digital,” published on Dec. 8, 2021 on Techxplore website: https://techxplore.com/news/2021-12-analog-digital.html. |
| Baldwin, “Fun With Java, Understanding the Fast Fourier Transform (FFT) Algorithm,” published on Jan. 5, 2005 on the website: https://developer.com/java/fun-with-Java-understanding-the-fast-fourier-transform-fft-algorithm/. |
| Article entitled “FFT.java,” published online by an unknown author on Jan. 14, 2020 by Princeton University on the website, https://introcs.cs.princeton.edu/java/97data/FFT.java.html. |
| Service,“ Light-Based Memory Chip is the First to Permanently Store Data,” published on Sep. 25, 2015 on the website: https://www.science.org/content/article/light-based-memory-chip-first-permanently-store-data. |
| “New Optical Memory Cell Achieves Record Data-Storage Density,” published by the Oxford News Blog on Dec. 21, 2018 on the website: https://www.ox.ac.uk/news/science-blog/new-optical-memory-cell-achieves-record-data-storage-density-0. |
| Platt, “The Unbelievable Zombie Comeback of Analog Computing” Backchannel, Wired Magazine, Mar. 30, 2023. |
| Prosecution history from corresponding U.S. Appl. No. 17/577,922, filed Jan. 18, 2022 including: Notice of Allowance and Fee(s) Due mailed Aug. 18, 2023; and Non-Final Rejection mailed Mar. 31, 2023. |
| Number | Date | Country | |
|---|---|---|---|
| 20240004617 A1 | Jan 2024 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17577922 | Jan 2022 | US |
| Child | 18467177 | US |
