#pragma once /* * Copyright (C) 2024 Brett Terpstra * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . */ #ifndef COSC_4P80_ASSIGNMENT_1_A1_H #define COSC_4P80_ASSIGNMENT_1_A1_H #include #include #include namespace a1 { void test_math() { blt::generalized_matrix input{1, -1, -1, 1}; blt::generalized_matrix output{1, 1, 1}; blt::generalized_matrix expected{ blt::vec4{1, -1, -1, 1}, blt::vec4{1, -1, -1, 1}, blt::vec4{1, -1, -1, 1} }; auto w_matrix = input.transpose() * output; BLT_ASSERT(w_matrix == expected && "MATH MATRIX FAILURE"); blt::vec4 one{5, 1, 3, 0}; blt::vec4 two{9, -5, -8, 3}; blt::generalized_matrix g1{5, 1, 3, 0}; blt::generalized_matrix g2{9, -5, -8, 3}; BLT_ASSERT(g1 * g2.transpose() == blt::vec4::dot(one, two) && "MATH DOT FAILURE"); } template float crosstalk(const input_t& i, const input_t& j) { return i * j.transpose(); } template blt::generalized_matrix threshold(const blt::generalized_matrix& y, const blt::generalized_matrix& base) { blt::generalized_matrix result; for (blt::u32 i = 0; i < columns; i++) { for (blt::u32 j = 0; j < rows; j++) result[i][j] = y[i][j] > 1 ? 1 : (y[i][j] < -1 ? -1 : base[i][j]); } return result; } template blt::size_t difference(const std::array& a, const std::array& b) { blt::size_t count = 0; for (const auto& [a_val, b_val] : blt::in_pairs(a, b)) { if (a_val != b_val) count++; } return count; } template bool equal(const std::array& a, const std::array& b) { return difference(a, b) == 0; } template std::pair run_step(const weight_t& associated_weights, const input_t& input, const output_t& output) { output_t output_recall = input * associated_weights; input_t input_recall = output_recall * associated_weights.transpose(); // BLT_DEBUG_STREAM << "Input: " << input.vec_from_column_row() << "\nOutput: " << output.vec_from_column_row() << '\n'; // BLT_DEBUG_STREAM << "Recalled Input: " << a1::threshold(input_recall, input).vec_from_column_row() << "\nRecalled Output: " // << a1::threshold(output_recall, output).vec_from_column_row() << '\n'; return std::pair{a1::threshold(input_recall, input), a1::threshold(output_recall, output)}; } template void check_recall(const weight_t& weights, const std::array& inputs, const std::array& outputs) { for (const auto& [index, val] : blt::enumerate(inputs)) { auto result = run_step(weights, val, outputs[index]); if (result.first != val) BLT_ERROR("Recall of input #%ld failed", index + 1); else BLT_INFO("Recall of input #%ld passed", index + 1); if (result.second != outputs[index]) BLT_ERROR("Recall of output #%ld failed", index + 1); else BLT_INFO("recall of output #%ld passed", index + 1); } } } #endif //COSC_4P80_ASSIGNMENT_1_A1_H