Jump to content

Porter

Members
  • Posts

    227
  • Joined

  • Last visited

  • Days Won

    26

Posts posted by Porter

  1. The release is now updated on github. I will send it off to vipm after a bit more testing.

    If you are curious about how I compiled libmuParser for windows and ubuntu, and the modification that I made, here are my notes: muParser Build Notes.pdf

    On an unrelated topic; is it worth uploading the latest versions of projects on the LAVA CR? Each project now has a copy on github, vipm, and LAVA

    - vipm is the most convenient for distribution
    - github is most convenient for source version control and issue tracking
    - LAVA is most convenient for discussion

    • Like 1
  2. Shockingly it works just fine for me. Note that installing LV2022 on ubuntu 22.04 is not straight forward. Its best to stick with ubuntu 20.04. I also couldn't get VI package manager to install so I extracted the vip manually.

    I did notice that the muparser .so files were not put in the right place. They should reside in /usr/local/natinst/LabVIEW-202X-64/resource/ and not in the vi.lib. Otherwise they won't be found.

    image.png.4e1977fdd682078733557fdd4b30c09a.png

  3. On 8/3/2022 at 7:05 AM, Rolf Kalbermatter said:

    You may want to try with this library. No guarantees about its proper operation. It's a quickly hacked together version from this library that I posted earlier. It's not really tested for the extra bitwise operators and there is no provision for correct left and right association of these operators, so it might require explicit bracketing to work as expected unlike in other languages and formula parsers that tend to follow the mathematical and/or C style conventions.

    Do you have any plans to put this up on Github and/or vipm.io?

  4. The muparser library should definitely be updated. I had modified the muparser library to add the : character as a valid variable name character because my variable names often include colons.

    To add bitwise operations like "2&3 = 2", either you would need to create a wrapper that adds these functions to muparser, or just modify the original source code like I did for the : character. I'm not sure how much work this would be. The labview code wouldn't change at all, except for specifying a new version of the muparser dll.

  5. 300 baud. That is slow!

    This error is generated by the slave ID check that happens after the first 2 response bytes have been received.

    Byte 0: SlaveID
    Byte 1: Function Code

    If the slave ID doesn't match the slave ID of the request, then you have a slave ID mismatch. Likely the data is somehow corrupt.

    Are you sure that your stop bit and parity bit are set correctly?

    You can also check the two received bytes using a property node like this:

    image.png.284657381b09013487833bc362f612ad.png

    Be sure to set the string indicator to hex display.

  6. 9 hours ago, Antoine Chalons said:

    The lvanlys will return an error code if there is a NaN in the array

    I couldn't get it to return a non-zero error code. I tried Inf and NaN in the array.

    8 hours ago, Lipko said:

    Maybe lvanlys uses the cumulative average method

    Dividing once for each element feels expensive. It doesn't seem like lvanlys uses it either. Both the native "dumb" mean algorithm and lvanlys overflow around the same value. Whereas a divide at each element algorithm can handle higher values.Capture3.PNG.988852f2b44009128bb6d747e4f9da51.PNG

    Mean Value Test.vi

  7. I'm just going to throw this out there...

    Capture1.PNG.3452f28e3ed83affba758bfd4a90608a.PNG

    LabVIEW's included mean value of array function calls and external dll (lvanlys). It takes close to twice as long (depending on array size) to execute than just doing a native sum of array elements then divide by array size.

    Is there any advantage that the lvanlys function has over this simple native mean?

    Why aren't most of the lvanlys functions implemented as native LV code instead of a dll? I'd imagine that we could get some performance boost on some of them by using inlining, VIMs, and parallelized loops.

    Mean Value Test.vi Mean Value Test SGL.vi

  8. Glad to hear that a new converter did the trick. I can remember having an issue like that a long time ago and it was due to incompatible hardware.

    The main reason why I don't like the synchronous mode is because it allows only one serial read at a time, across the entire system. So for a system with multiple serial ports, you can only poll them one at a time. I recall being very confused when using the old NI Modbus code and watching the status LEDs on our multi-port USB-Serial converter light up sequentially. It had a very detrimental impact on the performance of the system.

  9. That's the first time I've heard of such a problem. I'm reluctant to implement this because from experience, synchronous R/W usually causes more problems that it solves. Would you be willing to privately share the code with me? What kind of serial port are you using?

    Can you try using a FTDI-based USB-Serial converter to see if you get the same behavior?

    Other USB-serial converters that perform well with VISA are:
    https://www.sealevel.com/product/2105r-usb-to-1-port-rs-232-db9-serial-interface-adapter/
    https://www.moxa.com/en/products/industrial-edge-connectivity/usb-to-serial-converters-usb-hubs/usb-to-serial-converters/uport-1100-series/uport-1150

     

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.