Abstract: A method includes receiving a data population and a plurality of constraints. The method includes representing a plurality of units corresponding to the data population by a first set of vectors, determining a holistic feature, and representing the holistic feature by a second vector. The method further includes defining a target volume based on a subset of the plurality of constraints, and for each unit, subtracting a vector representing a respective unit from a vector representing a current holistic feature to determine a third vector. The method thus includes instantiating a first data bucket and a second data bucket based on the plurality of units and the units corresponding to the current data population, and for each third vector, transferring units from the first data bucket to the second data bucket so as to cause the holistic feature to converge to the current holistic feature defined by the target volume.

Abstract: A method includes receiving a data population and a plurality of constraints. The method includes representing a plurality of units corresponding to the data population by a first set of vectors, determining a holistic feature, and representing the holistic feature by a second vector. The method further includes defining a target volume based on a subset of the plurality of constraints, and for each unit, subtracting a vector representing a respective unit from a vector representing a current holistic feature to determine a third vector. The method thus includes instantiating a first data bucket and a second data bucket based on the plurality of units and the units corresponding to the current data population, and for each third vector, transferring units from the first data bucket to the second data bucket so as to cause the holistic feature to converge to the current holistic feature defined by the target volume.

Abstract: A method includes receiving a data population and a plurality of constraints. The data population includes a plurality of units. Each unit includes a plurality of respective values. Each value corresponds to a respective parameter. Each constraint corresponds to a respective parameter. A holistic feature of the data population is determined. A volume is defined in the parameter space based on the plurality of constraints. For each unit of a current data population, a first vector representing a respective unit is subtracted from a second vector representing a current holistic feature to determine a third vector. For each third vector, a distance between a point defined by a respective third vector and the volume is determined. A minimum distance is determined from determined distances. The current data population is transformed into an updated data population by removing a unit that corresponds to the minimum distance from the current data population.

Abstract: A method includes receiving a data population and a plurality of constraints. The data population includes a plurality of units. Each unit includes a plurality of respective values. Each value corresponds to a respective parameter. Each constraint corresponds to a respective parameter. A holistic feature of the data population is determined. A volume is defined in the parameter space based on the plurality of constraints. For each unit of a current data population, a first vector representing a respective unit is subtracted from a second vector representing a current holistic feature to determine a third vector. For each third vector, a distance between a point defined by a respective third vector and the volume is determined. A minimum distance is determined from determined distances. The current data population is transformed into an updated data population by removing a unit that corresponds to the minimum distance from the current data population.

Abstract: A method of FSK decoding includes generating a pulse waveform (R'Edge) from a received FSK encoded signal (FSK signal) and a system clock (Sys_clk). From R'Edge and Sys_clk clocks are generated including a first clock and second clock framing a logic ‘0’ level of the FSK signal, and a third clock and fourth clock framing a logic ‘1’ level of the FSK signal. At least four frequency envelopes are generated from the clocks including a logic ‘0’ envelope, a logic ‘1’ envelope, a lower frequency envelope below the logic ‘0’ envelope, and an upper frequency envelope above the logic ‘1’ envelope. R'Edge is compared to the four envelopes, and a decoded output is produced, logic ‘0’ if the R'Edge overlaps the logic ‘0’ envelope, logic ‘1’ if R'Edge overlaps the logic ‘1’ envelope, and a previous output state if R'Edge does not overlap the logic ‘0’ or logic ‘1’ envelope.