I am working on algorithm where i can have any number of 16 bit values(For instance i have 1000 16 bit values , and all are sensor data, so no particular series or repetition). I want to stuff all of this data into an 8 or a 10 byte array(each and every value of the 1000 16 bits numbers should be inside the 10 byte array) . The information should be such that i can also easily decode to read each and every value from the 1000 values. I have thought of using sin function by dividing the values by 100 so every data point would always be in 8 bits(0-1 sin value range) , but that only covers up small range of data and not huge number of values. Pardon me if i am asking for too much. I am just curious if its possible or not.
How to stuff any number of values in 8-10 bytes of data for n number of 16 bit values?
111 Views Asked by In-terra Weekend Projects At
1
There are 1 best solutions below
Related Questions in C
- Passing arguments to main in C using Eclipse
- kernel module does not print packet info
- error C2016 (C requires that a struct or union has at least one member) and structs typedefs
- Drawing with ncurses, sockets and fork
- How to catch delay-import dll errors (missing dll or symbol) in MinGW(-w64)?
- Configured TTL for A record(s) backing CNAME records
- Allocating memory for pointers inside structures in functions
- Finding articulation point of undirected graph by DFS
- C first fgets() is being skipped while the second runs
- C std library don't appear to be linked in object file
- gcc static library compilation
- How to do a case-insensitive string comparison?
- C programming: Create and write 2D array of files as function
- How to read a file then store to array and then print?
- Function timeouts in C and thread
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in LOGIC
- core.logic CLP(FD) with ClojureScript
- Developing a Checkers (Draughts) engine, how to begin?
- How to use logical functions with %>% operator (dplyr)
- Unix - Tail Utility would open the file or not
- Combining similar columns in a SQL table?
- Calculating number of nights in overlapping dates
- Logical Operators and Precedence
- Search for zero in 2D array and make a corresponding row and col 0
- How to add repeating occurences of elements in two lists in python
- Error running this fork code in my eclipse, and also have some concept confusion around this code
- PHP logic to add a class to 2 rows every other 2 rows
- PHP: Switch() If{} other control structures
- Logic and Syntax- looking for a shortcut- convert 2D array to a 1D array with no repetitive values
- Given three boxes X, Y, Z. Let W denote white balls and B denote black balls. The contents of the boxes are : X (2W, 3B) , Y(3W, 1B) , Z(1W, 4B).
- Where is the Error in following code snippet, I have made a linkedlist implementation and I am adding elemnts at tail of the LinkedList
Related Questions in BITSTUFFING
- How to calculate the nof of bits of 0 in bit stuffing?
- In HDLC, how to recognize bit stuffing?
- Bit stuffing in CAN bus
- How i can calculate stuffbits in standard CAN 2.0A data frame
- Does Vehicle Spy software give visibility to CAN bus stuffed bits? If not, how can easily we see the stuffed bits?
- C Program don't have the same result when compiled on linux and windows
- utl_lms.format_message | PL/SQL | URL correct in <a> but dot is missing in href
- Bit stuffing help. GATE-CS Set 3 2014
- bit stuffing example
- Most pythonic way to implement byte stuffing algorithm
- How to do a integer division of a long int in c?
- How to stuff any number of values in 8-10 bytes of data for n number of 16 bit values?
- Which data structure should I use for bit stuffing?
- Regarding Bit stuffing for Java
- Discriminate bits after "bit stuffing"
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The answer to this question is rather obvious with a little knowledge in information sciences. It is not possible to store that much information in so little memory, and the data you are talking about just contains too much information.
Some data, like repetitive data or data which is following some structure (like constantly rising values), contains very little information. The task of compression algorithms is to figure out the structure or repetition and instead of storing the pure data to store the structure or rule how to reproduce the data instead.
In your case, the data is coming from sensors and unless you are willing to lose a massive amount of information, you will not be able to generate a compressed version of it with a compression factor in the magnitude your are talking about (1000 × 2 bytes into 10 bytes). If your sensors more or less produce the same values all the time with just a little jitter, a good compression can be achieved (but for this your question is way to broad to be answered here) but it will probably never be in the range of reducing your 1000 values to 10 bytes.