An Accelerator for Decoding Market Data Based on FPGA

2019 ◽  
Vol 28 (03) ◽  
pp. 1950050
Author(s):  
Yuhao Dou ◽  
Yisu Zhou ◽  
Bo Xin

In securities trading, low latency helps investors take the leading position in the market. Conventionally, market data is decoded with software running on general computers. However, the serial structure of software and complex operating system scheduling cause high latency. This paper designs an accelerator for decoding market data based on field-programmable gate array (FPGA). We propose a pipeline in the accelerator, where every part works independently and parallelly. Furthermore, we present a mechanism for encoding templates, which avoids reconstructing the accelerator and decreases the cost when the template is renewed. We evaluate this accelerator with real Financial Information eXchange (FIX) messages and FIX Adapting for Streaming (FAST) templates, attaining an average latency of 447[Formula: see text]ns.

Robotica ◽  
2011 ◽  
Vol 30 (6) ◽  
pp. 891-912 ◽  
Author(s):  
Damien C. Browne ◽  
Lindsay Kleeman

SUMMARYMatched filtering optimally estimates the arrival time for a sonar sensor by correlating received signals with templates. This paper presents a sonar ring with continuous matched filtering on 48 receiver channels sampled at 500kHz. The design dynamically switches the matched filter templates to account for pulse shape variations with range. To achieve real-time, low-latency and optimal performance, processing is implemented on an field-programmable gate array (FPGA) transmitting sonar pulses (2 periods of a 45kHz sine wave) at repetition rate of 30-Hz to 5.7-m range. The paper describes the removal of secondary peaks of the correlation output of matched filtering and template selection. Results include sonar maps, accuracy measurements and localization of weak targets.


Author(s):  
Nutenki Siddhartha ◽  
G. Renuka

<em>Digital filters are utilized as a one of flag handling and correspondence frameworks. At times, the unwavering quality of those frameworks is basic, and blame tolerant channel executions are needed. Throughout the years, numerous systems that endeavor the channels' structure and properties to accomplish adaptation to internal failure have been proposed. As innovation scales, it empowers more unpredictable frameworks that join many channels. In those perplexing frameworks, it is regular that a portion of the channels work in parallel. A plan in view of big rectification coding has been as of late proposed to protect parallel channels. In that plan, each channel is deal with as a bit, and excess channels that go about as equality check bits are acquainted with distinguish and rectify blunders. In this short, applying coding systems to secure parallel channels is tended to in a more broad manner. This decreases the assurance overhead and makes the quantity of excess channels autonomous of the quantity of parallel channels. The proposed technique is first described and then illustrated with two case studies. Finally, both the effectiveness in protecting against errors and the cost are evaluated for a field-programmable gate array implementation.</em>


Author(s):  
Mohan Rao Thokala

Elliptic curve cryptography processor implemented for point multiplication on field programmable gate array. Segmented pipelined full-precision multiplier is used to reduce the latency and also data dependency can be avoided by modifying Lopez-Dahab Montgomery PM Algorithm, results in drastic reduction in the number of clock cycles required. The proposed ECC processor is implemented on Xilinx FPGA families i.e. virtex-4, vitrtex-5, virtex-7.single and three multiplier based designs show the fastest performance compared with reported work individually. Our three multiplier based ECC processor implementation is taking the lowest number of clock cycles on FPGA based design processor.


2013 ◽  
Vol 4 (1) ◽  
pp. 56-77
Author(s):  
Hoang Trang ◽  
Nguyen Van Loi

This paper presents a Field-Programmable Gate Array (FPGA) implementation of an Advanced Encryption Standard (AES) algorithm using approach of combination iterative looping and Look-Up Table (LUT)-based S-box with block and key size of 128 bits. Modifications in the way of loading data out in AES encryption/decryption, loading key_expansion in Key_Expansion blocks are also proposed. The design is tested with the sample vectors provided by Federal Information Processing Standard (FIPS) 197. The design is implemented on APEX20KC Altera’s FPGA and on Virtex XCV600 Xilinx’s FPGA. For all the authors’ proposals, they are found to be very simple in FPGA-based architecture implementation, better in low latency, and small area, but large in memory, moderate throughput.


2020 ◽  
Vol 2 (2) ◽  
pp. 128-143
Author(s):  
Tedi Budiman

Financial information system is an information system that provides information to individuals or groups of people, both inside and outside the company that contains financial problems and information about the flow of money for users in the company. Financial information systems are used to solve financial problems in a company, by meeting three financial principles: fast, safe, and inexpensive.Quick principle, the intention is that financial information systems must be able to provide the required data on time and can meet the needs. The Safe Principle means that the financial information system must be prepared with consideration of internal controls so that company assets are maintained. The Principle of Inexpensive, the intention is that the cost of implementing a financial information system must be reduced so that it is relatively inexpensive.Therefore we need technology media that can solve financial problems, and produce financial information to related parties quickly, safely and cheaply. One example of developing information technology today is computer technology and internet. Starting from financial problems and technological advances, the authors make a website-based financial management application to facilitate the parties that perform financial management and supervision.Method of development application program is used Waterfall method, with the following stages: Software Requirement Analysis, Software Design, Program Code Making, Testing, Support, Maintenance.


2008 ◽  
Author(s):  
Michael Wirthlin ◽  
Brent Nelson ◽  
Brad Hutchings ◽  
Peter Athanas ◽  
Shawn Bohner

Sign in / Sign up

Export Citation Format

Share Document