{"entities":{"Q5355909":{"pageid":7385484,"ns":120,"title":"Item:Q5355909","lastrevid":92233373,"modified":"2026-06-05T01:12:23Z","type":"item","id":"Q5355909","labels":{"en":{"language":"en","value":"Computationally efficient systolic architecture for computing the discrete Fourier transform"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6776906"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5355909$1813C34A-D9BE-43F9-8811-2AA12F2EB8EE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ac44f8da97b2637e3d2232e2eda972af72e2327d","datavalue":{"value":{"text":"Computationally efficient systolic architecture for computing the discrete Fourier transform","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5355909$D6C4695D-AC04-4112-A073-7903A1DC08FE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0f8d2b383c3b1877d017276c7aee86b5c30a2ee9","datavalue":{"value":"1372.65366","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5355909$51375630-5EBD-4966-B88C-275D9B5E9895","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b6f3828e3be751217ae6242c7ec43bb9715f95ba","datavalue":{"value":"10.1109/TSP.2005.859216","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5355909$1CE3F71D-EEDF-4B8F-BE15-8B8C5C7A7020","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a95c7b10f903b6dbd255c0a2a8702047b7c212cc","datavalue":{"value":{"entity-type":"item","numeric-id":3805767,"id":"Q3805767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5355909$D6D24B27-A3EA-48FD-A979-C6B0520279B9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"39346dfbe0bcea35dbae204dc5864c494831351b","datavalue":{"value":{"entity-type":"item","numeric-id":63219,"id":"Q63219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5355909$E4156DAF-DBD1-4A02-AF44-263A82AC0D77","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"78ea25eff2fad6a05ad96ce79d2963a8e4c6b18a","datavalue":{"value":{"time":"+2017-09-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5355909$190A1B52-6F45-4744-B420-6842D1AD3DA0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"c4603c40f3b09770fdbb70ee2650f252415f25c5","datavalue":{"value":"65T50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5355909$0BF4BDB7-019F-4942-A183-B6F908EC02E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e804577640ebb408257a4a017aaf6a013220e36f","datavalue":{"value":"65Y10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5355909$4515A46C-7D6B-4B1D-B3E9-906E08A4F3E4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9c35f97705a92be0286f89c8b6fbab3560951c93","datavalue":{"value":"6776906","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5355909$0B19D293-C3DE-40F7-B313-BFD137E08BCD","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5355909$4D419934-C107-4531-9A3B-A5E79872E79A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computationally efficient systolic architecture for computing the discrete Fourier transform","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computationally_efficient_systolic_architecture_for_computing_the_discrete_Fourier_transform"}}}}}