[SOLVED] Can i store data with variable length in a RAM in VHDL ?

I need to store data with variable lengths in the same RAM. Can I do that using VHDL? If not, is there any suggestions to solve this ?

Basically yes, however variable length doesn't mean infinite length. To write synthesizable VHDL, you need to set an upper limit for the length.

FvM said:

Basically yes, however variable length doesn't mean infinite length. To write synthesizable VHDL, you need to set an upper limit for the length.

Click to expand...

Yes, I have 3157 elements and the largest one is 424-bit.

Are you saying you have 3157 elements and the elements are different sizes? That would mean you would need at least 1.3 Mega-bits of memory (3157 x 424).

Maybe you want to use a record rather than a memory?

barry said:

Are you saying you have 3157 elements and the elements are different sizes? That would mean you would need at least 1.3 Mega-bits of memory (3157 x 424).

Maybe you want to use a record rather than a memory?

Click to expand...

Yes, Like this:

c61626630396663356162626103636f6d00
0570726573730f75666f6e65636f6e666572656e636503636f6d00
096d61696c2d68656c7003636f6d00
076e696768746c790e77696e646f777375706461746573026575
056e63656261036f726700
08776f6f646d61746502697400
0477696e640d77696e646d696c6c64726f707303636f6d00
077765626d61696c09796f75727475726265036f726700
056170706c650f6c656e6f766f7369746567726f757003636f6d00
106672616d65776f726b737570706f7274036e657400
08746f7067616d736503636f6d00

Click to expand...

They are exist in a text file. I need to store them using VHDL to perform some operations based on them.
Could you please give me a hint about how using "record" in this case and I will google it also.

Record can be used if the length of individual elements is fixed at compile time. I guess it's not.

For true variable length you can use linked list or index table.

FvM said:

Record can be used if the length of individual elements is fixed at compile time. I guess it's not.

For true variable length you can use linked list or index table.

Click to expand...

Could you give me some examples please be useful in my case mentioned in the previous post.

Hi,

If it is ASCII you may use delimiters.

Now the question is: Do you need access to a dedicated element?
Let's say element 345, then element 1765?
Or do you process them one after the other?

Klaus

Mai89 said:

Could you give me some examples please be useful in my case mentioned in the previous post.

Click to expand...

for example, if you know ahead of time that element 35 is always 18 bits long, etc., then you can use a record. But if element 35 can have any length, you can’t use a record, since it’s fixed length. Without knowing ,more about your data, it’s hard to make intelligent recommendations.

KlausST said:

Hi,

If it is ASCII you may use delimiters.

Now the question is: Do you need access to a dedicated element?
Let's say element 345, then element 1765?
Or do you process them one after the other?

Klaus

Click to expand...

No, it is in Hex format.
I will sort them ascending to access them one after one.

barry said:

for example, if you know ahead of time that element 35 is always 18 bits long, etc., then you can use a record. But if element 35 can have any length, you can’t use a record, since it’s fixed length. Without knowing ,more about your data, it’s hard to make intelligent recommendations.

Click to expand...

My data like this:

c61626630396663356162626103636f6d00
0570726573730f75666f6e65636f6e666572656e636503636f6d00
096d61696c2d68656c7003636f6d00
076e696768746c790e77696e646f777375706461746573026575
056e63656261036f726700
08776f6f646d61746502697400
0477696e640d77696e646d696c6c64726f707303636f6d00
077765626d61696c09796f75727475726265036f726700
056170706c650f6c656e6f766f7369746567726f757003636f6d00
106672616d65776f726b737570706f7274036e657400
08746f7067616d736503636f6d00

Click to expand...

each element has fixed size(while the operation) but the size of all elements is not the same.

what I want exactly to store these data, sort them ascending and access any one at any time by it's address.

Hi,

not clear.

Mai89 said:

each element has fixed size(while the operation) but the size of all elements is not the same.

Click to expand...

It´s confusing to me.

Mai89 said:

what I want exactly to store these data, sort them ascending and access any one at any time by it's address.

Click to expand...

If you sort them.... why not sort them before storing? Then there is no need to sort them afterwards.
and why not storing them with identical length?
Ascending to what exactly .. when they are not in the same length? (Then they need to be treated some kind of right_aligned or left_aligned. Treated like a string or like a unsigned_int, or a signed_int, or a floating point..)
What does address in this case mean?

Klaus

KlausST said:

Hi,

not clear.

It´s confusing to me.


If you sort them.... why not sort them before storing? Then there is no need to sort them afterwards.
and why not storing them with identical length?
Ascending to what exactly .. when they are not in the same length? (Then they need to be treated some kind of right_aligned or left_aligned. Treated like a string or like a unsigned_int, or a signed_int, or a floating point..)
What does address in this case mean?

Klaus

Click to expand...

I need to treat them as strings if it is possible, it will be more useful for me.

You really haven't stated your intent clearly. I think you just have to have every element be maximum length.

barry said:

You really haven't stated your intent clearly. I think you just have to have every element be maximum length.

Click to expand...

Th task that I want is storing this data to perform "String Matching"

c61626630396663356162626103636f6d00
0570726573730f75666f6e65636f6e666572656e636503636f6d00
096d61696c2d68656c7003636f6d00
076e696768746c790e77696e646f777375706461746573026575
056e63656261036f726700
08776f6f646d61746502697400
0477696e640d77696e646d696c6c64726f707303636f6d00
077765626d61696c09796f75727475726265036f726700
056170706c650f6c656e6f766f7369746567726f757003636f6d00
106672616d65776f726b737570706f7274036e657400
08746f7067616d736503636f6d00

Is there any suggestions how to do this?

I tried to make a CAM but it needs data with the same size and also it consumes more logic

Hi,

a string usually is delimited with 0x00. You are free to use any other suitable value. (0x0d, 0x0a...)

I don´t know whether using a string is possible or suitable ... as long as you don´t tell us what you want to achieve. What´s your goal?

Compare data .. is no goal.
Treat them as string ... is no goal.
It´s both like filling water into a glass. It´s just a step to the goal. Another step is to drink the water.
But the goal is not to die of thirst.


Klaus

KlausST said:

Hi,

a string usually is delimited with 0x00. You are free to use any other suitable value. (0x0d, 0x0a...)

I don´t know whether using a string is possible or suitable ... as long as you don´t tell us what you want to achieve. What´s your goal?

Compare data .. is no goal.
Treat them as string ... is no goal.
It´s both like filling water into a glass. It´s just a step to the goal. Another step is to drink the water.
But the goal is not to die of thirst.


Klaus

Click to expand...

My goal is to do "String Matching" as shown in the previous post.
Just wanna compare a certain input data is exist between these data or not.

Hi,

I want to help. But it´s impossible...

I don´t want to annoy you with my questions. Thus I´d better leave.

I really hope that somebody finds out what you need.
Good luck with your project.

Klaus

Your answers (And questions) are all over the place. Now you say you want to find certain data inside a bunch of other data, which is totally different from your original question. I am joining Klaus and leaving this discussion.

“Full of sound and fury, signifying nothing”

I really apologize, I don't want to bother anyone with my questions.

I'm confused also. My issue is :
I have a set of data as mentioned before (with variable lengths) and I want to store them as a database to perform "String Matching" and check if an input data is exist between them or not ( Like Content Addressable Memory), But I know that CAM work with data set with fixed length. So The first Title of this post : I'm asking if I can store data with variable lengths.

Anyways I appreciate your help and patience.
Thanks.

@Mai89, Do you write software and looked at VHDL and thought "I can write software for an FPGA"?

If so then use some form of HLS (High Level Synthesis) and write your code that way using C/C++ instead. Or implement a softcore processor and write the software for that embedded processor.

VHDL stands for VHSIC Hardware Description Language and VHSIC stands for Very High Speed Integrated Circuit, both the terms Hardware and IC should give you and idea that VHDL isn't exactly a software language and the paradigm for developing something doesn't necessarily use a software paradigm. You either need to think about a circuit architecture that supports what you want (hence all the questions about what your end goal is and not the individual steps) or write this in a software language (using HLS) so you can continue to develop this using a software paradigm.

Mai89 said:

I really apologize, I don't want to bother anyone with my questions.

I'm confused also. My issue is :
I have a set of data as mentioned before (with variable lengths) and I want to store them as a database to perform "String Matching" and check if an input data is exist between them or not ( Like Content Addressable Memory), But I know that CAM work with data set with fixed length. So The first Title of this post : I'm asking if I can store data with variable lengths.

Anyways I appreciate your help and patience.
Thanks.

Click to expand...

You can store data any way you want, you have to come up with a hardware architecture to support writing and reading that data. Which is why you got all those previous questions, which you haven't answered.

If this has to be done without using software. Store the data as bytes with delimiters (looks like all but one of the lines ends with a 0x00 byte, a typo?) and write an FSM that reads the input string and compares that input string to the bytes in that data buffer with delimiters, you can then write an FSM that behaves like the equivalent software search algorithm. You will have to manage pointers to the data buffers and scan for the 0x00 bytes to determine both the end of each string and the number of strings processed.