Filters








197,044 Hits in 4.2 sec

Simulation of Securable Network Three-party Protocol Using Quantum Key Distribution in PHP

UNP. Gangadhar Raju
<span title="2018-04-30">2018</span> <i title="International Journal for Research in Applied Science and Engineering Technology (IJRASET)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hsp44774azcezeyiq4kuzpfh5a" style="color: black;">International Journal for Research in Applied Science and Engineering Technology</a> </i> &nbsp;
In this paper, we proposed a new protocol with quantum key distribution(QKDP) which is one hundred present un-hackable and accurate.  ...  In this protocol it uses traditional QKDP to send and receive keys between parties, it uses our algorithm to get accurate results and two parties can share and use secret key for long-1term repeatedly.  ...  to which machine is the correct one for measuring each qubit half the time she will use machine A and then use process A to generate a new qubit to pass on to the channel the other half of the time she  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22214/ijraset.2018.4364">doi:10.22214/ijraset.2018.4364</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/peszmaqfw5aqdlx42eg62ejoqu">fatcat:peszmaqfw5aqdlx42eg62ejoqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200209200309/http://ijraset.com/fileserve.php?FID=15914" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/b9/45b9ecf37ab1b33a3ee5c822db81a6af5c948300.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22214/ijraset.2018.4364"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Improving Throughput in BB84 Quantum Key Distribution

Shawn Prestridge, James Dunham
<span title="">2017</span> <i title="SCITEPRESS - Science and Technology Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tucwymxjpnhgdnuki4g66gio5q" style="color: black;">Proceedings of the 14th International Joint Conference on e-Business and Telecommunications</a> </i> &nbsp;
Quantum Key Distribution (QKD) is a scheme that allows two parties to exchange a key in a provably secure manner that will be used in a more conventional encryption system.  ...  Several techniques have been used to attempt to maximize the number of bits realized at the end of the BB84 protocol.  ...  If the parities between Alice and Bob disagree, they split the block in half and perform a 1-bit parity on each half of the block, burning a bit on each half to preserve security; this process is repeated  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5220/0006422104370443">doi:10.5220/0006422104370443</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/secrypt/PrestridgeD17.html">dblp:conf/secrypt/PrestridgeD17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/57tzawrfwjhnninrt677qxrvi4">fatcat:57tzawrfwjhnninrt677qxrvi4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222213253/http://pdfs.semanticscholar.org/43ee/b558f7e9673fa3371abe09816b68d5faa2b3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/ee/43eeb558f7e9673fa3371abe09816b68d5faa2b3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5220/0006422104370443"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Design and Implementation of a Certified Mail Exchange System Using Simultaneous Secret Exchange

Keita Shimizu, Shuichi Miyazaki, Yasuo Okabe
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7rwnrndvivevjogw65pi6sc33m" style="color: black;">2009 Ninth Annual International Symposium on Applications and the Internet</a> </i> &nbsp;
In this paper we design a certified e-mail exchange system based on simultaneous secret exchange protocol proposed by Okamoto and Ohta.  ...  Step 3 Alice and Bob execute the simultaneous secret exchange to exchange K a and K b , referring to X, Y and P a , P b . The exchange begins from Alice, and each party exchange keys bit by bit.  ...  Considering these advantages and disadvantages, we decided to construct the system realizes 'Direct Style' and 'Half Agent Style', and Alice can select how to use.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/saint.2009.15">doi:10.1109/saint.2009.15</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/saint/ShimizuMO09.html">dblp:conf/saint/ShimizuMO09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xtrqonxwh5eebkwqisnjk6vnlq">fatcat:xtrqonxwh5eebkwqisnjk6vnlq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426153007/https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/71167/1/M_Shimizu_Keita.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3f/b8/3fb80b976b81d29794be3e7fbd3bfe083e2380c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/saint.2009.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Parallel multiplication using fast sorting networks

P.D. Fiore
<span title="">1999</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5jlmyrayyrdazh5awdlsoec77q" style="color: black;">IEEE transactions on computers</a> </i> &nbsp;
The resulting approach was shown to be faster than the conventional Dadda multiplier when the wordlength x was small.  ...  CONCLUSIONS We have shown how bitonic sorting networks can be applied to fast parallel counter and multiplier designs.  ...  In technologies where an XOR gate is significantly slower than AND or OR gates, the Bitonic approach will outperform Dadda's method, the 4:2 compressor and the TDM method over a wide range of operand sizes  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.773800">doi:10.1109/12.773800</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c4fa2olcxjdrraor7bddiu2ze4">fatcat:c4fa2olcxjdrraor7bddiu2ze4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030409055737/http://207.150.13.220:80/OnLineDissertation/papers/fiore/ParallelMultiplication.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/33/29/3329baa3410550f2cacb3458ce4c672bf2cc207a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.773800"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources

U V Vazirani
<span title="">1985</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC &#39;85</a> </i> &nbsp;
to say that a function has high communication complexity in a strong sense, if the number of bit exchanges required to compute it remains high und.er any input distribution.  ...  How- ever, if x is generated by a 2 state Markov Pro- cess, the communication complexity falls to 0.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/22145.22186">doi:10.1145/22145.22186</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Vazirani85.html">dblp:conf/stoc/Vazirani85</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3te4ziheffd27ecfpborxe5qha">fatcat:3te4ziheffd27ecfpborxe5qha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829010336/https://people.eecs.berkeley.edu/~vazirani/pubs/2com.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/27/0d27e58980c1a7f3abf62ca16f038784a77ede14.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/22145.22186"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

End to End Encryption using QKD Algorithm

N. Abirami, M. Sri Nivetha, S. Veena
<span title="2018-10-31">2018</span> <i title="South Asia Management Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oarwpnpqjjfbbkyptszxdp4ch4" style="color: black;">International Journal of Trend in Scientific Research and Development</a> </i> &nbsp;
So the In this paper we are going to see how to increase the security of online transmission through Quantum shift distribution algorithm.  ...  So it is very important to secure the data transmission between the user. And in addition to this future of computer's will be of by Quantum technologies.  ...  Alice have only half set of time to read the data and other half for to access random value.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.31142/ijtsrd18723">doi:10.31142/ijtsrd18723</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uccq3dneqbh5haz6cyrkmbr5yq">fatcat:uccq3dneqbh5haz6cyrkmbr5yq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321053941/https://www.ijtsrd.com/papers/ijtsrd18723.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/f7/45f7b10cb5675ab34145ee7e06669c6757662a83.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.31142/ijtsrd18723"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Clean Quantum and Classical Communication Protocols

Harry Buhrman, Matthias Christandl, Christopher Perry, Jeroen Zuiddam
<span title="2016-12-01">2016</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pkmpevvs3bgkhal5dvrmsu5mvq" style="color: black;">Physical Review Letters</a> </i> &nbsp;
By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the  ...  For more general functions, we show that nearly all Boolean functions require close to 2n bits of classical communication to compute and close to n qubits if the parties have access to pre-shared entanglement  ...  [3] , we call such a protocol clean, and the minimum number of bits or qubits that a clean protocol needs to exchange to compute a given function is the clean communication complexity.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevlett.117.230503">doi:10.1103/physrevlett.117.230503</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/27982635">pmid:27982635</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vglrjep65jgttm2gceeebagfje">fatcat:vglrjep65jgttm2gceeebagfje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427043501/https://pure.uva.nl/ws/files/25582638/PhysRevLett.117.230503.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/25/c72533a7d5fd9e0ab3e0a3bac8852fbc4d7a2b3c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevlett.117.230503"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Cloud Security Algorithms

Er. Ashima Pansotra, Er. Simar Preet Singh
<span title="2015-10-31">2015</span> <i title="Science and Engineering Research Support Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4h7flaxsjnh6he3qbiwvxbekxe" style="color: black;">International Journal of Security and Its Applications</a> </i> &nbsp;
Cloud computing appear to be a very popular and interesting computing technology.  ...  So users can easily access and store data with low cost and without worrying about how these services are provided to user. Due to this flexibility everyone is transferring data to cloud.  ...  L f R f F L 1 R 1 Round 1 L f R f F L 2 R 2 Round 16 depends on how many cycle it uses [3] . For 10 cycles 128-bit key, 12 cycles 192 bit key and for 14 cycles 256 bit key is used.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijsia.2015.9.10.32">doi:10.14257/ijsia.2015.9.10.32</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p6zdqz6asjakfeqp3k2ok3iy7a">fatcat:p6zdqz6asjakfeqp3k2ok3iy7a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220311041331/http://article.nadiapub.com/IJSIA/vol9_no10/32.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/7a/d17a8f0a9d8ef7ab96327fce2f2185f7bca31e9d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijsia.2015.9.10.32"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

FFT algorithms and their adaptation to parallel processing

Eleanor Chu, Alan George
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
This Paper presents many FFT variants already proposed by others in a common framework, which illuminates the progress made in parallelizing them to this date.  ...  The development of the fast Fourier transform (FFT) and its numerous variants in the past 30 years has led to very efficient software and hardware implementations of the transform on uniprocessor Computers  ...  Acknowledgements The author are grateful to the anonymous referee who obviously read the original manuscript with great care.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0024-3795(98)10086-1">doi:10.1016/s0024-3795(98)10086-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6s62nk26yfhbliydtsrxhxseoa">fatcat:6s62nk26yfhbliydtsrxhxseoa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218010606/https://core.ac.uk/download/pdf/82653767.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/04/36/043613e1da71ae57b7586c1c32d2bb7db0141c17.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0024-3795(98)10086-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Multiplexer and Memory-Efficient Circuits for Parallel Bit Reversal

Mario Garrido
<span title="">2018</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c352rf3zizflhbzkvxrawww7mu" style="color: black;">IEEE Transactions on Circuits and Systems - II - Express Briefs</a> </i> &nbsp;
The circuits consist of delays/memories and multiplexers, and have the advantage that they requires the minimum number of multiplexers among circuits for parallel bit reversal so far, as well as a small  ...  This paper presents novel circuits for calculating the bit reversal on parallel data.  ...  When N = P 2 , half of the dimensions are serial and the other half are parallel. In this case, all the pairs of dimensions to be exchanged include a serial dimension and a parallel one.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcsii.2018.2880921">doi:10.1109/tcsii.2018.2880921</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dcugwknuubegtgul3ixlhhpsla">fatcat:dcugwknuubegtgul3ixlhhpsla</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429002957/http://liu.diva-portal.org/smash/get/diva2:1300795/FULLTEXT01" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/8c/6a8cd549c6fd1ff53605f856683f1820dd04037b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcsii.2018.2880921"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 288 of The Month Vol. 120, Issue 579 [page]

<span title="">1912</span> <i title="The Month"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_month" style="color: black;">The Month </a> </i> &nbsp;
He seemed re-dis- covering his own child bit by bit, and no detail escaped him. His actual words were ordinary, and he only half heard her answers.  ...  They had been talking for quite half an hour before he had the courage to put it to her.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_month_1912-09_120_579/page/288" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_month_1912-09_120_579/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Design and Implementation of Low Power Ring and Johnson Counter using Transistor Resizing Technology by VHDL

Pragya Naik, Prof.Priyanshu Pandey
<span title="2018-12-04">2018</span> <i title="Zenodo"> Zenodo </i> &nbsp;
So methods to lessen the power in clock arrange really limit the dynamic power altogether.There is a prerequisite of supplanting the flip-flop with a more proficient circuit which has same usefulness while  ...  accomplishing low power, zone, and vigor to PVT varieties.  ...  However, this requires effective procedures to decide how every now and again unique transistor is probably going to switch.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1913508">doi:10.5281/zenodo.1913508</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hak6ysj3u5fjdprmkmfbu7vbii">fatcat:hak6ysj3u5fjdprmkmfbu7vbii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200215085244/https://zenodo.org/record/1913509/files/%2826-33%29Design%20and%20Implementation%20of%20Low%20Power%20Ring%20and%20Johnson%20Counter%20using%20Transistor%20Resizing%20Technology%20by%20VHDL2-format.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/06/1e062029601132d33aef61f2bc95ba1ddad40726.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1913508"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Page 581 of Forum and Century Vol. 16, Issue 5 [page]

<span title="">1894</span> <i title="Open Court Publishing Co"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_forum-and-century" style="color: black;">Forum and Century </a> </i> &nbsp;
Consider the case abstractly for a mo- ment: you, by raising new products, are all the time adding to the number of business exchanges to be carried on in the country; while they, on the other hand, through  ...  Each bit of money in existence must consequently be made to do at least double  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_forum-and-century_1894-01_16_5/page/581" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_forum-and-century_1894-01_16_5/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Low Power VITERBI Decoder Design With Minimum Transition Hybrid Register Exchange Processing For Wireless Applications

S.L Haridas, N.K Choudhari
<span title="2010-12-28">2010</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dpfavoemqbeinduj3yjynh557i" style="color: black;">International Journal of VLSI Design &amp; Communication Systems</a> </i> &nbsp;
Also for storing the decoded data only half memory is required than register exchange method.  ...  Here simplification is made in survivor memory unit by storing only m-1 bits to identify previous state in the survivor path, and by assigning m-1 registers to decision vectors.  ...  Input bit enter the shift register by one bit at a time. The outputs of the generator functions produce an output of three symbols for each input bit, which corresponds to a code rate 1/3.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/vlsic.2010.1402">doi:10.5121/vlsic.2010.1402</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/susk22jujzftrh4uiovbweapha">fatcat:susk22jujzftrh4uiovbweapha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110813063956/http://airccse.org:80/journal/vlsi/papers/1210vlsics02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/78/2e/782e24f3768b4ae6f5970a74f216bdeea8eca248.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/vlsic.2010.1402"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 2 of Chemical Engineering Vol. 60, Issue 4 [page]

<span title="">1953</span> <i title="Access Intelligence LLC"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_chemical-engineering" style="color: black;">Chemical Engineering </a> </i> &nbsp;
New tricks to heat exchanger design. This time Author Gilmour spills his bag of tricks on how to design a heat exchanger when one fluid undergoes a change in phase—such as in heaters and condensers.  ...  Here’s how you can show a complete economic picture without having to use reams of graphs and tables (Feature Article). Please turn page  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_chemical-engineering_1953-04_60_4/page/2" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_chemical-engineering_1953-04_60_4/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 197,044 results