{"entities":{"Q5356888":{"pageid":7386463,"ns":120,"title":"Item:Q5356888","lastrevid":100913510,"modified":"2026-06-05T23:25:57Z","type":"item","id":"Q5356888","labels":{"en":{"language":"en","value":"Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6777569"}},"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":"Q5356888$25EBF4D4-61FB-4620-9DC7-BE1BDE03BC21","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ea333609588a5249118f4186ba31720f28363369","datavalue":{"value":{"text":"Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5356888$4BB40940-3017-4601-BE55-E96792886186","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c53e7f0ad5d17f40de4b2cbf2859cdbd3d84e32e","datavalue":{"value":"1370.94090","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$8C555301-49B7-4403-AE7A-689D19AA4B34","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b03ac80d45e99d96f1ae5a8382665ee2a73c820a","datavalue":{"value":"10.1109/TSP.2004.826167","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$13007E94-BD43-4E28-AF5D-0F2474AAFB67","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"48290c7920ff811b5170aab683f2b46ca3bbad5d","datavalue":{"value":{"entity-type":"item","numeric-id":1688975,"id":"Q1688975"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5356888$549A87BD-C82D-40ED-8C75-9B6E6728756A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c98b4581c7f3bf598a49b9b7d5519bc317c90e9b","datavalue":{"value":{"entity-type":"item","numeric-id":836540,"id":"Q836540"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5356888$50C959EE-65F5-4A9B-B66A-133F77727613","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2b93c451a9fe41b1ca4c2999d5519e820a137709","datavalue":{"value":{"entity-type":"item","numeric-id":553739,"id":"Q553739"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5356888$36426B06-089F-4EF1-B549-63A68C9DE2CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b3293c44daa8ea6bd75546188a386e48f91fae6b","datavalue":{"value":{"entity-type":"item","numeric-id":1950831,"id":"Q1950831"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5356888$33DF0C3D-E57F-4AF5-B745-BE6E2596D658","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":"Q5356888$74CE22A7-BEA6-4AF9-B8C3-A3C7FBD6DC77","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":"Q5356888$92AC0C04-1E69-450D-BA2E-742C6338CC62","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4db3fc3244f368e49336c7e23443d11b7d69297d","datavalue":{"value":"94A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$F99BB1C5-A2D6-4214-A69A-4B1434445AE1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8507c5cb252c5fa8df88e8def65b15a4ca8f94f3","datavalue":{"value":"93E24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$FDEAF477-649B-426F-96D3-13AF5CEBBA6A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"774c3d1c4aa2cf8f66d0c476af822344208fce4f","datavalue":{"value":"6777569","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$610E6AB8-CAF7-47E1-A3CA-ACE4B04FA913","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":"Q5356888$36DF7738-8B70-4C27-A4E0-9DB5D3900D31","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2627037af20b3580705ebeefba0a544a90d9b5d4","datavalue":{"value":"https://doi.org/10.1109/tsp.2004.826167","type":"string"},"datatype":"url"},"type":"statement","id":"Q5356888$1DE2198B-F55A-4431-9331-9202E6E98A7A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"067f977fd8f7054874e118fe45ac55cf573c34d3","datavalue":{"value":"W2141573408","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5356888$D5E528DE-90AA-4486-83F0-61B19DA618F4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array","badges":[]}}}}}