Litteris et Artibus. – 2017 р.

Permanent URI for this collectionhttps://ena.lpnu.ua/handle/ntb/40266

Proceedings of the 7th International youth science forum, November 23–25, 2017, Lviv, Ukraine

У збірнику опубліковано матеріали наукового форуму, присвяченого проблемам у галузі комп’ютерних наук та інженерії, інформаційних технологій; геодезії, архітектури та будівництва; енергетики та систем керування; гуманітарних та соціальних наук; машинобудування, матеріалознавства, транспорту; економіки та менеджменту; хімії та хімічних технологій; права та психології; екології, природоохоронної діяльності та туризму. Видання призначено для науковців, аспірантів, студентів.

Litteris et Artibus : proceedings of the 7th International youth science forum, November 23–25, 2017, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2017. – CD-ROM. – 466 p.

Зміст


1
15
22
24
26
28
30
32
34
36
38
40
42
44
46
48
50
52
54
56
58
60
62
64
66
68
70
72
74
76
78
79
81
83
85
87
89
91
95
97
99
101
103
105
107
109
111
114
118
120
122
124
126
128
130
132
134
136
138
140
142
144
146
148
150
152
154
156
158
160
164
166
168
170
172
174
178
180
182
184
186
188
190
192
194
198
202
206
208
210
212
214
216
218
222
224
226
228
232
240
248
250
252
254
256
258
260
262
265
267
269
271
273
275
277
279
281
283
285
287
290
292
294
297
300
306
308
312
314
317
319
321
327
329
331
333
335
337
339
341
343
345
348
350
352
354
356
358
360
362
368
370
373
375
377
379
381
383
385
387
389
392
394
396
398
402
404
410
412
414
416
418
420
422
425
428
430
432
434
437
442
450
452
454
456
458
462

Browse

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Computing square roots and solve equations of ECC over galois fields
    (Видавництво Львівської політехніки, 2017-12-23) Rahma, Mohammed Kadhim; Hlukhov, Valeriy; Lviv Polytechnic National University
    Computing square roots in finite fields are important computational problems with significant applications to cryptography. Therefore, in this paper, we introduced some methods for finding square roots. Our proposed method calculates the Square root using multiplier over. The proposed method is competitive compared with other existing methods. It is introduced development to decrease of complexity of arithmetic units. In addition, we approach a novel technique for Computation square roots presented using Half_even_odd unit mixed with multiplier and adder. One approach of Square Root presented using the same multiplier for arithmetic units of ECC. Thus, we goes to gets on reduced complexity for arithmetic units.
  • Thumbnail Image
    Item
    Hardware complexity of multipliers of extended Galois field in FPGA
    (Видавництво Львівської політехніки, 2017-12-23) Zholubak, Ivan; Hlukhov, Valeriy; Lviv Polytechnic National University
    In this paper, the implamantation of matrix multiplier of the Galois fields with basics 2, 3, 7, 13 and the analysis of the implementation of multipliers with a higher basis on the FPGA Xilinx Virtex-7 is considered. It is shown that the smallest hardware costs will be in multiplier of Galois fields with a base 3, 29% less than in binary fields. For the implementation of the Guild cells with a large foundation, the core generator of the modified Guild cells was implemented..
  • Thumbnail Image
    Item
    Approach To implementation on Fpga of data compression algorithm C Llanguage descriptions by the means of vivado package
    (Видавництво Львівської політехніки, 2017-12-23) Khomits, Valya; Hlukhov, Valeriy; Lviv Polytechnic National University
    The features of devices for monochrome images lossless compression by JPEG-LS method in modern element base are discussed. Capabilities of Vivado package (Xilinx) for JPEG-LS algorithm C- to suitable for implementation in FPGAs VHDL-descriptions transformation were tested and described. C language structures, which can not be processed by specified means and possible circumvention of such structures were defined.