97:
is a computing paradigm combining some of the flexibility of software with the high performance of hardware by processing with very flexible high speed computing fabrics like
144:
is a VLSI device. The term is no longer as common as it once was, as chips have increased in complexity into the hundreds of millions of transistors.
334:. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.
357:
encryption algorithm. In computer science applications, the operations are simplified for finite fields of characteristic 2, also called GF(2)
46:
design, and CAD. In the area of reconfigurable computing I am interested in understanding the capabilities and limitations of FPGA-based
342:
264:
215:
211:
207:
310:
271:
approach that bundles collections of gates into Java objects. Implemented as a toolset and class library on top of the
272:
268:
294:
and imports it into his favorite toolkit. Once imported, the developer should be able to transfer the circuit via a
172:
113:) is the possibility to adapt the hardware during runtime by "loading" a new circuit on the reconfigurable fabric.
240:
This issue, also known as the "navigation problem", though simple for humans, is one of the most challenging in
409:
405:
397:
306:
195:
55:
35:
252:
that would be able to find its way around a room with obstacles, perhaps accomplishing some task on the way.
79:
203:
191:
83:
199:
109:
itself in addition to the control flow. On the other hand, the main difference with custom hardware (
106:
71:
187:
125:
63:
47:
385:
241:
298:(JTAG) cable. EDIF netlisting is supported for the XC4000, Virtex, and Virtex-II series of
365:
337:
Finite fields are used in a variety of applications, including linear block codes such as
314:
75:
27:
364:
There are infinitely many different finite fields; however, their number of elements (or
141:
102:
346:
286:
When the design is ready to be placed in a fabric, the developer simply generates an
219:
137:
133:
67:
17:
377:
358:
350:
326:
389:
168:
331:
183:
160:
129:
249:
164:
354:
338:
245:
234:
132:-based circuits into a single chip. VLSI began in the 1970s when complex
74:
for CCM's. Recent work has included contributions to the development of
291:
179:
280:
176:
157:
361:, making these fields especially popular choices for applications.
59:
237:
for the process of detailing a task into atomic robotic motions.
299:
295:
287:
276:
110:
98:
43:
39:
51:
31:
263:(Just-Another Hardware Description Language) is a low level
101:. The principal difference when compared to using ordinary
279:(FPGAs). Particular attention was paid to supporting the
82:. Future work is concentrating on application-specific
105:is the ability to make substantial changes to the
267:, focused primarily on building circuits via an
26:My areas of research are in the broad field of
190:. Genetic algorithms are a particular class of
388:, and two finite fields of the same size are
8:
58:). Algorithms investigated to date include
400:of the field, and the positive integer
275:, its primary use is for the design of
140:technologies were being developed. The
7:
288:Electronic Design Interchange Format
330:is different from standard integer
122:Very-large-scale integration (VLSI)
198:) that use techniques inspired by
24:
311:Configurable Computing Laboratory
313:, the project initiated in 1997
248:. The problem is in creating an
277:field-programmable gate arrays
1:
368:) is necessarily of the form
265:hardware description language
34:. Specific interests include
70:. A second area of focus is
124:is the process of creating
426:
182:. Genetic algorithms are
128:by combining thousands of
273:Java programming language
56:custom computing machines
196:evolutionary computation
188:global search heuristics
95:Reconfigurable computing
90:Reconfigurable computing
78:and synthesis tools for
36:reconfigurable computing
353:algorithms such as the
320:Finite Field Arithmetic
296:Joint Test Action Group
192:evolutionary algorithms
80:finite field arithmetic
408:of the field over its
305:JHDL was developed at
154:genetic algorithm (GA)
200:evolutionary biology
126:integrated circuits
283:series of chips.
233:is a term used in
64:genetic algorithms
48:computing machines
167:to find exact or
148:Genetic Algorithm
84:compilation tools
417:
386:positive integer
325:Arithmetic in a
242:computer science
425:
424:
420:
419:
418:
416:
415:
414:
322:
269:Object Oriented
258:
231:Motion planning
228:
194:(also known as
150:
119:
103:microprocessors
92:
28:hardware design
22:
21:
20:
12:
11:
5:
423:
421:
398:characteristic
321:
318:
257:
254:
227:
224:
149:
146:
142:microprocessor
118:
115:
91:
88:
72:CAD algorithms
23:
15:
14:
13:
10:
9:
6:
4:
3:
2:
422:
413:
411:
407:
403:
399:
395:
392:. The prime
391:
387:
383:
379:
375:
371:
367:
362:
360:
359:Galois fields
356:
352:
348:
347:coding theory
345:in classical
344:
340:
335:
333:
329:
328:
319:
317:
315:
312:
308:
303:
301:
297:
293:
289:
284:
282:
278:
274:
270:
266:
262:
255:
253:
251:
247:
243:
238:
236:
232:
226:Path Planning
225:
223:
221:
220:recombination
218:(also called
217:
213:
209:
205:
201:
197:
193:
189:
185:
181:
178:
174:
171:solutions to
170:
166:
162:
159:
155:
147:
145:
143:
139:
138:communication
135:
134:semiconductor
131:
127:
123:
116:
114:
112:
108:
104:
100:
96:
89:
87:
85:
81:
77:
73:
69:
68:path planning
65:
61:
57:
53:
49:
45:
41:
37:
33:
29:
19:
18:User:Jcarroll
401:
393:
381:
378:prime number
373:
369:
363:
351:cryptography
336:
327:finite field
324:
323:
304:
285:
260:
259:
239:
230:
229:
173:optimization
153:
151:
121:
120:
94:
93:
25:
410:prime field
204:inheritance
184:categorized
169:approximate
86:for CCM's.
390:isomorphic
332:arithmetic
130:transistor
406:dimension
250:algorithm
216:crossover
212:selection
165:computing
161:technique
107:data path
42:-based),
366:cardinal
355:Rijndael
349:and in
246:robotics
235:robotics
208:mutation
202:such as
180:problems
163:used in
404:is the
396:is the
309:in the
292:netlist
290:(EDIF)
372:where
281:Xilinx
214:, and
177:search
158:search
54:'s or
384:is a
376:is a
300:FPGAs
156:is a
111:ASICs
99:FPGAs
60:SONAR
16:<
380:and
341:and
261:JHDL
256:JHDL
244:and
175:and
136:and
117:VLSI
76:JHDL
66:for
62:and
44:VLSI
40:FPGA
30:and
339:BCH
307:BYU
302:.
222:).
186:as
52:CCM
32:CAD
412:.
343:RS
316:.
210:,
206:,
152:A
402:n
394:p
382:n
374:p
370:p
50:(
38:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.