Wideband autonomous SDR analysis engine forked from sdr-visual-suite
Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.

384 řádky
13KB

  1. package pipeline
  2. import (
  3. "sort"
  4. "strings"
  5. )
  6. type ScheduledCandidate struct {
  7. Candidate Candidate `json:"candidate"`
  8. Priority float64 `json:"priority"`
  9. Tier string `json:"tier,omitempty"`
  10. TierFloor string `json:"tier_floor,omitempty"`
  11. Family string `json:"family,omitempty"`
  12. FamilyRank int `json:"family_rank,omitempty"`
  13. Score *RefinementScore `json:"score,omitempty"`
  14. Breakdown *RefinementScoreDetails `json:"breakdown,omitempty"`
  15. }
  16. type RefinementScoreModel struct {
  17. SNRWeight float64 `json:"snr_weight"`
  18. BandwidthWeight float64 `json:"bandwidth_weight"`
  19. PeakWeight float64 `json:"peak_weight"`
  20. EvidenceWeight float64 `json:"evidence_weight"`
  21. }
  22. type RefinementScoreDetails struct {
  23. SNRScore float64 `json:"snr_score"`
  24. BandwidthScore float64 `json:"bandwidth_score"`
  25. PeakScore float64 `json:"peak_score"`
  26. PolicyBoost float64 `json:"policy_boost"`
  27. EvidenceScore float64 `json:"evidence_score"`
  28. EvidenceDetail *EvidenceScoreDetails `json:"evidence_detail,omitempty"`
  29. }
  30. type RefinementScore struct {
  31. Total float64 `json:"total"`
  32. Breakdown RefinementScoreDetails `json:"breakdown"`
  33. Weights *RefinementScoreModel `json:"weights,omitempty"`
  34. }
  35. type RefinementWorkItem struct {
  36. Candidate Candidate `json:"candidate"`
  37. Window RefinementWindow `json:"window,omitempty"`
  38. Execution *RefinementExecution `json:"execution,omitempty"`
  39. Priority float64 `json:"priority,omitempty"`
  40. Score *RefinementScore `json:"score,omitempty"`
  41. Breakdown *RefinementScoreDetails `json:"breakdown,omitempty"`
  42. Status string `json:"status,omitempty"`
  43. Reason string `json:"reason,omitempty"`
  44. Admission *PriorityAdmission `json:"admission,omitempty"`
  45. }
  46. type RefinementExecution struct {
  47. Stage string `json:"stage,omitempty"`
  48. SampleRate int `json:"sample_rate,omitempty"`
  49. FFTSize int `json:"fft_size,omitempty"`
  50. CenterHz float64 `json:"center_hz,omitempty"`
  51. SpanHz float64 `json:"span_hz,omitempty"`
  52. Source string `json:"source,omitempty"`
  53. }
  54. const (
  55. RefinementStatusPlanned = "planned"
  56. RefinementStatusAdmitted = "admitted"
  57. RefinementStatusRunning = "running"
  58. RefinementStatusCompleted = "completed"
  59. RefinementStatusDropped = "dropped"
  60. RefinementStatusSkipped = "skipped"
  61. RefinementStatusDisplaced = "displaced"
  62. )
  63. const (
  64. RefinementReasonPlanned = "refinement:planned"
  65. RefinementReasonAdmitted = "refinement:admitted"
  66. RefinementReasonRunning = "refinement:running"
  67. RefinementReasonCompleted = "refinement:completed"
  68. RefinementReasonMonitorGate = "refinement:drop:monitor"
  69. RefinementReasonBelowSNR = "refinement:drop:snr"
  70. RefinementReasonBudget = "refinement:skip:budget"
  71. RefinementReasonDisabled = "refinement:drop:disabled"
  72. RefinementReasonUnclassified = "refinement:drop:unclassified"
  73. RefinementReasonDisplaced = "refinement:skip:displaced"
  74. )
  75. // BuildRefinementPlan scores and ranks candidates for costly local refinement.
  76. // Admission/budget enforcement is handled by arbitration to keep refinement/record/decode consistent.
  77. // Current heuristic is intentionally simple and deterministic; later phases can add
  78. // richer scoring (novelty, persistence, profile-aware band priorities, decoder value).
  79. func BuildRefinementPlan(candidates []Candidate, policy Policy) RefinementPlan {
  80. strategy, strategyReason := refinementStrategy(policy)
  81. budgetModel := BudgetModelFromPolicy(policy)
  82. budget := budgetModel.Refinement.Max
  83. holdPolicy := HoldPolicyFromPolicy(policy)
  84. plan := RefinementPlan{
  85. TotalCandidates: len(candidates),
  86. MinCandidateSNRDb: policy.MinCandidateSNRDb,
  87. Budget: budget,
  88. BudgetSource: budgetModel.Refinement.Source,
  89. Strategy: strategy,
  90. StrategyReason: strategyReason,
  91. }
  92. if start, end, ok := monitorBounds(policy); ok {
  93. plan.MonitorStartHz = start
  94. plan.MonitorEndHz = end
  95. if end > start {
  96. plan.MonitorSpanHz = end - start
  97. }
  98. }
  99. if len(candidates) == 0 {
  100. return plan
  101. }
  102. snrWeight, bwWeight, peakWeight := refinementIntentWeights(policy.Intent)
  103. scoreModel := RefinementScoreModel{
  104. SNRWeight: snrWeight,
  105. BandwidthWeight: bwWeight,
  106. PeakWeight: peakWeight,
  107. EvidenceWeight: 0.6,
  108. }
  109. scoreModel = applyStrategyWeights(strategy, scoreModel)
  110. plan.ScoreModel = scoreModel
  111. scored := make([]ScheduledCandidate, 0, len(candidates))
  112. workItems := make([]RefinementWorkItem, 0, len(candidates))
  113. for _, c := range candidates {
  114. candidate := c
  115. RefreshCandidateEvidenceState(&candidate)
  116. family, familyRank := signalPriorityMatch(policy, candidate.Hint, "")
  117. familyFloor := signalPriorityTierFloor(familyRank)
  118. familyRankOut := familyRankForOutput(familyRank)
  119. if !candidateInMonitor(policy, candidate) {
  120. plan.DroppedByMonitor++
  121. workItems = append(workItems, RefinementWorkItem{
  122. Candidate: candidate,
  123. Status: RefinementStatusDropped,
  124. Reason: RefinementReasonMonitorGate,
  125. Admission: &PriorityAdmission{
  126. Tier: PriorityTierBackground,
  127. TierFloor: familyFloor,
  128. Family: family,
  129. FamilyRank: familyRankOut,
  130. Class: AdmissionClassDrop,
  131. Basis: "refinement",
  132. Reason: admissionReason(RefinementReasonMonitorGate, policy, holdPolicy),
  133. },
  134. })
  135. continue
  136. }
  137. if candidate.SNRDb < policy.MinCandidateSNRDb {
  138. plan.DroppedBySNR++
  139. workItems = append(workItems, RefinementWorkItem{
  140. Candidate: candidate,
  141. Status: RefinementStatusDropped,
  142. Reason: RefinementReasonBelowSNR,
  143. Admission: &PriorityAdmission{
  144. Tier: PriorityTierBackground,
  145. TierFloor: familyFloor,
  146. Family: family,
  147. FamilyRank: familyRankOut,
  148. Class: AdmissionClassDrop,
  149. Basis: "refinement",
  150. Reason: admissionReason(RefinementReasonBelowSNR, policy, holdPolicy),
  151. },
  152. })
  153. continue
  154. }
  155. snrScore := candidate.SNRDb * scoreModel.SNRWeight
  156. bwScore := 0.0
  157. peakScore := 0.0
  158. policyBoost := CandidatePriorityBoost(policy, candidate.Hint)
  159. if candidate.BandwidthHz > 0 {
  160. bwScore = minFloat64(candidate.BandwidthHz/25000.0, 6) * scoreModel.BandwidthWeight
  161. }
  162. if candidate.PeakDb > 0 {
  163. peakScore = (candidate.PeakDb / 20.0) * scoreModel.PeakWeight
  164. }
  165. rawEvidenceScore, evidenceDetail := candidateEvidenceScore(candidate, strategy)
  166. evidenceDetail.Weight = scoreModel.EvidenceWeight
  167. evidenceDetail.RawScore = rawEvidenceScore
  168. evidenceDetail.WeightedScore = rawEvidenceScore * scoreModel.EvidenceWeight
  169. evidenceScore := evidenceDetail.WeightedScore
  170. priority := snrScore + bwScore + peakScore + policyBoost
  171. priority += evidenceScore
  172. score := &RefinementScore{
  173. Total: priority,
  174. Breakdown: RefinementScoreDetails{
  175. SNRScore: snrScore,
  176. BandwidthScore: bwScore,
  177. PeakScore: peakScore,
  178. PolicyBoost: policyBoost,
  179. EvidenceScore: evidenceScore,
  180. EvidenceDetail: &evidenceDetail,
  181. },
  182. Weights: &scoreModel,
  183. }
  184. scored = append(scored, ScheduledCandidate{
  185. Candidate: candidate,
  186. Priority: priority,
  187. TierFloor: familyFloor,
  188. Family: family,
  189. FamilyRank: familyRankOut,
  190. Score: score,
  191. Breakdown: &score.Breakdown,
  192. })
  193. workItems = append(workItems, RefinementWorkItem{
  194. Candidate: candidate,
  195. Priority: priority,
  196. Score: score,
  197. Breakdown: &score.Breakdown,
  198. Status: RefinementStatusPlanned,
  199. Reason: RefinementReasonPlanned,
  200. Admission: &PriorityAdmission{
  201. Class: AdmissionClassPlanned,
  202. TierFloor: familyFloor,
  203. Family: family,
  204. FamilyRank: familyRankOut,
  205. Score: priority,
  206. Basis: "refinement",
  207. Reason: admissionReason(RefinementReasonPlanned, policy, holdPolicy),
  208. },
  209. })
  210. }
  211. sort.Slice(scored, func(i, j int) bool {
  212. if scored[i].Priority == scored[j].Priority {
  213. return scored[i].Candidate.CenterHz < scored[j].Candidate.CenterHz
  214. }
  215. return scored[i].Priority > scored[j].Priority
  216. })
  217. if len(scored) > 0 {
  218. minPriority := scored[0].Priority
  219. maxPriority := scored[0].Priority
  220. sumPriority := 0.0
  221. for _, s := range scored {
  222. if s.Priority < minPriority {
  223. minPriority = s.Priority
  224. }
  225. if s.Priority > maxPriority {
  226. maxPriority = s.Priority
  227. }
  228. sumPriority += s.Priority
  229. }
  230. plan.PriorityMin = minPriority
  231. plan.PriorityMax = maxPriority
  232. plan.PriorityAvg = sumPriority / float64(len(scored))
  233. for i := range scored {
  234. baseTier := PriorityTierFromRange(scored[i].Priority, minPriority, maxPriority)
  235. scored[i].Tier = applyTierFloor(baseTier, scored[i].TierFloor)
  236. }
  237. for i := range workItems {
  238. if workItems[i].Admission == nil {
  239. continue
  240. }
  241. if workItems[i].Status != RefinementStatusPlanned {
  242. continue
  243. }
  244. baseTier := PriorityTierFromRange(workItems[i].Priority, minPriority, maxPriority)
  245. workItems[i].Admission.Tier = applyTierFloor(baseTier, workItems[i].Admission.TierFloor)
  246. }
  247. }
  248. plan.Ranked = append(plan.Ranked, scored...)
  249. plan.WorkItems = workItems
  250. return plan
  251. }
  252. func ScheduleCandidates(candidates []Candidate, policy Policy) []ScheduledCandidate {
  253. plan := BuildRefinementPlan(candidates, policy)
  254. if len(plan.Ranked) > 0 {
  255. return plan.Ranked
  256. }
  257. return plan.Selected
  258. }
  259. func refinementStrategy(policy Policy) (string, string) {
  260. intent := strings.ToLower(strings.TrimSpace(policy.Intent))
  261. profile := strings.ToLower(strings.TrimSpace(policy.Profile))
  262. switch {
  263. case strings.Contains(profile, "digital"):
  264. return "digital-hunting", "profile"
  265. case strings.Contains(profile, "archive"):
  266. return "archive-oriented", "profile"
  267. case strings.Contains(profile, "aggressive"):
  268. return "multi-resolution", "profile"
  269. case strings.Contains(intent, "digital") || strings.Contains(intent, "hunt") || strings.Contains(intent, "decode"):
  270. return "digital-hunting", "intent"
  271. case strings.Contains(intent, "archive") || strings.Contains(intent, "triage") || strings.Contains(policy.Mode, "archive"):
  272. return "archive-oriented", "intent"
  273. case strings.Contains(strings.ToLower(policy.SurveillanceStrategy), "multi"):
  274. return "multi-resolution", "surveillance-strategy"
  275. default:
  276. return "single-resolution", "default"
  277. }
  278. }
  279. func applyStrategyWeights(strategy string, model RefinementScoreModel) RefinementScoreModel {
  280. switch strings.ToLower(strings.TrimSpace(strategy)) {
  281. case "digital-hunting":
  282. model.SNRWeight *= 1.4
  283. model.BandwidthWeight *= 0.75
  284. model.PeakWeight *= 1.2
  285. case "archive-oriented":
  286. model.SNRWeight *= 1.1
  287. model.BandwidthWeight *= 1.6
  288. model.PeakWeight *= 1.05
  289. case "multi-resolution", "multi", "multi-res", "multi_res":
  290. model.SNRWeight *= 1.15
  291. model.BandwidthWeight *= 1.1
  292. model.PeakWeight *= 1.15
  293. case "single-resolution":
  294. model.SNRWeight *= 1.1
  295. model.BandwidthWeight *= 1.0
  296. model.PeakWeight *= 1.0
  297. }
  298. return model
  299. }
  300. func candidateEvidenceScore(candidate Candidate, strategy string) (float64, EvidenceScoreDetails) {
  301. state := CandidateEvidenceStateFor(candidate)
  302. details := EvidenceScoreDetails{
  303. DetectionLevels: state.DetectionLevelCount,
  304. PrimaryLevels: state.PrimaryLevelCount,
  305. DerivedLevels: state.DerivedLevelCount,
  306. SupportLevels: state.SupportLevelCount,
  307. ProvenanceCount: len(state.Provenance),
  308. DerivedOnly: state.DerivedOnly,
  309. MultiLevelConfirmed: state.MultiLevelConfirmed,
  310. }
  311. score := 0.0
  312. if state.MultiLevelConfirmed && state.DetectionLevelCount > 1 {
  313. bonus := 0.85 * float64(state.DetectionLevelCount-1)
  314. score += bonus
  315. details.MultiLevelBonus = bonus
  316. }
  317. if len(state.Provenance) > 1 {
  318. bonus := 0.15 * float64(len(state.Provenance)-1)
  319. score += bonus
  320. details.ProvenanceBonus = bonus
  321. }
  322. if state.DerivedOnly {
  323. penalty := 0.35
  324. score -= penalty
  325. details.DerivedPenalty = -penalty
  326. }
  327. switch strings.ToLower(strings.TrimSpace(strategy)) {
  328. case "multi-resolution", "multi", "multi-res", "multi_res":
  329. if state.DerivedOnly {
  330. bias := 0.2
  331. score += bias
  332. details.StrategyBias = bias
  333. } else if state.MultiLevelConfirmed {
  334. bias := 0.1
  335. score += bias
  336. details.StrategyBias = bias
  337. }
  338. case "digital-hunting":
  339. if state.DerivedOnly {
  340. bias := -0.15
  341. score += bias
  342. details.StrategyBias = bias
  343. } else if state.MultiLevelConfirmed {
  344. bias := 0.05
  345. score += bias
  346. details.StrategyBias = bias
  347. }
  348. case "archive-oriented":
  349. if state.DerivedOnly {
  350. bias := -0.1
  351. score += bias
  352. details.StrategyBias = bias
  353. }
  354. case "single-resolution":
  355. if state.MultiLevelConfirmed {
  356. bias := 0.05
  357. score += bias
  358. details.StrategyBias = bias
  359. }
  360. }
  361. return score, details
  362. }
  363. func minFloat64(a, b float64) float64 {
  364. if a < b {
  365. return a
  366. }
  367. return b
  368. }