{"id":"W1914246070","doi":"10.1109/iscas.2003.1206017","title":"A parallel/pipelined algorithm for the computation of MDCT and IMDCT","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Computation; Data compression; Parallel architecture; Parallel computing; Scalability; Coding (social sciences); Parallel algorithm; Transform coding; Algorithm; Computer hardware; Architecture; Discrete cosine transform; Artificial intelligence; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292928,0.00006881028,0.00009712206,0.00003483525,0.00007122537,0.00003081264,0.0002959383,0.0000231999,0.000003364696],"category_scores_gemma":[0.00005588952,0.00004258465,0.00002628399,0.0001210944,0.00003938468,0.0002410031,0.00009798523,0.0000368439,8.296081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005338446,"about_ca_system_score_gemma":0.00001891502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007953624,"about_ca_topic_score_gemma":0.000001165521,"domain_scores_codex":[0.9994154,0.00003501636,0.0001626488,0.0001803693,0.0001048608,0.0001017021],"domain_scores_gemma":[0.9992495,0.0003033091,0.00005425629,0.0002836605,0.00008222963,0.00002709844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003256793,0.00003075707,0.00001636151,0.000008636165,0.000008656735,4.488301e-7,0.00008288086,0.0002261038,0.0006196395,0.1227613,0.003880779,0.8723612],"study_design_scores_gemma":[0.0004086412,0.00008590964,0.000130132,0.00001233226,0.000004254725,0.000009358014,0.00002560794,0.9110096,0.02188206,0.05435582,0.0119778,0.00009848669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005132123,0.0002384425,0.9987239,0.0002313303,0.00005662792,0.0003008669,0.000004099535,0.0001201105,0.0002732949],"genre_scores_gemma":[0.02787876,0.00003976731,0.9718006,0.0001615047,0.000008048137,0.00003466038,0.000001763813,0.000004089987,0.00007077184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9107835,"threshold_uncertainty_score":0.1736552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02108806019309503,"score_gpt":0.3013709239407233,"score_spread":0.2802828637476283,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}