Recent content by raminee

  1. raminee

    Waterproofing USB ports

    Thank you "Berkeman" ! I already did some research and the two methods that I came across is a cover for the USB and also putting a diode between the power lines on the USB lines. But I was wondering if there are other techniques that they use. We do have BTLE but adding a wireless charger and...
  2. raminee

    Waterproofing USB ports

    I am actually trying to build a wearable product for kids which has a USB connection for charging as well as data connectivity just like many wearable/mobile devices. We envision that kids are not careful enough and may accidentally get the device wet through rain, just like your own experience...
  3. raminee

    Waterproofing USB ports

    Hello All, I would like to know how mobile devices or EE devices that use mini/micro USB ports are protected from any water contacts ? i.e. how can you protect against any electrical shorting/damages when such devices are immersed in water ? R.
  4. raminee

    A Mapping and Recovering Combinations: A Challenge in Combination Theory

    OK I think I found the answer. For those of you that are interested here are the 2 correct terminologies for this: Lexicographical Elements of Combinations and Combinadic. The links to the following two sites is where it is all explained. https://planetcalc.com/8594/...
  5. raminee

    A Mapping and Recovering Combinations: A Challenge in Combination Theory

    Believe it or not the index approach is the most optimized way of preserving the combinations info. I know there is a procedure to encode and decode any combination sets into a unique index. I had come across this problem a long time ago and I remember reading about it in a paper. But I can...
  6. raminee

    A Mapping and Recovering Combinations: A Challenge in Combination Theory

    I am not looking to store any combinations. In my project I find the combinations C1,C2 and C3. For simplicity we can order these so that, in your example say 6,3,4 is in ascending order, 3,4,6. What I need is to come up with an index that is mapped only to the combinations of C1,C2,C3...
  7. raminee

    A Mapping and Recovering Combinations: A Challenge in Combination Theory

    Hi, I am looking for the psuedo code. In your example numbers that are the same are not allowed ! So 000, 223 and so on are not valid combinations. The order of the numbers is not important. What is important that the index points to a combination of 3 digit code. Also I used a simple...
  8. raminee

    A Mapping and Recovering Combinations: A Challenge in Combination Theory

    Hello All, Not sure if this belongs in general math but lets start here and see where it takes us. In mathematics, a combination is a way of selecting items from a collection where the order of selection does not matter. As an example , say we have digits 1 to 10. And we want to select 3...
  9. raminee

    A Editing in Freq domain and applying inverse FFT

    For anyone interested I tried both windows and it is very very hard to tell the difference in the outputs. At least with the audio signals I tried they both performed equally well under subjective testing. Thx
  10. raminee

    A Editing in Freq domain and applying inverse FFT

    I used Hamming window with 50% overlap. Any reasons Hann function would be better ?
  11. raminee

    A Editing in Freq domain and applying inverse FFT

    Thank you "FactChecker" for that info. I have implemented the procedure as in the phase vocoder description and it works !! THANKS AGAIN !! Raminee
  12. raminee

    A Editing in Freq domain and applying inverse FFT

    Hello All, I am somewhat familiar with FFT and iFFT and its uses. However I have an issue when I edit in Freq domain and try to get back to time domain . I have an audio signal in time domain that I transform to frequency domain using an FFT routine in block sizes of N points. (in my case 256...
  13. raminee

    Combinations Formulae & Mapping to Index Values

    Thank you DrClaude for this formula. Given the example I posted I assume n=5, S2 is S(i+1) and S1 is S(i) where (i) is the sample position from 0 to 4. You formula works for the example that I have given and the index goes from 1 to 10 which is fine. But I was looking for more of a generic...
  14. raminee

    Combinations Formulae & Mapping to Index Values

    In the example I have chosen we have 5 samples in our data set. So n =5. I have selected r to be 2. So we are looking at 2 sample combinations out of 5. As shown in the attached picture in my original post the 2 sample combinations are indicated as 1s. So in the table first 2 samples...
  15. raminee

    Combinations Formulae & Mapping to Index Values

    The Combinations formulae will find the number of possible combinations that can be obtained by taking a sample of items from a larger set. C = n! / [r! * (n-r)! ] Where n is the number of set samples and r is the number of desired selected samples. So as an example say we have n=5...
Back
Top