{"comment":{"url":"https://api.github.com/repos/f32c/f32c/comments/18467677","html_url":"https://github.com/f32c/f32c/commit/9a241f50b73149b4d34e55ec04215ca169559863#commitcomment-18467677","id":18467677,"user":{"login":"gornjas","id":11854009,"avatar_url":"https://avatars.githubusercontent.com/u/11854009?v=3","gravatar_id":"","url":"https://api.github.com/users/gornjas","html_url":"https://github.com/gornjas","followers_url":"https://api.github.com/users/gornjas/followers","following_url":"https://api.github.com/users/gornjas/following{/other_user}","gists_url":"https://api.github.com/users/gornjas/gists{/gist_id}","starred_url":"https://api.github.com/users/gornjas/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/gornjas/subscriptions","organizations_url":"https://api.github.com/users/gornjas/orgs","repos_url":"https://api.github.com/users/gornjas/repos","events_url":"https://api.github.com/users/gornjas/events{/privacy}","received_events_url":"https://api.github.com/users/gornjas/received_events","type":"User","site_admin":false},"position":null,"line":null,"path":null,"commit_id":"9a241f50b73149b4d34e55ec04215ca169559863","created_at":"2016-08-01T08:17:01Z","updated_at":"2016-08-01T08:17:01Z","body":"On Sun, 31 Jul 2016 08:43:13 -0700\nemard <notifications@github.com> wrote:\n\n> Uf da onda se jedino može probati sa množenjem u 2 odvojena koraka\n> \n> Inače na artix-7 i spartan-6 kod FPU množenja i dijieljenja dobivam\n> ispravan rad\n> svih 36 množitetlja na 100 MHz\n> \n> I artix i spartan za jedno množenje 28x28 bita potroše 3 množitelja\n> svaki inače 18x25 bita\n> \n> Ekipa koja radi sa artix se već žalila zašto troši 3 množitelja kad bi\n> mogo samo\n> 2 onda su prvo rekli da se pokuša inferat sa signed umjesto unsigned\n> integer (probao sam isto je) a ako to ne pomogne onda treba ručno\n> ubaci vendor specific module množenja i sparametrizirat ih. To još\n> nisam probao\n\nU tom smjeru isprobavam nesto, izdvojio bih genericko mnozenje u zasebni\nmodul, kojeg bi mogli po potrebi zamjenjivati s vendor-specific\nmnoziteljima, koji bi bili pipelinirani, ali to ocito ide samo\ninstanciranjem vendor-specific primitiva, generickim opisom se\nizgleda neda napravit efikasni pipelinirani 32 x 32 -> 64 multiplier.\n\nInace sad f32c infera signed multiplier, svejedno je prespor...\n\n> http://www.xilinx.com/support/documentation/user_guides/ug479_7Series_DSP48E1.pdf\n> https://forums.xilinx.com/t5/Synthesis/Inferring-DSP48E1-Slices-in-Kintex-7/td-p/557199\n> \n> \n> On 7/31/16, Marko Zec <notifications@github.com> wrote:\n> > On Sun, 31 Jul 2016 02:09:54 -0700\n> > emard <notifications@github.com> wrote:\n> >  \n> >> Ono što treba napraviti da se ubrzna multiplier,\n> >> barem na artix-7, je izlaz iz multipliera prvo strpat\n> >> u registar iz kojeg se tek u idućem clocku onda može\n> >> pročitat rezultat, a ne rezultat koristit direkno za neku\n> >> kombinacijsku logiku  \n> >\n> > Tak je vec sad, rezultat mnozenja ide odmah u registar R_hi_lo, nema\n> > nikakve kombinacijske logike izmedju mnozitelja i registra, kao ni\n> > ispred mnozitelja.  Ali to nije dovoljno brzo, treba mnozenje rucno\n> > razbit u vise koraka, sto bi u teoriji trebali optimalno odradit\n> > toolovi (tzv. register retiming), al ne rade.\n> >  \n> >> To sam morao napravit na dijeljenju inače bi mogo\n> >> dijelit u 6 ciklusa a sada dijelim u 12  \n> >\n> >\n> > ---\n> > You are receiving this because you authored the thread.\n> > Reply to this email directly or view it on GitHub:\n> > https://github.com/f32c/f32c/commit/9a241f50b73149b4d34e55ec04215ca169559863#commitcomment-18463634  \n> \n> \n> ---\n> You are receiving this because you commented.\n> Reply to this email directly or view it on GitHub:\n> https://github.com/f32c/f32c/commit/9a241f50b73149b4d34e55ec04215ca169559863#commitcomment-18464000\n"}}
{"actor":{"display_login":"gornjas"}}